2023-03-24 13:06:08,318 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\config\Macleod_win.conf
2023-03-24 13:06:08,319 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\config\logging.conf
2023-03-24 13:06:08,320 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-24 13:06:08,322 macleod.scripts.parser         INFO     Starting to parse macleod/src/macleod/tests/rcc_restriction.clif
2023-03-24 13:06:20,141 macleod.Ontology               INFO     Found 5 total statements in http://colore.oor.net/mereotopology/rcc_restriction.clif
2023-03-24 13:20:01,419 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\Macleod_win.conf
2023-03-24 13:20:01,420 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-24 13:20:01,421 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-24 13:20:01,422 macleod.scripts.parser         INFO     Starting to parse macleod/src/macleod/tests/rcc_restriction.clif
2023-03-24 13:20:07,241 macleod.Ontology               INFO     Found 5 total statements in http://colore.oor.net/mereotopology/rcc_restriction.clif
2023-03-28 10:14:16,353 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\Macleod_win.conf
2023-03-28 10:14:16,353 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-28 10:14:16,353 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-28 10:58:01,008 macleod.scripts.parser         INFO     Starting to parse macleod/src/macleod/tests/rcc_restriction.clif
2023-03-28 12:15:30,023 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\Macleod_win.conf
2023-03-28 12:15:30,023 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-28 12:15:30,023 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-28 12:15:30,023 macleod.scripts.parser         INFO     Starting to parse macleod/src/macleod/tests/rcc_basic.clif
2023-03-28 12:15:39,955 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\Macleod_win.conf
2023-03-28 12:15:39,956 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-28 12:15:39,956 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-28 12:15:44,781 macleod.scripts.parser         INFO     Starting to parse macleod/src/macleod/tests/rcc_basic.clif
2023-03-28 13:12:27,853 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\Macleod_win.conf
2023-03-28 13:12:27,853 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-28 13:12:27,854 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-28 13:12:51,940 macleod.scripts.parser         INFO     Starting to parse macleod/src/macleod/tests/rcc_basic.clif
2023-03-28 13:12:59,790 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\Macleod_win.conf
2023-03-28 13:12:59,791 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-28 13:12:59,791 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-28 13:13:06,693 macleod.scripts.parser         INFO     Starting to parse macleod/src/macleod/tests/rcc_basic.clif
2023-03-30 15:10:20,238 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-03-30 15:10:20,239 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-30 15:10:20,239 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-30 15:10:20,240 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_basic.clif
2023-03-30 15:29:21,781 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-03-30 15:29:21,782 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-30 15:29:21,782 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-30 15:29:34,286 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_basic.clif
2023-03-30 15:30:43,974 macleod.Ontology               INFO     Found 11 total statements in http://colore.oor.net/mereotopology/rcc_basic.clif
2023-03-30 15:31:06,863 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-03-30 15:31:06,864 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-30 15:31:06,865 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-30 15:31:08,203 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended.clif
2023-03-30 15:31:41,817 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-03-30 15:31:41,819 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-30 15:31:41,819 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-30 15:31:41,820 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended.clif
2023-03-30 15:32:05,032 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-03-30 15:32:05,033 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-30 15:32:05,034 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-30 15:32:05,034 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended.clif
2023-03-30 15:34:20,697 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-03-30 15:34:20,709 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-30 15:34:20,709 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-30 15:34:20,709 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended.clif
2023-03-30 15:34:50,113 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-03-30 15:34:50,114 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-30 15:34:50,114 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-30 15:34:50,115 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended.clif
2023-03-30 15:34:50,139 macleod.Ontology               INFO     Found 2 total statements in http://colore.oor.net/mereotopology/rcc_extended.clif
2023-03-30 15:36:35,357 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-03-30 15:36:35,358 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-30 15:36:35,358 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-30 15:36:35,359 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended.clif
2023-03-30 15:39:10,822 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-03-30 15:39:10,822 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-30 15:39:10,823 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-30 15:39:10,824 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended.clif
2023-03-30 15:39:33,879 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-03-30 15:39:33,880 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-30 15:39:33,880 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-30 15:39:33,881 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended.clif
2023-03-30 15:39:48,114 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-03-30 15:39:48,115 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-30 15:39:48,115 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-30 15:39:48,115 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended.clif
2023-03-30 15:40:12,452 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-03-30 15:40:12,453 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-30 15:40:12,454 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-30 15:40:12,455 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended.clif
2023-03-30 15:40:50,512 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-03-30 15:40:50,513 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-30 15:40:50,513 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-30 15:40:50,514 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended.clif
2023-03-30 15:41:36,455 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-03-30 15:41:36,456 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-30 15:41:36,456 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-30 15:41:36,457 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended.clif
2023-03-30 15:43:05,807 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-03-30 15:43:05,807 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-30 15:43:05,808 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-30 15:43:05,808 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended.clif
2023-03-30 15:44:59,793 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-03-30 15:44:59,794 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-30 15:44:59,794 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-30 15:44:59,795 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended.clif
2023-03-30 15:46:01,336 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-03-30 15:46:01,337 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-30 15:46:01,337 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-30 15:46:01,338 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended.clif
2023-03-30 15:46:01,350 macleod.Ontology               INFO     Found 5 total statements in http://colore.oor.net/mereotopology/rcc_extended.clif
2023-03-30 15:47:42,521 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-03-30 15:47:42,522 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-30 15:47:42,523 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-30 15:47:42,524 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended.clif
2023-03-30 15:47:42,535 macleod.Ontology               INFO     Found 5 total statements in http://colore.oor.net/mereotopology/rcc_extended.clif
2023-03-30 15:48:01,459 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-03-30 15:48:01,460 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-30 15:48:01,460 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-30 15:48:01,461 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended.clif
2023-03-30 15:48:01,472 macleod.Ontology               INFO     Found 5 total statements in http://colore.oor.net/mereotopology/rcc_extended.clif
2023-03-30 15:48:27,511 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-03-30 15:48:27,512 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-30 15:48:27,513 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-30 15:48:27,515 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended.clif
2023-03-30 15:48:27,541 macleod.Ontology               INFO     Found 5 total statements in http://colore.oor.net/mereotopology/rcc_extended.clif
2023-03-30 15:48:47,126 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-03-30 15:48:47,128 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-30 15:48:47,128 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-30 15:48:47,129 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended.clif
2023-03-30 15:48:47,144 macleod.Ontology               INFO     Found 5 total statements in http://colore.oor.net/mereotopology/rcc_extended.clif
2023-03-30 15:49:38,695 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-03-30 15:49:38,696 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-30 15:49:38,696 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-30 15:49:38,697 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended.clif
2023-03-30 15:49:38,711 macleod.Ontology               INFO     Found 5 total statements in http://colore.oor.net/mereotopology/rcc_extended.clif
2023-03-30 15:52:53,257 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-03-30 15:52:53,257 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-30 15:52:53,258 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-30 15:52:53,259 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended.clif
2023-03-30 15:52:53,300 macleod.Ontology               INFO     Found 5 total statements in http://colore.oor.net/mereotopology/rcc_extended.clif
2023-03-30 15:53:03,551 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-03-30 15:53:03,552 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-30 15:53:03,553 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-30 15:53:03,553 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended.clif
2023-03-30 15:53:03,566 macleod.Ontology               INFO     Found 5 total statements in http://colore.oor.net/mereotopology/rcc_extended.clif
2023-03-30 15:55:22,077 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-03-30 15:55:22,078 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-30 15:55:22,079 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-30 15:55:22,079 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended.clif
2023-03-30 15:55:22,090 macleod.Ontology               INFO     Found 5 total statements in http://colore.oor.net/mereotopology/rcc_extended.clif
2023-03-30 15:55:43,851 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-03-30 15:55:43,852 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-30 15:55:43,853 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-30 15:55:43,854 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended.clif
2023-03-30 15:55:43,871 macleod.Ontology               INFO     Found 5 total statements in http://colore.oor.net/mereotopology/rcc_extended.clif
2023-03-30 16:05:28,443 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-03-30 16:05:28,444 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-30 16:05:28,444 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-30 16:05:28,445 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended.clif
2023-03-30 16:05:28,565 macleod.Ontology               INFO     Found 5 total statements in http://colore.oor.net/mereotopology/rcc_extended.clif
2023-03-30 16:10:02,310 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-03-30 16:10:02,310 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-30 16:10:02,310 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-30 16:10:09,199 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended.clif
2023-03-30 16:11:15,939 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-03-30 16:11:15,940 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-30 16:11:15,941 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-30 16:11:18,456 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended.clif
2023-03-30 16:11:37,567 macleod.Ontology               INFO     Found 5 total statements in http://colore.oor.net/mereotopology/rcc_extended.clif
2023-03-30 16:27:10,000 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-03-30 16:27:10,000 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-30 16:27:10,011 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-30 16:27:10,012 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended.clif
2023-03-30 16:27:22,079 macleod.Ontology               INFO     Found 5 total statements in http://colore.oor.net/mereotopology/rcc_extended.clif
2023-03-30 16:36:32,160 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-03-30 16:36:32,161 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-30 16:36:32,161 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-30 16:36:32,162 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-03-30 16:37:09,905 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-03-30 16:37:09,906 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-30 16:37:09,906 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-30 16:37:09,907 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-03-30 16:37:33,676 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-03-30 16:37:33,677 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-30 16:37:33,677 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-30 16:37:33,679 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-03-30 16:37:57,637 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-03-30 16:37:57,638 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-30 16:37:57,638 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-30 16:37:57,639 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-03-30 16:37:57,660 macleod.Ontology               INFO     Found 6 total statements in http://colore.oor.net/mereotopology/rcc_extended.clif
2023-03-30 16:40:02,519 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-03-30 16:40:02,520 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-30 16:40:02,520 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-30 16:40:02,521 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-03-30 16:42:47,264 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-03-30 16:42:47,265 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-30 16:42:47,266 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-30 16:42:47,268 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-03-30 16:45:49,852 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-03-30 16:45:49,852 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-30 16:45:49,852 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-30 16:45:49,860 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-03-30 16:45:57,068 macleod.Ontology               INFO     Found 6 total statements in http://colore.oor.net/mereotopology/rcc_extended.clif
2023-03-30 16:48:02,506 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-03-30 16:48:02,514 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-30 16:48:02,514 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-30 16:48:02,514 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-03-30 16:49:08,648 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-03-30 16:49:08,648 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-30 16:49:08,648 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-30 16:49:08,648 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-03-30 16:49:08,688 macleod.Ontology               INFO     Found 6 total statements in http://colore.oor.net/mereotopology/rcc_extended.clif
2023-03-30 16:58:10,598 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-03-30 16:58:10,598 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-03-30 16:58:10,605 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-03-30 16:58:10,606 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-03-30 16:58:10,750 macleod.Ontology               INFO     Found 6 total statements in http://colore.oor.net/mereotopology/rcc_extended.clif
2023-04-01 15:53:05,844 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 15:53:05,845 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 15:53:05,846 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 15:53:05,846 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-04-01 15:53:05,948 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(['inline', "'properPartOf'", pp(x,y)] <-> (p(x,y) & ~p(y,x)))]
2023-04-01 15:55:32,076 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 15:55:32,076 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 15:55:32,077 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 15:55:32,078 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-04-01 15:55:32,120 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(['inline', "'properPartOf'", pp(x,y)] <-> (p(x,y) & ~p(y,x)))]
2023-04-01 15:55:39,653 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 15:55:39,654 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 15:55:39,655 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 15:55:39,656 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-04-01 15:55:39,674 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(['inline', "'properPartOf'", pp(x,y)] <-> (p(x,y) & ~p(y,x)))]
2023-04-01 15:56:39,196 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 15:56:39,197 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 15:56:39,198 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 15:56:39,198 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-04-01 15:56:39,217 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(['inline', "'properPartOf'", pp(x,y)] <-> (p(x,y) & ~p(y,x)))]
2023-04-01 15:57:00,260 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 15:57:00,262 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 15:57:00,263 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 15:57:00,264 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-04-01 15:57:00,283 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(['inline', "'properPartOf'", pp(x,y)] <-> (p(x,y) & ~p(y,x)))]
2023-04-01 15:58:19,020 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 15:58:19,022 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 15:58:19,023 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 15:58:19,023 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-04-01 15:58:19,044 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(['inline', "'properPartOf'", pp(x,y)] <-> (p(x,y) & ~p(y,x)))]
2023-04-01 15:58:57,041 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 15:58:57,042 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 15:58:57,043 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 15:58:57,044 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-04-01 15:58:57,063 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(['inline', "'properPartOf'", pp(x,y)] <-> (p(x,y) & ~p(y,x)))]
2023-04-01 15:59:13,488 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 15:59:13,490 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 15:59:13,490 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 15:59:13,491 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-04-01 15:59:13,509 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(['inline', "'properPartOf'", pp(x,y)] <-> (p(x,y) & ~p(y,x)))]
2023-04-01 15:59:13,511 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(pp(x,y) <-> (p(x,y) & ~p(y,x)))]
2023-04-01 15:59:13,513 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 15:59:13,515 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 15:59:13,516 macleod.logical.axiom          DEBUG    Term: p(y,z)
2023-04-01 15:59:13,516 macleod.logical.axiom          DEBUG    Term: ~p(y,z)
2023-04-01 15:59:13,517 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 15:59:13,517 macleod.logical.axiom          DEBUG    Term: (p(z,y) & ~p(y,z))
2023-04-01 15:59:13,518 macleod.logical.connective     DEBUG    Coalesced Called: (p(z,y) & ~p(y,z))
2023-04-01 15:59:13,518 macleod.logical.axiom          DEBUG    Coalesced Term: (p(z,y) & ~p(y,z))
2023-04-01 15:59:13,519 macleod.logical.connective     DEBUG    Rescope Called: (p(z,y) & ~p(y,z))
2023-04-01 15:59:13,520 macleod.logical.connective     DEBUG    No Quantifier children: (p(z,y) & ~p(y,z))
2023-04-01 15:59:13,520 macleod.logical.axiom          DEBUG    Rescoped Term: (p(z,y) & ~p(y,z))
2023-04-01 15:59:13,521 macleod.logical.axiom          DEBUG    Term: pp(z,y)
2023-04-01 15:59:13,522 macleod.logical.axiom          DEBUG    Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 15:59:13,523 macleod.logical.connective     DEBUG    Coalesced Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 15:59:13,523 macleod.logical.axiom          DEBUG    Coalesced Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 15:59:13,524 macleod.logical.connective     DEBUG    Rescope Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 15:59:13,525 macleod.logical.connective     DEBUG    No Quantifier children: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 15:59:13,525 macleod.logical.axiom          DEBUG    Rescoped Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 15:59:13,526 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 15:59:13,526 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 15:59:13,527 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 16:01:22,276 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 16:01:22,277 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 16:01:22,278 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 16:01:22,278 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-04-01 16:01:22,299 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(['inline', "'properPartOf'", pp(x,y)] <-> (p(x,y) & ~p(y,x)))]
2023-04-01 16:01:22,301 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(pp(x,y) <-> (p(x,y) & ~p(y,x)))]
2023-04-01 16:01:22,302 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 16:01:22,304 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 16:01:22,305 macleod.logical.axiom          DEBUG    Term: p(y,z)
2023-04-01 16:01:22,306 macleod.logical.axiom          DEBUG    Term: ~p(y,z)
2023-04-01 16:01:22,307 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 16:01:22,307 macleod.logical.axiom          DEBUG    Term: (p(z,y) & ~p(y,z))
2023-04-01 16:01:22,308 macleod.logical.connective     DEBUG    Coalesced Called: (p(z,y) & ~p(y,z))
2023-04-01 16:01:22,309 macleod.logical.axiom          DEBUG    Coalesced Term: (p(z,y) & ~p(y,z))
2023-04-01 16:01:22,310 macleod.logical.connective     DEBUG    Rescope Called: (p(z,y) & ~p(y,z))
2023-04-01 16:01:22,310 macleod.logical.connective     DEBUG    No Quantifier children: (p(z,y) & ~p(y,z))
2023-04-01 16:01:22,311 macleod.logical.axiom          DEBUG    Rescoped Term: (p(z,y) & ~p(y,z))
2023-04-01 16:01:22,312 macleod.logical.axiom          DEBUG    Term: pp(z,y)
2023-04-01 16:01:22,312 macleod.logical.axiom          DEBUG    Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 16:01:22,313 macleod.logical.connective     DEBUG    Coalesced Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 16:01:22,314 macleod.logical.axiom          DEBUG    Coalesced Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 16:01:22,315 macleod.logical.connective     DEBUG    Rescope Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 16:01:22,316 macleod.logical.connective     DEBUG    No Quantifier children: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 16:01:22,316 macleod.logical.axiom          DEBUG    Rescoped Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 16:01:22,317 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 16:01:22,318 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 16:01:22,319 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 16:01:41,644 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 16:01:41,645 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 16:01:41,645 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 16:01:41,647 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-04-01 16:01:41,669 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(['inline', "'properPartOf'", pp(x,y)] <-> (p(x,y) & ~p(y,x)))]
2023-04-01 16:01:41,671 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(pp(x,y) <-> (p(x,y) & ~p(y,x)))]
2023-04-01 16:01:41,674 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 16:01:41,676 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 16:01:41,677 macleod.logical.axiom          DEBUG    Term: p(y,z)
2023-04-01 16:01:41,678 macleod.logical.axiom          DEBUG    Term: ~p(y,z)
2023-04-01 16:01:41,678 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 16:01:41,679 macleod.logical.axiom          DEBUG    Term: (p(z,y) & ~p(y,z))
2023-04-01 16:01:41,680 macleod.logical.connective     DEBUG    Coalesced Called: (p(z,y) & ~p(y,z))
2023-04-01 16:01:41,680 macleod.logical.axiom          DEBUG    Coalesced Term: (p(z,y) & ~p(y,z))
2023-04-01 16:01:41,681 macleod.logical.connective     DEBUG    Rescope Called: (p(z,y) & ~p(y,z))
2023-04-01 16:01:41,682 macleod.logical.connective     DEBUG    No Quantifier children: (p(z,y) & ~p(y,z))
2023-04-01 16:01:41,683 macleod.logical.axiom          DEBUG    Rescoped Term: (p(z,y) & ~p(y,z))
2023-04-01 16:01:41,684 macleod.logical.axiom          DEBUG    Term: pp(z,y)
2023-04-01 16:01:41,684 macleod.logical.axiom          DEBUG    Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 16:01:41,685 macleod.logical.connective     DEBUG    Coalesced Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 16:01:41,686 macleod.logical.axiom          DEBUG    Coalesced Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 16:01:41,687 macleod.logical.connective     DEBUG    Rescope Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 16:01:41,687 macleod.logical.connective     DEBUG    No Quantifier children: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 16:01:41,688 macleod.logical.axiom          DEBUG    Rescoped Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 16:01:41,689 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 16:01:41,690 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 16:01:41,692 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 16:03:37,522 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 16:03:37,522 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 16:03:37,523 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 16:03:37,525 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-04-01 16:07:57,206 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 16:07:57,208 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 16:07:57,208 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 16:07:57,210 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-04-01 16:08:08,991 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 16:08:08,992 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 16:08:08,992 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 16:08:19,850 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 16:08:19,850 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 16:08:19,850 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 16:08:24,027 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-04-01 16:08:24,047 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(['inline', "'properPartOf'", pp(x,y)] <-> (p(x,y) & ~p(y,x)))]
2023-04-01 16:08:24,049 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(pp(x,y) <-> (p(x,y) & ~p(y,x)))]
2023-04-01 16:08:24,051 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 16:08:24,053 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 16:08:24,056 macleod.logical.axiom          DEBUG    Term: p(y,z)
2023-04-01 16:08:24,057 macleod.logical.axiom          DEBUG    Term: ~p(y,z)
2023-04-01 16:08:24,057 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 16:08:24,058 macleod.logical.axiom          DEBUG    Term: (p(z,y) & ~p(y,z))
2023-04-01 16:08:24,058 macleod.logical.connective     DEBUG    Coalesced Called: (p(z,y) & ~p(y,z))
2023-04-01 16:08:24,058 macleod.logical.axiom          DEBUG    Coalesced Term: (p(z,y) & ~p(y,z))
2023-04-01 16:08:24,059 macleod.logical.connective     DEBUG    Rescope Called: (p(z,y) & ~p(y,z))
2023-04-01 16:08:24,060 macleod.logical.connective     DEBUG    No Quantifier children: (p(z,y) & ~p(y,z))
2023-04-01 16:08:24,060 macleod.logical.axiom          DEBUG    Rescoped Term: (p(z,y) & ~p(y,z))
2023-04-01 16:08:24,061 macleod.logical.axiom          DEBUG    Term: pp(z,y)
2023-04-01 16:08:24,062 macleod.logical.axiom          DEBUG    Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 16:08:24,062 macleod.logical.connective     DEBUG    Coalesced Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 16:08:24,063 macleod.logical.axiom          DEBUG    Coalesced Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 16:08:24,063 macleod.logical.connective     DEBUG    Rescope Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 16:08:24,064 macleod.logical.connective     DEBUG    No Quantifier children: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 16:08:24,064 macleod.logical.axiom          DEBUG    Rescoped Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 16:08:24,065 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 16:08:24,065 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 16:08:24,066 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 16:09:21,071 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 16:09:21,072 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 16:09:21,073 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 16:09:32,790 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-04-01 16:10:04,799 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(['inline', "'properPartOf'", pp(x,y)] <-> (p(x,y) & ~p(y,x)))]
2023-04-01 16:10:06,359 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(pp(x,y) <-> (p(x,y) & ~p(y,x)))]
2023-04-01 16:10:07,389 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 16:10:08,907 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 16:10:10,125 macleod.logical.axiom          DEBUG    Term: p(y,z)
2023-04-01 16:10:10,125 macleod.logical.axiom          DEBUG    Term: ~p(y,z)
2023-04-01 16:10:10,126 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 16:10:10,126 macleod.logical.axiom          DEBUG    Term: (p(z,y) & ~p(y,z))
2023-04-01 16:10:10,127 macleod.logical.connective     DEBUG    Coalesced Called: (p(z,y) & ~p(y,z))
2023-04-01 16:10:10,128 macleod.logical.axiom          DEBUG    Coalesced Term: (p(z,y) & ~p(y,z))
2023-04-01 16:10:10,129 macleod.logical.connective     DEBUG    Rescope Called: (p(z,y) & ~p(y,z))
2023-04-01 16:10:10,129 macleod.logical.connective     DEBUG    No Quantifier children: (p(z,y) & ~p(y,z))
2023-04-01 16:10:10,130 macleod.logical.axiom          DEBUG    Rescoped Term: (p(z,y) & ~p(y,z))
2023-04-01 16:10:10,131 macleod.logical.axiom          DEBUG    Term: pp(z,y)
2023-04-01 16:10:10,132 macleod.logical.axiom          DEBUG    Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 16:10:10,133 macleod.logical.connective     DEBUG    Coalesced Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 16:10:10,134 macleod.logical.axiom          DEBUG    Coalesced Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 16:10:10,134 macleod.logical.connective     DEBUG    Rescope Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 16:10:10,135 macleod.logical.connective     DEBUG    No Quantifier children: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 16:10:10,136 macleod.logical.axiom          DEBUG    Rescoped Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 16:10:10,136 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 16:10:10,137 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 16:10:10,561 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 16:10:19,028 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 16:10:19,029 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 16:10:19,029 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 16:10:30,680 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-04-01 16:16:47,351 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(['inline', "'properPartOf'", pp(x,y)] <-> (p(x,y) & ~p(y,x)))]
2023-04-01 16:16:59,665 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(pp(x,y) <-> (p(x,y) & ~p(y,x)))]
2023-04-01 16:17:05,841 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 16:17:11,649 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 16:17:14,386 macleod.logical.axiom          DEBUG    Term: p(y,z)
2023-04-01 16:17:14,387 macleod.logical.axiom          DEBUG    Term: ~p(y,z)
2023-04-01 16:17:14,387 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 16:17:14,388 macleod.logical.axiom          DEBUG    Term: (p(z,y) & ~p(y,z))
2023-04-01 16:17:14,389 macleod.logical.connective     DEBUG    Coalesced Called: (p(z,y) & ~p(y,z))
2023-04-01 16:17:14,389 macleod.logical.axiom          DEBUG    Coalesced Term: (p(z,y) & ~p(y,z))
2023-04-01 16:17:14,390 macleod.logical.connective     DEBUG    Rescope Called: (p(z,y) & ~p(y,z))
2023-04-01 16:17:14,390 macleod.logical.connective     DEBUG    No Quantifier children: (p(z,y) & ~p(y,z))
2023-04-01 16:17:14,391 macleod.logical.axiom          DEBUG    Rescoped Term: (p(z,y) & ~p(y,z))
2023-04-01 16:17:14,392 macleod.logical.axiom          DEBUG    Term: pp(z,y)
2023-04-01 16:17:14,393 macleod.logical.axiom          DEBUG    Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 16:17:14,394 macleod.logical.connective     DEBUG    Coalesced Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 16:17:14,395 macleod.logical.axiom          DEBUG    Coalesced Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 16:17:14,396 macleod.logical.connective     DEBUG    Rescope Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 16:17:14,396 macleod.logical.connective     DEBUG    No Quantifier children: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 16:17:14,397 macleod.logical.axiom          DEBUG    Rescoped Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 16:17:14,398 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 16:17:14,398 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 16:17:18,035 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 16:18:04,691 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 16:18:04,692 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 16:18:04,693 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 16:18:07,719 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-04-01 16:18:21,831 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(['inline', "'properPartOf'", pp(x,y)] <-> (p(x,y) & ~p(y,x)))]
2023-04-01 16:18:21,834 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(pp(x,y) <-> (p(x,y) & ~p(y,x)))]
2023-04-01 16:18:21,836 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 16:18:21,838 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 16:18:21,839 macleod.logical.axiom          DEBUG    Term: p(y,z)
2023-04-01 16:18:21,839 macleod.logical.axiom          DEBUG    Term: ~p(y,z)
2023-04-01 16:18:21,840 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 16:18:21,841 macleod.logical.axiom          DEBUG    Term: (p(z,y) & ~p(y,z))
2023-04-01 16:18:21,842 macleod.logical.connective     DEBUG    Coalesced Called: (p(z,y) & ~p(y,z))
2023-04-01 16:18:21,843 macleod.logical.axiom          DEBUG    Coalesced Term: (p(z,y) & ~p(y,z))
2023-04-01 16:18:21,843 macleod.logical.connective     DEBUG    Rescope Called: (p(z,y) & ~p(y,z))
2023-04-01 16:18:21,844 macleod.logical.connective     DEBUG    No Quantifier children: (p(z,y) & ~p(y,z))
2023-04-01 16:18:21,845 macleod.logical.axiom          DEBUG    Rescoped Term: (p(z,y) & ~p(y,z))
2023-04-01 16:18:21,846 macleod.logical.axiom          DEBUG    Term: pp(z,y)
2023-04-01 16:18:21,846 macleod.logical.axiom          DEBUG    Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 16:18:21,847 macleod.logical.connective     DEBUG    Coalesced Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 16:18:21,848 macleod.logical.axiom          DEBUG    Coalesced Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 16:18:21,848 macleod.logical.connective     DEBUG    Rescope Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 16:18:21,849 macleod.logical.connective     DEBUG    No Quantifier children: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 16:18:21,850 macleod.logical.axiom          DEBUG    Rescoped Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 16:18:21,851 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 16:18:21,851 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 16:18:21,852 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 17:36:13,564 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 17:36:13,564 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 17:36:13,564 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 17:36:16,142 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_restriction.clif
2023-04-01 17:36:46,804 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 17:36:46,806 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 17:36:46,806 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 17:36:51,908 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_restriction.clif
2023-04-01 17:46:39,081 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 17:46:39,082 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 17:46:39,082 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 17:46:41,338 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_restriction.clif
2023-04-01 17:46:44,662 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(P(x,y) -> \exists z,v\;[PP(z,x)])]
2023-04-01 17:46:44,665 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(P(x,y) -> \exists z,v\;[PP(z,x)])]
2023-04-01 17:46:44,667 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(P(z,y) -> \exists x,w\;[PP(x,z)])]
2023-04-01 17:46:44,668 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(P(z,y) -> \exists x,w\;[PP(x,z)])]
2023-04-01 17:46:44,669 macleod.logical.axiom          DEBUG    Term: PP(x,z)
2023-04-01 17:46:44,669 macleod.logical.axiom          DEBUG    Term: \exists x,w\;[PP(x,z)]
2023-04-01 17:46:44,670 macleod.logical.axiom          DEBUG    Term: P(z,y)
2023-04-01 17:46:44,670 macleod.logical.axiom          DEBUG    Term: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 17:46:44,671 macleod.logical.connective     DEBUG    Coalesced Called: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 17:46:44,671 macleod.logical.axiom          DEBUG    Coalesced Term: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 17:46:44,671 macleod.logical.connective     DEBUG    Rescope Called: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 17:46:44,672 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 17:46:44,672 macleod.logical.connective     DEBUG    Rescope Called: (PP(x,z) -> P(z,y))
2023-04-01 17:46:44,673 macleod.logical.connective     DEBUG    No Quantifier children: (PP(x,z) -> P(z,y))
2023-04-01 17:46:44,673 macleod.logical.axiom          DEBUG    Rescoped Term: \exists x,w\;[(PP(x,z) -> P(z,y))]
2023-04-01 17:46:44,673 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 17:46:44,674 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 17:46:44,674 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 17:50:40,586 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 17:50:40,588 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 17:50:40,589 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 17:50:40,590 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_restriction.clif
2023-04-01 17:50:40,606 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(P(x,y) -> \exists z,v\;[PP(z,x)])]
2023-04-01 17:50:40,607 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(P(x,y) -> \exists z,v\;[PP(z,x)])]
2023-04-01 17:50:40,609 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(P(z,y) -> \exists x,w\;[PP(x,z)])]
2023-04-01 17:50:40,610 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(P(z,y) -> \exists x,w\;[PP(x,z)])]
2023-04-01 17:50:40,611 macleod.logical.axiom          DEBUG    Term: PP(x,z)
2023-04-01 17:50:40,612 macleod.logical.axiom          DEBUG    Term: \exists x,w\;[PP(x,z)]
2023-04-01 17:50:40,612 macleod.logical.axiom          DEBUG    Term: P(z,y)
2023-04-01 17:50:40,612 macleod.logical.axiom          DEBUG    Term: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 17:50:40,612 macleod.logical.connective     DEBUG    Coalesced Called: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 17:50:40,614 macleod.logical.axiom          DEBUG    Coalesced Term: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 17:50:40,614 macleod.logical.connective     DEBUG    Rescope Called: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 17:50:40,614 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 17:50:40,615 macleod.logical.connective     DEBUG    Rescope Called: (PP(x,z) -> P(z,y))
2023-04-01 17:50:40,616 macleod.logical.connective     DEBUG    No Quantifier children: (PP(x,z) -> P(z,y))
2023-04-01 17:50:40,617 macleod.logical.axiom          DEBUG    Rescoped Term: \exists x,w\;[(PP(x,z) -> P(z,y))]
2023-04-01 17:50:40,617 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 17:50:40,618 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 17:50:40,619 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 17:50:56,217 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 17:50:56,218 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 17:50:56,219 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 17:50:56,219 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_restriction.clif
2023-04-01 17:50:56,230 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(P(x,y) -> \exists z,v\;[PP(z,x)])]
2023-04-01 17:50:56,232 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(P(x,y) -> \exists z,v\;[PP(z,x)])]
2023-04-01 17:50:56,233 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(P(z,y) -> \exists x,w\;[PP(x,z)])]
2023-04-01 17:50:56,235 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(P(z,y) -> \exists x,w\;[PP(x,z)])]
2023-04-01 17:50:56,236 macleod.logical.axiom          DEBUG    Term: PP(x,z)
2023-04-01 17:50:56,236 macleod.logical.axiom          DEBUG    Term: \exists x,w\;[PP(x,z)]
2023-04-01 17:50:56,237 macleod.logical.axiom          DEBUG    Term: P(z,y)
2023-04-01 17:50:56,237 macleod.logical.axiom          DEBUG    Term: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 17:50:56,238 macleod.logical.connective     DEBUG    Coalesced Called: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 17:50:56,238 macleod.logical.axiom          DEBUG    Coalesced Term: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 17:50:56,238 macleod.logical.connective     DEBUG    Rescope Called: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 17:50:56,239 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 17:50:56,239 macleod.logical.connective     DEBUG    Rescope Called: (PP(x,z) -> P(z,y))
2023-04-01 17:50:56,240 macleod.logical.connective     DEBUG    No Quantifier children: (PP(x,z) -> P(z,y))
2023-04-01 17:50:56,240 macleod.logical.axiom          DEBUG    Rescoped Term: \exists x,w\;[(PP(x,z) -> P(z,y))]
2023-04-01 17:50:56,240 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 17:50:56,241 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 17:50:56,241 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 17:55:52,770 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 17:55:52,771 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 17:55:52,772 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 17:55:52,773 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_restriction.clif
2023-04-01 17:55:52,788 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(P(x,y) -> \exists z,v\;[PP(z,x)])]
2023-04-01 17:55:52,789 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(P(x,y) -> \exists z,v\;[PP(z,x)])]
2023-04-01 17:55:52,791 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(P(z,y) -> \exists x,w\;[PP(x,z)])]
2023-04-01 17:55:52,792 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(P(z,y) -> \exists x,w\;[PP(x,z)])]
2023-04-01 17:55:52,793 macleod.logical.axiom          DEBUG    Term: PP(x,z)
2023-04-01 17:55:52,794 macleod.logical.axiom          DEBUG    Term: \exists x,w\;[PP(x,z)]
2023-04-01 17:55:52,794 macleod.logical.axiom          DEBUG    Term: P(z,y)
2023-04-01 17:55:52,795 macleod.logical.axiom          DEBUG    Term: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 17:55:52,795 macleod.logical.connective     DEBUG    Coalesced Called: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 17:55:52,796 macleod.logical.axiom          DEBUG    Coalesced Term: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 17:55:52,796 macleod.logical.connective     DEBUG    Rescope Called: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 17:55:52,797 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 17:55:52,797 macleod.logical.connective     DEBUG    Rescope Called: (PP(x,z) -> P(z,y))
2023-04-01 17:55:52,798 macleod.logical.connective     DEBUG    No Quantifier children: (PP(x,z) -> P(z,y))
2023-04-01 17:55:52,798 macleod.logical.axiom          DEBUG    Rescoped Term: \exists x,w\;[(PP(x,z) -> P(z,y))]
2023-04-01 17:55:52,799 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 17:55:52,800 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 17:55:52,801 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:05:12,478 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 18:05:12,478 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 18:05:12,479 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 18:05:12,480 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_restriction.clif
2023-04-01 18:05:12,492 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(P(x,y) -> \exists z,v\;[PP(z,x)])]
2023-04-01 18:05:12,493 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(P(x,y) -> \exists z,v\;[PP(z,x)])]
2023-04-01 18:05:12,494 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(P(z,y) -> \exists x,w\;[PP(x,z)])]
2023-04-01 18:05:12,496 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(P(z,y) -> \exists x,w\;[PP(x,z)])]
2023-04-01 18:05:12,498 macleod.logical.axiom          DEBUG    Term: PP(x,z)
2023-04-01 18:05:12,499 macleod.logical.axiom          DEBUG    Term: \exists x,w\;[PP(x,z)]
2023-04-01 18:05:12,499 macleod.logical.axiom          DEBUG    Term: P(z,y)
2023-04-01 18:05:12,499 macleod.logical.axiom          DEBUG    Term: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:05:12,500 macleod.logical.connective     DEBUG    Coalesced Called: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:05:12,501 macleod.logical.axiom          DEBUG    Coalesced Term: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:05:12,501 macleod.logical.connective     DEBUG    Rescope Called: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:05:12,502 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:05:12,503 macleod.logical.connective     DEBUG    Rescope Called: (PP(x,z) -> P(z,y))
2023-04-01 18:05:12,503 macleod.logical.connective     DEBUG    No Quantifier children: (PP(x,z) -> P(z,y))
2023-04-01 18:05:12,504 macleod.logical.axiom          DEBUG    Rescoped Term: \exists x,w\;[(PP(x,z) -> P(z,y))]
2023-04-01 18:05:12,504 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:05:12,505 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:05:12,506 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:05:22,634 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 18:05:22,635 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 18:05:22,636 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 18:05:22,637 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_restriction.clif
2023-04-01 18:05:22,649 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(P(x,y) -> \exists z,v\;[PP(z,x)])]
2023-04-01 18:05:22,650 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(P(x,y) -> \exists z,v\;[PP(z,x)])]
2023-04-01 18:05:22,652 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(P(z,y) -> \exists x,w\;[PP(x,z)])]
2023-04-01 18:05:22,652 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(P(z,y) -> \exists x,w\;[PP(x,z)])]
2023-04-01 18:05:22,653 macleod.logical.axiom          DEBUG    Term: PP(x,z)
2023-04-01 18:05:22,654 macleod.logical.axiom          DEBUG    Term: \exists x,w\;[PP(x,z)]
2023-04-01 18:05:22,654 macleod.logical.axiom          DEBUG    Term: P(z,y)
2023-04-01 18:05:22,654 macleod.logical.axiom          DEBUG    Term: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:05:22,655 macleod.logical.connective     DEBUG    Coalesced Called: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:05:22,655 macleod.logical.axiom          DEBUG    Coalesced Term: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:05:22,656 macleod.logical.connective     DEBUG    Rescope Called: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:05:22,657 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:05:22,657 macleod.logical.connective     DEBUG    Rescope Called: (PP(x,z) -> P(z,y))
2023-04-01 18:05:22,658 macleod.logical.connective     DEBUG    No Quantifier children: (PP(x,z) -> P(z,y))
2023-04-01 18:05:22,659 macleod.logical.axiom          DEBUG    Rescoped Term: \exists x,w\;[(PP(x,z) -> P(z,y))]
2023-04-01 18:05:22,659 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:05:22,660 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:05:22,660 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:10:19,229 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 18:10:19,230 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 18:10:19,230 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 18:10:19,231 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_restriction.clif
2023-04-01 18:10:19,245 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(P(x,y) -> \exists z,v\;[PP(z,x)])]
2023-04-01 18:10:19,247 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(P(x,y) -> \exists z,v\;[PP(z,x)])]
2023-04-01 18:10:19,248 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(P(z,y) -> \exists x,w\;[PP(x,z)])]
2023-04-01 18:10:19,249 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(P(z,y) -> \exists x,w\;[PP(x,z)])]
2023-04-01 18:10:19,250 macleod.logical.axiom          DEBUG    Term: PP(x,z)
2023-04-01 18:10:19,250 macleod.logical.axiom          DEBUG    Term: \exists x,w\;[PP(x,z)]
2023-04-01 18:10:19,250 macleod.logical.axiom          DEBUG    Term: P(z,y)
2023-04-01 18:10:19,251 macleod.logical.axiom          DEBUG    Term: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:10:19,251 macleod.logical.connective     DEBUG    Coalesced Called: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:10:19,251 macleod.logical.axiom          DEBUG    Coalesced Term: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:10:19,252 macleod.logical.connective     DEBUG    Rescope Called: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:10:19,252 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:10:19,253 macleod.logical.connective     DEBUG    Rescope Called: (PP(x,z) -> P(z,y))
2023-04-01 18:10:19,253 macleod.logical.connective     DEBUG    No Quantifier children: (PP(x,z) -> P(z,y))
2023-04-01 18:10:19,254 macleod.logical.axiom          DEBUG    Rescoped Term: \exists x,w\;[(PP(x,z) -> P(z,y))]
2023-04-01 18:10:19,255 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:10:19,255 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:10:19,256 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:10:39,380 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 18:10:39,381 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 18:10:39,381 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 18:10:39,383 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_restriction.clif
2023-04-01 18:10:39,399 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(P(x,y) -> \exists z,v\;[PP(z,x)])]
2023-04-01 18:10:39,400 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(P(x,y) -> \exists z,v\;[PP(z,x)])]
2023-04-01 18:10:39,402 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(P(z,y) -> \exists x,w\;[PP(x,z)])]
2023-04-01 18:10:39,403 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(P(z,y) -> \exists x,w\;[PP(x,z)])]
2023-04-01 18:10:39,404 macleod.logical.axiom          DEBUG    Term: PP(x,z)
2023-04-01 18:10:39,404 macleod.logical.axiom          DEBUG    Term: \exists x,w\;[PP(x,z)]
2023-04-01 18:10:39,404 macleod.logical.axiom          DEBUG    Term: P(z,y)
2023-04-01 18:10:39,405 macleod.logical.axiom          DEBUG    Term: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:10:39,406 macleod.logical.connective     DEBUG    Coalesced Called: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:10:39,406 macleod.logical.axiom          DEBUG    Coalesced Term: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:10:39,407 macleod.logical.connective     DEBUG    Rescope Called: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:10:39,407 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:10:39,408 macleod.logical.connective     DEBUG    Rescope Called: (PP(x,z) -> P(z,y))
2023-04-01 18:10:39,408 macleod.logical.connective     DEBUG    No Quantifier children: (PP(x,z) -> P(z,y))
2023-04-01 18:10:39,409 macleod.logical.axiom          DEBUG    Rescoped Term: \exists x,w\;[(PP(x,z) -> P(z,y))]
2023-04-01 18:10:39,410 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:10:39,411 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:10:39,412 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:10:54,867 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 18:10:54,868 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 18:10:54,868 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 18:10:54,869 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_restriction.clif
2023-04-01 18:10:54,882 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(P(x,y) -> \exists z,v\;[PP(z,x)])]
2023-04-01 18:10:54,883 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(P(x,y) -> \exists z,v\;[PP(z,x)])]
2023-04-01 18:10:54,885 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(P(z,y) -> \exists x,w\;[PP(x,z)])]
2023-04-01 18:10:54,886 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(P(z,y) -> \exists x,w\;[PP(x,z)])]
2023-04-01 18:10:54,887 macleod.logical.axiom          DEBUG    Term: PP(x,z)
2023-04-01 18:10:54,887 macleod.logical.axiom          DEBUG    Term: \exists x,w\;[PP(x,z)]
2023-04-01 18:10:54,887 macleod.logical.axiom          DEBUG    Term: P(z,y)
2023-04-01 18:10:54,888 macleod.logical.axiom          DEBUG    Term: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:10:54,888 macleod.logical.connective     DEBUG    Coalesced Called: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:10:54,889 macleod.logical.axiom          DEBUG    Coalesced Term: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:10:54,889 macleod.logical.connective     DEBUG    Rescope Called: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:10:54,890 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:10:54,890 macleod.logical.connective     DEBUG    Rescope Called: (PP(x,z) -> P(z,y))
2023-04-01 18:10:54,891 macleod.logical.connective     DEBUG    No Quantifier children: (PP(x,z) -> P(z,y))
2023-04-01 18:10:54,891 macleod.logical.axiom          DEBUG    Rescoped Term: \exists x,w\;[(PP(x,z) -> P(z,y))]
2023-04-01 18:10:54,892 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:10:54,892 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:10:54,893 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:12:59,471 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 18:12:59,472 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 18:12:59,472 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 18:12:59,473 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_restriction.clif
2023-04-01 18:12:59,485 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(P(x,y) -> \exists z,v\;[PP(z,x)])]
2023-04-01 18:12:59,486 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(P(x,y) -> \exists z,v\;[PP(z,x)])]
2023-04-01 18:12:59,487 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(P(z,y) -> \exists x,w\;[PP(x,z)])]
2023-04-01 18:12:59,489 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(P(z,y) -> \exists x,w\;[PP(x,z)])]
2023-04-01 18:12:59,490 macleod.logical.axiom          DEBUG    Term: PP(x,z)
2023-04-01 18:12:59,491 macleod.logical.axiom          DEBUG    Term: \exists x,w\;[PP(x,z)]
2023-04-01 18:12:59,491 macleod.logical.axiom          DEBUG    Term: P(z,y)
2023-04-01 18:12:59,491 macleod.logical.axiom          DEBUG    Term: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:12:59,492 macleod.logical.connective     DEBUG    Coalesced Called: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:12:59,492 macleod.logical.axiom          DEBUG    Coalesced Term: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:12:59,493 macleod.logical.connective     DEBUG    Rescope Called: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:12:59,493 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:12:59,494 macleod.logical.connective     DEBUG    Rescope Called: (PP(x,z) -> P(z,y))
2023-04-01 18:12:59,494 macleod.logical.connective     DEBUG    No Quantifier children: (PP(x,z) -> P(z,y))
2023-04-01 18:12:59,495 macleod.logical.axiom          DEBUG    Rescoped Term: \exists x,w\;[(PP(x,z) -> P(z,y))]
2023-04-01 18:12:59,495 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:12:59,495 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:12:59,496 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:13:21,494 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 18:13:21,495 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 18:13:21,496 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 18:13:21,497 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_restriction.clif
2023-04-01 18:13:21,510 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(P(x,y) -> \exists z,v\;[PP(z,x)])]
2023-04-01 18:13:21,512 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(P(x,y) -> \exists z,v\;[PP(z,x)])]
2023-04-01 18:13:21,513 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(P(z,y) -> \exists x,w\;[PP(x,z)])]
2023-04-01 18:13:21,514 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(P(z,y) -> \exists x,w\;[PP(x,z)])]
2023-04-01 18:13:21,515 macleod.logical.axiom          DEBUG    Term: PP(x,z)
2023-04-01 18:13:21,516 macleod.logical.axiom          DEBUG    Term: \exists x,w\;[PP(x,z)]
2023-04-01 18:13:21,516 macleod.logical.axiom          DEBUG    Term: P(z,y)
2023-04-01 18:13:21,516 macleod.logical.axiom          DEBUG    Term: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:13:21,517 macleod.logical.connective     DEBUG    Coalesced Called: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:13:21,517 macleod.logical.axiom          DEBUG    Coalesced Term: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:13:21,518 macleod.logical.connective     DEBUG    Rescope Called: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:13:21,518 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:13:21,519 macleod.logical.connective     DEBUG    Rescope Called: (PP(x,z) -> P(z,y))
2023-04-01 18:13:21,520 macleod.logical.connective     DEBUG    No Quantifier children: (PP(x,z) -> P(z,y))
2023-04-01 18:13:21,521 macleod.logical.axiom          DEBUG    Rescoped Term: \exists x,w\;[(PP(x,z) -> P(z,y))]
2023-04-01 18:13:21,521 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:13:21,522 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:13:21,522 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:14:09,669 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 18:14:09,670 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 18:14:09,671 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 18:14:09,672 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_restriction.clif
2023-04-01 18:14:09,687 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(P(x,y) -> \exists z,v\;[PP(z,x)])]
2023-04-01 18:14:09,689 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(P(x,y) -> \exists z,v\;[PP(z,x)])]
2023-04-01 18:14:09,690 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(P(z,y) -> \exists x,w\;[PP(x,z)])]
2023-04-01 18:14:09,691 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(P(z,y) -> \exists x,w\;[PP(x,z)])]
2023-04-01 18:14:09,692 macleod.logical.axiom          DEBUG    Term: PP(x,z)
2023-04-01 18:14:09,693 macleod.logical.axiom          DEBUG    Term: \exists x,w\;[PP(x,z)]
2023-04-01 18:14:09,693 macleod.logical.axiom          DEBUG    Term: P(z,y)
2023-04-01 18:14:09,693 macleod.logical.axiom          DEBUG    Term: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:14:09,694 macleod.logical.connective     DEBUG    Coalesced Called: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:14:09,695 macleod.logical.axiom          DEBUG    Coalesced Term: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:14:09,695 macleod.logical.connective     DEBUG    Rescope Called: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:14:09,696 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:14:09,697 macleod.logical.connective     DEBUG    Rescope Called: (PP(x,z) -> P(z,y))
2023-04-01 18:14:09,697 macleod.logical.connective     DEBUG    No Quantifier children: (PP(x,z) -> P(z,y))
2023-04-01 18:14:09,698 macleod.logical.axiom          DEBUG    Rescoped Term: \exists x,w\;[(PP(x,z) -> P(z,y))]
2023-04-01 18:14:09,699 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:14:09,699 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:14:09,700 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:14:38,618 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 18:14:38,619 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 18:14:38,621 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 18:14:38,622 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_restriction.clif
2023-04-01 18:14:38,635 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(P(x,y) -> \exists z,v\;[PP(z,x)])]
2023-04-01 18:14:38,636 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(P(x,y) -> \exists z,v\;[PP(z,x)])]
2023-04-01 18:14:38,637 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(P(z,y) -> \exists x,w\;[PP(x,z)])]
2023-04-01 18:14:38,638 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(P(z,y) -> \exists x,w\;[PP(x,z)])]
2023-04-01 18:14:38,639 macleod.logical.axiom          DEBUG    Term: PP(x,z)
2023-04-01 18:14:38,639 macleod.logical.axiom          DEBUG    Term: \exists x,w\;[PP(x,z)]
2023-04-01 18:14:38,639 macleod.logical.axiom          DEBUG    Term: P(z,y)
2023-04-01 18:14:38,639 macleod.logical.axiom          DEBUG    Term: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:14:38,640 macleod.logical.connective     DEBUG    Coalesced Called: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:14:38,641 macleod.logical.axiom          DEBUG    Coalesced Term: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:14:38,641 macleod.logical.connective     DEBUG    Rescope Called: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:14:38,642 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:14:38,642 macleod.logical.connective     DEBUG    Rescope Called: (PP(x,z) -> P(z,y))
2023-04-01 18:14:38,643 macleod.logical.connective     DEBUG    No Quantifier children: (PP(x,z) -> P(z,y))
2023-04-01 18:14:38,643 macleod.logical.axiom          DEBUG    Rescoped Term: \exists x,w\;[(PP(x,z) -> P(z,y))]
2023-04-01 18:14:38,644 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:14:38,644 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:14:38,645 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:15:41,628 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 18:15:41,630 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 18:15:41,630 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 18:15:41,631 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_restriction.clif
2023-04-01 18:15:41,645 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(P(x,y) -> \exists z,v\;[PP(z,x)])]
2023-04-01 18:15:41,647 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(P(x,y) -> \exists z,v\;[PP(z,x)])]
2023-04-01 18:15:41,648 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(P(z,y) -> \exists x,w\;[PP(x,z)])]
2023-04-01 18:15:41,648 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(P(z,y) -> \exists x,w\;[PP(x,z)])]
2023-04-01 18:15:41,650 macleod.logical.axiom          DEBUG    Term: PP(x,z)
2023-04-01 18:15:41,650 macleod.logical.axiom          DEBUG    Term: \exists x,w\;[PP(x,z)]
2023-04-01 18:15:41,650 macleod.logical.axiom          DEBUG    Term: P(z,y)
2023-04-01 18:15:41,651 macleod.logical.axiom          DEBUG    Term: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:15:41,651 macleod.logical.connective     DEBUG    Coalesced Called: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:15:41,652 macleod.logical.axiom          DEBUG    Coalesced Term: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:15:41,652 macleod.logical.connective     DEBUG    Rescope Called: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:15:41,653 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:15:41,653 macleod.logical.connective     DEBUG    Rescope Called: (PP(x,z) -> P(z,y))
2023-04-01 18:15:41,654 macleod.logical.connective     DEBUG    No Quantifier children: (PP(x,z) -> P(z,y))
2023-04-01 18:15:41,654 macleod.logical.axiom          DEBUG    Rescoped Term: \exists x,w\;[(PP(x,z) -> P(z,y))]
2023-04-01 18:15:41,655 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:15:41,655 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:15:41,657 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:15:53,378 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 18:15:53,379 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 18:15:53,380 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 18:15:53,381 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_restriction.clif
2023-04-01 18:15:53,393 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(P(x,y) -> \exists z,v\;[PP(z,x)])]
2023-04-01 18:15:53,395 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(P(x,y) -> \exists z,v\;[PP(z,x)])]
2023-04-01 18:15:53,396 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(P(z,y) -> \exists x,w\;[PP(x,z)])]
2023-04-01 18:15:53,397 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(P(z,y) -> \exists x,w\;[PP(x,z)])]
2023-04-01 18:15:53,398 macleod.logical.axiom          DEBUG    Term: PP(x,z)
2023-04-01 18:15:53,399 macleod.logical.axiom          DEBUG    Term: \exists x,w\;[PP(x,z)]
2023-04-01 18:15:53,399 macleod.logical.axiom          DEBUG    Term: P(z,y)
2023-04-01 18:15:53,399 macleod.logical.axiom          DEBUG    Term: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:15:53,400 macleod.logical.connective     DEBUG    Coalesced Called: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:15:53,400 macleod.logical.axiom          DEBUG    Coalesced Term: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:15:53,401 macleod.logical.connective     DEBUG    Rescope Called: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:15:53,401 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:15:53,402 macleod.logical.connective     DEBUG    Rescope Called: (PP(x,z) -> P(z,y))
2023-04-01 18:15:53,403 macleod.logical.connective     DEBUG    No Quantifier children: (PP(x,z) -> P(z,y))
2023-04-01 18:15:53,403 macleod.logical.axiom          DEBUG    Rescoped Term: \exists x,w\;[(PP(x,z) -> P(z,y))]
2023-04-01 18:15:53,404 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:15:53,405 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:15:53,405 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:15:57,297 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:17:53,508 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 18:17:53,509 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 18:17:53,510 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 18:17:53,511 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_restriction.clif
2023-04-01 18:17:53,524 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(P(x,y) -> \exists z,v\;[PP(z,x)])]
2023-04-01 18:17:53,526 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(P(x,y) -> \exists z,v\;[PP(z,x)])]
2023-04-01 18:17:53,527 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(P(z,y) -> \exists x,w\;[PP(x,z)])]
2023-04-01 18:17:53,528 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(P(z,y) -> \exists x,w\;[PP(x,z)])]
2023-04-01 18:17:53,529 macleod.logical.axiom          DEBUG    Term: PP(x,z)
2023-04-01 18:17:53,530 macleod.logical.axiom          DEBUG    Term: \exists x,w\;[PP(x,z)]
2023-04-01 18:17:53,530 macleod.logical.axiom          DEBUG    Term: P(z,y)
2023-04-01 18:17:53,530 macleod.logical.axiom          DEBUG    Term: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:17:53,531 macleod.logical.connective     DEBUG    Coalesced Called: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:17:53,532 macleod.logical.axiom          DEBUG    Coalesced Term: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:17:53,532 macleod.logical.connective     DEBUG    Rescope Called: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:17:53,532 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:17:53,533 macleod.logical.connective     DEBUG    Rescope Called: (PP(x,z) -> P(z,y))
2023-04-01 18:17:53,534 macleod.logical.connective     DEBUG    No Quantifier children: (PP(x,z) -> P(z,y))
2023-04-01 18:17:53,535 macleod.logical.axiom          DEBUG    Rescoped Term: \exists x,w\;[(PP(x,z) -> P(z,y))]
2023-04-01 18:17:53,535 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:17:53,536 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:17:53,537 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:17:58,018 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:18:14,719 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 18:18:14,721 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 18:18:14,722 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 18:18:14,723 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_restriction.clif
2023-04-01 18:18:14,736 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(P(x,y) -> \exists z,v\;[PP(z,x)])]
2023-04-01 18:18:14,737 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(P(x,y) -> \exists z,v\;[PP(z,x)])]
2023-04-01 18:18:14,738 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(P(z,y) -> \exists x,w\;[PP(x,z)])]
2023-04-01 18:18:14,739 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(P(z,y) -> \exists x,w\;[PP(x,z)])]
2023-04-01 18:18:14,740 macleod.logical.axiom          DEBUG    Term: PP(x,z)
2023-04-01 18:18:14,741 macleod.logical.axiom          DEBUG    Term: \exists x,w\;[PP(x,z)]
2023-04-01 18:18:14,741 macleod.logical.axiom          DEBUG    Term: P(z,y)
2023-04-01 18:18:14,742 macleod.logical.axiom          DEBUG    Term: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:18:14,742 macleod.logical.connective     DEBUG    Coalesced Called: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:18:14,743 macleod.logical.axiom          DEBUG    Coalesced Term: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:18:14,743 macleod.logical.connective     DEBUG    Rescope Called: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:18:14,744 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:18:14,744 macleod.logical.connective     DEBUG    Rescope Called: (PP(x,z) -> P(z,y))
2023-04-01 18:18:14,745 macleod.logical.connective     DEBUG    No Quantifier children: (PP(x,z) -> P(z,y))
2023-04-01 18:18:14,746 macleod.logical.axiom          DEBUG    Rescoped Term: \exists x,w\;[(PP(x,z) -> P(z,y))]
2023-04-01 18:18:14,746 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:18:14,747 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:18:14,747 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:18:14,750 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:19:06,289 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 18:19:06,290 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 18:19:06,291 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 18:19:06,292 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_restriction.clif
2023-04-01 18:19:06,307 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(P(x,y) -> \exists z,v\;[PP(z,x)])]
2023-04-01 18:19:06,309 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(P(x,y) -> \exists z,v\;[PP(z,x)])]
2023-04-01 18:19:06,310 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(P(z,y) -> \exists x,w\;[PP(x,z)])]
2023-04-01 18:19:06,311 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(P(z,y) -> \exists x,w\;[PP(x,z)])]
2023-04-01 18:19:06,313 macleod.logical.axiom          DEBUG    Term: PP(x,z)
2023-04-01 18:19:06,313 macleod.logical.axiom          DEBUG    Term: \exists x,w\;[PP(x,z)]
2023-04-01 18:19:06,313 macleod.logical.axiom          DEBUG    Term: P(z,y)
2023-04-01 18:19:06,314 macleod.logical.axiom          DEBUG    Term: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:19:06,315 macleod.logical.connective     DEBUG    Coalesced Called: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:19:06,315 macleod.logical.axiom          DEBUG    Coalesced Term: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:19:06,316 macleod.logical.connective     DEBUG    Rescope Called: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 18:19:06,316 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:19:06,317 macleod.logical.connective     DEBUG    Rescope Called: (PP(x,z) -> P(z,y))
2023-04-01 18:19:06,317 macleod.logical.connective     DEBUG    No Quantifier children: (PP(x,z) -> P(z,y))
2023-04-01 18:19:06,318 macleod.logical.axiom          DEBUG    Rescoped Term: \exists x,w\;[(PP(x,z) -> P(z,y))]
2023-04-01 18:19:06,319 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:19:06,319 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:19:06,320 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:19:06,323 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 18:19:06,325 macleod.logical.axiom          DEBUG    Starting Axiom: \forall a,b\;[PP(b,a)]
2023-04-01 18:19:06,325 macleod.logical.axiom          DEBUG    Function Free: \forall a,b\;[PP(b,a)]
2023-04-01 18:19:06,326 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[PP(y,z)]
2023-04-01 18:19:06,327 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[PP(y,z)]
2023-04-01 18:19:06,328 macleod.logical.axiom          DEBUG    Term: PP(y,z)
2023-04-01 18:19:06,328 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[PP(y,z)]
2023-04-01 18:19:06,329 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[PP(y,z)]
2023-04-01 18:19:06,329 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[PP(y,z)]
2023-04-01 18:19:06,330 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[PP(y,z)]
2023-04-01 18:19:24,857 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 18:19:24,858 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 18:19:24,859 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 18:19:24,860 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-04-01 18:19:24,879 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(['inline', "'properPartOf'", pp(x,y)] <-> (p(x,y) & ~p(y,x)))]
2023-04-01 18:19:24,881 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(pp(x,y) <-> (p(x,y) & ~p(y,x)))]
2023-04-01 18:19:24,883 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:19:24,885 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:19:24,886 macleod.logical.axiom          DEBUG    Term: p(y,z)
2023-04-01 18:19:24,886 macleod.logical.axiom          DEBUG    Term: ~p(y,z)
2023-04-01 18:19:24,887 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 18:19:24,887 macleod.logical.axiom          DEBUG    Term: (p(z,y) & ~p(y,z))
2023-04-01 18:19:24,888 macleod.logical.connective     DEBUG    Coalesced Called: (p(z,y) & ~p(y,z))
2023-04-01 18:19:24,889 macleod.logical.axiom          DEBUG    Coalesced Term: (p(z,y) & ~p(y,z))
2023-04-01 18:19:24,889 macleod.logical.connective     DEBUG    Rescope Called: (p(z,y) & ~p(y,z))
2023-04-01 18:19:24,890 macleod.logical.connective     DEBUG    No Quantifier children: (p(z,y) & ~p(y,z))
2023-04-01 18:19:24,891 macleod.logical.axiom          DEBUG    Rescoped Term: (p(z,y) & ~p(y,z))
2023-04-01 18:19:24,891 macleod.logical.axiom          DEBUG    Term: pp(z,y)
2023-04-01 18:19:24,892 macleod.logical.axiom          DEBUG    Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:19:24,892 macleod.logical.connective     DEBUG    Coalesced Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:19:24,893 macleod.logical.axiom          DEBUG    Coalesced Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:19:24,894 macleod.logical.connective     DEBUG    Rescope Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:19:24,894 macleod.logical.connective     DEBUG    No Quantifier children: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:19:24,896 macleod.logical.axiom          DEBUG    Rescoped Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:19:24,897 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:19:24,898 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:19:24,898 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:19:49,780 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 18:19:49,781 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 18:19:49,782 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 18:19:49,783 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-04-01 18:19:49,800 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(['inline', "'properPartOf'", pp(x,y)] <-> (p(x,y) & ~p(y,x)))]
2023-04-01 18:19:49,802 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(pp(x,y) <-> (p(x,y) & ~p(y,x)))]
2023-04-01 18:19:49,804 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:19:49,807 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:19:49,808 macleod.logical.axiom          DEBUG    Term: p(y,z)
2023-04-01 18:19:49,809 macleod.logical.axiom          DEBUG    Term: ~p(y,z)
2023-04-01 18:19:49,809 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 18:19:49,810 macleod.logical.axiom          DEBUG    Term: (p(z,y) & ~p(y,z))
2023-04-01 18:19:49,811 macleod.logical.connective     DEBUG    Coalesced Called: (p(z,y) & ~p(y,z))
2023-04-01 18:19:49,811 macleod.logical.axiom          DEBUG    Coalesced Term: (p(z,y) & ~p(y,z))
2023-04-01 18:19:49,812 macleod.logical.connective     DEBUG    Rescope Called: (p(z,y) & ~p(y,z))
2023-04-01 18:19:49,812 macleod.logical.connective     DEBUG    No Quantifier children: (p(z,y) & ~p(y,z))
2023-04-01 18:19:49,813 macleod.logical.axiom          DEBUG    Rescoped Term: (p(z,y) & ~p(y,z))
2023-04-01 18:19:49,814 macleod.logical.axiom          DEBUG    Term: pp(z,y)
2023-04-01 18:19:49,814 macleod.logical.axiom          DEBUG    Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:19:49,815 macleod.logical.connective     DEBUG    Coalesced Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:19:49,816 macleod.logical.axiom          DEBUG    Coalesced Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:19:49,816 macleod.logical.connective     DEBUG    Rescope Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:19:49,817 macleod.logical.connective     DEBUG    No Quantifier children: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:19:49,818 macleod.logical.axiom          DEBUG    Rescoped Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:19:49,818 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:19:49,819 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:19:49,820 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:20:33,937 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 18:20:33,938 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 18:20:33,939 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 18:20:33,940 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-04-01 18:20:33,957 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(['inline', "'properPartOf'", pp(x,y)] <-> (p(x,y) & ~p(y,x)))]
2023-04-01 18:20:33,958 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(pp(x,y) <-> (p(x,y) & ~p(y,x)))]
2023-04-01 18:20:33,960 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:20:33,962 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:20:33,963 macleod.logical.axiom          DEBUG    Term: p(y,z)
2023-04-01 18:20:33,964 macleod.logical.axiom          DEBUG    Term: ~p(y,z)
2023-04-01 18:20:33,964 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 18:20:33,964 macleod.logical.axiom          DEBUG    Term: (p(z,y) & ~p(y,z))
2023-04-01 18:20:33,965 macleod.logical.connective     DEBUG    Coalesced Called: (p(z,y) & ~p(y,z))
2023-04-01 18:20:33,965 macleod.logical.axiom          DEBUG    Coalesced Term: (p(z,y) & ~p(y,z))
2023-04-01 18:20:33,966 macleod.logical.connective     DEBUG    Rescope Called: (p(z,y) & ~p(y,z))
2023-04-01 18:20:33,966 macleod.logical.connective     DEBUG    No Quantifier children: (p(z,y) & ~p(y,z))
2023-04-01 18:20:33,967 macleod.logical.axiom          DEBUG    Rescoped Term: (p(z,y) & ~p(y,z))
2023-04-01 18:20:33,969 macleod.logical.axiom          DEBUG    Term: pp(z,y)
2023-04-01 18:20:33,970 macleod.logical.axiom          DEBUG    Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:20:33,971 macleod.logical.connective     DEBUG    Coalesced Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:20:33,972 macleod.logical.axiom          DEBUG    Coalesced Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:20:33,973 macleod.logical.connective     DEBUG    Rescope Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:20:33,973 macleod.logical.connective     DEBUG    No Quantifier children: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:20:33,974 macleod.logical.axiom          DEBUG    Rescoped Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:20:33,974 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:20:33,974 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:20:33,975 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:21:15,196 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:21:15,198 macleod.logical.axiom          DEBUG    Starting Axiom: =('(',uni)
2023-04-01 18:21:15,199 macleod.logical.axiom          DEBUG    Function Free: =(''('',uni)
2023-04-01 18:21:15,200 macleod.logical.utils          INFO     Found a constant!
2023-04-01 18:21:15,200 macleod.logical.axiom          DEBUG    Unique Variables: =('''(''',uni)
2023-04-01 18:21:15,201 macleod.logical.axiom          DEBUG    Distributed Negation: =(''''('''',uni)
2023-04-01 18:21:15,202 macleod.logical.axiom          DEBUG    Term: =(''''('''',uni)
2023-04-01 18:21:15,203 macleod.logical.axiom          DEBUG    Prenex Form: =('''''(''''',uni)
2023-04-01 18:21:15,203 macleod.logical.axiom          DEBUG    CNF Form: =(''''''('''''',uni)
2023-04-01 18:21:15,206 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[((P(x,y) & ~=('(',x)) <-> <<(x,y))]
2023-04-01 18:21:15,208 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[((P(x,y) & ~=(''('',x)) <-> <<(x,y))]
2023-04-01 18:21:15,208 macleod.logical.utils          INFO     Found a constant!
2023-04-01 18:21:15,210 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[((P(z,y) & ~=('''(''',z)) <-> <<(z,y))]
2023-04-01 18:21:15,214 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[((P(z,y) & ~=(''''('''',z)) <-> <<(z,y))]
2023-04-01 18:21:15,214 macleod.logical.axiom          DEBUG    Term: =(''''('''',z)
2023-04-01 18:21:15,214 macleod.logical.axiom          DEBUG    Term: ~=(''''('''',z)
2023-04-01 18:21:15,214 macleod.logical.axiom          DEBUG    Term: P(z,y)
2023-04-01 18:21:15,215 macleod.logical.axiom          DEBUG    Term: <<(z,y)
2023-04-01 18:21:15,215 macleod.logical.axiom          DEBUG    Term: (P(z,y) & ~=(''''('''',z))
2023-04-01 18:21:15,215 macleod.logical.connective     DEBUG    Coalesced Called: (P(z,y) & ~=(''''('''',z))
2023-04-01 18:21:15,216 macleod.logical.axiom          DEBUG    Coalesced Term: (P(z,y) & ~=(''''('''',z))
2023-04-01 18:21:15,216 macleod.logical.connective     DEBUG    Rescope Called: (P(z,y) & ~=(''''('''',z))
2023-04-01 18:21:15,217 macleod.logical.connective     DEBUG    No Quantifier children: (P(z,y) & ~=(''''('''',z))
2023-04-01 18:21:15,217 macleod.logical.axiom          DEBUG    Rescoped Term: (P(z,y) & ~=(''''('''',z))
2023-04-01 18:21:15,218 macleod.logical.axiom          DEBUG    Term: (<<(z,y) <-> (P(z,y) & ~=(''''('''',z)))
2023-04-01 18:21:15,219 macleod.logical.connective     DEBUG    Coalesced Called: (<<(z,y) <-> (P(z,y) & ~=(''''('''',z)))
2023-04-01 18:21:15,219 macleod.logical.axiom          DEBUG    Coalesced Term: (<<(z,y) <-> (P(z,y) & ~=(''''('''',z)))
2023-04-01 18:21:15,220 macleod.logical.connective     DEBUG    Rescope Called: (<<(z,y) <-> (P(z,y) & ~=(''''('''',z)))
2023-04-01 18:21:15,221 macleod.logical.connective     DEBUG    No Quantifier children: (<<(z,y) <-> (P(z,y) & ~=(''''('''',z)))
2023-04-01 18:21:15,222 macleod.logical.axiom          DEBUG    Rescoped Term: (<<(z,y) <-> (P(z,y) & ~=(''''('''',z)))
2023-04-01 18:21:15,223 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(<<(z,y) <-> (P(z,y) & ~=(''''('''',z)))]
2023-04-01 18:21:15,223 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(<<(z,y) <-> (P(z,y) & ~=(''''('''',z)))]
2023-04-01 18:21:15,226 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(<<(z,y) <-> (P(z,y) & ~=('''''(''''',z)))]
2023-04-01 18:21:17,520 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[(<<(z,y) <-> (P(z,y) & ~=(''''''('''''',z)))]
2023-04-01 18:23:23,094 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 18:23:23,095 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 18:23:23,096 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 18:23:32,673 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-04-01 18:23:51,017 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 18:23:51,019 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 18:23:51,019 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 18:23:54,917 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-04-01 18:23:56,743 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(['inline', "'properPartOf'", pp(x,y)] <-> (p(x,y) & ~p(y,x)))]
2023-04-01 18:23:56,746 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(pp(x,y) <-> (p(x,y) & ~p(y,x)))]
2023-04-01 18:23:56,748 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:23:56,751 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:23:56,751 macleod.logical.axiom          DEBUG    Term: p(y,z)
2023-04-01 18:23:56,752 macleod.logical.axiom          DEBUG    Term: ~p(y,z)
2023-04-01 18:23:56,752 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 18:23:56,753 macleod.logical.axiom          DEBUG    Term: (p(z,y) & ~p(y,z))
2023-04-01 18:23:56,753 macleod.logical.connective     DEBUG    Coalesced Called: (p(z,y) & ~p(y,z))
2023-04-01 18:23:56,754 macleod.logical.axiom          DEBUG    Coalesced Term: (p(z,y) & ~p(y,z))
2023-04-01 18:23:56,755 macleod.logical.connective     DEBUG    Rescope Called: (p(z,y) & ~p(y,z))
2023-04-01 18:23:56,755 macleod.logical.connective     DEBUG    No Quantifier children: (p(z,y) & ~p(y,z))
2023-04-01 18:23:56,756 macleod.logical.axiom          DEBUG    Rescoped Term: (p(z,y) & ~p(y,z))
2023-04-01 18:23:56,757 macleod.logical.axiom          DEBUG    Term: pp(z,y)
2023-04-01 18:23:56,757 macleod.logical.axiom          DEBUG    Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:23:56,761 macleod.logical.connective     DEBUG    Coalesced Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:23:56,762 macleod.logical.axiom          DEBUG    Coalesced Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:23:56,763 macleod.logical.connective     DEBUG    Rescope Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:23:56,763 macleod.logical.connective     DEBUG    No Quantifier children: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:23:56,764 macleod.logical.axiom          DEBUG    Rescoped Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:23:56,765 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:23:56,766 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:23:56,767 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:24:00,126 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:24:00,127 macleod.logical.axiom          DEBUG    Starting Axiom: =('(',uni)
2023-04-01 18:24:00,128 macleod.logical.axiom          DEBUG    Function Free: =(''('',uni)
2023-04-01 18:24:00,129 macleod.logical.utils          INFO     Found a constant!
2023-04-01 18:24:00,130 macleod.logical.axiom          DEBUG    Unique Variables: =('''(''',uni)
2023-04-01 18:24:00,131 macleod.logical.axiom          DEBUG    Distributed Negation: =(''''('''',uni)
2023-04-01 18:24:00,131 macleod.logical.axiom          DEBUG    Term: =(''''('''',uni)
2023-04-01 18:24:00,132 macleod.logical.axiom          DEBUG    Prenex Form: =('''''(''''',uni)
2023-04-01 18:24:00,133 macleod.logical.axiom          DEBUG    CNF Form: =(''''''('''''',uni)
2023-04-01 18:24:00,135 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[((P(x,y) & ~=('(',x)) <-> <<(x,y))]
2023-04-01 18:24:00,139 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[((P(x,y) & ~=(''('',x)) <-> <<(x,y))]
2023-04-01 18:24:00,140 macleod.logical.utils          INFO     Found a constant!
2023-04-01 18:24:00,144 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[((P(z,y) & ~=('''(''',z)) <-> <<(z,y))]
2023-04-01 18:24:00,148 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[((P(z,y) & ~=(''''('''',z)) <-> <<(z,y))]
2023-04-01 18:24:00,150 macleod.logical.axiom          DEBUG    Term: =(''''('''',z)
2023-04-01 18:24:00,151 macleod.logical.axiom          DEBUG    Term: ~=(''''('''',z)
2023-04-01 18:24:00,152 macleod.logical.axiom          DEBUG    Term: P(z,y)
2023-04-01 18:24:00,152 macleod.logical.axiom          DEBUG    Term: <<(z,y)
2023-04-01 18:24:00,153 macleod.logical.axiom          DEBUG    Term: (P(z,y) & ~=(''''('''',z))
2023-04-01 18:24:00,154 macleod.logical.connective     DEBUG    Coalesced Called: (P(z,y) & ~=(''''('''',z))
2023-04-01 18:24:00,155 macleod.logical.axiom          DEBUG    Coalesced Term: (P(z,y) & ~=(''''('''',z))
2023-04-01 18:24:00,155 macleod.logical.connective     DEBUG    Rescope Called: (P(z,y) & ~=(''''('''',z))
2023-04-01 18:24:00,156 macleod.logical.connective     DEBUG    No Quantifier children: (P(z,y) & ~=(''''('''',z))
2023-04-01 18:24:00,157 macleod.logical.axiom          DEBUG    Rescoped Term: (P(z,y) & ~=(''''('''',z))
2023-04-01 18:24:00,158 macleod.logical.axiom          DEBUG    Term: (<<(z,y) <-> (P(z,y) & ~=(''''('''',z)))
2023-04-01 18:24:00,159 macleod.logical.connective     DEBUG    Coalesced Called: (<<(z,y) <-> (P(z,y) & ~=(''''('''',z)))
2023-04-01 18:24:00,160 macleod.logical.axiom          DEBUG    Coalesced Term: (<<(z,y) <-> (P(z,y) & ~=(''''('''',z)))
2023-04-01 18:24:00,161 macleod.logical.connective     DEBUG    Rescope Called: (<<(z,y) <-> (P(z,y) & ~=(''''('''',z)))
2023-04-01 18:24:00,163 macleod.logical.connective     DEBUG    No Quantifier children: (<<(z,y) <-> (P(z,y) & ~=(''''('''',z)))
2023-04-01 18:24:00,165 macleod.logical.axiom          DEBUG    Rescoped Term: (<<(z,y) <-> (P(z,y) & ~=(''''('''',z)))
2023-04-01 18:24:00,165 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(<<(z,y) <-> (P(z,y) & ~=(''''('''',z)))]
2023-04-01 18:24:00,166 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(<<(z,y) <-> (P(z,y) & ~=(''''('''',z)))]
2023-04-01 18:24:00,168 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(<<(z,y) <-> (P(z,y) & ~=('''''(''''',z)))]
2023-04-01 18:24:00,173 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[(<<(z,y) <-> (P(z,y) & ~=(''''''('''''',z)))]
2023-04-01 18:24:15,478 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 18:24:15,478 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 18:24:15,482 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 18:24:42,820 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-04-01 18:25:10,066 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(['inline', "'properPartOf'", pp(x,y)] <-> (p(x,y) & ~p(y,x)))]
2023-04-01 18:25:10,069 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(pp(x,y) <-> (p(x,y) & ~p(y,x)))]
2023-04-01 18:25:10,072 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:25:10,075 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:25:10,076 macleod.logical.axiom          DEBUG    Term: p(y,z)
2023-04-01 18:25:10,077 macleod.logical.axiom          DEBUG    Term: ~p(y,z)
2023-04-01 18:25:10,077 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 18:25:10,078 macleod.logical.axiom          DEBUG    Term: (p(z,y) & ~p(y,z))
2023-04-01 18:25:10,079 macleod.logical.connective     DEBUG    Coalesced Called: (p(z,y) & ~p(y,z))
2023-04-01 18:25:10,080 macleod.logical.axiom          DEBUG    Coalesced Term: (p(z,y) & ~p(y,z))
2023-04-01 18:25:10,081 macleod.logical.connective     DEBUG    Rescope Called: (p(z,y) & ~p(y,z))
2023-04-01 18:25:10,082 macleod.logical.connective     DEBUG    No Quantifier children: (p(z,y) & ~p(y,z))
2023-04-01 18:25:10,083 macleod.logical.axiom          DEBUG    Rescoped Term: (p(z,y) & ~p(y,z))
2023-04-01 18:25:10,085 macleod.logical.axiom          DEBUG    Term: pp(z,y)
2023-04-01 18:25:10,085 macleod.logical.axiom          DEBUG    Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:25:10,086 macleod.logical.connective     DEBUG    Coalesced Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:25:10,087 macleod.logical.axiom          DEBUG    Coalesced Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:25:10,088 macleod.logical.connective     DEBUG    Rescope Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:25:10,089 macleod.logical.connective     DEBUG    No Quantifier children: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:25:10,090 macleod.logical.axiom          DEBUG    Rescoped Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:25:10,091 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:25:10,091 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:25:10,093 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:25:10,097 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:25:52,960 macleod.logical.axiom          DEBUG    Starting Axiom: =('(',uni)
2023-04-01 18:25:52,962 macleod.logical.axiom          DEBUG    Function Free: =(''('',uni)
2023-04-01 18:25:52,963 macleod.logical.utils          INFO     Found a constant!
2023-04-01 18:25:52,964 macleod.logical.axiom          DEBUG    Unique Variables: =('''(''',uni)
2023-04-01 18:25:52,965 macleod.logical.axiom          DEBUG    Distributed Negation: =(''''('''',uni)
2023-04-01 18:25:52,965 macleod.logical.axiom          DEBUG    Term: =(''''('''',uni)
2023-04-01 18:25:52,966 macleod.logical.axiom          DEBUG    Prenex Form: =('''''(''''',uni)
2023-04-01 18:25:52,967 macleod.logical.axiom          DEBUG    CNF Form: =(''''''('''''',uni)
2023-04-01 18:26:05,274 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[((P(x,y) & ~=('(',x)) <-> <<(x,y))]
2023-04-01 18:26:05,278 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[((P(x,y) & ~=(''('',x)) <-> <<(x,y))]
2023-04-01 18:26:05,279 macleod.logical.utils          INFO     Found a constant!
2023-04-01 18:26:05,280 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[((P(z,y) & ~=('''(''',z)) <-> <<(z,y))]
2023-04-01 18:26:05,283 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[((P(z,y) & ~=(''''('''',z)) <-> <<(z,y))]
2023-04-01 18:26:05,284 macleod.logical.axiom          DEBUG    Term: =(''''('''',z)
2023-04-01 18:26:05,284 macleod.logical.axiom          DEBUG    Term: ~=(''''('''',z)
2023-04-01 18:26:05,285 macleod.logical.axiom          DEBUG    Term: P(z,y)
2023-04-01 18:26:05,285 macleod.logical.axiom          DEBUG    Term: <<(z,y)
2023-04-01 18:26:05,285 macleod.logical.axiom          DEBUG    Term: (P(z,y) & ~=(''''('''',z))
2023-04-01 18:26:05,286 macleod.logical.connective     DEBUG    Coalesced Called: (P(z,y) & ~=(''''('''',z))
2023-04-01 18:26:05,286 macleod.logical.axiom          DEBUG    Coalesced Term: (P(z,y) & ~=(''''('''',z))
2023-04-01 18:26:05,287 macleod.logical.connective     DEBUG    Rescope Called: (P(z,y) & ~=(''''('''',z))
2023-04-01 18:26:05,287 macleod.logical.connective     DEBUG    No Quantifier children: (P(z,y) & ~=(''''('''',z))
2023-04-01 18:26:05,288 macleod.logical.axiom          DEBUG    Rescoped Term: (P(z,y) & ~=(''''('''',z))
2023-04-01 18:26:05,289 macleod.logical.axiom          DEBUG    Term: (<<(z,y) <-> (P(z,y) & ~=(''''('''',z)))
2023-04-01 18:26:05,290 macleod.logical.connective     DEBUG    Coalesced Called: (<<(z,y) <-> (P(z,y) & ~=(''''('''',z)))
2023-04-01 18:26:05,291 macleod.logical.axiom          DEBUG    Coalesced Term: (<<(z,y) <-> (P(z,y) & ~=(''''('''',z)))
2023-04-01 18:26:05,292 macleod.logical.connective     DEBUG    Rescope Called: (<<(z,y) <-> (P(z,y) & ~=(''''('''',z)))
2023-04-01 18:26:05,292 macleod.logical.connective     DEBUG    No Quantifier children: (<<(z,y) <-> (P(z,y) & ~=(''''('''',z)))
2023-04-01 18:26:05,293 macleod.logical.axiom          DEBUG    Rescoped Term: (<<(z,y) <-> (P(z,y) & ~=(''''('''',z)))
2023-04-01 18:26:05,293 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(<<(z,y) <-> (P(z,y) & ~=(''''('''',z)))]
2023-04-01 18:26:05,294 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(<<(z,y) <-> (P(z,y) & ~=(''''('''',z)))]
2023-04-01 18:26:05,295 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(<<(z,y) <-> (P(z,y) & ~=('''''(''''',z)))]
2023-04-01 18:26:05,298 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[(<<(z,y) <-> (P(z,y) & ~=(''''''('''''',z)))]
2023-04-01 18:28:03,937 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 18:28:03,937 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 18:28:03,938 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 18:28:12,225 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-04-01 18:31:05,576 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 18:31:05,577 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 18:31:05,578 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 18:31:07,726 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-04-01 18:33:53,278 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 18:33:53,279 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 18:33:53,279 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 18:33:55,398 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-04-01 18:34:19,216 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 18:34:19,217 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 18:34:19,218 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 18:34:21,465 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-04-01 18:36:00,123 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 18:36:00,124 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 18:36:00,125 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 18:36:01,936 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-04-01 18:36:44,331 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 18:36:44,332 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 18:36:44,333 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 18:36:47,209 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-04-01 18:36:52,742 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(['inline', "'properPartOf'", pp(x,y)] <-> (p(x,y) & ~p(y,x)))]
2023-04-01 18:36:52,745 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(pp(x,y) <-> (p(x,y) & ~p(y,x)))]
2023-04-01 18:36:52,748 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:36:52,751 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:36:52,752 macleod.logical.axiom          DEBUG    Term: p(y,z)
2023-04-01 18:36:52,753 macleod.logical.axiom          DEBUG    Term: ~p(y,z)
2023-04-01 18:36:52,753 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 18:36:52,755 macleod.logical.axiom          DEBUG    Term: (p(z,y) & ~p(y,z))
2023-04-01 18:36:52,756 macleod.logical.connective     DEBUG    Coalesced Called: (p(z,y) & ~p(y,z))
2023-04-01 18:36:52,757 macleod.logical.axiom          DEBUG    Coalesced Term: (p(z,y) & ~p(y,z))
2023-04-01 18:36:52,758 macleod.logical.connective     DEBUG    Rescope Called: (p(z,y) & ~p(y,z))
2023-04-01 18:36:52,758 macleod.logical.connective     DEBUG    No Quantifier children: (p(z,y) & ~p(y,z))
2023-04-01 18:36:52,759 macleod.logical.axiom          DEBUG    Rescoped Term: (p(z,y) & ~p(y,z))
2023-04-01 18:36:52,760 macleod.logical.axiom          DEBUG    Term: pp(z,y)
2023-04-01 18:36:52,761 macleod.logical.axiom          DEBUG    Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:36:52,762 macleod.logical.connective     DEBUG    Coalesced Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:36:52,763 macleod.logical.axiom          DEBUG    Coalesced Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:36:52,764 macleod.logical.connective     DEBUG    Rescope Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:36:52,764 macleod.logical.connective     DEBUG    No Quantifier children: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:36:52,765 macleod.logical.axiom          DEBUG    Rescoped Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:36:52,766 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:36:52,767 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:36:52,768 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:36:52,771 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:36:52,773 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[((P(x,y) & ~=(x,y)) <-> "<<"(x,y))]
2023-04-01 18:36:52,776 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[((P(x,y) & ~=(x,y)) <-> "<<"(x,y))]
2023-04-01 18:36:52,778 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[((P(z,y) & ~=(z,y)) <-> "<<"(z,y))]
2023-04-01 18:36:52,780 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[((P(z,y) & ~=(z,y)) <-> "<<"(z,y))]
2023-04-01 18:36:52,781 macleod.logical.axiom          DEBUG    Term: =(z,y)
2023-04-01 18:36:52,782 macleod.logical.axiom          DEBUG    Term: ~=(z,y)
2023-04-01 18:36:52,782 macleod.logical.axiom          DEBUG    Term: P(z,y)
2023-04-01 18:36:52,783 macleod.logical.axiom          DEBUG    Term: "<<"(z,y)
2023-04-01 18:36:52,783 macleod.logical.axiom          DEBUG    Term: (P(z,y) & ~=(z,y))
2023-04-01 18:36:52,784 macleod.logical.connective     DEBUG    Coalesced Called: (P(z,y) & ~=(z,y))
2023-04-01 18:36:52,785 macleod.logical.axiom          DEBUG    Coalesced Term: (P(z,y) & ~=(z,y))
2023-04-01 18:36:52,785 macleod.logical.connective     DEBUG    Rescope Called: (P(z,y) & ~=(z,y))
2023-04-01 18:36:52,786 macleod.logical.connective     DEBUG    No Quantifier children: (P(z,y) & ~=(z,y))
2023-04-01 18:36:52,788 macleod.logical.axiom          DEBUG    Rescoped Term: (P(z,y) & ~=(z,y))
2023-04-01 18:36:52,789 macleod.logical.axiom          DEBUG    Term: ("<<"(z,y) <-> (P(z,y) & ~=(z,y)))
2023-04-01 18:36:52,791 macleod.logical.connective     DEBUG    Coalesced Called: ("<<"(z,y) <-> (P(z,y) & ~=(z,y)))
2023-04-01 18:36:52,792 macleod.logical.axiom          DEBUG    Coalesced Term: ("<<"(z,y) <-> (P(z,y) & ~=(z,y)))
2023-04-01 18:36:52,792 macleod.logical.connective     DEBUG    Rescope Called: ("<<"(z,y) <-> (P(z,y) & ~=(z,y)))
2023-04-01 18:36:52,793 macleod.logical.connective     DEBUG    No Quantifier children: ("<<"(z,y) <-> (P(z,y) & ~=(z,y)))
2023-04-01 18:36:52,794 macleod.logical.axiom          DEBUG    Rescoped Term: ("<<"(z,y) <-> (P(z,y) & ~=(z,y)))
2023-04-01 18:36:52,795 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[("<<"(z,y) <-> (P(z,y) & ~=(z,y)))]
2023-04-01 18:36:52,795 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[("<<"(z,y) <-> (P(z,y) & ~=(z,y)))]
2023-04-01 18:36:52,796 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[("<<"(z,y) <-> (P(z,y) & ~=(z,y)))]
2023-04-01 18:36:52,799 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[("<<"(z,y) <-> (P(z,y) & ~=(z,y)))]
2023-04-01 18:39:15,017 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 18:39:15,018 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 18:39:15,019 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 18:39:15,020 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-04-01 18:39:21,943 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(['inline', "'properPartOf'", pp(x,y)] <-> (p(x,y) & ~p(y,x)))]
2023-04-01 18:39:21,946 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(pp(x,y) <-> (p(x,y) & ~p(y,x)))]
2023-04-01 18:39:21,948 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:39:21,951 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:39:21,952 macleod.logical.axiom          DEBUG    Term: p(y,z)
2023-04-01 18:39:21,953 macleod.logical.axiom          DEBUG    Term: ~p(y,z)
2023-04-01 18:39:21,953 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 18:39:21,954 macleod.logical.axiom          DEBUG    Term: (p(z,y) & ~p(y,z))
2023-04-01 18:39:21,955 macleod.logical.connective     DEBUG    Coalesced Called: (p(z,y) & ~p(y,z))
2023-04-01 18:39:21,955 macleod.logical.axiom          DEBUG    Coalesced Term: (p(z,y) & ~p(y,z))
2023-04-01 18:39:21,956 macleod.logical.connective     DEBUG    Rescope Called: (p(z,y) & ~p(y,z))
2023-04-01 18:39:21,958 macleod.logical.connective     DEBUG    No Quantifier children: (p(z,y) & ~p(y,z))
2023-04-01 18:39:21,959 macleod.logical.axiom          DEBUG    Rescoped Term: (p(z,y) & ~p(y,z))
2023-04-01 18:39:21,960 macleod.logical.axiom          DEBUG    Term: pp(z,y)
2023-04-01 18:39:21,960 macleod.logical.axiom          DEBUG    Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:39:21,961 macleod.logical.connective     DEBUG    Coalesced Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:39:21,962 macleod.logical.axiom          DEBUG    Coalesced Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:39:21,963 macleod.logical.connective     DEBUG    Rescope Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:39:21,963 macleod.logical.connective     DEBUG    No Quantifier children: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:39:21,965 macleod.logical.axiom          DEBUG    Rescoped Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:39:21,966 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:39:21,966 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:39:21,968 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:39:21,971 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:39:21,974 macleod.logical.axiom          DEBUG    Starting Axiom: =(uni,'"UniversalEntity1"')
2023-04-01 18:39:21,975 macleod.logical.axiom          DEBUG    Function Free: =(uni,''"UniversalEntity1"'')
2023-04-01 18:39:21,975 macleod.logical.utils          INFO     Found a constant!
2023-04-01 18:39:21,976 macleod.logical.axiom          DEBUG    Unique Variables: =(uni,'''"UniversalEntity1"''')
2023-04-01 18:39:21,977 macleod.logical.axiom          DEBUG    Distributed Negation: =(uni,''''"UniversalEntity1"'''')
2023-04-01 18:39:21,978 macleod.logical.axiom          DEBUG    Term: =(uni,''''"UniversalEntity1"'''')
2023-04-01 18:39:21,978 macleod.logical.axiom          DEBUG    Prenex Form: =(uni,'''''"UniversalEntity1"''''')
2023-04-01 18:39:21,980 macleod.logical.axiom          DEBUG    CNF Form: =(uni,''''''"UniversalEntity1"'''''')
2023-04-01 18:39:21,981 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[((P(x,y) & ~=(x,y)) <-> "<<"(x,y))]
2023-04-01 18:39:21,984 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[((P(x,y) & ~=(x,y)) <-> "<<"(x,y))]
2023-04-01 18:39:21,987 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[((P(z,y) & ~=(z,y)) <-> "<<"(z,y))]
2023-04-01 18:39:21,989 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[((P(z,y) & ~=(z,y)) <-> "<<"(z,y))]
2023-04-01 18:39:21,990 macleod.logical.axiom          DEBUG    Term: =(z,y)
2023-04-01 18:39:21,991 macleod.logical.axiom          DEBUG    Term: ~=(z,y)
2023-04-01 18:39:21,992 macleod.logical.axiom          DEBUG    Term: P(z,y)
2023-04-01 18:39:21,992 macleod.logical.axiom          DEBUG    Term: "<<"(z,y)
2023-04-01 18:39:21,992 macleod.logical.axiom          DEBUG    Term: (P(z,y) & ~=(z,y))
2023-04-01 18:39:21,993 macleod.logical.connective     DEBUG    Coalesced Called: (P(z,y) & ~=(z,y))
2023-04-01 18:39:21,994 macleod.logical.axiom          DEBUG    Coalesced Term: (P(z,y) & ~=(z,y))
2023-04-01 18:39:21,994 macleod.logical.connective     DEBUG    Rescope Called: (P(z,y) & ~=(z,y))
2023-04-01 18:39:21,995 macleod.logical.connective     DEBUG    No Quantifier children: (P(z,y) & ~=(z,y))
2023-04-01 18:39:21,996 macleod.logical.axiom          DEBUG    Rescoped Term: (P(z,y) & ~=(z,y))
2023-04-01 18:39:21,997 macleod.logical.axiom          DEBUG    Term: ("<<"(z,y) <-> (P(z,y) & ~=(z,y)))
2023-04-01 18:39:21,998 macleod.logical.connective     DEBUG    Coalesced Called: ("<<"(z,y) <-> (P(z,y) & ~=(z,y)))
2023-04-01 18:39:21,998 macleod.logical.axiom          DEBUG    Coalesced Term: ("<<"(z,y) <-> (P(z,y) & ~=(z,y)))
2023-04-01 18:39:21,999 macleod.logical.connective     DEBUG    Rescope Called: ("<<"(z,y) <-> (P(z,y) & ~=(z,y)))
2023-04-01 18:39:22,000 macleod.logical.connective     DEBUG    No Quantifier children: ("<<"(z,y) <-> (P(z,y) & ~=(z,y)))
2023-04-01 18:39:22,001 macleod.logical.axiom          DEBUG    Rescoped Term: ("<<"(z,y) <-> (P(z,y) & ~=(z,y)))
2023-04-01 18:39:22,003 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[("<<"(z,y) <-> (P(z,y) & ~=(z,y)))]
2023-04-01 18:39:22,003 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[("<<"(z,y) <-> (P(z,y) & ~=(z,y)))]
2023-04-01 18:39:22,005 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[("<<"(z,y) <-> (P(z,y) & ~=(z,y)))]
2023-04-01 18:39:22,007 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[("<<"(z,y) <-> (P(z,y) & ~=(z,y)))]
2023-04-01 18:39:53,952 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 18:39:53,953 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 18:39:53,954 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 18:39:53,955 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_basic.clif
2023-04-01 18:41:08,891 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 18:41:08,892 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 18:41:08,893 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 18:41:08,893 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_basic.clif
2023-04-01 18:41:08,992 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(p(x,y) <-> \forall z\;[(c(z,x) -> c(z,y))])]
2023-04-01 18:41:08,994 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(p(x,y) <-> \forall z\;[(c(z,x) -> c(z,y))])]
2023-04-01 18:41:08,995 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])]
2023-04-01 18:41:08,997 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])]
2023-04-01 18:41:08,997 macleod.logical.axiom          DEBUG    Term: c(x,y)
2023-04-01 18:41:08,998 macleod.logical.axiom          DEBUG    Term: c(x,z)
2023-04-01 18:41:08,998 macleod.logical.axiom          DEBUG    Term: (c(x,z) -> c(x,y))
2023-04-01 18:41:08,999 macleod.logical.connective     DEBUG    Coalesced Called: (c(x,z) -> c(x,y))
2023-04-01 18:41:08,999 macleod.logical.axiom          DEBUG    Coalesced Term: (c(x,z) -> c(x,y))
2023-04-01 18:41:09,000 macleod.logical.connective     DEBUG    Rescope Called: (c(x,z) -> c(x,y))
2023-04-01 18:41:09,000 macleod.logical.connective     DEBUG    No Quantifier children: (c(x,z) -> c(x,y))
2023-04-01 18:41:09,001 macleod.logical.axiom          DEBUG    Rescoped Term: (c(x,z) -> c(x,y))
2023-04-01 18:41:09,001 macleod.logical.axiom          DEBUG    Term: \forall x\;[(c(x,z) -> c(x,y))]
2023-04-01 18:41:09,001 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 18:41:09,002 macleod.logical.axiom          DEBUG    Term: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-01 18:41:09,003 macleod.logical.connective     DEBUG    Coalesced Called: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-01 18:41:09,003 macleod.logical.axiom          DEBUG    Coalesced Term: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-01 18:41:09,003 macleod.logical.connective     DEBUG    Rescope Called: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-01 18:41:09,004 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:41:09,005 macleod.logical.connective     DEBUG    Rescope Called: ((c(x,z) -> c(x,y)) <-> p(z,y))
2023-04-01 18:41:09,005 macleod.logical.connective     DEBUG    No Quantifier children: ((c(x,z) -> c(x,y)) <-> p(z,y))
2023-04-01 18:41:09,006 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]
2023-04-01 18:41:09,006 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\forall x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]]
2023-04-01 18:41:09,007 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\forall x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]]
2023-04-01 18:41:09,008 macleod.logical.quantifier     DEBUG    Found a matching quantifier
2023-04-01 18:41:09,009 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y,x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]
2023-04-01 18:41:09,010 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y,x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]
2023-04-01 18:41:09,012 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(pp(x,y) <-> (p(x,y) & ~p(y,x)))]
2023-04-01 18:41:09,013 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(pp(x,y) <-> (p(x,y) & ~p(y,x)))]
2023-04-01 18:41:09,015 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:41:09,017 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:41:09,017 macleod.logical.axiom          DEBUG    Term: p(y,z)
2023-04-01 18:41:09,018 macleod.logical.axiom          DEBUG    Term: ~p(y,z)
2023-04-01 18:41:09,018 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 18:41:09,019 macleod.logical.axiom          DEBUG    Term: (p(z,y) & ~p(y,z))
2023-04-01 18:41:09,019 macleod.logical.connective     DEBUG    Coalesced Called: (p(z,y) & ~p(y,z))
2023-04-01 18:41:09,020 macleod.logical.axiom          DEBUG    Coalesced Term: (p(z,y) & ~p(y,z))
2023-04-01 18:41:09,021 macleod.logical.connective     DEBUG    Rescope Called: (p(z,y) & ~p(y,z))
2023-04-01 18:41:09,021 macleod.logical.connective     DEBUG    No Quantifier children: (p(z,y) & ~p(y,z))
2023-04-01 18:41:09,022 macleod.logical.axiom          DEBUG    Rescoped Term: (p(z,y) & ~p(y,z))
2023-04-01 18:41:09,022 macleod.logical.axiom          DEBUG    Term: pp(z,y)
2023-04-01 18:41:09,023 macleod.logical.axiom          DEBUG    Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:41:09,024 macleod.logical.connective     DEBUG    Coalesced Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:41:09,024 macleod.logical.axiom          DEBUG    Coalesced Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:41:09,025 macleod.logical.connective     DEBUG    Rescope Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:41:09,025 macleod.logical.connective     DEBUG    No Quantifier children: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:41:09,026 macleod.logical.axiom          DEBUG    Rescoped Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:41:09,026 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:41:09,026 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:41:09,027 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:41:09,029 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:41:09,030 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(o(x,y) <-> \exists z\;[(p(z,x) & p(z,y))])]
2023-04-01 18:41:09,031 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(o(x,y) <-> \exists z\;[(p(z,x) & p(z,y))])]
2023-04-01 18:41:09,033 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])]
2023-04-01 18:41:09,035 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])]
2023-04-01 18:41:09,036 macleod.logical.axiom          DEBUG    Term: p(x,y)
2023-04-01 18:41:09,036 macleod.logical.axiom          DEBUG    Term: p(x,z)
2023-04-01 18:41:09,036 macleod.logical.axiom          DEBUG    Term: (p(x,z) & p(x,y))
2023-04-01 18:41:09,037 macleod.logical.connective     DEBUG    Coalesced Called: (p(x,z) & p(x,y))
2023-04-01 18:41:09,037 macleod.logical.axiom          DEBUG    Coalesced Term: (p(x,z) & p(x,y))
2023-04-01 18:41:09,037 macleod.logical.connective     DEBUG    Rescope Called: (p(x,z) & p(x,y))
2023-04-01 18:41:09,038 macleod.logical.connective     DEBUG    No Quantifier children: (p(x,z) & p(x,y))
2023-04-01 18:41:09,038 macleod.logical.axiom          DEBUG    Rescoped Term: (p(x,z) & p(x,y))
2023-04-01 18:41:09,038 macleod.logical.axiom          DEBUG    Term: \exists x\;[(p(x,z) & p(x,y))]
2023-04-01 18:41:09,039 macleod.logical.axiom          DEBUG    Term: o(z,y)
2023-04-01 18:41:09,039 macleod.logical.axiom          DEBUG    Term: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-01 18:41:09,040 macleod.logical.connective     DEBUG    Coalesced Called: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-01 18:41:09,041 macleod.logical.axiom          DEBUG    Coalesced Term: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-01 18:41:09,041 macleod.logical.connective     DEBUG    Rescope Called: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-01 18:41:09,041 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:41:09,042 macleod.logical.connective     DEBUG    Rescope Called: ((p(x,z) & p(x,y)) <-> o(z,y))
2023-04-01 18:41:09,043 macleod.logical.connective     DEBUG    No Quantifier children: ((p(x,z) & p(x,y)) <-> o(z,y))
2023-04-01 18:41:09,043 macleod.logical.axiom          DEBUG    Rescoped Term: \exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]
2023-04-01 18:41:09,044 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-01 18:41:09,044 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-01 18:41:09,045 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-01 18:41:09,047 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-01 18:41:09,049 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(ec(x,y) <-> (c(x,y) & ~o(x,y)))]
2023-04-01 18:41:09,050 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(ec(x,y) <-> (c(x,y) & ~o(x,y)))]
2023-04-01 18:41:09,052 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:41:09,054 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:41:09,055 macleod.logical.axiom          DEBUG    Term: o(z,y)
2023-04-01 18:41:09,055 macleod.logical.axiom          DEBUG    Term: ~o(z,y)
2023-04-01 18:41:09,055 macleod.logical.axiom          DEBUG    Term: c(z,y)
2023-04-01 18:41:09,056 macleod.logical.axiom          DEBUG    Term: (c(z,y) & ~o(z,y))
2023-04-01 18:41:09,057 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,y) & ~o(z,y))
2023-04-01 18:41:09,057 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,y) & ~o(z,y))
2023-04-01 18:41:09,058 macleod.logical.connective     DEBUG    Rescope Called: (c(z,y) & ~o(z,y))
2023-04-01 18:41:09,059 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,y) & ~o(z,y))
2023-04-01 18:41:09,059 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,y) & ~o(z,y))
2023-04-01 18:41:09,060 macleod.logical.axiom          DEBUG    Term: ec(z,y)
2023-04-01 18:41:09,060 macleod.logical.axiom          DEBUG    Term: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:41:09,062 macleod.logical.connective     DEBUG    Coalesced Called: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:41:09,062 macleod.logical.axiom          DEBUG    Coalesced Term: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:41:09,063 macleod.logical.connective     DEBUG    Rescope Called: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:41:09,063 macleod.logical.connective     DEBUG    No Quantifier children: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:41:09,064 macleod.logical.axiom          DEBUG    Rescoped Term: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:41:09,065 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:41:09,065 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:41:09,066 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:41:09,068 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:41:09,070 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(ntpp(x,y) <-> (pp(x,y) & ~\exists z\;[(ec(z,x) & ec(z,y))]))]
2023-04-01 18:41:09,072 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(ntpp(x,y) <-> (pp(x,y) & ~\exists z\;[(ec(z,x) & ec(z,y))]))]
2023-04-01 18:41:09,074 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(ntpp(z,y) <-> (pp(z,y) & ~\exists x\;[(ec(x,z) & ec(x,y))]))]
2023-04-01 18:41:09,078 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(ntpp(z,y) <-> (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))]))]
2023-04-01 18:41:09,079 macleod.logical.axiom          DEBUG    Term: ec(x,y)
2023-04-01 18:41:09,079 macleod.logical.axiom          DEBUG    Term: ec(x,z)
2023-04-01 18:41:09,079 macleod.logical.axiom          DEBUG    Term: ~ec(x,y)
2023-04-01 18:41:09,080 macleod.logical.axiom          DEBUG    Term: ~ec(x,z)
2023-04-01 18:41:09,080 macleod.logical.axiom          DEBUG    Term: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:41:09,081 macleod.logical.connective     DEBUG    Coalesced Called: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:41:09,081 macleod.logical.axiom          DEBUG    Coalesced Term: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:41:09,082 macleod.logical.connective     DEBUG    Rescope Called: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:41:09,082 macleod.logical.connective     DEBUG    No Quantifier children: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:41:09,083 macleod.logical.axiom          DEBUG    Rescoped Term: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:41:09,084 macleod.logical.axiom          DEBUG    Term: \forall x\;[(~ec(x,z) | ~ec(x,y))]
2023-04-01 18:41:09,085 macleod.logical.axiom          DEBUG    Term: pp(z,y)
2023-04-01 18:41:09,085 macleod.logical.axiom          DEBUG    Term: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-01 18:41:09,086 macleod.logical.connective     DEBUG    Coalesced Called: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-01 18:41:09,087 macleod.logical.axiom          DEBUG    Coalesced Term: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-01 18:41:09,087 macleod.logical.connective     DEBUG    Rescope Called: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-01 18:41:09,088 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:41:09,089 macleod.logical.connective     DEBUG    Rescope Called: ((~ec(x,z) | ~ec(x,y)) & pp(z,y))
2023-04-01 18:41:09,089 macleod.logical.connective     DEBUG    No Quantifier children: ((~ec(x,z) | ~ec(x,y)) & pp(z,y))
2023-04-01 18:41:09,090 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))]
2023-04-01 18:41:09,091 macleod.logical.axiom          DEBUG    Term: ntpp(z,y)
2023-04-01 18:41:09,091 macleod.logical.axiom          DEBUG    Term: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-01 18:41:09,092 macleod.logical.connective     DEBUG    Coalesced Called: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-01 18:41:09,093 macleod.logical.axiom          DEBUG    Coalesced Term: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-01 18:41:09,093 macleod.logical.connective     DEBUG    Rescope Called: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-01 18:41:09,093 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:41:09,094 macleod.logical.connective     DEBUG    Rescope Called: (((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))
2023-04-01 18:41:09,095 macleod.logical.connective     DEBUG    No Quantifier children: (((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))
2023-04-01 18:41:09,096 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]
2023-04-01 18:41:09,096 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\forall x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]]
2023-04-01 18:41:09,097 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\forall x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]]
2023-04-01 18:41:09,098 macleod.logical.quantifier     DEBUG    Found a matching quantifier
2023-04-01 18:41:09,099 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y,x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]
2023-04-01 18:41:09,100 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y,x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]
2023-04-01 18:41:09,102 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x\;[c(x,x)]
2023-04-01 18:41:09,102 macleod.logical.axiom          DEBUG    Function Free: \forall x\;[c(x,x)]
2023-04-01 18:41:09,103 macleod.logical.axiom          DEBUG    Unique Variables: \forall z\;[c(z,z)]
2023-04-01 18:41:09,104 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z\;[c(z,z)]
2023-04-01 18:41:09,104 macleod.logical.axiom          DEBUG    Term: c(z,z)
2023-04-01 18:41:09,104 macleod.logical.axiom          DEBUG    Term: \forall z\;[c(z,z)]
2023-04-01 18:41:09,105 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z\;[c(z,z)]
2023-04-01 18:41:09,105 macleod.logical.axiom          DEBUG    Prenex Form: \forall z\;[c(z,z)]
2023-04-01 18:41:09,106 macleod.logical.axiom          DEBUG    CNF Form: \forall z\;[c(z,z)]
2023-04-01 18:41:09,107 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(c(x,y) -> c(y,x))]
2023-04-01 18:41:09,108 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(c(x,y) -> c(y,x))]
2023-04-01 18:41:09,109 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:41:09,110 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:41:09,111 macleod.logical.axiom          DEBUG    Term: c(y,z)
2023-04-01 18:41:09,111 macleod.logical.axiom          DEBUG    Term: c(z,y)
2023-04-01 18:41:09,111 macleod.logical.axiom          DEBUG    Term: (c(z,y) -> c(y,z))
2023-04-01 18:41:09,112 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,y) -> c(y,z))
2023-04-01 18:41:09,112 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,y) -> c(y,z))
2023-04-01 18:41:09,113 macleod.logical.connective     DEBUG    Rescope Called: (c(z,y) -> c(y,z))
2023-04-01 18:41:09,113 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,y) -> c(y,z))
2023-04-01 18:41:09,113 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,y) -> c(y,z))
2023-04-01 18:41:09,114 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:41:09,114 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:41:09,115 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:41:09,116 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:41:09,117 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x\;[c(x,uni)]
2023-04-01 18:41:09,118 macleod.logical.axiom          DEBUG    Function Free: \forall x\;[c(x,uni)]
2023-04-01 18:41:09,119 macleod.logical.utils          INFO     Found a constant!
2023-04-01 18:41:09,120 macleod.logical.axiom          DEBUG    Unique Variables: \forall z\;[c(z,uni)]
2023-04-01 18:41:09,120 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z\;[c(z,uni)]
2023-04-01 18:41:09,121 macleod.logical.axiom          DEBUG    Term: c(z,uni)
2023-04-01 18:41:09,121 macleod.logical.axiom          DEBUG    Term: \forall z\;[c(z,uni)]
2023-04-01 18:41:09,122 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z\;[c(z,uni)]
2023-04-01 18:41:09,122 macleod.logical.axiom          DEBUG    Prenex Form: \forall z\;[c(z,uni)]
2023-04-01 18:41:09,123 macleod.logical.axiom          DEBUG    CNF Form: \forall z\;[c(z,uni)]
2023-04-01 18:41:09,125 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(~=(y,uni) -> (o(x,compl(y)) <-> ~p(x,y)))]
2023-04-01 18:41:18,206 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 18:41:18,207 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 18:41:18,208 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 18:41:18,209 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_basic.clif
2023-04-01 18:41:18,234 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(p(x,y) <-> \forall z\;[(c(z,x) -> c(z,y))])]
2023-04-01 18:41:18,235 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(p(x,y) <-> \forall z\;[(c(z,x) -> c(z,y))])]
2023-04-01 18:41:18,237 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])]
2023-04-01 18:41:18,239 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])]
2023-04-01 18:41:18,239 macleod.logical.axiom          DEBUG    Term: c(x,y)
2023-04-01 18:41:18,240 macleod.logical.axiom          DEBUG    Term: c(x,z)
2023-04-01 18:41:18,240 macleod.logical.axiom          DEBUG    Term: (c(x,z) -> c(x,y))
2023-04-01 18:41:18,241 macleod.logical.connective     DEBUG    Coalesced Called: (c(x,z) -> c(x,y))
2023-04-01 18:41:18,242 macleod.logical.axiom          DEBUG    Coalesced Term: (c(x,z) -> c(x,y))
2023-04-01 18:41:18,242 macleod.logical.connective     DEBUG    Rescope Called: (c(x,z) -> c(x,y))
2023-04-01 18:41:18,242 macleod.logical.connective     DEBUG    No Quantifier children: (c(x,z) -> c(x,y))
2023-04-01 18:41:18,243 macleod.logical.axiom          DEBUG    Rescoped Term: (c(x,z) -> c(x,y))
2023-04-01 18:41:18,243 macleod.logical.axiom          DEBUG    Term: \forall x\;[(c(x,z) -> c(x,y))]
2023-04-01 18:41:18,243 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 18:41:18,244 macleod.logical.axiom          DEBUG    Term: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-01 18:41:18,245 macleod.logical.connective     DEBUG    Coalesced Called: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-01 18:41:18,245 macleod.logical.axiom          DEBUG    Coalesced Term: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-01 18:41:18,246 macleod.logical.connective     DEBUG    Rescope Called: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-01 18:41:18,246 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:41:18,247 macleod.logical.connective     DEBUG    Rescope Called: ((c(x,z) -> c(x,y)) <-> p(z,y))
2023-04-01 18:41:18,247 macleod.logical.connective     DEBUG    No Quantifier children: ((c(x,z) -> c(x,y)) <-> p(z,y))
2023-04-01 18:41:18,247 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]
2023-04-01 18:41:18,248 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\forall x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]]
2023-04-01 18:41:18,248 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\forall x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]]
2023-04-01 18:41:18,249 macleod.logical.quantifier     DEBUG    Found a matching quantifier
2023-04-01 18:41:18,250 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y,x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]
2023-04-01 18:41:18,252 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y,x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]
2023-04-01 18:41:18,254 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(pp(x,y) <-> (p(x,y) & ~p(y,x)))]
2023-04-01 18:41:18,255 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(pp(x,y) <-> (p(x,y) & ~p(y,x)))]
2023-04-01 18:41:18,256 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:41:18,258 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:41:18,259 macleod.logical.axiom          DEBUG    Term: p(y,z)
2023-04-01 18:41:18,259 macleod.logical.axiom          DEBUG    Term: ~p(y,z)
2023-04-01 18:41:18,260 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 18:41:18,260 macleod.logical.axiom          DEBUG    Term: (p(z,y) & ~p(y,z))
2023-04-01 18:41:18,261 macleod.logical.connective     DEBUG    Coalesced Called: (p(z,y) & ~p(y,z))
2023-04-01 18:41:18,261 macleod.logical.axiom          DEBUG    Coalesced Term: (p(z,y) & ~p(y,z))
2023-04-01 18:41:18,262 macleod.logical.connective     DEBUG    Rescope Called: (p(z,y) & ~p(y,z))
2023-04-01 18:41:18,262 macleod.logical.connective     DEBUG    No Quantifier children: (p(z,y) & ~p(y,z))
2023-04-01 18:41:18,263 macleod.logical.axiom          DEBUG    Rescoped Term: (p(z,y) & ~p(y,z))
2023-04-01 18:41:18,263 macleod.logical.axiom          DEBUG    Term: pp(z,y)
2023-04-01 18:41:18,264 macleod.logical.axiom          DEBUG    Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:41:18,264 macleod.logical.connective     DEBUG    Coalesced Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:41:18,265 macleod.logical.axiom          DEBUG    Coalesced Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:41:18,266 macleod.logical.connective     DEBUG    Rescope Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:41:18,266 macleod.logical.connective     DEBUG    No Quantifier children: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:41:18,267 macleod.logical.axiom          DEBUG    Rescoped Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:41:18,267 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:41:18,268 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:41:18,269 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:41:18,270 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:41:18,271 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(o(x,y) <-> \exists z\;[(p(z,x) & p(z,y))])]
2023-04-01 18:41:18,273 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(o(x,y) <-> \exists z\;[(p(z,x) & p(z,y))])]
2023-04-01 18:41:18,274 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])]
2023-04-01 18:41:18,275 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])]
2023-04-01 18:41:18,276 macleod.logical.axiom          DEBUG    Term: p(x,y)
2023-04-01 18:41:18,276 macleod.logical.axiom          DEBUG    Term: p(x,z)
2023-04-01 18:41:18,276 macleod.logical.axiom          DEBUG    Term: (p(x,z) & p(x,y))
2023-04-01 18:41:18,276 macleod.logical.connective     DEBUG    Coalesced Called: (p(x,z) & p(x,y))
2023-04-01 18:41:18,277 macleod.logical.axiom          DEBUG    Coalesced Term: (p(x,z) & p(x,y))
2023-04-01 18:41:18,277 macleod.logical.connective     DEBUG    Rescope Called: (p(x,z) & p(x,y))
2023-04-01 18:41:18,277 macleod.logical.connective     DEBUG    No Quantifier children: (p(x,z) & p(x,y))
2023-04-01 18:41:18,278 macleod.logical.axiom          DEBUG    Rescoped Term: (p(x,z) & p(x,y))
2023-04-01 18:41:18,279 macleod.logical.axiom          DEBUG    Term: \exists x\;[(p(x,z) & p(x,y))]
2023-04-01 18:41:18,279 macleod.logical.axiom          DEBUG    Term: o(z,y)
2023-04-01 18:41:18,279 macleod.logical.axiom          DEBUG    Term: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-01 18:41:18,280 macleod.logical.connective     DEBUG    Coalesced Called: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-01 18:41:18,280 macleod.logical.axiom          DEBUG    Coalesced Term: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-01 18:41:18,281 macleod.logical.connective     DEBUG    Rescope Called: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-01 18:41:18,281 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:41:18,282 macleod.logical.connective     DEBUG    Rescope Called: ((p(x,z) & p(x,y)) <-> o(z,y))
2023-04-01 18:41:18,282 macleod.logical.connective     DEBUG    No Quantifier children: ((p(x,z) & p(x,y)) <-> o(z,y))
2023-04-01 18:41:18,282 macleod.logical.axiom          DEBUG    Rescoped Term: \exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]
2023-04-01 18:41:18,283 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-01 18:41:18,283 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-01 18:41:18,284 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-01 18:41:18,286 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-01 18:41:18,287 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(ec(x,y) <-> (c(x,y) & ~o(x,y)))]
2023-04-01 18:41:18,288 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(ec(x,y) <-> (c(x,y) & ~o(x,y)))]
2023-04-01 18:41:18,290 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:41:18,292 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:41:18,293 macleod.logical.axiom          DEBUG    Term: o(z,y)
2023-04-01 18:41:18,294 macleod.logical.axiom          DEBUG    Term: ~o(z,y)
2023-04-01 18:41:18,294 macleod.logical.axiom          DEBUG    Term: c(z,y)
2023-04-01 18:41:18,294 macleod.logical.axiom          DEBUG    Term: (c(z,y) & ~o(z,y))
2023-04-01 18:41:18,295 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,y) & ~o(z,y))
2023-04-01 18:41:18,295 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,y) & ~o(z,y))
2023-04-01 18:41:18,295 macleod.logical.connective     DEBUG    Rescope Called: (c(z,y) & ~o(z,y))
2023-04-01 18:41:18,296 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,y) & ~o(z,y))
2023-04-01 18:41:18,296 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,y) & ~o(z,y))
2023-04-01 18:41:18,297 macleod.logical.axiom          DEBUG    Term: ec(z,y)
2023-04-01 18:41:18,297 macleod.logical.axiom          DEBUG    Term: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:41:18,298 macleod.logical.connective     DEBUG    Coalesced Called: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:41:18,298 macleod.logical.axiom          DEBUG    Coalesced Term: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:41:18,298 macleod.logical.connective     DEBUG    Rescope Called: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:41:18,299 macleod.logical.connective     DEBUG    No Quantifier children: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:41:18,299 macleod.logical.axiom          DEBUG    Rescoped Term: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:41:18,299 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:41:18,300 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:41:18,300 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:41:18,301 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:41:18,303 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(ntpp(x,y) <-> (pp(x,y) & ~\exists z\;[(ec(z,x) & ec(z,y))]))]
2023-04-01 18:41:18,306 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(ntpp(x,y) <-> (pp(x,y) & ~\exists z\;[(ec(z,x) & ec(z,y))]))]
2023-04-01 18:41:18,308 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(ntpp(z,y) <-> (pp(z,y) & ~\exists x\;[(ec(x,z) & ec(x,y))]))]
2023-04-01 18:41:18,312 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(ntpp(z,y) <-> (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))]))]
2023-04-01 18:41:18,313 macleod.logical.axiom          DEBUG    Term: ec(x,y)
2023-04-01 18:41:18,314 macleod.logical.axiom          DEBUG    Term: ec(x,z)
2023-04-01 18:41:18,314 macleod.logical.axiom          DEBUG    Term: ~ec(x,y)
2023-04-01 18:41:18,314 macleod.logical.axiom          DEBUG    Term: ~ec(x,z)
2023-04-01 18:41:18,315 macleod.logical.axiom          DEBUG    Term: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:41:18,315 macleod.logical.connective     DEBUG    Coalesced Called: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:41:18,316 macleod.logical.axiom          DEBUG    Coalesced Term: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:41:18,316 macleod.logical.connective     DEBUG    Rescope Called: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:41:18,317 macleod.logical.connective     DEBUG    No Quantifier children: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:41:18,317 macleod.logical.axiom          DEBUG    Rescoped Term: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:41:18,318 macleod.logical.axiom          DEBUG    Term: \forall x\;[(~ec(x,z) | ~ec(x,y))]
2023-04-01 18:41:18,318 macleod.logical.axiom          DEBUG    Term: pp(z,y)
2023-04-01 18:41:18,319 macleod.logical.axiom          DEBUG    Term: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-01 18:41:18,319 macleod.logical.connective     DEBUG    Coalesced Called: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-01 18:41:18,320 macleod.logical.axiom          DEBUG    Coalesced Term: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-01 18:41:18,320 macleod.logical.connective     DEBUG    Rescope Called: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-01 18:41:18,320 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:41:18,321 macleod.logical.connective     DEBUG    Rescope Called: ((~ec(x,z) | ~ec(x,y)) & pp(z,y))
2023-04-01 18:41:18,322 macleod.logical.connective     DEBUG    No Quantifier children: ((~ec(x,z) | ~ec(x,y)) & pp(z,y))
2023-04-01 18:41:18,323 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))]
2023-04-01 18:41:18,324 macleod.logical.axiom          DEBUG    Term: ntpp(z,y)
2023-04-01 18:41:18,324 macleod.logical.axiom          DEBUG    Term: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-01 18:41:18,325 macleod.logical.connective     DEBUG    Coalesced Called: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-01 18:41:18,326 macleod.logical.axiom          DEBUG    Coalesced Term: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-01 18:41:18,326 macleod.logical.connective     DEBUG    Rescope Called: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-01 18:41:18,327 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:41:18,328 macleod.logical.connective     DEBUG    Rescope Called: (((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))
2023-04-01 18:41:18,328 macleod.logical.connective     DEBUG    No Quantifier children: (((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))
2023-04-01 18:41:18,329 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]
2023-04-01 18:41:18,330 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\forall x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]]
2023-04-01 18:41:18,330 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\forall x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]]
2023-04-01 18:41:18,330 macleod.logical.quantifier     DEBUG    Found a matching quantifier
2023-04-01 18:41:18,331 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y,x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]
2023-04-01 18:41:18,333 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y,x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]
2023-04-01 18:41:18,334 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x\;[c(x,x)]
2023-04-01 18:41:18,334 macleod.logical.axiom          DEBUG    Function Free: \forall x\;[c(x,x)]
2023-04-01 18:41:18,334 macleod.logical.axiom          DEBUG    Unique Variables: \forall z\;[c(z,z)]
2023-04-01 18:41:18,335 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z\;[c(z,z)]
2023-04-01 18:41:18,335 macleod.logical.axiom          DEBUG    Term: c(z,z)
2023-04-01 18:41:18,335 macleod.logical.axiom          DEBUG    Term: \forall z\;[c(z,z)]
2023-04-01 18:41:18,336 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z\;[c(z,z)]
2023-04-01 18:41:18,336 macleod.logical.axiom          DEBUG    Prenex Form: \forall z\;[c(z,z)]
2023-04-01 18:41:18,336 macleod.logical.axiom          DEBUG    CNF Form: \forall z\;[c(z,z)]
2023-04-01 18:41:18,337 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(c(x,y) -> c(y,x))]
2023-04-01 18:41:18,338 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(c(x,y) -> c(y,x))]
2023-04-01 18:41:18,339 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:41:18,339 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:41:18,340 macleod.logical.axiom          DEBUG    Term: c(y,z)
2023-04-01 18:41:18,340 macleod.logical.axiom          DEBUG    Term: c(z,y)
2023-04-01 18:41:18,340 macleod.logical.axiom          DEBUG    Term: (c(z,y) -> c(y,z))
2023-04-01 18:41:18,341 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,y) -> c(y,z))
2023-04-01 18:41:18,341 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,y) -> c(y,z))
2023-04-01 18:41:18,341 macleod.logical.connective     DEBUG    Rescope Called: (c(z,y) -> c(y,z))
2023-04-01 18:41:18,342 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,y) -> c(y,z))
2023-04-01 18:41:18,342 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,y) -> c(y,z))
2023-04-01 18:41:18,342 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:41:18,343 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:41:18,343 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:41:18,345 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:41:18,346 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x\;[c(x,uni)]
2023-04-01 18:41:18,347 macleod.logical.axiom          DEBUG    Function Free: \forall x\;[c(x,uni)]
2023-04-01 18:41:18,347 macleod.logical.utils          INFO     Found a constant!
2023-04-01 18:41:18,347 macleod.logical.axiom          DEBUG    Unique Variables: \forall z\;[c(z,uni)]
2023-04-01 18:41:18,348 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z\;[c(z,uni)]
2023-04-01 18:41:18,348 macleod.logical.axiom          DEBUG    Term: c(z,uni)
2023-04-01 18:41:18,348 macleod.logical.axiom          DEBUG    Term: \forall z\;[c(z,uni)]
2023-04-01 18:41:18,349 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z\;[c(z,uni)]
2023-04-01 18:41:18,349 macleod.logical.axiom          DEBUG    Prenex Form: \forall z\;[c(z,uni)]
2023-04-01 18:41:18,350 macleod.logical.axiom          DEBUG    CNF Form: \forall z\;[c(z,uni)]
2023-04-01 18:41:18,351 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(~=(y,uni) -> (o(x,compl(y)) <-> ~p(x,y)))]
2023-04-01 18:41:25,401 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 18:41:25,402 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 18:41:25,402 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 18:41:25,403 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_basic.clif
2023-04-01 18:41:25,436 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(p(x,y) <-> \forall z\;[(c(z,x) -> c(z,y))])]
2023-04-01 18:41:25,437 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(p(x,y) <-> \forall z\;[(c(z,x) -> c(z,y))])]
2023-04-01 18:41:25,439 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])]
2023-04-01 18:41:25,440 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])]
2023-04-01 18:41:25,441 macleod.logical.axiom          DEBUG    Term: c(x,y)
2023-04-01 18:41:25,441 macleod.logical.axiom          DEBUG    Term: c(x,z)
2023-04-01 18:41:25,441 macleod.logical.axiom          DEBUG    Term: (c(x,z) -> c(x,y))
2023-04-01 18:41:25,442 macleod.logical.connective     DEBUG    Coalesced Called: (c(x,z) -> c(x,y))
2023-04-01 18:41:25,442 macleod.logical.axiom          DEBUG    Coalesced Term: (c(x,z) -> c(x,y))
2023-04-01 18:41:25,443 macleod.logical.connective     DEBUG    Rescope Called: (c(x,z) -> c(x,y))
2023-04-01 18:41:25,443 macleod.logical.connective     DEBUG    No Quantifier children: (c(x,z) -> c(x,y))
2023-04-01 18:41:25,444 macleod.logical.axiom          DEBUG    Rescoped Term: (c(x,z) -> c(x,y))
2023-04-01 18:41:25,444 macleod.logical.axiom          DEBUG    Term: \forall x\;[(c(x,z) -> c(x,y))]
2023-04-01 18:41:25,445 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 18:41:25,445 macleod.logical.axiom          DEBUG    Term: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-01 18:41:25,446 macleod.logical.connective     DEBUG    Coalesced Called: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-01 18:41:25,447 macleod.logical.axiom          DEBUG    Coalesced Term: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-01 18:41:25,447 macleod.logical.connective     DEBUG    Rescope Called: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-01 18:41:25,448 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:41:25,449 macleod.logical.connective     DEBUG    Rescope Called: ((c(x,z) -> c(x,y)) <-> p(z,y))
2023-04-01 18:41:25,449 macleod.logical.connective     DEBUG    No Quantifier children: ((c(x,z) -> c(x,y)) <-> p(z,y))
2023-04-01 18:41:25,450 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]
2023-04-01 18:41:25,450 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\forall x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]]
2023-04-01 18:41:25,450 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\forall x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]]
2023-04-01 18:41:25,451 macleod.logical.quantifier     DEBUG    Found a matching quantifier
2023-04-01 18:41:25,452 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y,x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]
2023-04-01 18:41:25,453 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y,x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]
2023-04-01 18:41:25,455 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(pp(x,y) <-> (p(x,y) & ~p(y,x)))]
2023-04-01 18:41:25,457 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(pp(x,y) <-> (p(x,y) & ~p(y,x)))]
2023-04-01 18:41:25,458 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:41:25,461 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:41:25,461 macleod.logical.axiom          DEBUG    Term: p(y,z)
2023-04-01 18:41:25,462 macleod.logical.axiom          DEBUG    Term: ~p(y,z)
2023-04-01 18:41:25,462 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 18:41:25,463 macleod.logical.axiom          DEBUG    Term: (p(z,y) & ~p(y,z))
2023-04-01 18:41:25,463 macleod.logical.connective     DEBUG    Coalesced Called: (p(z,y) & ~p(y,z))
2023-04-01 18:41:25,464 macleod.logical.axiom          DEBUG    Coalesced Term: (p(z,y) & ~p(y,z))
2023-04-01 18:41:25,465 macleod.logical.connective     DEBUG    Rescope Called: (p(z,y) & ~p(y,z))
2023-04-01 18:41:25,465 macleod.logical.connective     DEBUG    No Quantifier children: (p(z,y) & ~p(y,z))
2023-04-01 18:41:25,466 macleod.logical.axiom          DEBUG    Rescoped Term: (p(z,y) & ~p(y,z))
2023-04-01 18:41:25,466 macleod.logical.axiom          DEBUG    Term: pp(z,y)
2023-04-01 18:41:25,466 macleod.logical.axiom          DEBUG    Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:41:25,467 macleod.logical.connective     DEBUG    Coalesced Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:41:25,467 macleod.logical.axiom          DEBUG    Coalesced Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:41:25,468 macleod.logical.connective     DEBUG    Rescope Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:41:25,468 macleod.logical.connective     DEBUG    No Quantifier children: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:41:25,469 macleod.logical.axiom          DEBUG    Rescoped Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:41:25,469 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:41:25,470 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:41:25,471 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:41:25,472 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:41:25,473 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(o(x,y) <-> \exists z\;[(p(z,x) & p(z,y))])]
2023-04-01 18:41:25,474 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(o(x,y) <-> \exists z\;[(p(z,x) & p(z,y))])]
2023-04-01 18:41:25,476 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])]
2023-04-01 18:41:25,477 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])]
2023-04-01 18:41:25,478 macleod.logical.axiom          DEBUG    Term: p(x,y)
2023-04-01 18:41:25,478 macleod.logical.axiom          DEBUG    Term: p(x,z)
2023-04-01 18:41:25,479 macleod.logical.axiom          DEBUG    Term: (p(x,z) & p(x,y))
2023-04-01 18:41:25,479 macleod.logical.connective     DEBUG    Coalesced Called: (p(x,z) & p(x,y))
2023-04-01 18:41:25,480 macleod.logical.axiom          DEBUG    Coalesced Term: (p(x,z) & p(x,y))
2023-04-01 18:41:25,480 macleod.logical.connective     DEBUG    Rescope Called: (p(x,z) & p(x,y))
2023-04-01 18:41:25,480 macleod.logical.connective     DEBUG    No Quantifier children: (p(x,z) & p(x,y))
2023-04-01 18:41:25,481 macleod.logical.axiom          DEBUG    Rescoped Term: (p(x,z) & p(x,y))
2023-04-01 18:41:25,481 macleod.logical.axiom          DEBUG    Term: \exists x\;[(p(x,z) & p(x,y))]
2023-04-01 18:41:25,482 macleod.logical.axiom          DEBUG    Term: o(z,y)
2023-04-01 18:41:25,482 macleod.logical.axiom          DEBUG    Term: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-01 18:41:25,483 macleod.logical.connective     DEBUG    Coalesced Called: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-01 18:41:25,483 macleod.logical.axiom          DEBUG    Coalesced Term: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-01 18:41:25,484 macleod.logical.connective     DEBUG    Rescope Called: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-01 18:41:25,484 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:41:25,485 macleod.logical.connective     DEBUG    Rescope Called: ((p(x,z) & p(x,y)) <-> o(z,y))
2023-04-01 18:41:25,485 macleod.logical.connective     DEBUG    No Quantifier children: ((p(x,z) & p(x,y)) <-> o(z,y))
2023-04-01 18:41:25,486 macleod.logical.axiom          DEBUG    Rescoped Term: \exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]
2023-04-01 18:41:25,487 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-01 18:41:25,540 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-01 18:41:25,542 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-01 18:41:25,546 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-01 18:41:25,548 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(ec(x,y) <-> (c(x,y) & ~o(x,y)))]
2023-04-01 18:41:25,549 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(ec(x,y) <-> (c(x,y) & ~o(x,y)))]
2023-04-01 18:41:25,550 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:41:25,552 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:41:25,552 macleod.logical.axiom          DEBUG    Term: o(z,y)
2023-04-01 18:41:25,553 macleod.logical.axiom          DEBUG    Term: ~o(z,y)
2023-04-01 18:41:25,553 macleod.logical.axiom          DEBUG    Term: c(z,y)
2023-04-01 18:41:25,554 macleod.logical.axiom          DEBUG    Term: (c(z,y) & ~o(z,y))
2023-04-01 18:41:25,554 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,y) & ~o(z,y))
2023-04-01 18:41:25,554 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,y) & ~o(z,y))
2023-04-01 18:41:25,555 macleod.logical.connective     DEBUG    Rescope Called: (c(z,y) & ~o(z,y))
2023-04-01 18:41:25,555 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,y) & ~o(z,y))
2023-04-01 18:41:25,556 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,y) & ~o(z,y))
2023-04-01 18:41:25,556 macleod.logical.axiom          DEBUG    Term: ec(z,y)
2023-04-01 18:41:25,556 macleod.logical.axiom          DEBUG    Term: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:41:25,557 macleod.logical.connective     DEBUG    Coalesced Called: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:41:25,557 macleod.logical.axiom          DEBUG    Coalesced Term: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:41:25,558 macleod.logical.connective     DEBUG    Rescope Called: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:41:25,558 macleod.logical.connective     DEBUG    No Quantifier children: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:41:25,559 macleod.logical.axiom          DEBUG    Rescoped Term: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:41:25,559 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:41:25,560 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:41:25,560 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:41:25,563 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:41:25,566 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(ntpp(x,y) <-> (pp(x,y) & ~\exists z\;[(ec(z,x) & ec(z,y))]))]
2023-04-01 18:41:25,569 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(ntpp(x,y) <-> (pp(x,y) & ~\exists z\;[(ec(z,x) & ec(z,y))]))]
2023-04-01 18:41:25,572 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(ntpp(z,y) <-> (pp(z,y) & ~\exists x\;[(ec(x,z) & ec(x,y))]))]
2023-04-01 18:41:25,577 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(ntpp(z,y) <-> (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))]))]
2023-04-01 18:41:25,578 macleod.logical.axiom          DEBUG    Term: ec(x,y)
2023-04-01 18:41:25,578 macleod.logical.axiom          DEBUG    Term: ec(x,z)
2023-04-01 18:41:25,578 macleod.logical.axiom          DEBUG    Term: ~ec(x,y)
2023-04-01 18:41:25,578 macleod.logical.axiom          DEBUG    Term: ~ec(x,z)
2023-04-01 18:41:25,579 macleod.logical.axiom          DEBUG    Term: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:41:25,579 macleod.logical.connective     DEBUG    Coalesced Called: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:41:25,580 macleod.logical.axiom          DEBUG    Coalesced Term: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:41:25,580 macleod.logical.connective     DEBUG    Rescope Called: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:41:25,581 macleod.logical.connective     DEBUG    No Quantifier children: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:41:25,581 macleod.logical.axiom          DEBUG    Rescoped Term: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:41:25,582 macleod.logical.axiom          DEBUG    Term: \forall x\;[(~ec(x,z) | ~ec(x,y))]
2023-04-01 18:41:25,582 macleod.logical.axiom          DEBUG    Term: pp(z,y)
2023-04-01 18:41:25,583 macleod.logical.axiom          DEBUG    Term: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-01 18:41:25,583 macleod.logical.connective     DEBUG    Coalesced Called: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-01 18:41:25,584 macleod.logical.axiom          DEBUG    Coalesced Term: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-01 18:41:25,584 macleod.logical.connective     DEBUG    Rescope Called: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-01 18:41:25,584 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:41:25,585 macleod.logical.connective     DEBUG    Rescope Called: ((~ec(x,z) | ~ec(x,y)) & pp(z,y))
2023-04-01 18:41:25,586 macleod.logical.connective     DEBUG    No Quantifier children: ((~ec(x,z) | ~ec(x,y)) & pp(z,y))
2023-04-01 18:41:25,587 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))]
2023-04-01 18:41:25,587 macleod.logical.axiom          DEBUG    Term: ntpp(z,y)
2023-04-01 18:41:25,588 macleod.logical.axiom          DEBUG    Term: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-01 18:41:25,589 macleod.logical.connective     DEBUG    Coalesced Called: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-01 18:41:25,589 macleod.logical.axiom          DEBUG    Coalesced Term: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-01 18:41:25,589 macleod.logical.connective     DEBUG    Rescope Called: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-01 18:41:25,589 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:41:25,592 macleod.logical.connective     DEBUG    Rescope Called: (((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))
2023-04-01 18:41:25,592 macleod.logical.connective     DEBUG    No Quantifier children: (((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))
2023-04-01 18:41:25,593 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]
2023-04-01 18:41:25,593 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\forall x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]]
2023-04-01 18:41:25,594 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\forall x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]]
2023-04-01 18:41:25,595 macleod.logical.quantifier     DEBUG    Found a matching quantifier
2023-04-01 18:41:25,596 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y,x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]
2023-04-01 18:41:25,598 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y,x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]
2023-04-01 18:41:25,599 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x\;[c(x,x)]
2023-04-01 18:41:25,600 macleod.logical.axiom          DEBUG    Function Free: \forall x\;[c(x,x)]
2023-04-01 18:41:25,601 macleod.logical.axiom          DEBUG    Unique Variables: \forall z\;[c(z,z)]
2023-04-01 18:41:25,601 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z\;[c(z,z)]
2023-04-01 18:41:25,602 macleod.logical.axiom          DEBUG    Term: c(z,z)
2023-04-01 18:41:25,602 macleod.logical.axiom          DEBUG    Term: \forall z\;[c(z,z)]
2023-04-01 18:41:25,602 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z\;[c(z,z)]
2023-04-01 18:41:25,603 macleod.logical.axiom          DEBUG    Prenex Form: \forall z\;[c(z,z)]
2023-04-01 18:41:25,603 macleod.logical.axiom          DEBUG    CNF Form: \forall z\;[c(z,z)]
2023-04-01 18:41:25,604 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(c(x,y) -> c(y,x))]
2023-04-01 18:41:25,605 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(c(x,y) -> c(y,x))]
2023-04-01 18:41:25,605 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:41:25,606 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:41:25,607 macleod.logical.axiom          DEBUG    Term: c(y,z)
2023-04-01 18:41:25,607 macleod.logical.axiom          DEBUG    Term: c(z,y)
2023-04-01 18:41:25,607 macleod.logical.axiom          DEBUG    Term: (c(z,y) -> c(y,z))
2023-04-01 18:41:25,607 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,y) -> c(y,z))
2023-04-01 18:41:25,608 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,y) -> c(y,z))
2023-04-01 18:41:25,608 macleod.logical.connective     DEBUG    Rescope Called: (c(z,y) -> c(y,z))
2023-04-01 18:41:25,608 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,y) -> c(y,z))
2023-04-01 18:41:25,609 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,y) -> c(y,z))
2023-04-01 18:41:25,609 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:41:25,609 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:41:25,610 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:41:25,610 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:41:25,611 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x\;[c(x,uni)]
2023-04-01 18:41:25,612 macleod.logical.axiom          DEBUG    Function Free: \forall x\;[c(x,uni)]
2023-04-01 18:41:25,613 macleod.logical.utils          INFO     Found a constant!
2023-04-01 18:41:25,614 macleod.logical.axiom          DEBUG    Unique Variables: \forall z\;[c(z,uni)]
2023-04-01 18:41:25,614 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z\;[c(z,uni)]
2023-04-01 18:41:25,614 macleod.logical.axiom          DEBUG    Term: c(z,uni)
2023-04-01 18:41:25,615 macleod.logical.axiom          DEBUG    Term: \forall z\;[c(z,uni)]
2023-04-01 18:41:25,615 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z\;[c(z,uni)]
2023-04-01 18:41:25,615 macleod.logical.axiom          DEBUG    Prenex Form: \forall z\;[c(z,uni)]
2023-04-01 18:41:25,616 macleod.logical.axiom          DEBUG    CNF Form: \forall z\;[c(z,uni)]
2023-04-01 18:41:25,617 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(~=(y,uni) -> (o(x,compl(y)) <-> ~p(x,y)))]
2023-04-01 18:41:25,619 macleod.logical.axiom          DEBUG    Adding function declaration on: compl
2023-04-01 18:41:25,620 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(~=(y,uni) -> (\forall c2\;[(o(x,c2) | ~compl(y,c2))] <-> ~p(x,y)))]
2023-04-01 18:41:25,620 macleod.logical.utils          INFO     Found a constant!
2023-04-01 18:41:25,622 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(~=(y,uni) -> (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y)))]
2023-04-01 18:41:25,623 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(~=(y,uni) -> (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y)))]
2023-04-01 18:41:25,624 macleod.logical.axiom          DEBUG    Term: compl(y,x)
2023-04-01 18:41:25,624 macleod.logical.axiom          DEBUG    Term: ~compl(y,x)
2023-04-01 18:41:25,624 macleod.logical.axiom          DEBUG    Term: o(z,x)
2023-04-01 18:41:25,625 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 18:41:25,625 macleod.logical.axiom          DEBUG    Term: (o(z,x) | ~compl(y,x))
2023-04-01 18:41:25,625 macleod.logical.connective     DEBUG    Coalesced Called: (o(z,x) | ~compl(y,x))
2023-04-01 18:41:25,625 macleod.logical.axiom          DEBUG    Coalesced Term: (o(z,x) | ~compl(y,x))
2023-04-01 18:41:25,626 macleod.logical.connective     DEBUG    Rescope Called: (o(z,x) | ~compl(y,x))
2023-04-01 18:41:25,626 macleod.logical.connective     DEBUG    No Quantifier children: (o(z,x) | ~compl(y,x))
2023-04-01 18:41:25,626 macleod.logical.axiom          DEBUG    Rescoped Term: (o(z,x) | ~compl(y,x))
2023-04-01 18:41:25,627 macleod.logical.axiom          DEBUG    Term: ~p(z,y)
2023-04-01 18:41:25,627 macleod.logical.axiom          DEBUG    Term: \forall x\;[(o(z,x) | ~compl(y,x))]
2023-04-01 18:41:25,628 macleod.logical.axiom          DEBUG    Term: =(y,uni)
2023-04-01 18:41:25,628 macleod.logical.axiom          DEBUG    Term: (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y))
2023-04-01 18:41:25,629 macleod.logical.connective     DEBUG    Coalesced Called: (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y))
2023-04-01 18:41:25,630 macleod.logical.axiom          DEBUG    Coalesced Term: (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y))
2023-04-01 18:41:25,630 macleod.logical.connective     DEBUG    Rescope Called: (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y))
2023-04-01 18:41:25,630 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:41:25,631 macleod.logical.connective     DEBUG    Rescope Called: ((o(z,x) | ~compl(y,x)) <-> ~p(z,y))
2023-04-01 18:41:25,632 macleod.logical.connective     DEBUG    No Quantifier children: ((o(z,x) | ~compl(y,x)) <-> ~p(z,y))
2023-04-01 18:41:25,632 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))]
2023-04-01 18:41:25,633 macleod.logical.axiom          DEBUG    Term: ~=(y,uni)
2023-04-01 18:41:25,633 macleod.logical.axiom          DEBUG    Term: (~=(y,uni) -> \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))])
2023-04-01 18:41:25,634 macleod.logical.connective     DEBUG    Coalesced Called: (~=(y,uni) -> \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))])
2023-04-01 18:41:25,634 macleod.logical.axiom          DEBUG    Coalesced Term: (~=(y,uni) -> \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))])
2023-04-01 18:41:25,634 macleod.logical.connective     DEBUG    Rescope Called: (~=(y,uni) -> \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))])
2023-04-01 18:41:25,634 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:41:25,635 macleod.logical.connective     DEBUG    Rescope Called: (((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))
2023-04-01 18:41:25,635 macleod.logical.connective     DEBUG    No Quantifier children: (((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))
2023-04-01 18:41:25,636 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]
2023-04-01 18:41:25,636 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\forall x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]]
2023-04-01 18:41:25,637 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\forall x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]]
2023-04-01 18:41:25,637 macleod.logical.quantifier     DEBUG    Found a matching quantifier
2023-04-01 18:41:25,638 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y,x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]
2023-04-01 18:41:25,639 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y,x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]
2023-04-01 18:41:25,640 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y,z\;[(c(x,sum(y,z)) <-> (c(x,y) | c(x,z)))]
2023-04-01 18:41:25,642 macleod.logical.axiom          DEBUG    Function Free: \forall x,y,z\;[(\forall s3\;[(c(x,s3) | ~sum(y,z,s3))] <-> (c(x,y) | c(x,z)))]
2023-04-01 18:41:25,643 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y,x\;[(\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))]
2023-04-01 18:41:25,646 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y,x\;[(\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))]
2023-04-01 18:41:25,647 macleod.logical.axiom          DEBUG    Term: sum(y,x,w)
2023-04-01 18:41:25,647 macleod.logical.axiom          DEBUG    Term: ~sum(y,x,w)
2023-04-01 18:41:25,648 macleod.logical.axiom          DEBUG    Term: c(z,w)
2023-04-01 18:41:25,648 macleod.logical.axiom          DEBUG    Term: c(z,x)
2023-04-01 18:41:25,648 macleod.logical.axiom          DEBUG    Term: c(z,y)
2023-04-01 18:41:25,648 macleod.logical.axiom          DEBUG    Term: (c(z,w) | ~sum(y,x,w))
2023-04-01 18:41:25,649 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,w) | ~sum(y,x,w))
2023-04-01 18:41:25,649 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,w) | ~sum(y,x,w))
2023-04-01 18:41:25,650 macleod.logical.connective     DEBUG    Rescope Called: (c(z,w) | ~sum(y,x,w))
2023-04-01 18:41:25,650 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,w) | ~sum(y,x,w))
2023-04-01 18:41:25,650 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,w) | ~sum(y,x,w))
2023-04-01 18:41:25,651 macleod.logical.axiom          DEBUG    Term: (c(z,y) | c(z,x))
2023-04-01 18:41:25,651 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,y) | c(z,x))
2023-04-01 18:41:25,651 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,y) | c(z,x))
2023-04-01 18:41:25,652 macleod.logical.connective     DEBUG    Rescope Called: (c(z,y) | c(z,x))
2023-04-01 18:41:25,652 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,y) | c(z,x))
2023-04-01 18:41:25,652 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,y) | c(z,x))
2023-04-01 18:41:25,653 macleod.logical.axiom          DEBUG    Term: \forall w\;[(c(z,w) | ~sum(y,x,w))]
2023-04-01 18:41:25,653 macleod.logical.axiom          DEBUG    Term: (\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))
2023-04-01 18:41:25,654 macleod.logical.connective     DEBUG    Coalesced Called: (\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))
2023-04-01 18:41:25,654 macleod.logical.axiom          DEBUG    Coalesced Term: (\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))
2023-04-01 18:41:25,654 macleod.logical.connective     DEBUG    Rescope Called: (\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))
2023-04-01 18:41:25,654 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:41:25,655 macleod.logical.connective     DEBUG    Rescope Called: ((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))
2023-04-01 18:41:25,655 macleod.logical.connective     DEBUG    No Quantifier children: ((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))
2023-04-01 18:41:25,656 macleod.logical.axiom          DEBUG    Rescoped Term: \forall w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]
2023-04-01 18:41:25,656 macleod.logical.axiom          DEBUG    Term: \forall z,y,x\;[\forall w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]]
2023-04-01 18:41:25,656 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y,x\;[\forall w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]]
2023-04-01 18:41:25,657 macleod.logical.quantifier     DEBUG    Found a matching quantifier
2023-04-01 18:41:25,657 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y,x,w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]
2023-04-01 18:41:25,658 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y,x,w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]
2023-04-01 18:41:25,659 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y,z\;[(o(y,z) -> (c(x,prod(y,z)) <-> \exists w\;[(p(w,y) & p(w,z) & c(x,w))]))]
2023-04-01 18:41:25,662 macleod.logical.axiom          DEBUG    Function Free: \forall x,y,z\;[(o(y,z) -> (\forall p4\;[(c(x,p4) | ~prod(y,z,p4))] <-> \exists w\;[(p(w,y) & p(w,z) & c(x,w))]))]
2023-04-01 18:41:25,665 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y,x\;[(o(y,x) -> (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))]))]
2023-04-01 18:41:25,668 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y,x\;[(o(y,x) -> (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))]))]
2023-04-01 18:41:25,669 macleod.logical.axiom          DEBUG    Term: prod(y,x,w)
2023-04-01 18:41:25,669 macleod.logical.axiom          DEBUG    Term: c(z,v)
2023-04-01 18:41:25,669 macleod.logical.axiom          DEBUG    Term: p(v,x)
2023-04-01 18:41:25,669 macleod.logical.axiom          DEBUG    Term: p(v,y)
2023-04-01 18:41:25,670 macleod.logical.axiom          DEBUG    Term: ~prod(y,x,w)
2023-04-01 18:41:25,670 macleod.logical.axiom          DEBUG    Term: c(z,w)
2023-04-01 18:41:25,670 macleod.logical.axiom          DEBUG    Term: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 18:41:25,671 macleod.logical.connective     DEBUG    Coalesced Called: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 18:41:25,671 macleod.logical.axiom          DEBUG    Coalesced Term: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 18:41:25,671 macleod.logical.connective     DEBUG    Rescope Called: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 18:41:25,672 macleod.logical.connective     DEBUG    No Quantifier children: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 18:41:25,672 macleod.logical.axiom          DEBUG    Rescoped Term: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 18:41:25,672 macleod.logical.axiom          DEBUG    Term: (c(z,w) | ~prod(y,x,w))
2023-04-01 18:41:25,673 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,w) | ~prod(y,x,w))
2023-04-01 18:41:25,673 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,w) | ~prod(y,x,w))
2023-04-01 18:41:25,673 macleod.logical.connective     DEBUG    Rescope Called: (c(z,w) | ~prod(y,x,w))
2023-04-01 18:41:25,674 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,w) | ~prod(y,x,w))
2023-04-01 18:41:25,674 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,w) | ~prod(y,x,w))
2023-04-01 18:41:25,674 macleod.logical.axiom          DEBUG    Term: \exists v\;[(p(v,y) & p(v,x) & c(z,v))]
2023-04-01 18:41:25,675 macleod.logical.axiom          DEBUG    Term: \forall w\;[(c(z,w) | ~prod(y,x,w))]
2023-04-01 18:41:25,675 macleod.logical.axiom          DEBUG    Term: (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))])
2023-04-01 18:41:25,676 macleod.logical.connective     DEBUG    Coalesced Called: (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))])
2023-04-01 18:41:25,676 macleod.logical.axiom          DEBUG    Coalesced Term: (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))])
2023-04-01 18:41:25,676 macleod.logical.connective     DEBUG    Rescope Called: (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))])
2023-04-01 18:44:19,852 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 18:44:19,853 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 18:44:19,854 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 18:44:19,855 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_basic.clif
2023-04-01 18:44:19,873 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(p(x,y) <-> \forall z\;[(c(z,x) -> c(z,y))])]
2023-04-01 18:44:19,875 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(p(x,y) <-> \forall z\;[(c(z,x) -> c(z,y))])]
2023-04-01 18:44:19,876 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])]
2023-04-01 18:44:19,878 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])]
2023-04-01 18:44:19,879 macleod.logical.axiom          DEBUG    Term: c(x,y)
2023-04-01 18:44:19,880 macleod.logical.axiom          DEBUG    Term: c(x,z)
2023-04-01 18:44:19,880 macleod.logical.axiom          DEBUG    Term: (c(x,z) -> c(x,y))
2023-04-01 18:44:19,881 macleod.logical.connective     DEBUG    Coalesced Called: (c(x,z) -> c(x,y))
2023-04-01 18:44:19,881 macleod.logical.axiom          DEBUG    Coalesced Term: (c(x,z) -> c(x,y))
2023-04-01 18:44:19,882 macleod.logical.connective     DEBUG    Rescope Called: (c(x,z) -> c(x,y))
2023-04-01 18:44:19,882 macleod.logical.connective     DEBUG    No Quantifier children: (c(x,z) -> c(x,y))
2023-04-01 18:44:19,883 macleod.logical.axiom          DEBUG    Rescoped Term: (c(x,z) -> c(x,y))
2023-04-01 18:44:19,883 macleod.logical.axiom          DEBUG    Term: \forall x\;[(c(x,z) -> c(x,y))]
2023-04-01 18:44:19,884 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 18:44:19,884 macleod.logical.axiom          DEBUG    Term: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-01 18:44:19,885 macleod.logical.connective     DEBUG    Coalesced Called: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-01 18:44:19,886 macleod.logical.axiom          DEBUG    Coalesced Term: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-01 18:44:19,886 macleod.logical.connective     DEBUG    Rescope Called: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-01 18:44:19,887 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:44:19,888 macleod.logical.connective     DEBUG    Rescope Called: ((c(x,z) -> c(x,y)) <-> p(z,y))
2023-04-01 18:44:19,888 macleod.logical.connective     DEBUG    No Quantifier children: ((c(x,z) -> c(x,y)) <-> p(z,y))
2023-04-01 18:44:19,889 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]
2023-04-01 18:44:19,890 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\forall x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]]
2023-04-01 18:44:19,890 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\forall x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]]
2023-04-01 18:44:19,891 macleod.logical.quantifier     DEBUG    Found a matching quantifier
2023-04-01 18:44:19,892 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y,x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]
2023-04-01 18:44:19,894 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y,x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]
2023-04-01 18:44:19,896 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(pp(x,y) <-> (p(x,y) & ~p(y,x)))]
2023-04-01 18:44:19,897 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(pp(x,y) <-> (p(x,y) & ~p(y,x)))]
2023-04-01 18:44:19,899 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:44:19,901 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:44:19,902 macleod.logical.axiom          DEBUG    Term: p(y,z)
2023-04-01 18:44:19,902 macleod.logical.axiom          DEBUG    Term: ~p(y,z)
2023-04-01 18:44:19,903 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 18:44:19,903 macleod.logical.axiom          DEBUG    Term: (p(z,y) & ~p(y,z))
2023-04-01 18:44:19,904 macleod.logical.connective     DEBUG    Coalesced Called: (p(z,y) & ~p(y,z))
2023-04-01 18:44:19,904 macleod.logical.axiom          DEBUG    Coalesced Term: (p(z,y) & ~p(y,z))
2023-04-01 18:44:19,905 macleod.logical.connective     DEBUG    Rescope Called: (p(z,y) & ~p(y,z))
2023-04-01 18:44:19,905 macleod.logical.connective     DEBUG    No Quantifier children: (p(z,y) & ~p(y,z))
2023-04-01 18:44:19,906 macleod.logical.axiom          DEBUG    Rescoped Term: (p(z,y) & ~p(y,z))
2023-04-01 18:44:19,907 macleod.logical.axiom          DEBUG    Term: pp(z,y)
2023-04-01 18:44:19,907 macleod.logical.axiom          DEBUG    Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:44:19,908 macleod.logical.connective     DEBUG    Coalesced Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:44:19,908 macleod.logical.axiom          DEBUG    Coalesced Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:44:19,909 macleod.logical.connective     DEBUG    Rescope Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:44:19,910 macleod.logical.connective     DEBUG    No Quantifier children: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:44:19,910 macleod.logical.axiom          DEBUG    Rescoped Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:44:19,911 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:44:19,911 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:44:19,912 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:44:19,914 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:44:19,916 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(o(x,y) <-> \exists z\;[(p(z,x) & p(z,y))])]
2023-04-01 18:44:19,917 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(o(x,y) <-> \exists z\;[(p(z,x) & p(z,y))])]
2023-04-01 18:44:19,919 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])]
2023-04-01 18:44:19,921 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])]
2023-04-01 18:44:19,921 macleod.logical.axiom          DEBUG    Term: p(x,y)
2023-04-01 18:44:19,922 macleod.logical.axiom          DEBUG    Term: p(x,z)
2023-04-01 18:44:19,922 macleod.logical.axiom          DEBUG    Term: (p(x,z) & p(x,y))
2023-04-01 18:44:19,922 macleod.logical.connective     DEBUG    Coalesced Called: (p(x,z) & p(x,y))
2023-04-01 18:44:19,922 macleod.logical.axiom          DEBUG    Coalesced Term: (p(x,z) & p(x,y))
2023-04-01 18:44:19,922 macleod.logical.connective     DEBUG    Rescope Called: (p(x,z) & p(x,y))
2023-04-01 18:44:19,923 macleod.logical.connective     DEBUG    No Quantifier children: (p(x,z) & p(x,y))
2023-04-01 18:44:19,923 macleod.logical.axiom          DEBUG    Rescoped Term: (p(x,z) & p(x,y))
2023-04-01 18:44:19,924 macleod.logical.axiom          DEBUG    Term: \exists x\;[(p(x,z) & p(x,y))]
2023-04-01 18:44:19,924 macleod.logical.axiom          DEBUG    Term: o(z,y)
2023-04-01 18:44:19,925 macleod.logical.axiom          DEBUG    Term: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-01 18:44:19,926 macleod.logical.connective     DEBUG    Coalesced Called: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-01 18:44:19,926 macleod.logical.axiom          DEBUG    Coalesced Term: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-01 18:44:19,927 macleod.logical.connective     DEBUG    Rescope Called: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-01 18:44:19,927 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:44:19,928 macleod.logical.connective     DEBUG    Rescope Called: ((p(x,z) & p(x,y)) <-> o(z,y))
2023-04-01 18:44:19,929 macleod.logical.connective     DEBUG    No Quantifier children: ((p(x,z) & p(x,y)) <-> o(z,y))
2023-04-01 18:44:19,930 macleod.logical.axiom          DEBUG    Rescoped Term: \exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]
2023-04-01 18:44:19,931 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-01 18:44:19,931 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-01 18:44:19,932 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-01 18:44:19,935 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-01 18:44:19,937 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(ec(x,y) <-> (c(x,y) & ~o(x,y)))]
2023-04-01 18:44:19,939 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(ec(x,y) <-> (c(x,y) & ~o(x,y)))]
2023-04-01 18:44:19,940 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:44:19,943 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:44:19,943 macleod.logical.axiom          DEBUG    Term: o(z,y)
2023-04-01 18:44:19,943 macleod.logical.axiom          DEBUG    Term: ~o(z,y)
2023-04-01 18:44:19,943 macleod.logical.axiom          DEBUG    Term: c(z,y)
2023-04-01 18:44:19,944 macleod.logical.axiom          DEBUG    Term: (c(z,y) & ~o(z,y))
2023-04-01 18:44:19,945 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,y) & ~o(z,y))
2023-04-01 18:44:19,945 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,y) & ~o(z,y))
2023-04-01 18:44:19,946 macleod.logical.connective     DEBUG    Rescope Called: (c(z,y) & ~o(z,y))
2023-04-01 18:44:19,947 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,y) & ~o(z,y))
2023-04-01 18:44:19,947 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,y) & ~o(z,y))
2023-04-01 18:44:19,948 macleod.logical.axiom          DEBUG    Term: ec(z,y)
2023-04-01 18:44:19,948 macleod.logical.axiom          DEBUG    Term: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:44:19,949 macleod.logical.connective     DEBUG    Coalesced Called: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:44:19,950 macleod.logical.axiom          DEBUG    Coalesced Term: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:44:19,950 macleod.logical.connective     DEBUG    Rescope Called: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:44:19,951 macleod.logical.connective     DEBUG    No Quantifier children: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:44:19,952 macleod.logical.axiom          DEBUG    Rescoped Term: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:44:19,953 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:44:19,953 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:44:19,954 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:44:19,956 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:44:19,958 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(ntpp(x,y) <-> (pp(x,y) & ~\exists z\;[(ec(z,x) & ec(z,y))]))]
2023-04-01 18:44:19,960 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(ntpp(x,y) <-> (pp(x,y) & ~\exists z\;[(ec(z,x) & ec(z,y))]))]
2023-04-01 18:44:19,962 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(ntpp(z,y) <-> (pp(z,y) & ~\exists x\;[(ec(x,z) & ec(x,y))]))]
2023-04-01 18:44:19,968 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(ntpp(z,y) <-> (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))]))]
2023-04-01 18:44:19,968 macleod.logical.axiom          DEBUG    Term: ec(x,y)
2023-04-01 18:44:19,968 macleod.logical.axiom          DEBUG    Term: ec(x,z)
2023-04-01 18:44:19,969 macleod.logical.axiom          DEBUG    Term: ~ec(x,y)
2023-04-01 18:44:19,969 macleod.logical.axiom          DEBUG    Term: ~ec(x,z)
2023-04-01 18:44:19,970 macleod.logical.axiom          DEBUG    Term: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:44:19,970 macleod.logical.connective     DEBUG    Coalesced Called: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:44:19,972 macleod.logical.axiom          DEBUG    Coalesced Term: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:44:19,973 macleod.logical.connective     DEBUG    Rescope Called: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:44:19,974 macleod.logical.connective     DEBUG    No Quantifier children: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:44:19,974 macleod.logical.axiom          DEBUG    Rescoped Term: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:44:19,975 macleod.logical.axiom          DEBUG    Term: \forall x\;[(~ec(x,z) | ~ec(x,y))]
2023-04-01 18:44:19,975 macleod.logical.axiom          DEBUG    Term: pp(z,y)
2023-04-01 18:44:19,976 macleod.logical.axiom          DEBUG    Term: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-01 18:44:19,976 macleod.logical.connective     DEBUG    Coalesced Called: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-01 18:44:19,977 macleod.logical.axiom          DEBUG    Coalesced Term: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-01 18:44:19,978 macleod.logical.connective     DEBUG    Rescope Called: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-01 18:44:19,978 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:44:19,979 macleod.logical.connective     DEBUG    Rescope Called: ((~ec(x,z) | ~ec(x,y)) & pp(z,y))
2023-04-01 18:44:19,980 macleod.logical.connective     DEBUG    No Quantifier children: ((~ec(x,z) | ~ec(x,y)) & pp(z,y))
2023-04-01 18:44:19,981 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))]
2023-04-01 18:44:19,982 macleod.logical.axiom          DEBUG    Term: ntpp(z,y)
2023-04-01 18:44:19,982 macleod.logical.axiom          DEBUG    Term: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-01 18:44:19,983 macleod.logical.connective     DEBUG    Coalesced Called: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-01 18:44:19,984 macleod.logical.axiom          DEBUG    Coalesced Term: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-01 18:44:19,984 macleod.logical.connective     DEBUG    Rescope Called: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-01 18:44:19,985 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:44:19,986 macleod.logical.connective     DEBUG    Rescope Called: (((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))
2023-04-01 18:44:19,987 macleod.logical.connective     DEBUG    No Quantifier children: (((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))
2023-04-01 18:44:19,988 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]
2023-04-01 18:44:19,988 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\forall x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]]
2023-04-01 18:44:19,989 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\forall x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]]
2023-04-01 18:44:19,990 macleod.logical.quantifier     DEBUG    Found a matching quantifier
2023-04-01 18:44:19,991 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y,x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]
2023-04-01 18:44:19,993 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y,x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]
2023-04-01 18:44:19,994 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x\;[c(x,x)]
2023-04-01 18:44:19,995 macleod.logical.axiom          DEBUG    Function Free: \forall x\;[c(x,x)]
2023-04-01 18:44:19,996 macleod.logical.axiom          DEBUG    Unique Variables: \forall z\;[c(z,z)]
2023-04-01 18:44:19,996 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z\;[c(z,z)]
2023-04-01 18:44:19,997 macleod.logical.axiom          DEBUG    Term: c(z,z)
2023-04-01 18:44:19,997 macleod.logical.axiom          DEBUG    Term: \forall z\;[c(z,z)]
2023-04-01 18:44:19,998 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z\;[c(z,z)]
2023-04-01 18:44:19,998 macleod.logical.axiom          DEBUG    Prenex Form: \forall z\;[c(z,z)]
2023-04-01 18:44:19,999 macleod.logical.axiom          DEBUG    CNF Form: \forall z\;[c(z,z)]
2023-04-01 18:44:20,001 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(c(x,y) -> c(y,x))]
2023-04-01 18:44:20,002 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(c(x,y) -> c(y,x))]
2023-04-01 18:44:20,002 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:44:20,003 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:44:20,004 macleod.logical.axiom          DEBUG    Term: c(y,z)
2023-04-01 18:44:20,004 macleod.logical.axiom          DEBUG    Term: c(z,y)
2023-04-01 18:44:20,005 macleod.logical.axiom          DEBUG    Term: (c(z,y) -> c(y,z))
2023-04-01 18:44:20,005 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,y) -> c(y,z))
2023-04-01 18:44:20,006 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,y) -> c(y,z))
2023-04-01 18:44:20,006 macleod.logical.connective     DEBUG    Rescope Called: (c(z,y) -> c(y,z))
2023-04-01 18:44:20,007 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,y) -> c(y,z))
2023-04-01 18:44:20,007 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,y) -> c(y,z))
2023-04-01 18:44:20,008 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:44:20,008 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:44:20,009 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:44:20,010 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:44:20,011 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x\;[c(x,uni)]
2023-04-01 18:44:20,012 macleod.logical.axiom          DEBUG    Function Free: \forall x\;[c(x,uni)]
2023-04-01 18:44:20,013 macleod.logical.utils          INFO     Found a constant!
2023-04-01 18:44:20,013 macleod.logical.axiom          DEBUG    Unique Variables: \forall z\;[c(z,uni)]
2023-04-01 18:44:20,014 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z\;[c(z,uni)]
2023-04-01 18:44:20,015 macleod.logical.axiom          DEBUG    Term: c(z,uni)
2023-04-01 18:44:20,015 macleod.logical.axiom          DEBUG    Term: \forall z\;[c(z,uni)]
2023-04-01 18:44:20,016 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z\;[c(z,uni)]
2023-04-01 18:44:20,017 macleod.logical.axiom          DEBUG    Prenex Form: \forall z\;[c(z,uni)]
2023-04-01 18:44:20,017 macleod.logical.axiom          DEBUG    CNF Form: \forall z\;[c(z,uni)]
2023-04-01 18:44:20,020 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(~=(y,uni) -> (o(x,compl(y)) <-> ~p(x,y)))]
2023-04-01 18:44:20,022 macleod.logical.axiom          DEBUG    Adding function declaration on: compl
2023-04-01 18:44:20,023 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(~=(y,uni) -> (\forall c2\;[(o(x,c2) | ~compl(y,c2))] <-> ~p(x,y)))]
2023-04-01 18:44:20,025 macleod.logical.utils          INFO     Found a constant!
2023-04-01 18:44:20,026 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(~=(y,uni) -> (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y)))]
2023-04-01 18:44:20,029 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(~=(y,uni) -> (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y)))]
2023-04-01 18:44:20,030 macleod.logical.axiom          DEBUG    Term: compl(y,x)
2023-04-01 18:44:20,031 macleod.logical.axiom          DEBUG    Term: ~compl(y,x)
2023-04-01 18:44:20,031 macleod.logical.axiom          DEBUG    Term: o(z,x)
2023-04-01 18:44:20,032 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 18:44:20,032 macleod.logical.axiom          DEBUG    Term: (o(z,x) | ~compl(y,x))
2023-04-01 18:44:20,033 macleod.logical.connective     DEBUG    Coalesced Called: (o(z,x) | ~compl(y,x))
2023-04-01 18:44:20,034 macleod.logical.axiom          DEBUG    Coalesced Term: (o(z,x) | ~compl(y,x))
2023-04-01 18:44:20,034 macleod.logical.connective     DEBUG    Rescope Called: (o(z,x) | ~compl(y,x))
2023-04-01 18:44:20,035 macleod.logical.connective     DEBUG    No Quantifier children: (o(z,x) | ~compl(y,x))
2023-04-01 18:44:20,035 macleod.logical.axiom          DEBUG    Rescoped Term: (o(z,x) | ~compl(y,x))
2023-04-01 18:44:20,036 macleod.logical.axiom          DEBUG    Term: ~p(z,y)
2023-04-01 18:44:20,037 macleod.logical.axiom          DEBUG    Term: \forall x\;[(o(z,x) | ~compl(y,x))]
2023-04-01 18:44:20,037 macleod.logical.axiom          DEBUG    Term: =(y,uni)
2023-04-01 18:44:20,038 macleod.logical.axiom          DEBUG    Term: (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y))
2023-04-01 18:44:20,039 macleod.logical.connective     DEBUG    Coalesced Called: (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y))
2023-04-01 18:44:20,039 macleod.logical.axiom          DEBUG    Coalesced Term: (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y))
2023-04-01 18:44:20,040 macleod.logical.connective     DEBUG    Rescope Called: (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y))
2023-04-01 18:44:20,041 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:44:20,041 macleod.logical.connective     DEBUG    Rescope Called: ((o(z,x) | ~compl(y,x)) <-> ~p(z,y))
2023-04-01 18:44:20,042 macleod.logical.connective     DEBUG    No Quantifier children: ((o(z,x) | ~compl(y,x)) <-> ~p(z,y))
2023-04-01 18:44:20,043 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))]
2023-04-01 18:44:20,043 macleod.logical.axiom          DEBUG    Term: ~=(y,uni)
2023-04-01 18:44:20,044 macleod.logical.axiom          DEBUG    Term: (~=(y,uni) -> \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))])
2023-04-01 18:44:20,045 macleod.logical.connective     DEBUG    Coalesced Called: (~=(y,uni) -> \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))])
2023-04-01 18:44:20,046 macleod.logical.axiom          DEBUG    Coalesced Term: (~=(y,uni) -> \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))])
2023-04-01 18:44:20,046 macleod.logical.connective     DEBUG    Rescope Called: (~=(y,uni) -> \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))])
2023-04-01 18:44:20,047 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:44:20,048 macleod.logical.connective     DEBUG    Rescope Called: (((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))
2023-04-01 18:44:20,050 macleod.logical.connective     DEBUG    No Quantifier children: (((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))
2023-04-01 18:44:20,050 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]
2023-04-01 18:44:20,050 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\forall x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]]
2023-04-01 18:44:20,051 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\forall x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]]
2023-04-01 18:44:20,053 macleod.logical.quantifier     DEBUG    Found a matching quantifier
2023-04-01 18:44:20,053 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y,x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]
2023-04-01 18:44:20,055 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y,x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]
2023-04-01 18:44:20,056 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y,z\;[(c(x,sum(y,z)) <-> (c(x,y) | c(x,z)))]
2023-04-01 18:44:20,059 macleod.logical.axiom          DEBUG    Function Free: \forall x,y,z\;[(\forall s3\;[(c(x,s3) | ~sum(y,z,s3))] <-> (c(x,y) | c(x,z)))]
2023-04-01 18:44:20,062 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y,x\;[(\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))]
2023-04-01 18:44:20,063 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y,x\;[(\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))]
2023-04-01 18:44:20,064 macleod.logical.axiom          DEBUG    Term: sum(y,x,w)
2023-04-01 18:44:20,065 macleod.logical.axiom          DEBUG    Term: ~sum(y,x,w)
2023-04-01 18:44:20,065 macleod.logical.axiom          DEBUG    Term: c(z,w)
2023-04-01 18:44:20,066 macleod.logical.axiom          DEBUG    Term: c(z,x)
2023-04-01 18:44:20,066 macleod.logical.axiom          DEBUG    Term: c(z,y)
2023-04-01 18:44:20,066 macleod.logical.axiom          DEBUG    Term: (c(z,w) | ~sum(y,x,w))
2023-04-01 18:44:20,067 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,w) | ~sum(y,x,w))
2023-04-01 18:44:20,068 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,w) | ~sum(y,x,w))
2023-04-01 18:44:20,069 macleod.logical.connective     DEBUG    Rescope Called: (c(z,w) | ~sum(y,x,w))
2023-04-01 18:44:20,069 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,w) | ~sum(y,x,w))
2023-04-01 18:44:20,070 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,w) | ~sum(y,x,w))
2023-04-01 18:44:20,070 macleod.logical.axiom          DEBUG    Term: (c(z,y) | c(z,x))
2023-04-01 18:44:20,071 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,y) | c(z,x))
2023-04-01 18:44:20,071 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,y) | c(z,x))
2023-04-01 18:44:20,072 macleod.logical.connective     DEBUG    Rescope Called: (c(z,y) | c(z,x))
2023-04-01 18:44:20,072 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,y) | c(z,x))
2023-04-01 18:44:20,073 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,y) | c(z,x))
2023-04-01 18:44:20,073 macleod.logical.axiom          DEBUG    Term: \forall w\;[(c(z,w) | ~sum(y,x,w))]
2023-04-01 18:44:20,074 macleod.logical.axiom          DEBUG    Term: (\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))
2023-04-01 18:44:20,074 macleod.logical.connective     DEBUG    Coalesced Called: (\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))
2023-04-01 18:44:20,075 macleod.logical.axiom          DEBUG    Coalesced Term: (\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))
2023-04-01 18:44:20,075 macleod.logical.connective     DEBUG    Rescope Called: (\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))
2023-04-01 18:44:20,076 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:44:20,094 macleod.logical.connective     DEBUG    Rescope Called: ((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))
2023-04-01 18:44:20,106 macleod.logical.connective     DEBUG    No Quantifier children: ((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))
2023-04-01 18:44:20,109 macleod.logical.axiom          DEBUG    Rescoped Term: \forall w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]
2023-04-01 18:44:20,110 macleod.logical.axiom          DEBUG    Term: \forall z,y,x\;[\forall w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]]
2023-04-01 18:44:20,111 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y,x\;[\forall w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]]
2023-04-01 18:44:20,112 macleod.logical.quantifier     DEBUG    Found a matching quantifier
2023-04-01 18:44:20,112 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y,x,w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]
2023-04-01 18:44:20,115 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y,x,w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]
2023-04-01 18:44:20,116 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y,z\;[(o(y,z) -> (c(x,prod(y,z)) <-> \exists w\;[(p(w,y) & p(w,z) & c(x,w))]))]
2023-04-01 18:44:20,120 macleod.logical.axiom          DEBUG    Function Free: \forall x,y,z\;[(o(y,z) -> (\forall p4\;[(c(x,p4) | ~prod(y,z,p4))] <-> \exists w\;[(p(w,y) & p(w,z) & c(x,w))]))]
2023-04-01 18:44:20,124 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y,x\;[(o(y,x) -> (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))]))]
2023-04-01 18:44:20,129 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y,x\;[(o(y,x) -> (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))]))]
2023-04-01 18:44:20,130 macleod.logical.axiom          DEBUG    Term: prod(y,x,w)
2023-04-01 18:44:20,131 macleod.logical.axiom          DEBUG    Term: c(z,v)
2023-04-01 18:44:20,131 macleod.logical.axiom          DEBUG    Term: p(v,x)
2023-04-01 18:44:20,132 macleod.logical.axiom          DEBUG    Term: p(v,y)
2023-04-01 18:44:20,132 macleod.logical.axiom          DEBUG    Term: ~prod(y,x,w)
2023-04-01 18:44:20,133 macleod.logical.axiom          DEBUG    Term: c(z,w)
2023-04-01 18:44:20,133 macleod.logical.axiom          DEBUG    Term: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 18:44:20,134 macleod.logical.connective     DEBUG    Coalesced Called: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 18:44:20,134 macleod.logical.axiom          DEBUG    Coalesced Term: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 18:44:20,134 macleod.logical.connective     DEBUG    Rescope Called: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 18:44:20,135 macleod.logical.connective     DEBUG    No Quantifier children: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 18:44:20,136 macleod.logical.axiom          DEBUG    Rescoped Term: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 18:44:20,136 macleod.logical.axiom          DEBUG    Term: (c(z,w) | ~prod(y,x,w))
2023-04-01 18:44:20,137 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,w) | ~prod(y,x,w))
2023-04-01 18:44:20,138 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,w) | ~prod(y,x,w))
2023-04-01 18:44:20,138 macleod.logical.connective     DEBUG    Rescope Called: (c(z,w) | ~prod(y,x,w))
2023-04-01 18:44:20,139 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,w) | ~prod(y,x,w))
2023-04-01 18:44:20,139 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,w) | ~prod(y,x,w))
2023-04-01 18:44:20,140 macleod.logical.axiom          DEBUG    Term: \exists v\;[(p(v,y) & p(v,x) & c(z,v))]
2023-04-01 18:44:20,140 macleod.logical.axiom          DEBUG    Term: \forall w\;[(c(z,w) | ~prod(y,x,w))]
2023-04-01 18:44:20,141 macleod.logical.axiom          DEBUG    Term: (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))])
2023-04-01 18:44:20,142 macleod.logical.connective     DEBUG    Coalesced Called: (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))])
2023-04-01 18:44:20,142 macleod.logical.axiom          DEBUG    Coalesced Term: (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))])
2023-04-01 18:44:20,143 macleod.logical.connective     DEBUG    Rescope Called: (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))])
2023-04-01 18:44:39,896 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 18:44:39,897 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 18:44:39,898 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 18:44:39,899 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_basic.clif
2023-04-01 18:44:39,918 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(p(x,y) <-> \forall z\;[(c(z,x) -> c(z,y))])]
2023-04-01 18:44:39,920 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(p(x,y) <-> \forall z\;[(c(z,x) -> c(z,y))])]
2023-04-01 18:44:39,922 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])]
2023-04-01 18:44:39,923 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])]
2023-04-01 18:44:39,924 macleod.logical.axiom          DEBUG    Term: c(x,y)
2023-04-01 18:44:39,924 macleod.logical.axiom          DEBUG    Term: c(x,z)
2023-04-01 18:44:39,925 macleod.logical.axiom          DEBUG    Term: (c(x,z) -> c(x,y))
2023-04-01 18:44:39,925 macleod.logical.connective     DEBUG    Coalesced Called: (c(x,z) -> c(x,y))
2023-04-01 18:44:39,926 macleod.logical.axiom          DEBUG    Coalesced Term: (c(x,z) -> c(x,y))
2023-04-01 18:44:39,926 macleod.logical.connective     DEBUG    Rescope Called: (c(x,z) -> c(x,y))
2023-04-01 18:44:39,927 macleod.logical.connective     DEBUG    No Quantifier children: (c(x,z) -> c(x,y))
2023-04-01 18:44:39,927 macleod.logical.axiom          DEBUG    Rescoped Term: (c(x,z) -> c(x,y))
2023-04-01 18:44:39,928 macleod.logical.axiom          DEBUG    Term: \forall x\;[(c(x,z) -> c(x,y))]
2023-04-01 18:44:39,928 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 18:44:39,929 macleod.logical.axiom          DEBUG    Term: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-01 18:44:39,929 macleod.logical.connective     DEBUG    Coalesced Called: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-01 18:44:39,930 macleod.logical.axiom          DEBUG    Coalesced Term: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-01 18:44:39,930 macleod.logical.connective     DEBUG    Rescope Called: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-01 18:44:39,931 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:44:39,931 macleod.logical.connective     DEBUG    Rescope Called: ((c(x,z) -> c(x,y)) <-> p(z,y))
2023-04-01 18:44:39,932 macleod.logical.connective     DEBUG    No Quantifier children: ((c(x,z) -> c(x,y)) <-> p(z,y))
2023-04-01 18:44:39,933 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]
2023-04-01 18:44:39,933 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\forall x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]]
2023-04-01 18:44:39,934 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\forall x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]]
2023-04-01 18:44:39,934 macleod.logical.quantifier     DEBUG    Found a matching quantifier
2023-04-01 18:44:39,935 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y,x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]
2023-04-01 18:44:39,937 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y,x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]
2023-04-01 18:44:39,939 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(pp(x,y) <-> (p(x,y) & ~p(y,x)))]
2023-04-01 18:44:39,940 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(pp(x,y) <-> (p(x,y) & ~p(y,x)))]
2023-04-01 18:44:39,942 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:44:39,943 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:44:39,944 macleod.logical.axiom          DEBUG    Term: p(y,z)
2023-04-01 18:44:39,945 macleod.logical.axiom          DEBUG    Term: ~p(y,z)
2023-04-01 18:44:39,945 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 18:44:39,946 macleod.logical.axiom          DEBUG    Term: (p(z,y) & ~p(y,z))
2023-04-01 18:44:39,946 macleod.logical.connective     DEBUG    Coalesced Called: (p(z,y) & ~p(y,z))
2023-04-01 18:44:39,947 macleod.logical.axiom          DEBUG    Coalesced Term: (p(z,y) & ~p(y,z))
2023-04-01 18:44:39,948 macleod.logical.connective     DEBUG    Rescope Called: (p(z,y) & ~p(y,z))
2023-04-01 18:44:39,948 macleod.logical.connective     DEBUG    No Quantifier children: (p(z,y) & ~p(y,z))
2023-04-01 18:44:39,949 macleod.logical.axiom          DEBUG    Rescoped Term: (p(z,y) & ~p(y,z))
2023-04-01 18:44:39,949 macleod.logical.axiom          DEBUG    Term: pp(z,y)
2023-04-01 18:44:39,950 macleod.logical.axiom          DEBUG    Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:44:39,950 macleod.logical.connective     DEBUG    Coalesced Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:44:39,951 macleod.logical.axiom          DEBUG    Coalesced Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:44:39,952 macleod.logical.connective     DEBUG    Rescope Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:44:39,952 macleod.logical.connective     DEBUG    No Quantifier children: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:44:39,953 macleod.logical.axiom          DEBUG    Rescoped Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:44:39,954 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:44:39,954 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:44:39,955 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:44:39,956 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:44:39,957 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(o(x,y) <-> \exists z\;[(p(z,x) & p(z,y))])]
2023-04-01 18:44:39,959 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(o(x,y) <-> \exists z\;[(p(z,x) & p(z,y))])]
2023-04-01 18:44:39,960 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])]
2023-04-01 18:44:39,961 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])]
2023-04-01 18:44:39,962 macleod.logical.axiom          DEBUG    Term: p(x,y)
2023-04-01 18:44:39,962 macleod.logical.axiom          DEBUG    Term: p(x,z)
2023-04-01 18:44:39,963 macleod.logical.axiom          DEBUG    Term: (p(x,z) & p(x,y))
2023-04-01 18:44:39,963 macleod.logical.connective     DEBUG    Coalesced Called: (p(x,z) & p(x,y))
2023-04-01 18:44:39,964 macleod.logical.axiom          DEBUG    Coalesced Term: (p(x,z) & p(x,y))
2023-04-01 18:44:39,964 macleod.logical.connective     DEBUG    Rescope Called: (p(x,z) & p(x,y))
2023-04-01 18:44:39,965 macleod.logical.connective     DEBUG    No Quantifier children: (p(x,z) & p(x,y))
2023-04-01 18:44:39,965 macleod.logical.axiom          DEBUG    Rescoped Term: (p(x,z) & p(x,y))
2023-04-01 18:44:39,966 macleod.logical.axiom          DEBUG    Term: \exists x\;[(p(x,z) & p(x,y))]
2023-04-01 18:44:39,966 macleod.logical.axiom          DEBUG    Term: o(z,y)
2023-04-01 18:44:39,966 macleod.logical.axiom          DEBUG    Term: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-01 18:44:39,967 macleod.logical.connective     DEBUG    Coalesced Called: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-01 18:44:39,967 macleod.logical.axiom          DEBUG    Coalesced Term: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-01 18:44:39,967 macleod.logical.connective     DEBUG    Rescope Called: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-01 18:44:39,968 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:44:39,969 macleod.logical.connective     DEBUG    Rescope Called: ((p(x,z) & p(x,y)) <-> o(z,y))
2023-04-01 18:44:39,969 macleod.logical.connective     DEBUG    No Quantifier children: ((p(x,z) & p(x,y)) <-> o(z,y))
2023-04-01 18:44:39,970 macleod.logical.axiom          DEBUG    Rescoped Term: \exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]
2023-04-01 18:44:39,970 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-01 18:44:39,970 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-01 18:44:39,972 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-01 18:44:39,975 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-01 18:44:39,976 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(ec(x,y) <-> (c(x,y) & ~o(x,y)))]
2023-04-01 18:44:39,978 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(ec(x,y) <-> (c(x,y) & ~o(x,y)))]
2023-04-01 18:44:39,979 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:44:39,981 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:44:39,982 macleod.logical.axiom          DEBUG    Term: o(z,y)
2023-04-01 18:44:39,982 macleod.logical.axiom          DEBUG    Term: ~o(z,y)
2023-04-01 18:44:39,982 macleod.logical.axiom          DEBUG    Term: c(z,y)
2023-04-01 18:44:39,983 macleod.logical.axiom          DEBUG    Term: (c(z,y) & ~o(z,y))
2023-04-01 18:44:39,983 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,y) & ~o(z,y))
2023-04-01 18:44:39,984 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,y) & ~o(z,y))
2023-04-01 18:44:39,984 macleod.logical.connective     DEBUG    Rescope Called: (c(z,y) & ~o(z,y))
2023-04-01 18:44:39,984 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,y) & ~o(z,y))
2023-04-01 18:44:39,985 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,y) & ~o(z,y))
2023-04-01 18:44:39,986 macleod.logical.axiom          DEBUG    Term: ec(z,y)
2023-04-01 18:44:39,986 macleod.logical.axiom          DEBUG    Term: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:44:39,987 macleod.logical.connective     DEBUG    Coalesced Called: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:44:39,988 macleod.logical.axiom          DEBUG    Coalesced Term: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:44:39,988 macleod.logical.connective     DEBUG    Rescope Called: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:44:39,988 macleod.logical.connective     DEBUG    No Quantifier children: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:44:39,989 macleod.logical.axiom          DEBUG    Rescoped Term: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:44:39,990 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:44:39,990 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:44:39,991 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:44:39,992 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:44:39,994 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(ntpp(x,y) <-> (pp(x,y) & ~\exists z\;[(ec(z,x) & ec(z,y))]))]
2023-04-01 18:44:39,996 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(ntpp(x,y) <-> (pp(x,y) & ~\exists z\;[(ec(z,x) & ec(z,y))]))]
2023-04-01 18:44:39,999 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(ntpp(z,y) <-> (pp(z,y) & ~\exists x\;[(ec(x,z) & ec(x,y))]))]
2023-04-01 18:44:40,003 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(ntpp(z,y) <-> (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))]))]
2023-04-01 18:44:40,003 macleod.logical.axiom          DEBUG    Term: ec(x,y)
2023-04-01 18:44:40,004 macleod.logical.axiom          DEBUG    Term: ec(x,z)
2023-04-01 18:44:40,004 macleod.logical.axiom          DEBUG    Term: ~ec(x,y)
2023-04-01 18:44:40,005 macleod.logical.axiom          DEBUG    Term: ~ec(x,z)
2023-04-01 18:44:40,005 macleod.logical.axiom          DEBUG    Term: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:44:40,006 macleod.logical.connective     DEBUG    Coalesced Called: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:44:40,007 macleod.logical.axiom          DEBUG    Coalesced Term: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:44:40,007 macleod.logical.connective     DEBUG    Rescope Called: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:44:40,008 macleod.logical.connective     DEBUG    No Quantifier children: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:44:40,008 macleod.logical.axiom          DEBUG    Rescoped Term: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:44:40,009 macleod.logical.axiom          DEBUG    Term: \forall x\;[(~ec(x,z) | ~ec(x,y))]
2023-04-01 18:44:40,009 macleod.logical.axiom          DEBUG    Term: pp(z,y)
2023-04-01 18:44:40,010 macleod.logical.axiom          DEBUG    Term: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-01 18:44:40,010 macleod.logical.connective     DEBUG    Coalesced Called: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-01 18:44:40,011 macleod.logical.axiom          DEBUG    Coalesced Term: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-01 18:44:40,012 macleod.logical.connective     DEBUG    Rescope Called: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-01 18:44:40,012 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:44:40,013 macleod.logical.connective     DEBUG    Rescope Called: ((~ec(x,z) | ~ec(x,y)) & pp(z,y))
2023-04-01 18:44:40,013 macleod.logical.connective     DEBUG    No Quantifier children: ((~ec(x,z) | ~ec(x,y)) & pp(z,y))
2023-04-01 18:44:40,014 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))]
2023-04-01 18:44:40,015 macleod.logical.axiom          DEBUG    Term: ntpp(z,y)
2023-04-01 18:44:40,016 macleod.logical.axiom          DEBUG    Term: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-01 18:44:40,017 macleod.logical.connective     DEBUG    Coalesced Called: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-01 18:44:40,017 macleod.logical.axiom          DEBUG    Coalesced Term: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-01 18:44:40,018 macleod.logical.connective     DEBUG    Rescope Called: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-01 18:44:40,018 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:44:40,019 macleod.logical.connective     DEBUG    Rescope Called: (((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))
2023-04-01 18:44:40,020 macleod.logical.connective     DEBUG    No Quantifier children: (((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))
2023-04-01 18:44:40,021 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]
2023-04-01 18:44:40,021 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\forall x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]]
2023-04-01 18:44:40,022 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\forall x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]]
2023-04-01 18:44:40,023 macleod.logical.quantifier     DEBUG    Found a matching quantifier
2023-04-01 18:44:40,024 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y,x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]
2023-04-01 18:44:40,025 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y,x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]
2023-04-01 18:44:40,027 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x\;[c(x,x)]
2023-04-01 18:44:40,027 macleod.logical.axiom          DEBUG    Function Free: \forall x\;[c(x,x)]
2023-04-01 18:44:40,028 macleod.logical.axiom          DEBUG    Unique Variables: \forall z\;[c(z,z)]
2023-04-01 18:44:40,029 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z\;[c(z,z)]
2023-04-01 18:44:40,029 macleod.logical.axiom          DEBUG    Term: c(z,z)
2023-04-01 18:44:40,029 macleod.logical.axiom          DEBUG    Term: \forall z\;[c(z,z)]
2023-04-01 18:44:40,030 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z\;[c(z,z)]
2023-04-01 18:44:40,030 macleod.logical.axiom          DEBUG    Prenex Form: \forall z\;[c(z,z)]
2023-04-01 18:44:40,031 macleod.logical.axiom          DEBUG    CNF Form: \forall z\;[c(z,z)]
2023-04-01 18:44:40,032 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(c(x,y) -> c(y,x))]
2023-04-01 18:44:40,033 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(c(x,y) -> c(y,x))]
2023-04-01 18:44:40,034 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:44:40,035 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:44:40,035 macleod.logical.axiom          DEBUG    Term: c(y,z)
2023-04-01 18:44:40,036 macleod.logical.axiom          DEBUG    Term: c(z,y)
2023-04-01 18:44:40,036 macleod.logical.axiom          DEBUG    Term: (c(z,y) -> c(y,z))
2023-04-01 18:44:40,037 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,y) -> c(y,z))
2023-04-01 18:44:40,037 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,y) -> c(y,z))
2023-04-01 18:44:40,038 macleod.logical.connective     DEBUG    Rescope Called: (c(z,y) -> c(y,z))
2023-04-01 18:44:40,038 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,y) -> c(y,z))
2023-04-01 18:44:40,039 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,y) -> c(y,z))
2023-04-01 18:44:40,039 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:44:40,039 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:44:40,040 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:44:40,041 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:44:40,042 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x\;[c(x,uni)]
2023-04-01 18:44:40,043 macleod.logical.axiom          DEBUG    Function Free: \forall x\;[c(x,uni)]
2023-04-01 18:44:40,043 macleod.logical.utils          INFO     Found a constant!
2023-04-01 18:44:40,044 macleod.logical.axiom          DEBUG    Unique Variables: \forall z\;[c(z,uni)]
2023-04-01 18:44:40,044 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z\;[c(z,uni)]
2023-04-01 18:44:40,045 macleod.logical.axiom          DEBUG    Term: c(z,uni)
2023-04-01 18:44:40,045 macleod.logical.axiom          DEBUG    Term: \forall z\;[c(z,uni)]
2023-04-01 18:44:40,046 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z\;[c(z,uni)]
2023-04-01 18:44:40,046 macleod.logical.axiom          DEBUG    Prenex Form: \forall z\;[c(z,uni)]
2023-04-01 18:44:40,047 macleod.logical.axiom          DEBUG    CNF Form: \forall z\;[c(z,uni)]
2023-04-01 18:44:40,048 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(~=(y,uni) -> (o(x,compl(y)) <-> ~p(x,y)))]
2023-04-01 18:44:40,050 macleod.logical.axiom          DEBUG    Adding function declaration on: compl
2023-04-01 18:44:40,051 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(~=(y,uni) -> (\forall c2\;[(o(x,c2) | ~compl(y,c2))] <-> ~p(x,y)))]
2023-04-01 18:44:40,052 macleod.logical.utils          INFO     Found a constant!
2023-04-01 18:44:40,055 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(~=(y,uni) -> (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y)))]
2023-04-01 18:44:40,058 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(~=(y,uni) -> (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y)))]
2023-04-01 18:44:40,058 macleod.logical.axiom          DEBUG    Term: compl(y,x)
2023-04-01 18:44:40,059 macleod.logical.axiom          DEBUG    Term: ~compl(y,x)
2023-04-01 18:44:40,059 macleod.logical.axiom          DEBUG    Term: o(z,x)
2023-04-01 18:44:40,060 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 18:44:40,060 macleod.logical.axiom          DEBUG    Term: (o(z,x) | ~compl(y,x))
2023-04-01 18:44:40,060 macleod.logical.connective     DEBUG    Coalesced Called: (o(z,x) | ~compl(y,x))
2023-04-01 18:44:40,061 macleod.logical.axiom          DEBUG    Coalesced Term: (o(z,x) | ~compl(y,x))
2023-04-01 18:44:40,061 macleod.logical.connective     DEBUG    Rescope Called: (o(z,x) | ~compl(y,x))
2023-04-01 18:44:40,062 macleod.logical.connective     DEBUG    No Quantifier children: (o(z,x) | ~compl(y,x))
2023-04-01 18:44:40,062 macleod.logical.axiom          DEBUG    Rescoped Term: (o(z,x) | ~compl(y,x))
2023-04-01 18:44:40,063 macleod.logical.axiom          DEBUG    Term: ~p(z,y)
2023-04-01 18:44:40,063 macleod.logical.axiom          DEBUG    Term: \forall x\;[(o(z,x) | ~compl(y,x))]
2023-04-01 18:44:40,063 macleod.logical.axiom          DEBUG    Term: =(y,uni)
2023-04-01 18:44:40,064 macleod.logical.axiom          DEBUG    Term: (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y))
2023-04-01 18:44:40,065 macleod.logical.connective     DEBUG    Coalesced Called: (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y))
2023-04-01 18:44:40,065 macleod.logical.axiom          DEBUG    Coalesced Term: (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y))
2023-04-01 18:44:40,066 macleod.logical.connective     DEBUG    Rescope Called: (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y))
2023-04-01 18:44:40,066 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:44:40,067 macleod.logical.connective     DEBUG    Rescope Called: ((o(z,x) | ~compl(y,x)) <-> ~p(z,y))
2023-04-01 18:44:40,067 macleod.logical.connective     DEBUG    No Quantifier children: ((o(z,x) | ~compl(y,x)) <-> ~p(z,y))
2023-04-01 18:44:40,068 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))]
2023-04-01 18:44:40,069 macleod.logical.axiom          DEBUG    Term: ~=(y,uni)
2023-04-01 18:44:40,070 macleod.logical.axiom          DEBUG    Term: (~=(y,uni) -> \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))])
2023-04-01 18:44:40,071 macleod.logical.connective     DEBUG    Coalesced Called: (~=(y,uni) -> \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))])
2023-04-01 18:44:40,071 macleod.logical.axiom          DEBUG    Coalesced Term: (~=(y,uni) -> \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))])
2023-04-01 18:44:40,072 macleod.logical.connective     DEBUG    Rescope Called: (~=(y,uni) -> \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))])
2023-04-01 18:44:40,072 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:44:40,073 macleod.logical.connective     DEBUG    Rescope Called: (((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))
2023-04-01 18:44:40,074 macleod.logical.connective     DEBUG    No Quantifier children: (((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))
2023-04-01 18:44:40,074 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]
2023-04-01 18:44:40,075 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\forall x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]]
2023-04-01 18:44:40,075 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\forall x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]]
2023-04-01 18:44:40,076 macleod.logical.quantifier     DEBUG    Found a matching quantifier
2023-04-01 18:44:40,076 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y,x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]
2023-04-01 18:44:40,078 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y,x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]
2023-04-01 18:44:40,079 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y,z\;[(c(x,sum(y,z)) <-> (c(x,y) | c(x,z)))]
2023-04-01 18:44:40,081 macleod.logical.axiom          DEBUG    Function Free: \forall x,y,z\;[(\forall s3\;[(c(x,s3) | ~sum(y,z,s3))] <-> (c(x,y) | c(x,z)))]
2023-04-01 18:44:40,084 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y,x\;[(\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))]
2023-04-01 18:44:40,086 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y,x\;[(\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))]
2023-04-01 18:44:40,087 macleod.logical.axiom          DEBUG    Term: sum(y,x,w)
2023-04-01 18:44:40,087 macleod.logical.axiom          DEBUG    Term: ~sum(y,x,w)
2023-04-01 18:44:40,088 macleod.logical.axiom          DEBUG    Term: c(z,w)
2023-04-01 18:44:40,088 macleod.logical.axiom          DEBUG    Term: c(z,x)
2023-04-01 18:44:40,088 macleod.logical.axiom          DEBUG    Term: c(z,y)
2023-04-01 18:44:40,089 macleod.logical.axiom          DEBUG    Term: (c(z,w) | ~sum(y,x,w))
2023-04-01 18:44:40,089 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,w) | ~sum(y,x,w))
2023-04-01 18:44:40,090 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,w) | ~sum(y,x,w))
2023-04-01 18:44:40,090 macleod.logical.connective     DEBUG    Rescope Called: (c(z,w) | ~sum(y,x,w))
2023-04-01 18:44:40,091 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,w) | ~sum(y,x,w))
2023-04-01 18:44:40,091 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,w) | ~sum(y,x,w))
2023-04-01 18:44:40,091 macleod.logical.axiom          DEBUG    Term: (c(z,y) | c(z,x))
2023-04-01 18:44:40,092 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,y) | c(z,x))
2023-04-01 18:44:40,092 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,y) | c(z,x))
2023-04-01 18:44:40,093 macleod.logical.connective     DEBUG    Rescope Called: (c(z,y) | c(z,x))
2023-04-01 18:44:40,093 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,y) | c(z,x))
2023-04-01 18:44:40,093 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,y) | c(z,x))
2023-04-01 18:44:40,094 macleod.logical.axiom          DEBUG    Term: \forall w\;[(c(z,w) | ~sum(y,x,w))]
2023-04-01 18:44:40,094 macleod.logical.axiom          DEBUG    Term: (\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))
2023-04-01 18:44:40,095 macleod.logical.connective     DEBUG    Coalesced Called: (\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))
2023-04-01 18:44:40,095 macleod.logical.axiom          DEBUG    Coalesced Term: (\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))
2023-04-01 18:44:40,096 macleod.logical.connective     DEBUG    Rescope Called: (\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))
2023-04-01 18:44:40,096 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:44:40,097 macleod.logical.connective     DEBUG    Rescope Called: ((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))
2023-04-01 18:44:40,097 macleod.logical.connective     DEBUG    No Quantifier children: ((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))
2023-04-01 18:44:40,098 macleod.logical.axiom          DEBUG    Rescoped Term: \forall w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]
2023-04-01 18:44:40,098 macleod.logical.axiom          DEBUG    Term: \forall z,y,x\;[\forall w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]]
2023-04-01 18:44:40,099 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y,x\;[\forall w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]]
2023-04-01 18:44:40,099 macleod.logical.quantifier     DEBUG    Found a matching quantifier
2023-04-01 18:44:40,100 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y,x,w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]
2023-04-01 18:44:40,102 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y,x,w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]
2023-04-01 18:44:40,103 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y,z\;[(o(y,z) -> (c(x,prod(y,z)) <-> \exists w\;[(p(w,y) & p(w,z) & c(x,w))]))]
2023-04-01 18:44:40,106 macleod.logical.axiom          DEBUG    Function Free: \forall x,y,z\;[(o(y,z) -> (\forall p4\;[(c(x,p4) | ~prod(y,z,p4))] <-> \exists w\;[(p(w,y) & p(w,z) & c(x,w))]))]
2023-04-01 18:44:40,111 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y,x\;[(o(y,x) -> (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))]))]
2023-04-01 18:44:40,134 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y,x\;[(o(y,x) -> (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))]))]
2023-04-01 18:44:40,140 macleod.logical.axiom          DEBUG    Term: prod(y,x,w)
2023-04-01 18:44:40,140 macleod.logical.axiom          DEBUG    Term: c(z,v)
2023-04-01 18:44:40,141 macleod.logical.axiom          DEBUG    Term: p(v,x)
2023-04-01 18:44:40,141 macleod.logical.axiom          DEBUG    Term: p(v,y)
2023-04-01 18:44:40,141 macleod.logical.axiom          DEBUG    Term: ~prod(y,x,w)
2023-04-01 18:44:40,142 macleod.logical.axiom          DEBUG    Term: c(z,w)
2023-04-01 18:44:40,142 macleod.logical.axiom          DEBUG    Term: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 18:44:40,142 macleod.logical.connective     DEBUG    Coalesced Called: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 18:44:40,143 macleod.logical.axiom          DEBUG    Coalesced Term: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 18:44:40,144 macleod.logical.connective     DEBUG    Rescope Called: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 18:44:40,144 macleod.logical.connective     DEBUG    No Quantifier children: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 18:44:40,145 macleod.logical.axiom          DEBUG    Rescoped Term: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 18:44:40,145 macleod.logical.axiom          DEBUG    Term: (c(z,w) | ~prod(y,x,w))
2023-04-01 18:44:40,146 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,w) | ~prod(y,x,w))
2023-04-01 18:44:40,146 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,w) | ~prod(y,x,w))
2023-04-01 18:44:40,147 macleod.logical.connective     DEBUG    Rescope Called: (c(z,w) | ~prod(y,x,w))
2023-04-01 18:44:40,147 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,w) | ~prod(y,x,w))
2023-04-01 18:44:40,148 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,w) | ~prod(y,x,w))
2023-04-01 18:44:40,148 macleod.logical.axiom          DEBUG    Term: \exists v\;[(p(v,y) & p(v,x) & c(z,v))]
2023-04-01 18:44:40,149 macleod.logical.axiom          DEBUG    Term: \forall w\;[(c(z,w) | ~prod(y,x,w))]
2023-04-01 18:44:40,149 macleod.logical.axiom          DEBUG    Term: (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))])
2023-04-01 18:44:40,151 macleod.logical.connective     DEBUG    Coalesced Called: (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))])
2023-04-01 18:44:40,151 macleod.logical.axiom          DEBUG    Coalesced Term: (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))])
2023-04-01 18:44:40,152 macleod.logical.connective     DEBUG    Rescope Called: (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))])
2023-04-01 18:45:54,421 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 18:45:54,422 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 18:45:54,423 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 18:45:54,425 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_basic.clif
2023-04-01 18:45:54,444 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(p(x,y) <-> \forall z\;[(c(z,x) -> c(z,y))])]
2023-04-01 18:45:54,445 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(p(x,y) <-> \forall z\;[(c(z,x) -> c(z,y))])]
2023-04-01 18:45:54,447 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])]
2023-04-01 18:45:54,449 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])]
2023-04-01 18:45:54,451 macleod.logical.axiom          DEBUG    Term: c(x,y)
2023-04-01 18:45:54,451 macleod.logical.axiom          DEBUG    Term: c(x,z)
2023-04-01 18:45:54,451 macleod.logical.axiom          DEBUG    Term: (c(x,z) -> c(x,y))
2023-04-01 18:45:54,452 macleod.logical.connective     DEBUG    Coalesced Called: (c(x,z) -> c(x,y))
2023-04-01 18:45:54,453 macleod.logical.axiom          DEBUG    Coalesced Term: (c(x,z) -> c(x,y))
2023-04-01 18:45:54,453 macleod.logical.connective     DEBUG    Rescope Called: (c(x,z) -> c(x,y))
2023-04-01 18:45:54,454 macleod.logical.connective     DEBUG    No Quantifier children: (c(x,z) -> c(x,y))
2023-04-01 18:45:54,454 macleod.logical.axiom          DEBUG    Rescoped Term: (c(x,z) -> c(x,y))
2023-04-01 18:45:54,454 macleod.logical.axiom          DEBUG    Term: \forall x\;[(c(x,z) -> c(x,y))]
2023-04-01 18:45:54,455 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 18:45:54,455 macleod.logical.axiom          DEBUG    Term: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-01 18:45:54,456 macleod.logical.connective     DEBUG    Coalesced Called: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-01 18:45:54,456 macleod.logical.axiom          DEBUG    Coalesced Term: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-01 18:45:54,457 macleod.logical.connective     DEBUG    Rescope Called: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-01 18:45:54,457 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:45:54,458 macleod.logical.connective     DEBUG    Rescope Called: ((c(x,z) -> c(x,y)) <-> p(z,y))
2023-04-01 18:45:54,458 macleod.logical.connective     DEBUG    No Quantifier children: ((c(x,z) -> c(x,y)) <-> p(z,y))
2023-04-01 18:45:54,459 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]
2023-04-01 18:45:54,460 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\forall x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]]
2023-04-01 18:45:54,460 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\forall x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]]
2023-04-01 18:45:54,461 macleod.logical.quantifier     DEBUG    Found a matching quantifier
2023-04-01 18:45:54,462 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y,x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]
2023-04-01 18:45:54,463 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y,x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]
2023-04-01 18:45:54,465 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(pp(x,y) <-> (p(x,y) & ~p(y,x)))]
2023-04-01 18:45:54,467 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(pp(x,y) <-> (p(x,y) & ~p(y,x)))]
2023-04-01 18:45:54,469 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:45:54,471 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:45:54,472 macleod.logical.axiom          DEBUG    Term: p(y,z)
2023-04-01 18:45:54,472 macleod.logical.axiom          DEBUG    Term: ~p(y,z)
2023-04-01 18:45:54,473 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 18:45:54,473 macleod.logical.axiom          DEBUG    Term: (p(z,y) & ~p(y,z))
2023-04-01 18:45:54,474 macleod.logical.connective     DEBUG    Coalesced Called: (p(z,y) & ~p(y,z))
2023-04-01 18:45:54,474 macleod.logical.axiom          DEBUG    Coalesced Term: (p(z,y) & ~p(y,z))
2023-04-01 18:45:54,474 macleod.logical.connective     DEBUG    Rescope Called: (p(z,y) & ~p(y,z))
2023-04-01 18:45:54,475 macleod.logical.connective     DEBUG    No Quantifier children: (p(z,y) & ~p(y,z))
2023-04-01 18:45:54,475 macleod.logical.axiom          DEBUG    Rescoped Term: (p(z,y) & ~p(y,z))
2023-04-01 18:45:54,476 macleod.logical.axiom          DEBUG    Term: pp(z,y)
2023-04-01 18:45:54,477 macleod.logical.axiom          DEBUG    Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:45:54,478 macleod.logical.connective     DEBUG    Coalesced Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:45:54,478 macleod.logical.axiom          DEBUG    Coalesced Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:45:54,479 macleod.logical.connective     DEBUG    Rescope Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:45:54,479 macleod.logical.connective     DEBUG    No Quantifier children: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:45:54,480 macleod.logical.axiom          DEBUG    Rescoped Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:45:54,480 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:45:54,481 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:45:54,482 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:45:54,483 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:45:54,485 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(o(x,y) <-> \exists z\;[(p(z,x) & p(z,y))])]
2023-04-01 18:45:54,487 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(o(x,y) <-> \exists z\;[(p(z,x) & p(z,y))])]
2023-04-01 18:45:54,488 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])]
2023-04-01 18:45:54,490 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])]
2023-04-01 18:45:54,491 macleod.logical.axiom          DEBUG    Term: p(x,y)
2023-04-01 18:45:54,492 macleod.logical.axiom          DEBUG    Term: p(x,z)
2023-04-01 18:45:54,492 macleod.logical.axiom          DEBUG    Term: (p(x,z) & p(x,y))
2023-04-01 18:45:54,492 macleod.logical.connective     DEBUG    Coalesced Called: (p(x,z) & p(x,y))
2023-04-01 18:45:54,493 macleod.logical.axiom          DEBUG    Coalesced Term: (p(x,z) & p(x,y))
2023-04-01 18:45:54,493 macleod.logical.connective     DEBUG    Rescope Called: (p(x,z) & p(x,y))
2023-04-01 18:45:54,493 macleod.logical.connective     DEBUG    No Quantifier children: (p(x,z) & p(x,y))
2023-04-01 18:45:54,494 macleod.logical.axiom          DEBUG    Rescoped Term: (p(x,z) & p(x,y))
2023-04-01 18:45:54,494 macleod.logical.axiom          DEBUG    Term: \exists x\;[(p(x,z) & p(x,y))]
2023-04-01 18:45:54,495 macleod.logical.axiom          DEBUG    Term: o(z,y)
2023-04-01 18:45:54,495 macleod.logical.axiom          DEBUG    Term: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-01 18:45:54,496 macleod.logical.connective     DEBUG    Coalesced Called: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-01 18:45:54,496 macleod.logical.axiom          DEBUG    Coalesced Term: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-01 18:45:54,497 macleod.logical.connective     DEBUG    Rescope Called: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-01 18:45:54,497 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:45:54,498 macleod.logical.connective     DEBUG    Rescope Called: ((p(x,z) & p(x,y)) <-> o(z,y))
2023-04-01 18:45:54,498 macleod.logical.connective     DEBUG    No Quantifier children: ((p(x,z) & p(x,y)) <-> o(z,y))
2023-04-01 18:45:54,499 macleod.logical.axiom          DEBUG    Rescoped Term: \exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]
2023-04-01 18:45:54,499 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-01 18:45:54,500 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-01 18:45:54,501 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-01 18:45:54,503 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-01 18:45:54,504 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(ec(x,y) <-> (c(x,y) & ~o(x,y)))]
2023-04-01 18:45:54,505 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(ec(x,y) <-> (c(x,y) & ~o(x,y)))]
2023-04-01 18:45:54,506 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:45:54,507 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:45:54,508 macleod.logical.axiom          DEBUG    Term: o(z,y)
2023-04-01 18:45:54,508 macleod.logical.axiom          DEBUG    Term: ~o(z,y)
2023-04-01 18:45:54,508 macleod.logical.axiom          DEBUG    Term: c(z,y)
2023-04-01 18:45:54,508 macleod.logical.axiom          DEBUG    Term: (c(z,y) & ~o(z,y))
2023-04-01 18:45:54,509 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,y) & ~o(z,y))
2023-04-01 18:45:54,509 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,y) & ~o(z,y))
2023-04-01 18:45:54,509 macleod.logical.connective     DEBUG    Rescope Called: (c(z,y) & ~o(z,y))
2023-04-01 18:45:54,509 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,y) & ~o(z,y))
2023-04-01 18:45:54,510 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,y) & ~o(z,y))
2023-04-01 18:45:54,510 macleod.logical.axiom          DEBUG    Term: ec(z,y)
2023-04-01 18:45:54,510 macleod.logical.axiom          DEBUG    Term: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:45:54,511 macleod.logical.connective     DEBUG    Coalesced Called: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:45:54,511 macleod.logical.axiom          DEBUG    Coalesced Term: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:45:54,511 macleod.logical.connective     DEBUG    Rescope Called: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:45:54,512 macleod.logical.connective     DEBUG    No Quantifier children: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:45:54,512 macleod.logical.axiom          DEBUG    Rescoped Term: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:45:54,512 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:45:54,513 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:45:54,513 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:45:54,514 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:45:54,516 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(ntpp(x,y) <-> (pp(x,y) & ~\exists z\;[(ec(z,x) & ec(z,y))]))]
2023-04-01 18:45:54,519 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(ntpp(x,y) <-> (pp(x,y) & ~\exists z\;[(ec(z,x) & ec(z,y))]))]
2023-04-01 18:45:54,521 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(ntpp(z,y) <-> (pp(z,y) & ~\exists x\;[(ec(x,z) & ec(x,y))]))]
2023-04-01 18:45:54,525 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(ntpp(z,y) <-> (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))]))]
2023-04-01 18:45:54,525 macleod.logical.axiom          DEBUG    Term: ec(x,y)
2023-04-01 18:45:54,526 macleod.logical.axiom          DEBUG    Term: ec(x,z)
2023-04-01 18:45:54,526 macleod.logical.axiom          DEBUG    Term: ~ec(x,y)
2023-04-01 18:45:54,526 macleod.logical.axiom          DEBUG    Term: ~ec(x,z)
2023-04-01 18:45:54,527 macleod.logical.axiom          DEBUG    Term: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:45:54,528 macleod.logical.connective     DEBUG    Coalesced Called: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:45:54,528 macleod.logical.axiom          DEBUG    Coalesced Term: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:45:54,529 macleod.logical.connective     DEBUG    Rescope Called: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:45:54,529 macleod.logical.connective     DEBUG    No Quantifier children: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:45:54,529 macleod.logical.axiom          DEBUG    Rescoped Term: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:45:54,530 macleod.logical.axiom          DEBUG    Term: \forall x\;[(~ec(x,z) | ~ec(x,y))]
2023-04-01 18:45:54,530 macleod.logical.axiom          DEBUG    Term: pp(z,y)
2023-04-01 18:45:54,530 macleod.logical.axiom          DEBUG    Term: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-01 18:45:54,531 macleod.logical.connective     DEBUG    Coalesced Called: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-01 18:45:54,531 macleod.logical.axiom          DEBUG    Coalesced Term: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-01 18:45:54,532 macleod.logical.connective     DEBUG    Rescope Called: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-01 18:45:54,532 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:45:54,533 macleod.logical.connective     DEBUG    Rescope Called: ((~ec(x,z) | ~ec(x,y)) & pp(z,y))
2023-04-01 18:45:54,534 macleod.logical.connective     DEBUG    No Quantifier children: ((~ec(x,z) | ~ec(x,y)) & pp(z,y))
2023-04-01 18:45:54,534 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))]
2023-04-01 18:45:54,535 macleod.logical.axiom          DEBUG    Term: ntpp(z,y)
2023-04-01 18:45:54,536 macleod.logical.axiom          DEBUG    Term: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-01 18:45:54,537 macleod.logical.connective     DEBUG    Coalesced Called: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-01 18:45:54,537 macleod.logical.axiom          DEBUG    Coalesced Term: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-01 18:45:54,538 macleod.logical.connective     DEBUG    Rescope Called: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-01 18:45:54,538 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:45:54,539 macleod.logical.connective     DEBUG    Rescope Called: (((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))
2023-04-01 18:45:54,540 macleod.logical.connective     DEBUG    No Quantifier children: (((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))
2023-04-01 18:45:54,540 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]
2023-04-01 18:45:54,541 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\forall x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]]
2023-04-01 18:45:54,541 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\forall x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]]
2023-04-01 18:45:54,541 macleod.logical.quantifier     DEBUG    Found a matching quantifier
2023-04-01 18:45:54,542 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y,x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]
2023-04-01 18:45:54,543 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y,x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]
2023-04-01 18:45:54,573 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x\;[c(x,x)]
2023-04-01 18:45:54,574 macleod.logical.axiom          DEBUG    Function Free: \forall x\;[c(x,x)]
2023-04-01 18:45:54,574 macleod.logical.axiom          DEBUG    Unique Variables: \forall z\;[c(z,z)]
2023-04-01 18:45:54,575 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z\;[c(z,z)]
2023-04-01 18:45:54,575 macleod.logical.axiom          DEBUG    Term: c(z,z)
2023-04-01 18:45:54,575 macleod.logical.axiom          DEBUG    Term: \forall z\;[c(z,z)]
2023-04-01 18:45:54,575 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z\;[c(z,z)]
2023-04-01 18:45:54,576 macleod.logical.axiom          DEBUG    Prenex Form: \forall z\;[c(z,z)]
2023-04-01 18:45:54,576 macleod.logical.axiom          DEBUG    CNF Form: \forall z\;[c(z,z)]
2023-04-01 18:45:54,577 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(c(x,y) -> c(y,x))]
2023-04-01 18:45:54,578 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(c(x,y) -> c(y,x))]
2023-04-01 18:45:54,579 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:45:54,580 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:45:54,581 macleod.logical.axiom          DEBUG    Term: c(y,z)
2023-04-01 18:45:54,581 macleod.logical.axiom          DEBUG    Term: c(z,y)
2023-04-01 18:45:54,581 macleod.logical.axiom          DEBUG    Term: (c(z,y) -> c(y,z))
2023-04-01 18:45:54,584 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,y) -> c(y,z))
2023-04-01 18:45:54,585 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,y) -> c(y,z))
2023-04-01 18:45:54,586 macleod.logical.connective     DEBUG    Rescope Called: (c(z,y) -> c(y,z))
2023-04-01 18:45:54,587 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,y) -> c(y,z))
2023-04-01 18:45:54,588 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,y) -> c(y,z))
2023-04-01 18:45:54,588 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:45:54,588 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:45:54,589 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:45:54,590 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:45:54,591 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x\;[c(x,uni)]
2023-04-01 18:45:54,592 macleod.logical.axiom          DEBUG    Function Free: \forall x\;[c(x,uni)]
2023-04-01 18:45:54,592 macleod.logical.utils          INFO     Found a constant!
2023-04-01 18:45:54,593 macleod.logical.axiom          DEBUG    Unique Variables: \forall z\;[c(z,uni)]
2023-04-01 18:45:54,593 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z\;[c(z,uni)]
2023-04-01 18:45:54,594 macleod.logical.axiom          DEBUG    Term: c(z,uni)
2023-04-01 18:45:54,594 macleod.logical.axiom          DEBUG    Term: \forall z\;[c(z,uni)]
2023-04-01 18:45:54,594 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z\;[c(z,uni)]
2023-04-01 18:45:54,595 macleod.logical.axiom          DEBUG    Prenex Form: \forall z\;[c(z,uni)]
2023-04-01 18:45:54,595 macleod.logical.axiom          DEBUG    CNF Form: \forall z\;[c(z,uni)]
2023-04-01 18:45:54,596 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(~=(y,uni) -> (o(x,compl(y)) <-> ~p(x,y)))]
2023-04-01 18:45:54,598 macleod.logical.axiom          DEBUG    Adding function declaration on: compl
2023-04-01 18:45:54,600 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(~=(y,uni) -> (\forall c2\;[(o(x,c2) | ~compl(y,c2))] <-> ~p(x,y)))]
2023-04-01 18:45:54,600 macleod.logical.utils          INFO     Found a constant!
2023-04-01 18:45:54,602 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(~=(y,uni) -> (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y)))]
2023-04-01 18:45:54,605 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(~=(y,uni) -> (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y)))]
2023-04-01 18:45:54,606 macleod.logical.axiom          DEBUG    Term: compl(y,x)
2023-04-01 18:45:54,606 macleod.logical.axiom          DEBUG    Term: ~compl(y,x)
2023-04-01 18:45:54,606 macleod.logical.axiom          DEBUG    Term: o(z,x)
2023-04-01 18:45:54,606 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 18:45:54,607 macleod.logical.axiom          DEBUG    Term: (o(z,x) | ~compl(y,x))
2023-04-01 18:45:54,607 macleod.logical.connective     DEBUG    Coalesced Called: (o(z,x) | ~compl(y,x))
2023-04-01 18:45:54,607 macleod.logical.axiom          DEBUG    Coalesced Term: (o(z,x) | ~compl(y,x))
2023-04-01 18:45:54,608 macleod.logical.connective     DEBUG    Rescope Called: (o(z,x) | ~compl(y,x))
2023-04-01 18:45:54,608 macleod.logical.connective     DEBUG    No Quantifier children: (o(z,x) | ~compl(y,x))
2023-04-01 18:45:54,608 macleod.logical.axiom          DEBUG    Rescoped Term: (o(z,x) | ~compl(y,x))
2023-04-01 18:45:54,609 macleod.logical.axiom          DEBUG    Term: ~p(z,y)
2023-04-01 18:45:54,609 macleod.logical.axiom          DEBUG    Term: \forall x\;[(o(z,x) | ~compl(y,x))]
2023-04-01 18:45:54,609 macleod.logical.axiom          DEBUG    Term: =(y,uni)
2023-04-01 18:45:54,609 macleod.logical.axiom          DEBUG    Term: (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y))
2023-04-01 18:45:54,610 macleod.logical.connective     DEBUG    Coalesced Called: (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y))
2023-04-01 18:45:54,610 macleod.logical.axiom          DEBUG    Coalesced Term: (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y))
2023-04-01 18:45:54,611 macleod.logical.connective     DEBUG    Rescope Called: (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y))
2023-04-01 18:45:54,611 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:45:54,612 macleod.logical.connective     DEBUG    Rescope Called: ((o(z,x) | ~compl(y,x)) <-> ~p(z,y))
2023-04-01 18:45:54,612 macleod.logical.connective     DEBUG    No Quantifier children: ((o(z,x) | ~compl(y,x)) <-> ~p(z,y))
2023-04-01 18:45:54,612 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))]
2023-04-01 18:45:54,613 macleod.logical.axiom          DEBUG    Term: ~=(y,uni)
2023-04-01 18:45:54,613 macleod.logical.axiom          DEBUG    Term: (~=(y,uni) -> \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))])
2023-04-01 18:45:54,614 macleod.logical.connective     DEBUG    Coalesced Called: (~=(y,uni) -> \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))])
2023-04-01 18:45:54,614 macleod.logical.axiom          DEBUG    Coalesced Term: (~=(y,uni) -> \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))])
2023-04-01 18:45:54,615 macleod.logical.connective     DEBUG    Rescope Called: (~=(y,uni) -> \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))])
2023-04-01 18:45:54,615 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:45:54,616 macleod.logical.connective     DEBUG    Rescope Called: (((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))
2023-04-01 18:45:54,616 macleod.logical.connective     DEBUG    No Quantifier children: (((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))
2023-04-01 18:45:54,617 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]
2023-04-01 18:45:54,618 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\forall x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]]
2023-04-01 18:45:54,618 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\forall x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]]
2023-04-01 18:45:54,619 macleod.logical.quantifier     DEBUG    Found a matching quantifier
2023-04-01 18:45:54,620 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y,x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]
2023-04-01 18:45:54,621 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y,x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]
2023-04-01 18:45:54,623 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y,z\;[(c(x,sum(y,z)) <-> (c(x,y) | c(x,z)))]
2023-04-01 18:45:54,625 macleod.logical.axiom          DEBUG    Function Free: \forall x,y,z\;[(\forall s3\;[(c(x,s3) | ~sum(y,z,s3))] <-> (c(x,y) | c(x,z)))]
2023-04-01 18:45:54,626 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y,x\;[(\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))]
2023-04-01 18:45:54,627 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y,x\;[(\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))]
2023-04-01 18:45:54,628 macleod.logical.axiom          DEBUG    Term: sum(y,x,w)
2023-04-01 18:45:54,628 macleod.logical.axiom          DEBUG    Term: ~sum(y,x,w)
2023-04-01 18:45:54,628 macleod.logical.axiom          DEBUG    Term: c(z,w)
2023-04-01 18:45:54,628 macleod.logical.axiom          DEBUG    Term: c(z,x)
2023-04-01 18:45:54,629 macleod.logical.axiom          DEBUG    Term: c(z,y)
2023-04-01 18:45:54,629 macleod.logical.axiom          DEBUG    Term: (c(z,w) | ~sum(y,x,w))
2023-04-01 18:45:54,629 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,w) | ~sum(y,x,w))
2023-04-01 18:45:54,629 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,w) | ~sum(y,x,w))
2023-04-01 18:45:54,630 macleod.logical.connective     DEBUG    Rescope Called: (c(z,w) | ~sum(y,x,w))
2023-04-01 18:45:54,630 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,w) | ~sum(y,x,w))
2023-04-01 18:45:54,630 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,w) | ~sum(y,x,w))
2023-04-01 18:45:54,630 macleod.logical.axiom          DEBUG    Term: (c(z,y) | c(z,x))
2023-04-01 18:45:54,631 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,y) | c(z,x))
2023-04-01 18:45:54,631 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,y) | c(z,x))
2023-04-01 18:45:54,631 macleod.logical.connective     DEBUG    Rescope Called: (c(z,y) | c(z,x))
2023-04-01 18:45:54,631 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,y) | c(z,x))
2023-04-01 18:45:54,631 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,y) | c(z,x))
2023-04-01 18:45:54,632 macleod.logical.axiom          DEBUG    Term: \forall w\;[(c(z,w) | ~sum(y,x,w))]
2023-04-01 18:45:54,632 macleod.logical.axiom          DEBUG    Term: (\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))
2023-04-01 18:45:54,633 macleod.logical.connective     DEBUG    Coalesced Called: (\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))
2023-04-01 18:45:54,633 macleod.logical.axiom          DEBUG    Coalesced Term: (\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))
2023-04-01 18:45:54,634 macleod.logical.connective     DEBUG    Rescope Called: (\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))
2023-04-01 18:45:54,634 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:45:54,635 macleod.logical.connective     DEBUG    Rescope Called: ((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))
2023-04-01 18:45:54,635 macleod.logical.connective     DEBUG    No Quantifier children: ((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))
2023-04-01 18:45:54,636 macleod.logical.axiom          DEBUG    Rescoped Term: \forall w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]
2023-04-01 18:45:54,636 macleod.logical.axiom          DEBUG    Term: \forall z,y,x\;[\forall w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]]
2023-04-01 18:45:54,637 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y,x\;[\forall w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]]
2023-04-01 18:45:54,637 macleod.logical.quantifier     DEBUG    Found a matching quantifier
2023-04-01 18:45:54,638 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y,x,w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]
2023-04-01 18:45:54,639 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y,x,w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]
2023-04-01 18:45:54,640 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y,z\;[(o(y,z) -> (c(x,prod(y,z)) <-> \exists w\;[(p(w,y) & p(w,z) & c(x,w))]))]
2023-04-01 18:45:54,642 macleod.logical.axiom          DEBUG    Function Free: \forall x,y,z\;[(o(y,z) -> (\forall p4\;[(c(x,p4) | ~prod(y,z,p4))] <-> \exists w\;[(p(w,y) & p(w,z) & c(x,w))]))]
2023-04-01 18:45:54,645 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y,x\;[(o(y,x) -> (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))]))]
2023-04-01 18:45:54,647 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y,x\;[(o(y,x) -> (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))]))]
2023-04-01 18:45:54,649 macleod.logical.axiom          DEBUG    Term: prod(y,x,w)
2023-04-01 18:45:54,649 macleod.logical.axiom          DEBUG    Term: c(z,v)
2023-04-01 18:45:54,649 macleod.logical.axiom          DEBUG    Term: p(v,x)
2023-04-01 18:45:54,649 macleod.logical.axiom          DEBUG    Term: p(v,y)
2023-04-01 18:45:54,650 macleod.logical.axiom          DEBUG    Term: ~prod(y,x,w)
2023-04-01 18:45:54,650 macleod.logical.axiom          DEBUG    Term: c(z,w)
2023-04-01 18:45:54,650 macleod.logical.axiom          DEBUG    Term: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 18:45:54,651 macleod.logical.connective     DEBUG    Coalesced Called: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 18:45:54,651 macleod.logical.axiom          DEBUG    Coalesced Term: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 18:45:54,652 macleod.logical.connective     DEBUG    Rescope Called: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 18:45:54,652 macleod.logical.connective     DEBUG    No Quantifier children: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 18:45:54,652 macleod.logical.axiom          DEBUG    Rescoped Term: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 18:45:54,653 macleod.logical.axiom          DEBUG    Term: (c(z,w) | ~prod(y,x,w))
2023-04-01 18:45:54,653 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,w) | ~prod(y,x,w))
2023-04-01 18:45:54,654 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,w) | ~prod(y,x,w))
2023-04-01 18:45:54,654 macleod.logical.connective     DEBUG    Rescope Called: (c(z,w) | ~prod(y,x,w))
2023-04-01 18:45:54,654 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,w) | ~prod(y,x,w))
2023-04-01 18:45:54,655 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,w) | ~prod(y,x,w))
2023-04-01 18:45:54,655 macleod.logical.axiom          DEBUG    Term: \exists v\;[(p(v,y) & p(v,x) & c(z,v))]
2023-04-01 18:45:54,655 macleod.logical.axiom          DEBUG    Term: \forall w\;[(c(z,w) | ~prod(y,x,w))]
2023-04-01 18:45:54,656 macleod.logical.axiom          DEBUG    Term: (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))])
2023-04-01 18:45:54,656 macleod.logical.connective     DEBUG    Coalesced Called: (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))])
2023-04-01 18:45:54,656 macleod.logical.axiom          DEBUG    Coalesced Term: (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))])
2023-04-01 18:45:54,657 macleod.logical.connective     DEBUG    Rescope Called: (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))])
2023-04-01 18:47:24,886 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 18:47:24,888 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 18:47:24,890 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 18:47:24,892 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_basic.clif
2023-04-01 18:47:24,909 macleod.Ontology               INFO     Found 23 total statements in http://colore.oor.net/mereotopology/rcc_basic.clif
2023-04-01 18:50:25,694 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 18:50:25,695 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 18:50:25,696 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 18:50:25,697 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_basic.clif
2023-04-01 18:50:25,718 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(p(x,y) <-> \forall z\;[(c(z,x) -> c(z,y))])]
2023-04-01 18:50:25,719 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(p(x,y) <-> \forall z\;[(c(z,x) -> c(z,y))])]
2023-04-01 18:50:25,721 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])]
2023-04-01 18:50:25,723 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])]
2023-04-01 18:50:25,724 macleod.logical.axiom          DEBUG    Term: c(x,y)
2023-04-01 18:50:25,724 macleod.logical.axiom          DEBUG    Term: c(x,z)
2023-04-01 18:50:25,724 macleod.logical.axiom          DEBUG    Term: (c(x,z) -> c(x,y))
2023-04-01 18:50:25,725 macleod.logical.connective     DEBUG    Coalesced Called: (c(x,z) -> c(x,y))
2023-04-01 18:50:25,726 macleod.logical.axiom          DEBUG    Coalesced Term: (c(x,z) -> c(x,y))
2023-04-01 18:50:25,726 macleod.logical.connective     DEBUG    Rescope Called: (c(x,z) -> c(x,y))
2023-04-01 18:50:25,726 macleod.logical.connective     DEBUG    No Quantifier children: (c(x,z) -> c(x,y))
2023-04-01 18:50:25,727 macleod.logical.axiom          DEBUG    Rescoped Term: (c(x,z) -> c(x,y))
2023-04-01 18:50:25,727 macleod.logical.axiom          DEBUG    Term: \forall x\;[(c(x,z) -> c(x,y))]
2023-04-01 18:50:25,728 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 18:50:25,728 macleod.logical.axiom          DEBUG    Term: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-01 18:50:25,729 macleod.logical.connective     DEBUG    Coalesced Called: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-01 18:50:25,729 macleod.logical.axiom          DEBUG    Coalesced Term: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-01 18:50:25,729 macleod.logical.connective     DEBUG    Rescope Called: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-01 18:50:25,730 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:50:25,730 macleod.logical.connective     DEBUG    Rescope Called: ((c(x,z) -> c(x,y)) <-> p(z,y))
2023-04-01 18:50:25,731 macleod.logical.connective     DEBUG    No Quantifier children: ((c(x,z) -> c(x,y)) <-> p(z,y))
2023-04-01 18:50:25,732 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]
2023-04-01 18:50:25,732 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\forall x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]]
2023-04-01 18:50:25,733 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\forall x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]]
2023-04-01 18:50:25,734 macleod.logical.quantifier     DEBUG    Found a matching quantifier
2023-04-01 18:50:25,735 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y,x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]
2023-04-01 18:50:25,736 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y,x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]
2023-04-01 18:50:25,739 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(pp(x,y) <-> (p(x,y) & ~p(y,x)))]
2023-04-01 18:50:25,741 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(pp(x,y) <-> (p(x,y) & ~p(y,x)))]
2023-04-01 18:50:25,742 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:50:25,744 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:50:25,745 macleod.logical.axiom          DEBUG    Term: p(y,z)
2023-04-01 18:50:25,745 macleod.logical.axiom          DEBUG    Term: ~p(y,z)
2023-04-01 18:50:25,746 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 18:50:25,746 macleod.logical.axiom          DEBUG    Term: (p(z,y) & ~p(y,z))
2023-04-01 18:50:25,747 macleod.logical.connective     DEBUG    Coalesced Called: (p(z,y) & ~p(y,z))
2023-04-01 18:50:25,748 macleod.logical.axiom          DEBUG    Coalesced Term: (p(z,y) & ~p(y,z))
2023-04-01 18:50:25,748 macleod.logical.connective     DEBUG    Rescope Called: (p(z,y) & ~p(y,z))
2023-04-01 18:50:25,749 macleod.logical.connective     DEBUG    No Quantifier children: (p(z,y) & ~p(y,z))
2023-04-01 18:50:25,749 macleod.logical.axiom          DEBUG    Rescoped Term: (p(z,y) & ~p(y,z))
2023-04-01 18:50:25,750 macleod.logical.axiom          DEBUG    Term: pp(z,y)
2023-04-01 18:50:25,751 macleod.logical.axiom          DEBUG    Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:50:25,751 macleod.logical.connective     DEBUG    Coalesced Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:50:25,752 macleod.logical.axiom          DEBUG    Coalesced Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:50:25,752 macleod.logical.connective     DEBUG    Rescope Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:50:25,753 macleod.logical.connective     DEBUG    No Quantifier children: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:50:25,753 macleod.logical.axiom          DEBUG    Rescoped Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:50:25,754 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:50:25,755 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:50:25,756 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:50:25,757 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:50:25,758 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(o(x,y) <-> \exists z\;[(p(z,x) & p(z,y))])]
2023-04-01 18:50:25,759 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(o(x,y) <-> \exists z\;[(p(z,x) & p(z,y))])]
2023-04-01 18:50:25,760 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])]
2023-04-01 18:50:25,761 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])]
2023-04-01 18:50:25,761 macleod.logical.axiom          DEBUG    Term: p(x,y)
2023-04-01 18:50:25,762 macleod.logical.axiom          DEBUG    Term: p(x,z)
2023-04-01 18:50:25,762 macleod.logical.axiom          DEBUG    Term: (p(x,z) & p(x,y))
2023-04-01 18:50:25,762 macleod.logical.connective     DEBUG    Coalesced Called: (p(x,z) & p(x,y))
2023-04-01 18:50:25,762 macleod.logical.axiom          DEBUG    Coalesced Term: (p(x,z) & p(x,y))
2023-04-01 18:50:25,763 macleod.logical.connective     DEBUG    Rescope Called: (p(x,z) & p(x,y))
2023-04-01 18:50:25,763 macleod.logical.connective     DEBUG    No Quantifier children: (p(x,z) & p(x,y))
2023-04-01 18:50:25,763 macleod.logical.axiom          DEBUG    Rescoped Term: (p(x,z) & p(x,y))
2023-04-01 18:50:25,763 macleod.logical.axiom          DEBUG    Term: \exists x\;[(p(x,z) & p(x,y))]
2023-04-01 18:50:25,764 macleod.logical.axiom          DEBUG    Term: o(z,y)
2023-04-01 18:50:25,764 macleod.logical.axiom          DEBUG    Term: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-01 18:50:25,765 macleod.logical.connective     DEBUG    Coalesced Called: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-01 18:50:25,765 macleod.logical.axiom          DEBUG    Coalesced Term: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-01 18:50:25,766 macleod.logical.connective     DEBUG    Rescope Called: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-01 18:50:25,766 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:50:25,767 macleod.logical.connective     DEBUG    Rescope Called: ((p(x,z) & p(x,y)) <-> o(z,y))
2023-04-01 18:50:25,768 macleod.logical.connective     DEBUG    No Quantifier children: ((p(x,z) & p(x,y)) <-> o(z,y))
2023-04-01 18:50:25,769 macleod.logical.axiom          DEBUG    Rescoped Term: \exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]
2023-04-01 18:50:25,769 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-01 18:50:25,770 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-01 18:50:25,770 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-01 18:50:25,774 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-01 18:50:25,776 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(ec(x,y) <-> (c(x,y) & ~o(x,y)))]
2023-04-01 18:50:25,777 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(ec(x,y) <-> (c(x,y) & ~o(x,y)))]
2023-04-01 18:50:25,779 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:50:25,781 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:50:25,782 macleod.logical.axiom          DEBUG    Term: o(z,y)
2023-04-01 18:50:25,783 macleod.logical.axiom          DEBUG    Term: ~o(z,y)
2023-04-01 18:50:25,783 macleod.logical.axiom          DEBUG    Term: c(z,y)
2023-04-01 18:50:25,783 macleod.logical.axiom          DEBUG    Term: (c(z,y) & ~o(z,y))
2023-04-01 18:50:25,784 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,y) & ~o(z,y))
2023-04-01 18:50:25,785 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,y) & ~o(z,y))
2023-04-01 18:50:25,785 macleod.logical.connective     DEBUG    Rescope Called: (c(z,y) & ~o(z,y))
2023-04-01 18:50:25,786 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,y) & ~o(z,y))
2023-04-01 18:50:25,787 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,y) & ~o(z,y))
2023-04-01 18:50:25,788 macleod.logical.axiom          DEBUG    Term: ec(z,y)
2023-04-01 18:50:25,789 macleod.logical.axiom          DEBUG    Term: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:50:25,789 macleod.logical.connective     DEBUG    Coalesced Called: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:50:25,790 macleod.logical.axiom          DEBUG    Coalesced Term: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:50:25,790 macleod.logical.connective     DEBUG    Rescope Called: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:50:25,791 macleod.logical.connective     DEBUG    No Quantifier children: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:50:25,792 macleod.logical.axiom          DEBUG    Rescoped Term: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:50:25,792 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:50:25,793 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:50:25,793 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:50:25,796 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:50:25,798 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(ntpp(x,y) <-> (pp(x,y) & ~\exists z\;[(ec(z,x) & ec(z,y))]))]
2023-04-01 18:50:25,801 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(ntpp(x,y) <-> (pp(x,y) & ~\exists z\;[(ec(z,x) & ec(z,y))]))]
2023-04-01 18:50:25,804 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(ntpp(z,y) <-> (pp(z,y) & ~\exists x\;[(ec(x,z) & ec(x,y))]))]
2023-04-01 18:50:25,809 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(ntpp(z,y) <-> (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))]))]
2023-04-01 18:50:25,810 macleod.logical.axiom          DEBUG    Term: ec(x,y)
2023-04-01 18:50:25,811 macleod.logical.axiom          DEBUG    Term: ec(x,z)
2023-04-01 18:50:25,811 macleod.logical.axiom          DEBUG    Term: ~ec(x,y)
2023-04-01 18:50:25,812 macleod.logical.axiom          DEBUG    Term: ~ec(x,z)
2023-04-01 18:50:25,812 macleod.logical.axiom          DEBUG    Term: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:50:25,813 macleod.logical.connective     DEBUG    Coalesced Called: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:50:25,813 macleod.logical.axiom          DEBUG    Coalesced Term: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:50:25,814 macleod.logical.connective     DEBUG    Rescope Called: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:50:25,815 macleod.logical.connective     DEBUG    No Quantifier children: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:50:25,816 macleod.logical.axiom          DEBUG    Rescoped Term: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:50:25,816 macleod.logical.axiom          DEBUG    Term: \forall x\;[(~ec(x,z) | ~ec(x,y))]
2023-04-01 18:50:25,817 macleod.logical.axiom          DEBUG    Term: pp(z,y)
2023-04-01 18:50:25,817 macleod.logical.axiom          DEBUG    Term: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-01 18:50:25,818 macleod.logical.connective     DEBUG    Coalesced Called: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-01 18:50:25,819 macleod.logical.axiom          DEBUG    Coalesced Term: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-01 18:50:25,820 macleod.logical.connective     DEBUG    Rescope Called: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-01 18:50:25,820 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:50:25,821 macleod.logical.connective     DEBUG    Rescope Called: ((~ec(x,z) | ~ec(x,y)) & pp(z,y))
2023-04-01 18:50:25,822 macleod.logical.connective     DEBUG    No Quantifier children: ((~ec(x,z) | ~ec(x,y)) & pp(z,y))
2023-04-01 18:50:25,822 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))]
2023-04-01 18:50:25,823 macleod.logical.axiom          DEBUG    Term: ntpp(z,y)
2023-04-01 18:50:25,824 macleod.logical.axiom          DEBUG    Term: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-01 18:50:25,825 macleod.logical.connective     DEBUG    Coalesced Called: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-01 18:50:25,825 macleod.logical.axiom          DEBUG    Coalesced Term: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-01 18:50:25,826 macleod.logical.connective     DEBUG    Rescope Called: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-01 18:50:25,826 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:50:25,828 macleod.logical.connective     DEBUG    Rescope Called: (((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))
2023-04-01 18:50:25,828 macleod.logical.connective     DEBUG    No Quantifier children: (((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))
2023-04-01 18:50:25,829 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]
2023-04-01 18:50:25,830 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\forall x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]]
2023-04-01 18:50:25,830 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\forall x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]]
2023-04-01 18:50:25,831 macleod.logical.quantifier     DEBUG    Found a matching quantifier
2023-04-01 18:50:25,833 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y,x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]
2023-04-01 18:50:25,835 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y,x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]
2023-04-01 18:50:25,838 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x\;[c(x,x)]
2023-04-01 18:50:25,838 macleod.logical.axiom          DEBUG    Function Free: \forall x\;[c(x,x)]
2023-04-01 18:50:25,839 macleod.logical.axiom          DEBUG    Unique Variables: \forall z\;[c(z,z)]
2023-04-01 18:50:25,840 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z\;[c(z,z)]
2023-04-01 18:50:25,840 macleod.logical.axiom          DEBUG    Term: c(z,z)
2023-04-01 18:50:25,841 macleod.logical.axiom          DEBUG    Term: \forall z\;[c(z,z)]
2023-04-01 18:50:25,841 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z\;[c(z,z)]
2023-04-01 18:50:25,842 macleod.logical.axiom          DEBUG    Prenex Form: \forall z\;[c(z,z)]
2023-04-01 18:50:25,842 macleod.logical.axiom          DEBUG    CNF Form: \forall z\;[c(z,z)]
2023-04-01 18:50:25,844 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(c(x,y) -> c(y,x))]
2023-04-01 18:50:25,845 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(c(x,y) -> c(y,x))]
2023-04-01 18:50:25,845 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:50:25,846 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:50:25,847 macleod.logical.axiom          DEBUG    Term: c(y,z)
2023-04-01 18:50:25,847 macleod.logical.axiom          DEBUG    Term: c(z,y)
2023-04-01 18:50:25,847 macleod.logical.axiom          DEBUG    Term: (c(z,y) -> c(y,z))
2023-04-01 18:50:25,847 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,y) -> c(y,z))
2023-04-01 18:50:25,848 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,y) -> c(y,z))
2023-04-01 18:50:25,848 macleod.logical.connective     DEBUG    Rescope Called: (c(z,y) -> c(y,z))
2023-04-01 18:50:25,848 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,y) -> c(y,z))
2023-04-01 18:50:25,848 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,y) -> c(y,z))
2023-04-01 18:50:25,849 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:50:25,849 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:50:25,849 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:50:25,851 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:50:25,852 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x\;[c(x,uni)]
2023-04-01 18:50:25,852 macleod.logical.axiom          DEBUG    Function Free: \forall x\;[c(x,uni)]
2023-04-01 18:50:25,853 macleod.logical.utils          INFO     Found a constant!
2023-04-01 18:50:25,853 macleod.logical.axiom          DEBUG    Unique Variables: \forall z\;[c(z,uni)]
2023-04-01 18:50:25,854 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z\;[c(z,uni)]
2023-04-01 18:50:25,854 macleod.logical.axiom          DEBUG    Term: c(z,uni)
2023-04-01 18:50:25,854 macleod.logical.axiom          DEBUG    Term: \forall z\;[c(z,uni)]
2023-04-01 18:50:25,854 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z\;[c(z,uni)]
2023-04-01 18:50:25,855 macleod.logical.axiom          DEBUG    Prenex Form: \forall z\;[c(z,uni)]
2023-04-01 18:50:25,856 macleod.logical.axiom          DEBUG    CNF Form: \forall z\;[c(z,uni)]
2023-04-01 18:50:25,857 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(~=(y,uni) -> (o(x,compl(y)) <-> ~p(x,y)))]
2023-04-01 18:50:25,859 macleod.logical.axiom          DEBUG    Adding function declaration on: compl
2023-04-01 18:50:25,861 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(~=(y,uni) -> (\forall c2\;[(o(x,c2) | ~compl(y,c2))] <-> ~p(x,y)))]
2023-04-01 18:50:25,862 macleod.logical.utils          INFO     Found a constant!
2023-04-01 18:50:25,863 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(~=(y,uni) -> (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y)))]
2023-04-01 18:50:25,865 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(~=(y,uni) -> (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y)))]
2023-04-01 18:50:25,866 macleod.logical.axiom          DEBUG    Term: compl(y,x)
2023-04-01 18:50:25,866 macleod.logical.axiom          DEBUG    Term: ~compl(y,x)
2023-04-01 18:50:25,867 macleod.logical.axiom          DEBUG    Term: o(z,x)
2023-04-01 18:50:25,867 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 18:50:25,867 macleod.logical.axiom          DEBUG    Term: (o(z,x) | ~compl(y,x))
2023-04-01 18:50:25,868 macleod.logical.connective     DEBUG    Coalesced Called: (o(z,x) | ~compl(y,x))
2023-04-01 18:50:25,868 macleod.logical.axiom          DEBUG    Coalesced Term: (o(z,x) | ~compl(y,x))
2023-04-01 18:50:25,869 macleod.logical.connective     DEBUG    Rescope Called: (o(z,x) | ~compl(y,x))
2023-04-01 18:50:25,869 macleod.logical.connective     DEBUG    No Quantifier children: (o(z,x) | ~compl(y,x))
2023-04-01 18:50:25,869 macleod.logical.axiom          DEBUG    Rescoped Term: (o(z,x) | ~compl(y,x))
2023-04-01 18:50:25,869 macleod.logical.axiom          DEBUG    Term: ~p(z,y)
2023-04-01 18:50:25,870 macleod.logical.axiom          DEBUG    Term: \forall x\;[(o(z,x) | ~compl(y,x))]
2023-04-01 18:50:25,870 macleod.logical.axiom          DEBUG    Term: =(y,uni)
2023-04-01 18:50:25,870 macleod.logical.axiom          DEBUG    Term: (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y))
2023-04-01 18:50:25,871 macleod.logical.connective     DEBUG    Coalesced Called: (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y))
2023-04-01 18:50:25,872 macleod.logical.axiom          DEBUG    Coalesced Term: (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y))
2023-04-01 18:50:25,872 macleod.logical.connective     DEBUG    Rescope Called: (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y))
2023-04-01 18:50:25,873 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:50:25,873 macleod.logical.connective     DEBUG    Rescope Called: ((o(z,x) | ~compl(y,x)) <-> ~p(z,y))
2023-04-01 18:50:25,874 macleod.logical.connective     DEBUG    No Quantifier children: ((o(z,x) | ~compl(y,x)) <-> ~p(z,y))
2023-04-01 18:50:25,874 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))]
2023-04-01 18:50:25,875 macleod.logical.axiom          DEBUG    Term: ~=(y,uni)
2023-04-01 18:50:25,875 macleod.logical.axiom          DEBUG    Term: (~=(y,uni) -> \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))])
2023-04-01 18:50:25,876 macleod.logical.connective     DEBUG    Coalesced Called: (~=(y,uni) -> \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))])
2023-04-01 18:50:25,876 macleod.logical.axiom          DEBUG    Coalesced Term: (~=(y,uni) -> \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))])
2023-04-01 18:50:25,876 macleod.logical.connective     DEBUG    Rescope Called: (~=(y,uni) -> \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))])
2023-04-01 18:50:25,877 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:50:25,877 macleod.logical.connective     DEBUG    Rescope Called: (((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))
2023-04-01 18:50:25,878 macleod.logical.connective     DEBUG    No Quantifier children: (((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))
2023-04-01 18:50:25,878 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]
2023-04-01 18:50:25,879 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\forall x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]]
2023-04-01 18:50:25,879 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\forall x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]]
2023-04-01 18:50:25,880 macleod.logical.quantifier     DEBUG    Found a matching quantifier
2023-04-01 18:50:25,880 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y,x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]
2023-04-01 18:50:25,882 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y,x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]
2023-04-01 18:50:25,883 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y,z\;[(c(x,sum(y,z)) <-> (c(x,y) | c(x,z)))]
2023-04-01 18:50:25,885 macleod.logical.axiom          DEBUG    Function Free: \forall x,y,z\;[(\forall s3\;[(c(x,s3) | ~sum(y,z,s3))] <-> (c(x,y) | c(x,z)))]
2023-04-01 18:50:25,886 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y,x\;[(\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))]
2023-04-01 18:50:25,889 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y,x\;[(\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))]
2023-04-01 18:50:25,889 macleod.logical.axiom          DEBUG    Term: sum(y,x,w)
2023-04-01 18:50:25,890 macleod.logical.axiom          DEBUG    Term: ~sum(y,x,w)
2023-04-01 18:50:25,890 macleod.logical.axiom          DEBUG    Term: c(z,w)
2023-04-01 18:50:25,890 macleod.logical.axiom          DEBUG    Term: c(z,x)
2023-04-01 18:50:25,890 macleod.logical.axiom          DEBUG    Term: c(z,y)
2023-04-01 18:50:25,890 macleod.logical.axiom          DEBUG    Term: (c(z,w) | ~sum(y,x,w))
2023-04-01 18:50:25,891 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,w) | ~sum(y,x,w))
2023-04-01 18:50:25,891 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,w) | ~sum(y,x,w))
2023-04-01 18:50:25,891 macleod.logical.connective     DEBUG    Rescope Called: (c(z,w) | ~sum(y,x,w))
2023-04-01 18:50:25,892 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,w) | ~sum(y,x,w))
2023-04-01 18:50:25,892 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,w) | ~sum(y,x,w))
2023-04-01 18:50:25,892 macleod.logical.axiom          DEBUG    Term: (c(z,y) | c(z,x))
2023-04-01 18:50:25,893 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,y) | c(z,x))
2023-04-01 18:50:25,893 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,y) | c(z,x))
2023-04-01 18:50:25,893 macleod.logical.connective     DEBUG    Rescope Called: (c(z,y) | c(z,x))
2023-04-01 18:50:25,893 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,y) | c(z,x))
2023-04-01 18:50:25,894 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,y) | c(z,x))
2023-04-01 18:50:25,894 macleod.logical.axiom          DEBUG    Term: \forall w\;[(c(z,w) | ~sum(y,x,w))]
2023-04-01 18:50:25,894 macleod.logical.axiom          DEBUG    Term: (\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))
2023-04-01 18:50:25,895 macleod.logical.connective     DEBUG    Coalesced Called: (\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))
2023-04-01 18:50:25,895 macleod.logical.axiom          DEBUG    Coalesced Term: (\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))
2023-04-01 18:50:25,895 macleod.logical.connective     DEBUG    Rescope Called: (\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))
2023-04-01 18:50:25,895 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:50:25,896 macleod.logical.connective     DEBUG    Rescope Called: ((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))
2023-04-01 18:50:25,896 macleod.logical.connective     DEBUG    No Quantifier children: ((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))
2023-04-01 18:50:25,897 macleod.logical.axiom          DEBUG    Rescoped Term: \forall w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]
2023-04-01 18:50:25,897 macleod.logical.axiom          DEBUG    Term: \forall z,y,x\;[\forall w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]]
2023-04-01 18:50:25,898 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y,x\;[\forall w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]]
2023-04-01 18:50:25,898 macleod.logical.quantifier     DEBUG    Found a matching quantifier
2023-04-01 18:50:25,899 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y,x,w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]
2023-04-01 18:50:25,900 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y,x,w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]
2023-04-01 18:50:25,902 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y,z\;[(o(y,z) -> (c(x,prod(y,z)) <-> \exists w\;[(p(w,y) & p(w,z) & c(x,w))]))]
2023-04-01 18:50:25,905 macleod.logical.axiom          DEBUG    Function Free: \forall x,y,z\;[(o(y,z) -> (\forall p4\;[(c(x,p4) | ~prod(y,z,p4))] <-> \exists w\;[(p(w,y) & p(w,z) & c(x,w))]))]
2023-04-01 18:50:25,908 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y,x\;[(o(y,x) -> (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))]))]
2023-04-01 18:50:25,910 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y,x\;[(o(y,x) -> (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))]))]
2023-04-01 18:50:25,911 macleod.logical.axiom          DEBUG    Term: prod(y,x,w)
2023-04-01 18:50:25,911 macleod.logical.axiom          DEBUG    Term: c(z,v)
2023-04-01 18:50:25,912 macleod.logical.axiom          DEBUG    Term: p(v,x)
2023-04-01 18:50:25,912 macleod.logical.axiom          DEBUG    Term: p(v,y)
2023-04-01 18:50:25,912 macleod.logical.axiom          DEBUG    Term: ~prod(y,x,w)
2023-04-01 18:50:25,912 macleod.logical.axiom          DEBUG    Term: c(z,w)
2023-04-01 18:50:25,912 macleod.logical.axiom          DEBUG    Term: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 18:50:25,913 macleod.logical.connective     DEBUG    Coalesced Called: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 18:50:25,913 macleod.logical.axiom          DEBUG    Coalesced Term: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 18:50:25,913 macleod.logical.connective     DEBUG    Rescope Called: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 18:50:25,913 macleod.logical.connective     DEBUG    No Quantifier children: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 18:50:25,914 macleod.logical.axiom          DEBUG    Rescoped Term: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 18:50:25,914 macleod.logical.axiom          DEBUG    Term: (c(z,w) | ~prod(y,x,w))
2023-04-01 18:50:25,914 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,w) | ~prod(y,x,w))
2023-04-01 18:50:25,915 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,w) | ~prod(y,x,w))
2023-04-01 18:50:25,915 macleod.logical.connective     DEBUG    Rescope Called: (c(z,w) | ~prod(y,x,w))
2023-04-01 18:50:25,915 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,w) | ~prod(y,x,w))
2023-04-01 18:50:25,916 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,w) | ~prod(y,x,w))
2023-04-01 18:50:25,916 macleod.logical.axiom          DEBUG    Term: \exists v\;[(p(v,y) & p(v,x) & c(z,v))]
2023-04-01 18:50:25,917 macleod.logical.axiom          DEBUG    Term: \forall w\;[(c(z,w) | ~prod(y,x,w))]
2023-04-01 18:50:25,917 macleod.logical.axiom          DEBUG    Term: (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))])
2023-04-01 18:50:25,918 macleod.logical.connective     DEBUG    Coalesced Called: (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))])
2023-04-01 18:50:25,918 macleod.logical.axiom          DEBUG    Coalesced Term: (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))])
2023-04-01 18:50:25,918 macleod.logical.connective     DEBUG    Rescope Called: (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))])
2023-04-01 18:51:28,750 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 18:51:28,751 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 18:51:28,752 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 18:51:28,753 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_basic.clif
2023-04-01 18:51:28,774 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(p(x,y) <-> \forall z\;[(c(z,x) -> c(z,y))])]
2023-04-01 18:51:28,775 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(p(x,y) <-> \forall z\;[(c(z,x) -> c(z,y))])]
2023-04-01 18:51:28,776 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])]
2023-04-01 18:51:28,778 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])]
2023-04-01 18:51:28,779 macleod.logical.axiom          DEBUG    Term: c(x,y)
2023-04-01 18:51:28,779 macleod.logical.axiom          DEBUG    Term: c(x,z)
2023-04-01 18:51:28,779 macleod.logical.axiom          DEBUG    Term: (c(x,z) -> c(x,y))
2023-04-01 18:51:37,344 macleod.logical.connective     DEBUG    Coalesced Called: (c(x,z) -> c(x,y))
2023-04-01 18:51:37,345 macleod.logical.axiom          DEBUG    Coalesced Term: (c(x,z) -> c(x,y))
2023-04-01 18:51:37,345 macleod.logical.connective     DEBUG    Rescope Called: (c(x,z) -> c(x,y))
2023-04-01 18:51:37,346 macleod.logical.connective     DEBUG    No Quantifier children: (c(x,z) -> c(x,y))
2023-04-01 18:51:37,346 macleod.logical.axiom          DEBUG    Rescoped Term: (c(x,z) -> c(x,y))
2023-04-01 18:51:37,347 macleod.logical.axiom          DEBUG    Term: \forall x\;[(c(x,z) -> c(x,y))]
2023-04-01 18:51:37,347 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 18:51:37,347 macleod.logical.axiom          DEBUG    Term: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-01 18:51:43,111 macleod.logical.connective     DEBUG    Coalesced Called: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-01 18:51:43,112 macleod.logical.axiom          DEBUG    Coalesced Term: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-01 18:51:43,113 macleod.logical.connective     DEBUG    Rescope Called: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-01 18:51:43,115 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:51:43,116 macleod.logical.connective     DEBUG    Rescope Called: ((c(x,z) -> c(x,y)) <-> p(z,y))
2023-04-01 18:51:43,117 macleod.logical.connective     DEBUG    No Quantifier children: ((c(x,z) -> c(x,y)) <-> p(z,y))
2023-04-01 18:51:43,118 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]
2023-04-01 18:51:43,119 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\forall x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]]
2023-04-01 18:51:43,119 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\forall x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]]
2023-04-01 18:51:43,120 macleod.logical.quantifier     DEBUG    Found a matching quantifier
2023-04-01 18:51:43,121 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y,x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]
2023-04-01 18:51:43,123 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y,x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]
2023-04-01 18:51:43,124 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(pp(x,y) <-> (p(x,y) & ~p(y,x)))]
2023-04-01 18:51:43,126 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(pp(x,y) <-> (p(x,y) & ~p(y,x)))]
2023-04-01 18:51:43,127 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:51:43,129 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:51:43,129 macleod.logical.axiom          DEBUG    Term: p(y,z)
2023-04-01 18:51:43,130 macleod.logical.axiom          DEBUG    Term: ~p(y,z)
2023-04-01 18:51:43,130 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 18:51:43,130 macleod.logical.axiom          DEBUG    Term: (p(z,y) & ~p(y,z))
2023-04-01 18:51:47,188 macleod.logical.connective     DEBUG    Coalesced Called: (p(z,y) & ~p(y,z))
2023-04-01 18:51:47,188 macleod.logical.axiom          DEBUG    Coalesced Term: (p(z,y) & ~p(y,z))
2023-04-01 18:51:47,190 macleod.logical.connective     DEBUG    Rescope Called: (p(z,y) & ~p(y,z))
2023-04-01 18:51:47,190 macleod.logical.connective     DEBUG    No Quantifier children: (p(z,y) & ~p(y,z))
2023-04-01 18:51:47,190 macleod.logical.axiom          DEBUG    Rescoped Term: (p(z,y) & ~p(y,z))
2023-04-01 18:51:47,191 macleod.logical.axiom          DEBUG    Term: pp(z,y)
2023-04-01 18:51:47,192 macleod.logical.axiom          DEBUG    Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:51:52,842 macleod.logical.connective     DEBUG    Coalesced Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:51:52,843 macleod.logical.axiom          DEBUG    Coalesced Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:51:52,843 macleod.logical.connective     DEBUG    Rescope Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:51:52,844 macleod.logical.connective     DEBUG    No Quantifier children: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:51:52,845 macleod.logical.axiom          DEBUG    Rescoped Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 18:51:52,845 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:51:52,845 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:51:52,846 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:51:52,848 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 18:51:52,849 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(o(x,y) <-> \exists z\;[(p(z,x) & p(z,y))])]
2023-04-01 18:51:52,851 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(o(x,y) <-> \exists z\;[(p(z,x) & p(z,y))])]
2023-04-01 18:51:52,853 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])]
2023-04-01 18:51:52,854 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])]
2023-04-01 18:51:52,855 macleod.logical.axiom          DEBUG    Term: p(x,y)
2023-04-01 18:51:52,855 macleod.logical.axiom          DEBUG    Term: p(x,z)
2023-04-01 18:51:52,856 macleod.logical.axiom          DEBUG    Term: (p(x,z) & p(x,y))
2023-04-01 18:51:55,163 macleod.logical.connective     DEBUG    Coalesced Called: (p(x,z) & p(x,y))
2023-04-01 18:51:55,163 macleod.logical.axiom          DEBUG    Coalesced Term: (p(x,z) & p(x,y))
2023-04-01 18:51:55,163 macleod.logical.connective     DEBUG    Rescope Called: (p(x,z) & p(x,y))
2023-04-01 18:51:55,163 macleod.logical.connective     DEBUG    No Quantifier children: (p(x,z) & p(x,y))
2023-04-01 18:51:55,163 macleod.logical.axiom          DEBUG    Rescoped Term: (p(x,z) & p(x,y))
2023-04-01 18:51:55,163 macleod.logical.axiom          DEBUG    Term: \exists x\;[(p(x,z) & p(x,y))]
2023-04-01 18:51:55,163 macleod.logical.axiom          DEBUG    Term: o(z,y)
2023-04-01 18:51:55,163 macleod.logical.axiom          DEBUG    Term: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-01 18:52:00,234 macleod.logical.connective     DEBUG    Coalesced Called: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-01 18:52:00,235 macleod.logical.axiom          DEBUG    Coalesced Term: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-01 18:52:00,236 macleod.logical.connective     DEBUG    Rescope Called: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-01 18:52:00,237 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:52:00,238 macleod.logical.connective     DEBUG    Rescope Called: ((p(x,z) & p(x,y)) <-> o(z,y))
2023-04-01 18:52:00,238 macleod.logical.connective     DEBUG    No Quantifier children: ((p(x,z) & p(x,y)) <-> o(z,y))
2023-04-01 18:52:00,239 macleod.logical.axiom          DEBUG    Rescoped Term: \exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]
2023-04-01 18:52:00,240 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-01 18:52:00,240 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-01 18:52:00,241 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-01 18:52:00,244 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-01 18:52:00,245 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(ec(x,y) <-> (c(x,y) & ~o(x,y)))]
2023-04-01 18:52:00,247 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(ec(x,y) <-> (c(x,y) & ~o(x,y)))]
2023-04-01 18:52:00,249 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:52:00,250 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:52:00,251 macleod.logical.axiom          DEBUG    Term: o(z,y)
2023-04-01 18:52:00,251 macleod.logical.axiom          DEBUG    Term: ~o(z,y)
2023-04-01 18:52:00,252 macleod.logical.axiom          DEBUG    Term: c(z,y)
2023-04-01 18:52:00,252 macleod.logical.axiom          DEBUG    Term: (c(z,y) & ~o(z,y))
2023-04-01 18:52:03,685 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,y) & ~o(z,y))
2023-04-01 18:52:03,686 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,y) & ~o(z,y))
2023-04-01 18:52:03,687 macleod.logical.connective     DEBUG    Rescope Called: (c(z,y) & ~o(z,y))
2023-04-01 18:52:03,688 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,y) & ~o(z,y))
2023-04-01 18:52:03,688 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,y) & ~o(z,y))
2023-04-01 18:52:03,689 macleod.logical.axiom          DEBUG    Term: ec(z,y)
2023-04-01 18:52:03,690 macleod.logical.axiom          DEBUG    Term: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:52:05,835 macleod.logical.connective     DEBUG    Coalesced Called: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:52:05,835 macleod.logical.axiom          DEBUG    Coalesced Term: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:52:05,837 macleod.logical.connective     DEBUG    Rescope Called: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:52:05,837 macleod.logical.connective     DEBUG    No Quantifier children: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:52:05,838 macleod.logical.axiom          DEBUG    Rescoped Term: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 18:52:05,838 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:52:05,839 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:52:05,840 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:52:05,842 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 18:52:05,843 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(ntpp(x,y) <-> (pp(x,y) & ~\exists z\;[(ec(z,x) & ec(z,y))]))]
2023-04-01 18:52:05,879 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(ntpp(x,y) <-> (pp(x,y) & ~\exists z\;[(ec(z,x) & ec(z,y))]))]
2023-04-01 18:52:05,883 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(ntpp(z,y) <-> (pp(z,y) & ~\exists x\;[(ec(x,z) & ec(x,y))]))]
2023-04-01 18:52:05,887 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(ntpp(z,y) <-> (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))]))]
2023-04-01 18:52:05,890 macleod.logical.axiom          DEBUG    Term: ec(x,y)
2023-04-01 18:52:05,890 macleod.logical.axiom          DEBUG    Term: ec(x,z)
2023-04-01 18:52:05,891 macleod.logical.axiom          DEBUG    Term: ~ec(x,y)
2023-04-01 18:52:05,892 macleod.logical.axiom          DEBUG    Term: ~ec(x,z)
2023-04-01 18:52:05,892 macleod.logical.axiom          DEBUG    Term: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:52:08,976 macleod.logical.connective     DEBUG    Coalesced Called: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:52:08,977 macleod.logical.axiom          DEBUG    Coalesced Term: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:52:08,977 macleod.logical.connective     DEBUG    Rescope Called: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:52:08,977 macleod.logical.connective     DEBUG    No Quantifier children: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:52:08,979 macleod.logical.axiom          DEBUG    Rescoped Term: (~ec(x,z) | ~ec(x,y))
2023-04-01 18:52:08,980 macleod.logical.axiom          DEBUG    Term: \forall x\;[(~ec(x,z) | ~ec(x,y))]
2023-04-01 18:52:08,980 macleod.logical.axiom          DEBUG    Term: pp(z,y)
2023-04-01 18:52:08,981 macleod.logical.axiom          DEBUG    Term: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-01 18:52:12,288 macleod.logical.connective     DEBUG    Coalesced Called: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-01 18:52:12,289 macleod.logical.axiom          DEBUG    Coalesced Term: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-01 18:52:12,290 macleod.logical.connective     DEBUG    Rescope Called: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-01 18:52:12,290 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:52:12,291 macleod.logical.connective     DEBUG    Rescope Called: ((~ec(x,z) | ~ec(x,y)) & pp(z,y))
2023-04-01 18:52:12,292 macleod.logical.connective     DEBUG    No Quantifier children: ((~ec(x,z) | ~ec(x,y)) & pp(z,y))
2023-04-01 18:52:12,293 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))]
2023-04-01 18:52:12,293 macleod.logical.axiom          DEBUG    Term: ntpp(z,y)
2023-04-01 18:52:12,294 macleod.logical.axiom          DEBUG    Term: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-01 18:52:24,262 macleod.logical.connective     DEBUG    Coalesced Called: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-01 18:52:24,263 macleod.logical.axiom          DEBUG    Coalesced Term: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-01 18:52:24,263 macleod.logical.connective     DEBUG    Rescope Called: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-01 18:52:24,264 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:52:24,266 macleod.logical.connective     DEBUG    Rescope Called: (((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))
2023-04-01 18:52:24,266 macleod.logical.connective     DEBUG    No Quantifier children: (((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))
2023-04-01 18:52:24,267 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]
2023-04-01 18:52:24,268 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\forall x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]]
2023-04-01 18:52:24,269 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\forall x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]]
2023-04-01 18:52:24,270 macleod.logical.quantifier     DEBUG    Found a matching quantifier
2023-04-01 18:52:24,271 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y,x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]
2023-04-01 18:52:24,273 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y,x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]
2023-04-01 18:52:24,275 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x\;[c(x,x)]
2023-04-01 18:52:24,276 macleod.logical.axiom          DEBUG    Function Free: \forall x\;[c(x,x)]
2023-04-01 18:52:24,277 macleod.logical.axiom          DEBUG    Unique Variables: \forall z\;[c(z,z)]
2023-04-01 18:52:24,278 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z\;[c(z,z)]
2023-04-01 18:52:24,278 macleod.logical.axiom          DEBUG    Term: c(z,z)
2023-04-01 18:52:24,279 macleod.logical.axiom          DEBUG    Term: \forall z\;[c(z,z)]
2023-04-01 18:52:24,279 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z\;[c(z,z)]
2023-04-01 18:52:24,279 macleod.logical.axiom          DEBUG    Prenex Form: \forall z\;[c(z,z)]
2023-04-01 18:52:24,280 macleod.logical.axiom          DEBUG    CNF Form: \forall z\;[c(z,z)]
2023-04-01 18:52:24,281 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(c(x,y) -> c(y,x))]
2023-04-01 18:52:24,282 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(c(x,y) -> c(y,x))]
2023-04-01 18:52:24,283 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:52:24,284 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:52:24,285 macleod.logical.axiom          DEBUG    Term: c(y,z)
2023-04-01 18:52:24,285 macleod.logical.axiom          DEBUG    Term: c(z,y)
2023-04-01 18:52:24,286 macleod.logical.axiom          DEBUG    Term: (c(z,y) -> c(y,z))
2023-04-01 18:52:31,874 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,y) -> c(y,z))
2023-04-01 18:52:31,875 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,y) -> c(y,z))
2023-04-01 18:52:33,617 macleod.logical.connective     DEBUG    Rescope Called: (c(z,y) -> c(y,z))
2023-04-01 18:52:33,618 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,y) -> c(y,z))
2023-04-01 18:52:33,618 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,y) -> c(y,z))
2023-04-01 18:52:33,619 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:52:33,620 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:52:33,621 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:52:33,622 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 18:52:33,624 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x\;[c(x,uni)]
2023-04-01 18:52:33,625 macleod.logical.axiom          DEBUG    Function Free: \forall x\;[c(x,uni)]
2023-04-01 18:52:33,626 macleod.logical.utils          INFO     Found a constant!
2023-04-01 18:52:33,626 macleod.logical.axiom          DEBUG    Unique Variables: \forall z\;[c(z,uni)]
2023-04-01 18:52:33,627 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z\;[c(z,uni)]
2023-04-01 18:52:33,628 macleod.logical.axiom          DEBUG    Term: c(z,uni)
2023-04-01 18:52:33,628 macleod.logical.axiom          DEBUG    Term: \forall z\;[c(z,uni)]
2023-04-01 18:52:33,628 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z\;[c(z,uni)]
2023-04-01 18:52:33,629 macleod.logical.axiom          DEBUG    Prenex Form: \forall z\;[c(z,uni)]
2023-04-01 18:52:33,630 macleod.logical.axiom          DEBUG    CNF Form: \forall z\;[c(z,uni)]
2023-04-01 18:52:33,631 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(~=(y,uni) -> (o(x,compl(y)) <-> ~p(x,y)))]
2023-04-01 18:52:33,634 macleod.logical.axiom          DEBUG    Adding function declaration on: compl
2023-04-01 18:52:33,637 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(~=(y,uni) -> (\forall c2\;[(o(x,c2) | ~compl(y,c2))] <-> ~p(x,y)))]
2023-04-01 18:52:33,638 macleod.logical.utils          INFO     Found a constant!
2023-04-01 18:52:33,640 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(~=(y,uni) -> (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y)))]
2023-04-01 18:52:33,643 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(~=(y,uni) -> (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y)))]
2023-04-01 18:52:33,644 macleod.logical.axiom          DEBUG    Term: compl(y,x)
2023-04-01 18:52:33,644 macleod.logical.axiom          DEBUG    Term: ~compl(y,x)
2023-04-01 18:52:33,644 macleod.logical.axiom          DEBUG    Term: o(z,x)
2023-04-01 18:52:33,644 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 18:52:33,645 macleod.logical.axiom          DEBUG    Term: (o(z,x) | ~compl(y,x))
2023-04-01 18:52:35,411 macleod.logical.connective     DEBUG    Coalesced Called: (o(z,x) | ~compl(y,x))
2023-04-01 18:52:35,412 macleod.logical.axiom          DEBUG    Coalesced Term: (o(z,x) | ~compl(y,x))
2023-04-01 18:52:36,502 macleod.logical.connective     DEBUG    Rescope Called: (o(z,x) | ~compl(y,x))
2023-04-01 18:52:36,503 macleod.logical.connective     DEBUG    No Quantifier children: (o(z,x) | ~compl(y,x))
2023-04-01 18:52:36,504 macleod.logical.axiom          DEBUG    Rescoped Term: (o(z,x) | ~compl(y,x))
2023-04-01 18:52:36,505 macleod.logical.axiom          DEBUG    Term: ~p(z,y)
2023-04-01 18:52:36,506 macleod.logical.axiom          DEBUG    Term: \forall x\;[(o(z,x) | ~compl(y,x))]
2023-04-01 18:52:36,506 macleod.logical.axiom          DEBUG    Term: =(y,uni)
2023-04-01 18:52:36,507 macleod.logical.axiom          DEBUG    Term: (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y))
2023-04-01 18:52:37,837 macleod.logical.connective     DEBUG    Coalesced Called: (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y))
2023-04-01 18:52:37,838 macleod.logical.axiom          DEBUG    Coalesced Term: (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y))
2023-04-01 18:52:38,972 macleod.logical.connective     DEBUG    Rescope Called: (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y))
2023-04-01 18:52:38,973 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:52:38,974 macleod.logical.connective     DEBUG    Rescope Called: ((o(z,x) | ~compl(y,x)) <-> ~p(z,y))
2023-04-01 18:52:38,975 macleod.logical.connective     DEBUG    No Quantifier children: ((o(z,x) | ~compl(y,x)) <-> ~p(z,y))
2023-04-01 18:52:38,975 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))]
2023-04-01 18:52:38,976 macleod.logical.axiom          DEBUG    Term: ~=(y,uni)
2023-04-01 18:52:38,977 macleod.logical.axiom          DEBUG    Term: (~=(y,uni) -> \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))])
2023-04-01 18:52:39,981 macleod.logical.connective     DEBUG    Coalesced Called: (~=(y,uni) -> \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))])
2023-04-01 18:52:39,982 macleod.logical.axiom          DEBUG    Coalesced Term: (~=(y,uni) -> \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))])
2023-04-01 18:52:42,157 macleod.logical.connective     DEBUG    Rescope Called: (~=(y,uni) -> \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))])
2023-04-01 18:52:42,158 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:52:42,160 macleod.logical.connective     DEBUG    Rescope Called: (((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))
2023-04-01 18:52:42,161 macleod.logical.connective     DEBUG    No Quantifier children: (((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))
2023-04-01 18:52:42,163 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]
2023-04-01 18:52:42,164 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\forall x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]]
2023-04-01 18:52:42,165 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\forall x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]]
2023-04-01 18:52:42,166 macleod.logical.quantifier     DEBUG    Found a matching quantifier
2023-04-01 18:52:42,167 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y,x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]
2023-04-01 18:52:42,171 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y,x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]
2023-04-01 18:52:42,172 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y,z\;[(c(x,sum(y,z)) <-> (c(x,y) | c(x,z)))]
2023-04-01 18:52:42,175 macleod.logical.axiom          DEBUG    Function Free: \forall x,y,z\;[(\forall s3\;[(c(x,s3) | ~sum(y,z,s3))] <-> (c(x,y) | c(x,z)))]
2023-04-01 18:52:42,178 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y,x\;[(\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))]
2023-04-01 18:52:42,180 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y,x\;[(\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))]
2023-04-01 18:52:42,181 macleod.logical.axiom          DEBUG    Term: sum(y,x,w)
2023-04-01 18:52:42,182 macleod.logical.axiom          DEBUG    Term: ~sum(y,x,w)
2023-04-01 18:52:42,182 macleod.logical.axiom          DEBUG    Term: c(z,w)
2023-04-01 18:52:42,182 macleod.logical.axiom          DEBUG    Term: c(z,x)
2023-04-01 18:52:42,183 macleod.logical.axiom          DEBUG    Term: c(z,y)
2023-04-01 18:52:42,183 macleod.logical.axiom          DEBUG    Term: (c(z,w) | ~sum(y,x,w))
2023-04-01 18:52:44,214 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,w) | ~sum(y,x,w))
2023-04-01 18:52:44,214 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,w) | ~sum(y,x,w))
2023-04-01 18:52:45,477 macleod.logical.connective     DEBUG    Rescope Called: (c(z,w) | ~sum(y,x,w))
2023-04-01 18:52:45,478 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,w) | ~sum(y,x,w))
2023-04-01 18:52:45,479 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,w) | ~sum(y,x,w))
2023-04-01 18:52:45,480 macleod.logical.axiom          DEBUG    Term: (c(z,y) | c(z,x))
2023-04-01 18:52:47,350 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,y) | c(z,x))
2023-04-01 18:52:47,351 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,y) | c(z,x))
2023-04-01 18:52:48,782 macleod.logical.connective     DEBUG    Rescope Called: (c(z,y) | c(z,x))
2023-04-01 18:52:48,783 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,y) | c(z,x))
2023-04-01 18:52:48,784 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,y) | c(z,x))
2023-04-01 18:52:48,784 macleod.logical.axiom          DEBUG    Term: \forall w\;[(c(z,w) | ~sum(y,x,w))]
2023-04-01 18:52:48,785 macleod.logical.axiom          DEBUG    Term: (\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))
2023-04-01 18:52:50,965 macleod.logical.connective     DEBUG    Coalesced Called: (\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))
2023-04-01 18:52:50,965 macleod.logical.axiom          DEBUG    Coalesced Term: (\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))
2023-04-01 18:52:52,197 macleod.logical.connective     DEBUG    Rescope Called: (\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))
2023-04-01 18:52:52,198 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 18:52:52,199 macleod.logical.connective     DEBUG    Rescope Called: ((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))
2023-04-01 18:52:52,199 macleod.logical.connective     DEBUG    No Quantifier children: ((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))
2023-04-01 18:52:52,200 macleod.logical.axiom          DEBUG    Rescoped Term: \forall w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]
2023-04-01 18:52:52,201 macleod.logical.axiom          DEBUG    Term: \forall z,y,x\;[\forall w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]]
2023-04-01 18:52:52,201 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y,x\;[\forall w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]]
2023-04-01 18:52:52,202 macleod.logical.quantifier     DEBUG    Found a matching quantifier
2023-04-01 18:52:52,203 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y,x,w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]
2023-04-01 18:52:52,204 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y,x,w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]
2023-04-01 18:52:52,206 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y,z\;[(o(y,z) -> (c(x,prod(y,z)) <-> \exists w\;[(p(w,y) & p(w,z) & c(x,w))]))]
2023-04-01 18:52:52,208 macleod.logical.axiom          DEBUG    Function Free: \forall x,y,z\;[(o(y,z) -> (\forall p4\;[(c(x,p4) | ~prod(y,z,p4))] <-> \exists w\;[(p(w,y) & p(w,z) & c(x,w))]))]
2023-04-01 18:52:52,211 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y,x\;[(o(y,x) -> (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))]))]
2023-04-01 18:52:52,215 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y,x\;[(o(y,x) -> (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))]))]
2023-04-01 18:52:52,216 macleod.logical.axiom          DEBUG    Term: prod(y,x,w)
2023-04-01 18:52:52,216 macleod.logical.axiom          DEBUG    Term: c(z,v)
2023-04-01 18:52:52,216 macleod.logical.axiom          DEBUG    Term: p(v,x)
2023-04-01 18:52:52,217 macleod.logical.axiom          DEBUG    Term: p(v,y)
2023-04-01 18:52:52,217 macleod.logical.axiom          DEBUG    Term: ~prod(y,x,w)
2023-04-01 18:52:52,217 macleod.logical.axiom          DEBUG    Term: c(z,w)
2023-04-01 18:52:52,218 macleod.logical.axiom          DEBUG    Term: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 18:52:53,247 macleod.logical.connective     DEBUG    Coalesced Called: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 18:52:53,248 macleod.logical.axiom          DEBUG    Coalesced Term: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 18:52:54,555 macleod.logical.connective     DEBUG    Rescope Called: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 18:52:54,556 macleod.logical.connective     DEBUG    No Quantifier children: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 18:52:54,556 macleod.logical.axiom          DEBUG    Rescoped Term: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 18:52:54,557 macleod.logical.axiom          DEBUG    Term: (c(z,w) | ~prod(y,x,w))
2023-04-01 18:52:55,669 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,w) | ~prod(y,x,w))
2023-04-01 18:52:55,670 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,w) | ~prod(y,x,w))
2023-04-01 18:52:56,758 macleod.logical.connective     DEBUG    Rescope Called: (c(z,w) | ~prod(y,x,w))
2023-04-01 18:52:56,759 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,w) | ~prod(y,x,w))
2023-04-01 18:52:56,760 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,w) | ~prod(y,x,w))
2023-04-01 18:52:56,760 macleod.logical.axiom          DEBUG    Term: \exists v\;[(p(v,y) & p(v,x) & c(z,v))]
2023-04-01 18:52:56,760 macleod.logical.axiom          DEBUG    Term: \forall w\;[(c(z,w) | ~prod(y,x,w))]
2023-04-01 18:52:56,760 macleod.logical.axiom          DEBUG    Term: (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))])
2023-04-01 18:52:57,902 macleod.logical.connective     DEBUG    Coalesced Called: (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))])
2023-04-01 18:52:57,903 macleod.logical.axiom          DEBUG    Coalesced Term: (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))])
2023-04-01 18:52:58,940 macleod.logical.connective     DEBUG    Rescope Called: (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))])
2023-04-01 19:05:55,216 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 19:05:55,217 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 19:05:55,217 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 19:05:55,219 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_restriction.clif
2023-04-01 19:05:55,232 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(P(x,y) -> \exists z,v\;[PP(z,x)])]
2023-04-01 19:05:55,233 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(P(x,y) -> \exists z,v\;[PP(z,x)])]
2023-04-01 19:05:55,234 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(P(z,y) -> \exists x,w\;[PP(x,z)])]
2023-04-01 19:05:55,235 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(P(z,y) -> \exists x,w\;[PP(x,z)])]
2023-04-01 19:05:55,236 macleod.logical.axiom          DEBUG    Term: PP(x,z)
2023-04-01 19:05:55,237 macleod.logical.axiom          DEBUG    Term: \exists x,w\;[PP(x,z)]
2023-04-01 19:05:55,237 macleod.logical.axiom          DEBUG    Term: P(z,y)
2023-04-01 19:05:55,237 macleod.logical.axiom          DEBUG    Term: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 19:05:58,238 macleod.logical.connective     DEBUG    Coalesced Called: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 19:05:58,238 macleod.logical.axiom          DEBUG    Coalesced Term: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 19:05:58,751 macleod.logical.connective     DEBUG    Rescope Called: (P(z,y) -> \exists x,w\;[PP(x,z)])
2023-04-01 19:05:58,752 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 19:05:58,754 macleod.logical.connective     DEBUG    Rescope Called: (PP(x,z) -> P(z,y))
2023-04-01 19:05:58,755 macleod.logical.connective     DEBUG    No Quantifier children: (PP(x,z) -> P(z,y))
2023-04-01 19:05:58,755 macleod.logical.axiom          DEBUG    Rescoped Term: \exists x,w\;[(PP(x,z) -> P(z,y))]
2023-04-01 19:05:58,756 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 19:05:58,757 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 19:05:58,757 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 19:05:58,759 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[\exists x,w\;[(PP(x,z) -> P(z,y))]]
2023-04-01 19:05:58,760 macleod.logical.axiom          DEBUG    Starting Axiom: \forall a,b\;[PP(b,a)]
2023-04-01 19:05:58,761 macleod.logical.axiom          DEBUG    Function Free: \forall a,b\;[PP(b,a)]
2023-04-01 19:05:58,761 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[PP(y,z)]
2023-04-01 19:05:58,762 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[PP(y,z)]
2023-04-01 19:05:58,762 macleod.logical.axiom          DEBUG    Term: PP(y,z)
2023-04-01 19:05:58,763 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[PP(y,z)]
2023-04-01 19:05:58,763 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[PP(y,z)]
2023-04-01 19:05:58,763 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[PP(y,z)]
2023-04-01 19:05:58,764 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[PP(y,z)]
2023-04-01 19:07:01,023 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 19:07:01,024 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 19:07:01,025 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 19:07:01,026 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_basic.clif
2023-04-01 19:07:01,046 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(p(x,y) <-> \forall z\;[(c(z,x) -> c(z,y))])]
2023-04-01 19:07:01,047 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(p(x,y) <-> \forall z\;[(c(z,x) -> c(z,y))])]
2023-04-01 19:07:01,048 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])]
2023-04-01 19:07:01,049 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])]
2023-04-01 19:07:01,050 macleod.logical.axiom          DEBUG    Term: c(x,y)
2023-04-01 19:07:01,050 macleod.logical.axiom          DEBUG    Term: c(x,z)
2023-04-01 19:07:01,050 macleod.logical.axiom          DEBUG    Term: (c(x,z) -> c(x,y))
2023-04-01 19:07:04,631 macleod.logical.connective     DEBUG    Coalesced Called: (c(x,z) -> c(x,y))
2023-04-01 19:07:04,631 macleod.logical.axiom          DEBUG    Coalesced Term: (c(x,z) -> c(x,y))
2023-04-01 19:07:04,838 macleod.logical.connective     DEBUG    Rescope Called: (c(x,z) -> c(x,y))
2023-04-01 19:07:04,839 macleod.logical.connective     DEBUG    No Quantifier children: (c(x,z) -> c(x,y))
2023-04-01 19:07:04,839 macleod.logical.axiom          DEBUG    Rescoped Term: (c(x,z) -> c(x,y))
2023-04-01 19:07:04,840 macleod.logical.axiom          DEBUG    Term: \forall x\;[(c(x,z) -> c(x,y))]
2023-04-01 19:07:04,840 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 19:07:04,840 macleod.logical.axiom          DEBUG    Term: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-01 19:07:05,035 macleod.logical.connective     DEBUG    Coalesced Called: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-01 19:07:05,036 macleod.logical.axiom          DEBUG    Coalesced Term: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-01 19:07:05,267 macleod.logical.connective     DEBUG    Rescope Called: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-01 19:07:05,268 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 19:07:05,269 macleod.logical.connective     DEBUG    Rescope Called: ((c(x,z) -> c(x,y)) <-> p(z,y))
2023-04-01 19:07:05,269 macleod.logical.connective     DEBUG    No Quantifier children: ((c(x,z) -> c(x,y)) <-> p(z,y))
2023-04-01 19:07:05,270 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]
2023-04-01 19:07:05,270 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\forall x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]]
2023-04-01 19:07:05,271 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\forall x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]]
2023-04-01 19:07:05,271 macleod.logical.quantifier     DEBUG    Found a matching quantifier
2023-04-01 19:07:05,272 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y,x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]
2023-04-01 19:07:05,273 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y,x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]
2023-04-01 19:07:05,275 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(pp(x,y) <-> (p(x,y) & ~p(y,x)))]
2023-04-01 19:07:05,276 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(pp(x,y) <-> (p(x,y) & ~p(y,x)))]
2023-04-01 19:07:05,277 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 19:07:05,278 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 19:07:05,279 macleod.logical.axiom          DEBUG    Term: p(y,z)
2023-04-01 19:07:05,279 macleod.logical.axiom          DEBUG    Term: ~p(y,z)
2023-04-01 19:07:05,280 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 19:07:05,280 macleod.logical.axiom          DEBUG    Term: (p(z,y) & ~p(y,z))
2023-04-01 19:07:05,723 macleod.logical.connective     DEBUG    Coalesced Called: (p(z,y) & ~p(y,z))
2023-04-01 19:07:05,724 macleod.logical.axiom          DEBUG    Coalesced Term: (p(z,y) & ~p(y,z))
2023-04-01 19:07:06,740 macleod.logical.connective     DEBUG    Rescope Called: (p(z,y) & ~p(y,z))
2023-04-01 19:07:06,741 macleod.logical.connective     DEBUG    No Quantifier children: (p(z,y) & ~p(y,z))
2023-04-01 19:07:06,742 macleod.logical.axiom          DEBUG    Rescoped Term: (p(z,y) & ~p(y,z))
2023-04-01 19:07:06,742 macleod.logical.axiom          DEBUG    Term: pp(z,y)
2023-04-01 19:07:06,743 macleod.logical.axiom          DEBUG    Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 19:07:06,959 macleod.logical.connective     DEBUG    Coalesced Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 19:07:06,960 macleod.logical.axiom          DEBUG    Coalesced Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 19:07:07,163 macleod.logical.connective     DEBUG    Rescope Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 19:07:07,164 macleod.logical.connective     DEBUG    No Quantifier children: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 19:07:07,164 macleod.logical.axiom          DEBUG    Rescoped Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 19:07:07,165 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 19:07:07,166 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 19:07:07,166 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 19:07:07,168 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 19:07:07,169 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(o(x,y) <-> \exists z\;[(p(z,x) & p(z,y))])]
2023-04-01 19:07:07,170 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(o(x,y) <-> \exists z\;[(p(z,x) & p(z,y))])]
2023-04-01 19:07:07,172 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])]
2023-04-01 19:07:07,173 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])]
2023-04-01 19:07:07,174 macleod.logical.axiom          DEBUG    Term: p(x,y)
2023-04-01 19:07:07,174 macleod.logical.axiom          DEBUG    Term: p(x,z)
2023-04-01 19:07:07,175 macleod.logical.axiom          DEBUG    Term: (p(x,z) & p(x,y))
2023-04-01 19:07:07,656 macleod.logical.connective     DEBUG    Coalesced Called: (p(x,z) & p(x,y))
2023-04-01 19:07:07,657 macleod.logical.axiom          DEBUG    Coalesced Term: (p(x,z) & p(x,y))
2023-04-01 19:07:08,167 macleod.logical.connective     DEBUG    Rescope Called: (p(x,z) & p(x,y))
2023-04-01 19:07:08,168 macleod.logical.connective     DEBUG    No Quantifier children: (p(x,z) & p(x,y))
2023-04-01 19:07:08,170 macleod.logical.axiom          DEBUG    Rescoped Term: (p(x,z) & p(x,y))
2023-04-01 19:07:08,170 macleod.logical.axiom          DEBUG    Term: \exists x\;[(p(x,z) & p(x,y))]
2023-04-01 19:07:08,170 macleod.logical.axiom          DEBUG    Term: o(z,y)
2023-04-01 19:07:08,171 macleod.logical.axiom          DEBUG    Term: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-01 19:07:08,553 macleod.logical.connective     DEBUG    Coalesced Called: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-01 19:07:08,554 macleod.logical.axiom          DEBUG    Coalesced Term: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-01 19:07:08,970 macleod.logical.connective     DEBUG    Rescope Called: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-01 19:07:08,971 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 19:07:08,973 macleod.logical.connective     DEBUG    Rescope Called: ((p(x,z) & p(x,y)) <-> o(z,y))
2023-04-01 19:07:08,974 macleod.logical.connective     DEBUG    No Quantifier children: ((p(x,z) & p(x,y)) <-> o(z,y))
2023-04-01 19:07:08,975 macleod.logical.axiom          DEBUG    Rescoped Term: \exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]
2023-04-01 19:07:08,975 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-01 19:07:08,976 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-01 19:07:08,977 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-01 19:07:08,980 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-01 19:07:08,982 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(ec(x,y) <-> (c(x,y) & ~o(x,y)))]
2023-04-01 19:07:08,983 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(ec(x,y) <-> (c(x,y) & ~o(x,y)))]
2023-04-01 19:07:08,984 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 19:07:08,985 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 19:07:08,986 macleod.logical.axiom          DEBUG    Term: o(z,y)
2023-04-01 19:07:08,987 macleod.logical.axiom          DEBUG    Term: ~o(z,y)
2023-04-01 19:07:08,987 macleod.logical.axiom          DEBUG    Term: c(z,y)
2023-04-01 19:07:08,988 macleod.logical.axiom          DEBUG    Term: (c(z,y) & ~o(z,y))
2023-04-01 19:07:10,038 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,y) & ~o(z,y))
2023-04-01 19:07:10,039 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,y) & ~o(z,y))
2023-04-01 19:07:10,831 macleod.logical.connective     DEBUG    Rescope Called: (c(z,y) & ~o(z,y))
2023-04-01 19:07:10,833 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,y) & ~o(z,y))
2023-04-01 19:07:10,834 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,y) & ~o(z,y))
2023-04-01 19:07:10,835 macleod.logical.axiom          DEBUG    Term: ec(z,y)
2023-04-01 19:07:10,837 macleod.logical.axiom          DEBUG    Term: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 19:07:13,555 macleod.logical.connective     DEBUG    Coalesced Called: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 19:07:13,559 macleod.logical.axiom          DEBUG    Coalesced Term: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 19:07:14,715 macleod.logical.connective     DEBUG    Rescope Called: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 19:07:14,717 macleod.logical.connective     DEBUG    No Quantifier children: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 19:07:14,718 macleod.logical.axiom          DEBUG    Rescoped Term: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 19:07:14,719 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 19:07:14,720 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 19:07:14,721 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 19:07:14,723 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 19:07:14,725 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(ntpp(x,y) <-> (pp(x,y) & ~\exists z\;[(ec(z,x) & ec(z,y))]))]
2023-04-01 19:07:14,727 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(ntpp(x,y) <-> (pp(x,y) & ~\exists z\;[(ec(z,x) & ec(z,y))]))]
2023-04-01 19:07:14,729 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(ntpp(z,y) <-> (pp(z,y) & ~\exists x\;[(ec(x,z) & ec(x,y))]))]
2023-04-01 19:07:14,736 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(ntpp(z,y) <-> (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))]))]
2023-04-01 19:07:14,737 macleod.logical.axiom          DEBUG    Term: ec(x,y)
2023-04-01 19:07:14,737 macleod.logical.axiom          DEBUG    Term: ec(x,z)
2023-04-01 19:07:14,737 macleod.logical.axiom          DEBUG    Term: ~ec(x,y)
2023-04-01 19:07:14,738 macleod.logical.axiom          DEBUG    Term: ~ec(x,z)
2023-04-01 19:07:14,738 macleod.logical.axiom          DEBUG    Term: (~ec(x,z) | ~ec(x,y))
2023-04-01 19:07:17,474 macleod.logical.connective     DEBUG    Coalesced Called: (~ec(x,z) | ~ec(x,y))
2023-04-01 19:07:17,475 macleod.logical.axiom          DEBUG    Coalesced Term: (~ec(x,z) | ~ec(x,y))
2023-04-01 19:07:19,258 macleod.logical.connective     DEBUG    Rescope Called: (~ec(x,z) | ~ec(x,y))
2023-04-01 19:07:19,262 macleod.logical.connective     DEBUG    No Quantifier children: (~ec(x,z) | ~ec(x,y))
2023-04-01 19:07:19,263 macleod.logical.axiom          DEBUG    Rescoped Term: (~ec(x,z) | ~ec(x,y))
2023-04-01 19:07:19,264 macleod.logical.axiom          DEBUG    Term: \forall x\;[(~ec(x,z) | ~ec(x,y))]
2023-04-01 19:07:19,264 macleod.logical.axiom          DEBUG    Term: pp(z,y)
2023-04-01 19:07:19,264 macleod.logical.axiom          DEBUG    Term: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-01 19:07:20,377 macleod.logical.connective     DEBUG    Coalesced Called: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-01 19:07:20,378 macleod.logical.axiom          DEBUG    Coalesced Term: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-01 19:07:21,369 macleod.logical.connective     DEBUG    Rescope Called: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-01 19:07:21,371 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 19:07:21,372 macleod.logical.connective     DEBUG    Rescope Called: ((~ec(x,z) | ~ec(x,y)) & pp(z,y))
2023-04-01 19:07:21,373 macleod.logical.connective     DEBUG    No Quantifier children: ((~ec(x,z) | ~ec(x,y)) & pp(z,y))
2023-04-01 19:07:21,374 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))]
2023-04-01 19:07:21,375 macleod.logical.axiom          DEBUG    Term: ntpp(z,y)
2023-04-01 19:07:21,375 macleod.logical.axiom          DEBUG    Term: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-01 19:07:22,259 macleod.logical.connective     DEBUG    Coalesced Called: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-01 19:07:22,260 macleod.logical.axiom          DEBUG    Coalesced Term: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-01 19:07:23,102 macleod.logical.connective     DEBUG    Rescope Called: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-01 19:07:23,103 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 19:07:23,105 macleod.logical.connective     DEBUG    Rescope Called: (((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))
2023-04-01 19:07:23,105 macleod.logical.connective     DEBUG    No Quantifier children: (((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))
2023-04-01 19:07:23,106 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]
2023-04-01 19:07:23,107 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\forall x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]]
2023-04-01 19:07:23,108 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\forall x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]]
2023-04-01 19:07:23,109 macleod.logical.quantifier     DEBUG    Found a matching quantifier
2023-04-01 19:07:23,109 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y,x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]
2023-04-01 19:07:23,111 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y,x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]
2023-04-01 19:07:23,112 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x\;[c(x,x)]
2023-04-01 19:07:23,113 macleod.logical.axiom          DEBUG    Function Free: \forall x\;[c(x,x)]
2023-04-01 19:07:23,114 macleod.logical.axiom          DEBUG    Unique Variables: \forall z\;[c(z,z)]
2023-04-01 19:07:23,115 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z\;[c(z,z)]
2023-04-01 19:07:23,116 macleod.logical.axiom          DEBUG    Term: c(z,z)
2023-04-01 19:07:23,116 macleod.logical.axiom          DEBUG    Term: \forall z\;[c(z,z)]
2023-04-01 19:07:23,116 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z\;[c(z,z)]
2023-04-01 19:07:23,117 macleod.logical.axiom          DEBUG    Prenex Form: \forall z\;[c(z,z)]
2023-04-01 19:07:23,118 macleod.logical.axiom          DEBUG    CNF Form: \forall z\;[c(z,z)]
2023-04-01 19:07:23,119 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(c(x,y) -> c(y,x))]
2023-04-01 19:07:23,119 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(c(x,y) -> c(y,x))]
2023-04-01 19:07:23,120 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 19:07:23,121 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 19:07:23,122 macleod.logical.axiom          DEBUG    Term: c(y,z)
2023-04-01 19:07:23,123 macleod.logical.axiom          DEBUG    Term: c(z,y)
2023-04-01 19:07:23,123 macleod.logical.axiom          DEBUG    Term: (c(z,y) -> c(y,z))
2023-04-01 19:07:23,803 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,y) -> c(y,z))
2023-04-01 19:07:23,803 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,y) -> c(y,z))
2023-04-01 19:07:24,300 macleod.logical.connective     DEBUG    Rescope Called: (c(z,y) -> c(y,z))
2023-04-01 19:07:24,300 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,y) -> c(y,z))
2023-04-01 19:07:24,301 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,y) -> c(y,z))
2023-04-01 19:07:24,302 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 19:07:24,302 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 19:07:24,303 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 19:07:24,304 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 19:07:24,305 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x\;[c(x,uni)]
2023-04-01 19:07:24,305 macleod.logical.axiom          DEBUG    Function Free: \forall x\;[c(x,uni)]
2023-04-01 19:07:24,306 macleod.logical.utils          INFO     Found a constant!
2023-04-01 19:07:24,306 macleod.logical.axiom          DEBUG    Unique Variables: \forall z\;[c(z,uni)]
2023-04-01 19:07:24,307 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z\;[c(z,uni)]
2023-04-01 19:07:24,307 macleod.logical.axiom          DEBUG    Term: c(z,uni)
2023-04-01 19:07:24,308 macleod.logical.axiom          DEBUG    Term: \forall z\;[c(z,uni)]
2023-04-01 19:07:24,308 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z\;[c(z,uni)]
2023-04-01 19:07:24,309 macleod.logical.axiom          DEBUG    Prenex Form: \forall z\;[c(z,uni)]
2023-04-01 19:07:24,309 macleod.logical.axiom          DEBUG    CNF Form: \forall z\;[c(z,uni)]
2023-04-01 19:07:24,310 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(~=(y,uni) -> (o(x,compl(y)) <-> ~p(x,y)))]
2023-04-01 19:07:24,313 macleod.logical.axiom          DEBUG    Adding function declaration on: compl
2023-04-01 19:07:24,314 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(~=(y,uni) -> (\forall c2\;[(o(x,c2) | ~compl(y,c2))] <-> ~p(x,y)))]
2023-04-01 19:07:24,315 macleod.logical.utils          INFO     Found a constant!
2023-04-01 19:07:24,318 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(~=(y,uni) -> (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y)))]
2023-04-01 19:07:24,321 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(~=(y,uni) -> (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y)))]
2023-04-01 19:07:24,322 macleod.logical.axiom          DEBUG    Term: compl(y,x)
2023-04-01 19:07:24,322 macleod.logical.axiom          DEBUG    Term: ~compl(y,x)
2023-04-01 19:07:24,322 macleod.logical.axiom          DEBUG    Term: o(z,x)
2023-04-01 19:07:24,323 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 19:07:24,323 macleod.logical.axiom          DEBUG    Term: (o(z,x) | ~compl(y,x))
2023-04-01 19:07:25,002 macleod.logical.connective     DEBUG    Coalesced Called: (o(z,x) | ~compl(y,x))
2023-04-01 19:07:25,003 macleod.logical.axiom          DEBUG    Coalesced Term: (o(z,x) | ~compl(y,x))
2023-04-01 19:07:25,330 macleod.logical.connective     DEBUG    Rescope Called: (o(z,x) | ~compl(y,x))
2023-04-01 19:07:25,332 macleod.logical.connective     DEBUG    No Quantifier children: (o(z,x) | ~compl(y,x))
2023-04-01 19:07:25,333 macleod.logical.axiom          DEBUG    Rescoped Term: (o(z,x) | ~compl(y,x))
2023-04-01 19:07:25,334 macleod.logical.axiom          DEBUG    Term: ~p(z,y)
2023-04-01 19:07:25,335 macleod.logical.axiom          DEBUG    Term: \forall x\;[(o(z,x) | ~compl(y,x))]
2023-04-01 19:07:25,335 macleod.logical.axiom          DEBUG    Term: =(y,uni)
2023-04-01 19:07:25,336 macleod.logical.axiom          DEBUG    Term: (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y))
2023-04-01 19:07:25,798 macleod.logical.connective     DEBUG    Coalesced Called: (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y))
2023-04-01 19:07:25,799 macleod.logical.axiom          DEBUG    Coalesced Term: (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y))
2023-04-01 19:07:26,473 macleod.logical.connective     DEBUG    Rescope Called: (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y))
2023-04-01 19:07:26,474 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 19:07:26,475 macleod.logical.connective     DEBUG    Rescope Called: ((o(z,x) | ~compl(y,x)) <-> ~p(z,y))
2023-04-01 19:07:26,475 macleod.logical.connective     DEBUG    No Quantifier children: ((o(z,x) | ~compl(y,x)) <-> ~p(z,y))
2023-04-01 19:07:26,476 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))]
2023-04-01 19:07:26,477 macleod.logical.axiom          DEBUG    Term: ~=(y,uni)
2023-04-01 19:07:26,478 macleod.logical.axiom          DEBUG    Term: (~=(y,uni) -> \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))])
2023-04-01 19:07:26,866 macleod.logical.connective     DEBUG    Coalesced Called: (~=(y,uni) -> \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))])
2023-04-01 19:07:26,868 macleod.logical.axiom          DEBUG    Coalesced Term: (~=(y,uni) -> \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))])
2023-04-01 19:07:27,162 macleod.logical.connective     DEBUG    Rescope Called: (~=(y,uni) -> \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))])
2023-04-01 19:07:27,164 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 19:07:27,167 macleod.logical.connective     DEBUG    Rescope Called: (((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))
2023-04-01 19:07:27,169 macleod.logical.connective     DEBUG    No Quantifier children: (((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))
2023-04-01 19:07:27,170 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]
2023-04-01 19:07:27,172 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\forall x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]]
2023-04-01 19:07:27,172 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\forall x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]]
2023-04-01 19:07:27,173 macleod.logical.quantifier     DEBUG    Found a matching quantifier
2023-04-01 19:07:27,174 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y,x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]
2023-04-01 19:07:27,176 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y,x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]
2023-04-01 19:07:27,178 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y,z\;[(c(x,sum(y,z)) <-> (c(x,y) | c(x,z)))]
2023-04-01 19:07:27,180 macleod.logical.axiom          DEBUG    Function Free: \forall x,y,z\;[(\forall s3\;[(c(x,s3) | ~sum(y,z,s3))] <-> (c(x,y) | c(x,z)))]
2023-04-01 19:07:27,183 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y,x\;[(\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))]
2023-04-01 19:07:27,184 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y,x\;[(\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))]
2023-04-01 19:07:27,185 macleod.logical.axiom          DEBUG    Term: sum(y,x,w)
2023-04-01 19:07:27,185 macleod.logical.axiom          DEBUG    Term: ~sum(y,x,w)
2023-04-01 19:07:27,186 macleod.logical.axiom          DEBUG    Term: c(z,w)
2023-04-01 19:07:27,186 macleod.logical.axiom          DEBUG    Term: c(z,x)
2023-04-01 19:07:27,186 macleod.logical.axiom          DEBUG    Term: c(z,y)
2023-04-01 19:07:27,187 macleod.logical.axiom          DEBUG    Term: (c(z,w) | ~sum(y,x,w))
2023-04-01 19:07:27,634 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,w) | ~sum(y,x,w))
2023-04-01 19:07:27,635 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,w) | ~sum(y,x,w))
2023-04-01 19:07:28,627 macleod.logical.connective     DEBUG    Rescope Called: (c(z,w) | ~sum(y,x,w))
2023-04-01 19:07:28,629 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,w) | ~sum(y,x,w))
2023-04-01 19:07:28,631 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,w) | ~sum(y,x,w))
2023-04-01 19:07:28,631 macleod.logical.axiom          DEBUG    Term: (c(z,y) | c(z,x))
2023-04-01 19:07:30,482 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,y) | c(z,x))
2023-04-01 19:07:30,483 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,y) | c(z,x))
2023-04-01 19:07:31,524 macleod.logical.connective     DEBUG    Rescope Called: (c(z,y) | c(z,x))
2023-04-01 19:07:31,524 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,y) | c(z,x))
2023-04-01 19:07:31,525 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,y) | c(z,x))
2023-04-01 19:07:31,526 macleod.logical.axiom          DEBUG    Term: \forall w\;[(c(z,w) | ~sum(y,x,w))]
2023-04-01 19:07:31,526 macleod.logical.axiom          DEBUG    Term: (\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))
2023-04-01 19:07:32,290 macleod.logical.connective     DEBUG    Coalesced Called: (\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))
2023-04-01 19:07:32,291 macleod.logical.axiom          DEBUG    Coalesced Term: (\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))
2023-04-01 19:07:33,162 macleod.logical.connective     DEBUG    Rescope Called: (\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))
2023-04-01 19:07:33,163 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 19:07:33,164 macleod.logical.connective     DEBUG    Rescope Called: ((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))
2023-04-01 19:07:33,164 macleod.logical.connective     DEBUG    No Quantifier children: ((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))
2023-04-01 19:07:33,165 macleod.logical.axiom          DEBUG    Rescoped Term: \forall w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]
2023-04-01 19:07:33,166 macleod.logical.axiom          DEBUG    Term: \forall z,y,x\;[\forall w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]]
2023-04-01 19:07:33,166 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y,x\;[\forall w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]]
2023-04-01 19:07:33,167 macleod.logical.quantifier     DEBUG    Found a matching quantifier
2023-04-01 19:07:33,168 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y,x,w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]
2023-04-01 19:07:33,170 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y,x,w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]
2023-04-01 19:07:33,171 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y,z\;[(o(y,z) -> (c(x,prod(y,z)) <-> \exists w\;[(p(w,y) & p(w,z) & c(x,w))]))]
2023-04-01 19:07:33,173 macleod.logical.axiom          DEBUG    Function Free: \forall x,y,z\;[(o(y,z) -> (\forall p4\;[(c(x,p4) | ~prod(y,z,p4))] <-> \exists w\;[(p(w,y) & p(w,z) & c(x,w))]))]
2023-04-01 19:07:33,176 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y,x\;[(o(y,x) -> (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))]))]
2023-04-01 19:07:33,179 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y,x\;[(o(y,x) -> (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))]))]
2023-04-01 19:07:33,181 macleod.logical.axiom          DEBUG    Term: prod(y,x,w)
2023-04-01 19:07:33,181 macleod.logical.axiom          DEBUG    Term: c(z,v)
2023-04-01 19:07:33,182 macleod.logical.axiom          DEBUG    Term: p(v,x)
2023-04-01 19:07:33,182 macleod.logical.axiom          DEBUG    Term: p(v,y)
2023-04-01 19:07:33,182 macleod.logical.axiom          DEBUG    Term: ~prod(y,x,w)
2023-04-01 19:07:33,182 macleod.logical.axiom          DEBUG    Term: c(z,w)
2023-04-01 19:07:33,183 macleod.logical.axiom          DEBUG    Term: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 19:07:33,866 macleod.logical.connective     DEBUG    Coalesced Called: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 19:07:33,867 macleod.logical.axiom          DEBUG    Coalesced Term: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 19:07:34,646 macleod.logical.connective     DEBUG    Rescope Called: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 19:07:34,646 macleod.logical.connective     DEBUG    No Quantifier children: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 19:07:34,647 macleod.logical.axiom          DEBUG    Rescoped Term: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 19:07:34,648 macleod.logical.axiom          DEBUG    Term: (c(z,w) | ~prod(y,x,w))
2023-04-01 19:07:35,369 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,w) | ~prod(y,x,w))
2023-04-01 19:07:35,370 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,w) | ~prod(y,x,w))
2023-04-01 19:07:35,777 macleod.logical.connective     DEBUG    Rescope Called: (c(z,w) | ~prod(y,x,w))
2023-04-01 19:07:35,779 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,w) | ~prod(y,x,w))
2023-04-01 19:07:35,780 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,w) | ~prod(y,x,w))
2023-04-01 19:07:35,781 macleod.logical.axiom          DEBUG    Term: \exists v\;[(p(v,y) & p(v,x) & c(z,v))]
2023-04-01 19:07:35,782 macleod.logical.axiom          DEBUG    Term: \forall w\;[(c(z,w) | ~prod(y,x,w))]
2023-04-01 19:07:35,782 macleod.logical.axiom          DEBUG    Term: (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))])
2023-04-01 19:07:36,092 macleod.logical.connective     DEBUG    Coalesced Called: (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))])
2023-04-01 19:07:36,093 macleod.logical.axiom          DEBUG    Coalesced Term: (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))])
2023-04-01 19:07:36,341 macleod.logical.connective     DEBUG    Rescope Called: (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))])
2023-04-01 19:07:44,317 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-01 19:07:44,317 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-01 19:07:44,318 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-01 19:07:44,319 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_basic.clif
2023-04-01 19:07:44,339 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(p(x,y) <-> \forall z\;[(c(z,x) -> c(z,y))])]
2023-04-01 19:07:44,341 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(p(x,y) <-> \forall z\;[(c(z,x) -> c(z,y))])]
2023-04-01 19:07:44,343 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])]
2023-04-01 19:07:44,344 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])]
2023-04-01 19:07:44,345 macleod.logical.axiom          DEBUG    Term: c(x,y)
2023-04-01 19:07:44,345 macleod.logical.axiom          DEBUG    Term: c(x,z)
2023-04-01 19:07:44,345 macleod.logical.axiom          DEBUG    Term: (c(x,z) -> c(x,y))
2023-04-01 19:07:53,039 macleod.logical.connective     DEBUG    Coalesced Called: (c(x,z) -> c(x,y))
2023-04-01 19:07:53,040 macleod.logical.axiom          DEBUG    Coalesced Term: (c(x,z) -> c(x,y))
2023-04-01 19:07:53,040 macleod.logical.connective     DEBUG    Rescope Called: (c(x,z) -> c(x,y))
2023-04-01 19:07:53,041 macleod.logical.connective     DEBUG    No Quantifier children: (c(x,z) -> c(x,y))
2023-04-01 19:07:53,042 macleod.logical.axiom          DEBUG    Rescoped Term: (c(x,z) -> c(x,y))
2023-04-01 19:07:53,042 macleod.logical.axiom          DEBUG    Term: \forall x\;[(c(x,z) -> c(x,y))]
2023-04-01 19:07:53,043 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 19:07:53,043 macleod.logical.axiom          DEBUG    Term: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-01 19:07:53,044 macleod.logical.connective     DEBUG    Coalesced Called: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-01 19:07:53,044 macleod.logical.axiom          DEBUG    Coalesced Term: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-01 19:07:53,044 macleod.logical.connective     DEBUG    Rescope Called: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-01 19:07:53,045 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 19:07:53,046 macleod.logical.connective     DEBUG    Rescope Called: ((c(x,z) -> c(x,y)) <-> p(z,y))
2023-04-01 19:07:53,046 macleod.logical.connective     DEBUG    No Quantifier children: ((c(x,z) -> c(x,y)) <-> p(z,y))
2023-04-01 19:07:53,047 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]
2023-04-01 19:07:53,047 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\forall x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]]
2023-04-01 19:07:53,048 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\forall x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]]
2023-04-01 19:07:53,048 macleod.logical.quantifier     DEBUG    Found a matching quantifier
2023-04-01 19:07:53,049 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y,x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]
2023-04-01 19:07:53,051 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y,x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]
2023-04-01 19:07:53,053 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(pp(x,y) <-> (p(x,y) & ~p(y,x)))]
2023-04-01 19:07:53,055 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(pp(x,y) <-> (p(x,y) & ~p(y,x)))]
2023-04-01 19:07:53,056 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 19:07:53,059 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 19:07:53,059 macleod.logical.axiom          DEBUG    Term: p(y,z)
2023-04-01 19:07:53,060 macleod.logical.axiom          DEBUG    Term: ~p(y,z)
2023-04-01 19:07:53,060 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 19:07:53,060 macleod.logical.axiom          DEBUG    Term: (p(z,y) & ~p(y,z))
2023-04-01 19:07:53,060 macleod.logical.connective     DEBUG    Coalesced Called: (p(z,y) & ~p(y,z))
2023-04-01 19:07:53,061 macleod.logical.axiom          DEBUG    Coalesced Term: (p(z,y) & ~p(y,z))
2023-04-01 19:07:53,062 macleod.logical.connective     DEBUG    Rescope Called: (p(z,y) & ~p(y,z))
2023-04-01 19:07:53,062 macleod.logical.connective     DEBUG    No Quantifier children: (p(z,y) & ~p(y,z))
2023-04-01 19:07:53,063 macleod.logical.axiom          DEBUG    Rescoped Term: (p(z,y) & ~p(y,z))
2023-04-01 19:07:53,064 macleod.logical.axiom          DEBUG    Term: pp(z,y)
2023-04-01 19:07:53,064 macleod.logical.axiom          DEBUG    Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 19:07:53,064 macleod.logical.connective     DEBUG    Coalesced Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 19:07:53,065 macleod.logical.axiom          DEBUG    Coalesced Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 19:07:53,065 macleod.logical.connective     DEBUG    Rescope Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 19:07:53,066 macleod.logical.connective     DEBUG    No Quantifier children: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 19:07:53,066 macleod.logical.axiom          DEBUG    Rescoped Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-01 19:07:53,067 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 19:07:53,068 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 19:07:53,068 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 19:07:53,070 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-01 19:07:53,072 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(o(x,y) <-> \exists z\;[(p(z,x) & p(z,y))])]
2023-04-01 19:07:53,073 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(o(x,y) <-> \exists z\;[(p(z,x) & p(z,y))])]
2023-04-01 19:07:53,074 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])]
2023-04-01 19:07:53,075 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])]
2023-04-01 19:07:53,076 macleod.logical.axiom          DEBUG    Term: p(x,y)
2023-04-01 19:07:53,076 macleod.logical.axiom          DEBUG    Term: p(x,z)
2023-04-01 19:07:53,077 macleod.logical.axiom          DEBUG    Term: (p(x,z) & p(x,y))
2023-04-01 19:07:53,077 macleod.logical.connective     DEBUG    Coalesced Called: (p(x,z) & p(x,y))
2023-04-01 19:07:53,077 macleod.logical.axiom          DEBUG    Coalesced Term: (p(x,z) & p(x,y))
2023-04-01 19:07:53,077 macleod.logical.connective     DEBUG    Rescope Called: (p(x,z) & p(x,y))
2023-04-01 19:07:53,078 macleod.logical.connective     DEBUG    No Quantifier children: (p(x,z) & p(x,y))
2023-04-01 19:07:53,078 macleod.logical.axiom          DEBUG    Rescoped Term: (p(x,z) & p(x,y))
2023-04-01 19:07:53,079 macleod.logical.axiom          DEBUG    Term: \exists x\;[(p(x,z) & p(x,y))]
2023-04-01 19:07:53,079 macleod.logical.axiom          DEBUG    Term: o(z,y)
2023-04-01 19:07:53,079 macleod.logical.axiom          DEBUG    Term: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-01 19:07:53,080 macleod.logical.connective     DEBUG    Coalesced Called: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-01 19:07:53,080 macleod.logical.axiom          DEBUG    Coalesced Term: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-01 19:07:53,081 macleod.logical.connective     DEBUG    Rescope Called: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-01 19:07:53,081 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 19:07:53,082 macleod.logical.connective     DEBUG    Rescope Called: ((p(x,z) & p(x,y)) <-> o(z,y))
2023-04-01 19:07:53,082 macleod.logical.connective     DEBUG    No Quantifier children: ((p(x,z) & p(x,y)) <-> o(z,y))
2023-04-01 19:07:53,083 macleod.logical.axiom          DEBUG    Rescoped Term: \exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]
2023-04-01 19:07:53,084 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-01 19:07:53,084 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-01 19:07:53,085 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-01 19:07:53,087 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-01 19:07:53,088 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(ec(x,y) <-> (c(x,y) & ~o(x,y)))]
2023-04-01 19:07:53,090 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(ec(x,y) <-> (c(x,y) & ~o(x,y)))]
2023-04-01 19:07:53,091 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 19:07:53,092 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 19:07:53,093 macleod.logical.axiom          DEBUG    Term: o(z,y)
2023-04-01 19:07:53,093 macleod.logical.axiom          DEBUG    Term: ~o(z,y)
2023-04-01 19:07:53,093 macleod.logical.axiom          DEBUG    Term: c(z,y)
2023-04-01 19:07:53,094 macleod.logical.axiom          DEBUG    Term: (c(z,y) & ~o(z,y))
2023-04-01 19:07:53,094 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,y) & ~o(z,y))
2023-04-01 19:07:53,095 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,y) & ~o(z,y))
2023-04-01 19:07:53,095 macleod.logical.connective     DEBUG    Rescope Called: (c(z,y) & ~o(z,y))
2023-04-01 19:07:53,096 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,y) & ~o(z,y))
2023-04-01 19:07:53,096 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,y) & ~o(z,y))
2023-04-01 19:07:53,097 macleod.logical.axiom          DEBUG    Term: ec(z,y)
2023-04-01 19:07:53,097 macleod.logical.axiom          DEBUG    Term: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 19:07:53,098 macleod.logical.connective     DEBUG    Coalesced Called: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 19:07:53,098 macleod.logical.axiom          DEBUG    Coalesced Term: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 19:07:53,099 macleod.logical.connective     DEBUG    Rescope Called: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 19:07:53,100 macleod.logical.connective     DEBUG    No Quantifier children: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 19:07:53,100 macleod.logical.axiom          DEBUG    Rescoped Term: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-01 19:07:53,101 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 19:07:53,101 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 19:07:53,102 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 19:07:53,103 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-01 19:07:53,105 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(ntpp(x,y) <-> (pp(x,y) & ~\exists z\;[(ec(z,x) & ec(z,y))]))]
2023-04-01 19:07:53,106 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(ntpp(x,y) <-> (pp(x,y) & ~\exists z\;[(ec(z,x) & ec(z,y))]))]
2023-04-01 19:07:53,108 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(ntpp(z,y) <-> (pp(z,y) & ~\exists x\;[(ec(x,z) & ec(x,y))]))]
2023-04-01 19:07:53,112 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(ntpp(z,y) <-> (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))]))]
2023-04-01 19:07:53,114 macleod.logical.axiom          DEBUG    Term: ec(x,y)
2023-04-01 19:07:53,114 macleod.logical.axiom          DEBUG    Term: ec(x,z)
2023-04-01 19:07:53,115 macleod.logical.axiom          DEBUG    Term: ~ec(x,y)
2023-04-01 19:07:53,116 macleod.logical.axiom          DEBUG    Term: ~ec(x,z)
2023-04-01 19:07:53,116 macleod.logical.axiom          DEBUG    Term: (~ec(x,z) | ~ec(x,y))
2023-04-01 19:07:53,117 macleod.logical.connective     DEBUG    Coalesced Called: (~ec(x,z) | ~ec(x,y))
2023-04-01 19:07:53,117 macleod.logical.axiom          DEBUG    Coalesced Term: (~ec(x,z) | ~ec(x,y))
2023-04-01 19:07:53,118 macleod.logical.connective     DEBUG    Rescope Called: (~ec(x,z) | ~ec(x,y))
2023-04-01 19:07:53,119 macleod.logical.connective     DEBUG    No Quantifier children: (~ec(x,z) | ~ec(x,y))
2023-04-01 19:07:53,119 macleod.logical.axiom          DEBUG    Rescoped Term: (~ec(x,z) | ~ec(x,y))
2023-04-01 19:07:53,120 macleod.logical.axiom          DEBUG    Term: \forall x\;[(~ec(x,z) | ~ec(x,y))]
2023-04-01 19:07:53,120 macleod.logical.axiom          DEBUG    Term: pp(z,y)
2023-04-01 19:07:53,121 macleod.logical.axiom          DEBUG    Term: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-01 19:07:53,122 macleod.logical.connective     DEBUG    Coalesced Called: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-01 19:07:53,122 macleod.logical.axiom          DEBUG    Coalesced Term: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-01 19:07:53,123 macleod.logical.connective     DEBUG    Rescope Called: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-01 19:07:53,123 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 19:07:53,124 macleod.logical.connective     DEBUG    Rescope Called: ((~ec(x,z) | ~ec(x,y)) & pp(z,y))
2023-04-01 19:07:53,124 macleod.logical.connective     DEBUG    No Quantifier children: ((~ec(x,z) | ~ec(x,y)) & pp(z,y))
2023-04-01 19:07:53,125 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))]
2023-04-01 19:07:53,126 macleod.logical.axiom          DEBUG    Term: ntpp(z,y)
2023-04-01 19:07:53,126 macleod.logical.axiom          DEBUG    Term: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-01 19:07:53,127 macleod.logical.connective     DEBUG    Coalesced Called: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-01 19:07:53,127 macleod.logical.axiom          DEBUG    Coalesced Term: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-01 19:07:53,127 macleod.logical.connective     DEBUG    Rescope Called: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-01 19:07:53,127 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 19:07:53,128 macleod.logical.connective     DEBUG    Rescope Called: (((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))
2023-04-01 19:07:53,129 macleod.logical.connective     DEBUG    No Quantifier children: (((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))
2023-04-01 19:07:53,130 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]
2023-04-01 19:07:53,130 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\forall x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]]
2023-04-01 19:07:53,130 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\forall x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]]
2023-04-01 19:07:53,131 macleod.logical.quantifier     DEBUG    Found a matching quantifier
2023-04-01 19:07:53,132 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y,x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]
2023-04-01 19:07:53,134 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y,x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]
2023-04-01 19:07:53,135 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x\;[c(x,x)]
2023-04-01 19:07:53,136 macleod.logical.axiom          DEBUG    Function Free: \forall x\;[c(x,x)]
2023-04-01 19:07:53,136 macleod.logical.axiom          DEBUG    Unique Variables: \forall z\;[c(z,z)]
2023-04-01 19:07:53,137 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z\;[c(z,z)]
2023-04-01 19:07:53,137 macleod.logical.axiom          DEBUG    Term: c(z,z)
2023-04-01 19:07:53,138 macleod.logical.axiom          DEBUG    Term: \forall z\;[c(z,z)]
2023-04-01 19:07:53,138 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z\;[c(z,z)]
2023-04-01 19:07:53,138 macleod.logical.axiom          DEBUG    Prenex Form: \forall z\;[c(z,z)]
2023-04-01 19:07:53,139 macleod.logical.axiom          DEBUG    CNF Form: \forall z\;[c(z,z)]
2023-04-01 19:07:53,140 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(c(x,y) -> c(y,x))]
2023-04-01 19:07:53,140 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(c(x,y) -> c(y,x))]
2023-04-01 19:07:53,142 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 19:07:53,143 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 19:07:53,143 macleod.logical.axiom          DEBUG    Term: c(y,z)
2023-04-01 19:07:53,144 macleod.logical.axiom          DEBUG    Term: c(z,y)
2023-04-01 19:07:53,144 macleod.logical.axiom          DEBUG    Term: (c(z,y) -> c(y,z))
2023-04-01 19:07:53,145 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,y) -> c(y,z))
2023-04-01 19:07:53,145 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,y) -> c(y,z))
2023-04-01 19:07:53,146 macleod.logical.connective     DEBUG    Rescope Called: (c(z,y) -> c(y,z))
2023-04-01 19:07:53,146 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,y) -> c(y,z))
2023-04-01 19:07:53,147 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,y) -> c(y,z))
2023-04-01 19:07:53,148 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 19:07:53,148 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 19:07:53,149 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 19:07:53,150 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-01 19:07:53,151 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x\;[c(x,uni)]
2023-04-01 19:07:53,152 macleod.logical.axiom          DEBUG    Function Free: \forall x\;[c(x,uni)]
2023-04-01 19:07:53,152 macleod.logical.utils          INFO     Found a constant!
2023-04-01 19:07:53,153 macleod.logical.axiom          DEBUG    Unique Variables: \forall z\;[c(z,uni)]
2023-04-01 19:07:53,154 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z\;[c(z,uni)]
2023-04-01 19:07:53,154 macleod.logical.axiom          DEBUG    Term: c(z,uni)
2023-04-01 19:07:53,155 macleod.logical.axiom          DEBUG    Term: \forall z\;[c(z,uni)]
2023-04-01 19:07:53,155 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z\;[c(z,uni)]
2023-04-01 19:07:53,155 macleod.logical.axiom          DEBUG    Prenex Form: \forall z\;[c(z,uni)]
2023-04-01 19:07:53,156 macleod.logical.axiom          DEBUG    CNF Form: \forall z\;[c(z,uni)]
2023-04-01 19:07:53,157 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(~=(y,uni) -> (o(x,compl(y)) <-> ~p(x,y)))]
2023-04-01 19:07:53,159 macleod.logical.axiom          DEBUG    Adding function declaration on: compl
2023-04-01 19:07:53,160 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(~=(y,uni) -> (\forall c2\;[(o(x,c2) | ~compl(y,c2))] <-> ~p(x,y)))]
2023-04-01 19:07:53,161 macleod.logical.utils          INFO     Found a constant!
2023-04-01 19:07:53,163 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(~=(y,uni) -> (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y)))]
2023-04-01 19:07:53,165 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(~=(y,uni) -> (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y)))]
2023-04-01 19:07:53,165 macleod.logical.axiom          DEBUG    Term: compl(y,x)
2023-04-01 19:07:53,166 macleod.logical.axiom          DEBUG    Term: ~compl(y,x)
2023-04-01 19:07:53,166 macleod.logical.axiom          DEBUG    Term: o(z,x)
2023-04-01 19:07:53,167 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-01 19:07:53,167 macleod.logical.axiom          DEBUG    Term: (o(z,x) | ~compl(y,x))
2023-04-01 19:07:53,168 macleod.logical.connective     DEBUG    Coalesced Called: (o(z,x) | ~compl(y,x))
2023-04-01 19:07:53,168 macleod.logical.axiom          DEBUG    Coalesced Term: (o(z,x) | ~compl(y,x))
2023-04-01 19:07:53,169 macleod.logical.connective     DEBUG    Rescope Called: (o(z,x) | ~compl(y,x))
2023-04-01 19:07:53,169 macleod.logical.connective     DEBUG    No Quantifier children: (o(z,x) | ~compl(y,x))
2023-04-01 19:07:53,170 macleod.logical.axiom          DEBUG    Rescoped Term: (o(z,x) | ~compl(y,x))
2023-04-01 19:07:53,170 macleod.logical.axiom          DEBUG    Term: ~p(z,y)
2023-04-01 19:07:53,171 macleod.logical.axiom          DEBUG    Term: \forall x\;[(o(z,x) | ~compl(y,x))]
2023-04-01 19:07:53,171 macleod.logical.axiom          DEBUG    Term: =(y,uni)
2023-04-01 19:07:53,171 macleod.logical.axiom          DEBUG    Term: (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y))
2023-04-01 19:07:53,173 macleod.logical.connective     DEBUG    Coalesced Called: (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y))
2023-04-01 19:07:53,173 macleod.logical.axiom          DEBUG    Coalesced Term: (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y))
2023-04-01 19:07:53,174 macleod.logical.connective     DEBUG    Rescope Called: (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y))
2023-04-01 19:07:53,174 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 19:07:53,175 macleod.logical.connective     DEBUG    Rescope Called: ((o(z,x) | ~compl(y,x)) <-> ~p(z,y))
2023-04-01 19:07:53,175 macleod.logical.connective     DEBUG    No Quantifier children: ((o(z,x) | ~compl(y,x)) <-> ~p(z,y))
2023-04-01 19:07:53,176 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))]
2023-04-01 19:07:53,177 macleod.logical.axiom          DEBUG    Term: ~=(y,uni)
2023-04-01 19:07:53,177 macleod.logical.axiom          DEBUG    Term: (~=(y,uni) -> \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))])
2023-04-01 19:07:53,178 macleod.logical.connective     DEBUG    Coalesced Called: (~=(y,uni) -> \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))])
2023-04-01 19:07:53,178 macleod.logical.axiom          DEBUG    Coalesced Term: (~=(y,uni) -> \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))])
2023-04-01 19:07:53,179 macleod.logical.connective     DEBUG    Rescope Called: (~=(y,uni) -> \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))])
2023-04-01 19:07:53,179 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 19:07:53,180 macleod.logical.connective     DEBUG    Rescope Called: (((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))
2023-04-01 19:07:53,180 macleod.logical.connective     DEBUG    No Quantifier children: (((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))
2023-04-01 19:07:53,181 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]
2023-04-01 19:07:53,182 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\forall x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]]
2023-04-01 19:07:53,182 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\forall x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]]
2023-04-01 19:07:53,183 macleod.logical.quantifier     DEBUG    Found a matching quantifier
2023-04-01 19:07:53,184 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y,x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]
2023-04-01 19:07:53,186 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y,x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]
2023-04-01 19:07:53,187 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y,z\;[(c(x,sum(y,z)) <-> (c(x,y) | c(x,z)))]
2023-04-01 19:07:53,189 macleod.logical.axiom          DEBUG    Function Free: \forall x,y,z\;[(\forall s3\;[(c(x,s3) | ~sum(y,z,s3))] <-> (c(x,y) | c(x,z)))]
2023-04-01 19:07:53,191 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y,x\;[(\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))]
2023-04-01 19:07:53,192 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y,x\;[(\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))]
2023-04-01 19:07:53,194 macleod.logical.axiom          DEBUG    Term: sum(y,x,w)
2023-04-01 19:07:53,194 macleod.logical.axiom          DEBUG    Term: ~sum(y,x,w)
2023-04-01 19:07:53,194 macleod.logical.axiom          DEBUG    Term: c(z,w)
2023-04-01 19:07:53,195 macleod.logical.axiom          DEBUG    Term: c(z,x)
2023-04-01 19:07:53,195 macleod.logical.axiom          DEBUG    Term: c(z,y)
2023-04-01 19:07:53,195 macleod.logical.axiom          DEBUG    Term: (c(z,w) | ~sum(y,x,w))
2023-04-01 19:07:53,196 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,w) | ~sum(y,x,w))
2023-04-01 19:07:53,196 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,w) | ~sum(y,x,w))
2023-04-01 19:07:53,197 macleod.logical.connective     DEBUG    Rescope Called: (c(z,w) | ~sum(y,x,w))
2023-04-01 19:07:53,197 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,w) | ~sum(y,x,w))
2023-04-01 19:07:53,198 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,w) | ~sum(y,x,w))
2023-04-01 19:07:53,198 macleod.logical.axiom          DEBUG    Term: (c(z,y) | c(z,x))
2023-04-01 19:07:53,198 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,y) | c(z,x))
2023-04-01 19:07:53,199 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,y) | c(z,x))
2023-04-01 19:07:53,199 macleod.logical.connective     DEBUG    Rescope Called: (c(z,y) | c(z,x))
2023-04-01 19:07:53,199 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,y) | c(z,x))
2023-04-01 19:07:53,200 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,y) | c(z,x))
2023-04-01 19:07:53,201 macleod.logical.axiom          DEBUG    Term: \forall w\;[(c(z,w) | ~sum(y,x,w))]
2023-04-01 19:07:53,202 macleod.logical.axiom          DEBUG    Term: (\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))
2023-04-01 19:07:53,202 macleod.logical.connective     DEBUG    Coalesced Called: (\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))
2023-04-01 19:07:53,203 macleod.logical.axiom          DEBUG    Coalesced Term: (\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))
2023-04-01 19:07:53,203 macleod.logical.connective     DEBUG    Rescope Called: (\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))
2023-04-01 19:07:53,203 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-01 19:07:53,204 macleod.logical.connective     DEBUG    Rescope Called: ((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))
2023-04-01 19:07:53,205 macleod.logical.connective     DEBUG    No Quantifier children: ((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))
2023-04-01 19:07:53,205 macleod.logical.axiom          DEBUG    Rescoped Term: \forall w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]
2023-04-01 19:07:53,206 macleod.logical.axiom          DEBUG    Term: \forall z,y,x\;[\forall w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]]
2023-04-01 19:07:53,206 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y,x\;[\forall w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]]
2023-04-01 19:07:53,207 macleod.logical.quantifier     DEBUG    Found a matching quantifier
2023-04-01 19:07:53,207 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y,x,w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]
2023-04-01 19:07:53,209 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y,x,w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]
2023-04-01 19:07:53,210 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y,z\;[(o(y,z) -> (c(x,prod(y,z)) <-> \exists w\;[(p(w,y) & p(w,z) & c(x,w))]))]
2023-04-01 19:07:53,212 macleod.logical.axiom          DEBUG    Function Free: \forall x,y,z\;[(o(y,z) -> (\forall p4\;[(c(x,p4) | ~prod(y,z,p4))] <-> \exists w\;[(p(w,y) & p(w,z) & c(x,w))]))]
2023-04-01 19:07:53,224 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y,x\;[(o(y,x) -> (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))]))]
2023-04-01 19:07:53,226 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y,x\;[(o(y,x) -> (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))]))]
2023-04-01 19:07:53,227 macleod.logical.axiom          DEBUG    Term: prod(y,x,w)
2023-04-01 19:07:53,228 macleod.logical.axiom          DEBUG    Term: c(z,v)
2023-04-01 19:07:53,228 macleod.logical.axiom          DEBUG    Term: p(v,x)
2023-04-01 19:07:53,228 macleod.logical.axiom          DEBUG    Term: p(v,y)
2023-04-01 19:07:53,229 macleod.logical.axiom          DEBUG    Term: ~prod(y,x,w)
2023-04-01 19:07:53,229 macleod.logical.axiom          DEBUG    Term: c(z,w)
2023-04-01 19:07:53,229 macleod.logical.axiom          DEBUG    Term: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 19:07:53,230 macleod.logical.connective     DEBUG    Coalesced Called: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 19:07:53,230 macleod.logical.axiom          DEBUG    Coalesced Term: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 19:07:53,231 macleod.logical.connective     DEBUG    Rescope Called: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 19:07:53,231 macleod.logical.connective     DEBUG    No Quantifier children: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 19:07:53,232 macleod.logical.axiom          DEBUG    Rescoped Term: (p(v,y) & p(v,x) & c(z,v))
2023-04-01 19:07:53,232 macleod.logical.axiom          DEBUG    Term: (c(z,w) | ~prod(y,x,w))
2023-04-01 19:07:53,233 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,w) | ~prod(y,x,w))
2023-04-01 19:07:53,233 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,w) | ~prod(y,x,w))
2023-04-01 19:07:53,234 macleod.logical.connective     DEBUG    Rescope Called: (c(z,w) | ~prod(y,x,w))
2023-04-01 19:07:53,234 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,w) | ~prod(y,x,w))
2023-04-01 19:07:53,235 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,w) | ~prod(y,x,w))
2023-04-01 19:07:53,235 macleod.logical.axiom          DEBUG    Term: \exists v\;[(p(v,y) & p(v,x) & c(z,v))]
2023-04-01 19:07:53,235 macleod.logical.axiom          DEBUG    Term: \forall w\;[(c(z,w) | ~prod(y,x,w))]
2023-04-01 19:07:53,236 macleod.logical.axiom          DEBUG    Term: (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))])
2023-04-01 19:07:53,237 macleod.logical.connective     DEBUG    Coalesced Called: (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))])
2023-04-01 19:07:53,237 macleod.logical.axiom          DEBUG    Coalesced Term: (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))])
2023-04-01 19:07:53,238 macleod.logical.connective     DEBUG    Rescope Called: (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))])
2023-04-02 16:32:30,839 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-02 16:32:30,839 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-02 16:32:30,839 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-02 16:32:30,839 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_basic.clif
2023-04-02 16:32:30,925 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(p(x,y) <-> \forall z\;[(c(z,x) -> c(z,y))])]
2023-04-02 16:32:30,925 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(p(x,y) <-> \forall z\;[(c(z,x) -> c(z,y))])]
2023-04-02 16:32:30,925 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])]
2023-04-02 16:32:30,925 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])]
2023-04-02 16:32:30,925 macleod.logical.axiom          DEBUG    Term: c(x,y)
2023-04-02 16:32:30,925 macleod.logical.axiom          DEBUG    Term: c(x,z)
2023-04-02 16:32:30,925 macleod.logical.axiom          DEBUG    Term: (c(x,z) -> c(x,y))
2023-04-02 16:32:30,933 macleod.logical.connective     DEBUG    Coalesced Called: (c(x,z) -> c(x,y))
2023-04-02 16:32:30,934 macleod.logical.axiom          DEBUG    Coalesced Term: (c(x,z) -> c(x,y))
2023-04-02 16:32:30,934 macleod.logical.connective     DEBUG    Rescope Called: (c(x,z) -> c(x,y))
2023-04-02 16:32:30,934 macleod.logical.connective     DEBUG    No Quantifier children: (c(x,z) -> c(x,y))
2023-04-02 16:32:30,934 macleod.logical.axiom          DEBUG    Rescoped Term: (c(x,z) -> c(x,y))
2023-04-02 16:32:30,934 macleod.logical.axiom          DEBUG    Term: \forall x\;[(c(x,z) -> c(x,y))]
2023-04-02 16:32:30,934 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-02 16:32:30,934 macleod.logical.axiom          DEBUG    Term: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-02 16:32:30,934 macleod.logical.connective     DEBUG    Coalesced Called: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-02 16:32:30,934 macleod.logical.axiom          DEBUG    Coalesced Term: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-02 16:32:30,934 macleod.logical.connective     DEBUG    Rescope Called: (p(z,y) <-> \forall x\;[(c(x,z) -> c(x,y))])
2023-04-02 16:32:30,934 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-02 16:32:30,934 macleod.logical.connective     DEBUG    Rescope Called: ((c(x,z) -> c(x,y)) <-> p(z,y))
2023-04-02 16:32:30,934 macleod.logical.connective     DEBUG    No Quantifier children: ((c(x,z) -> c(x,y)) <-> p(z,y))
2023-04-02 16:32:30,934 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]
2023-04-02 16:32:30,934 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\forall x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]]
2023-04-02 16:32:30,942 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\forall x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]]
2023-04-02 16:32:30,942 macleod.logical.quantifier     DEBUG    Found a matching quantifier
2023-04-02 16:32:30,942 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y,x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]
2023-04-02 16:32:30,942 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y,x\;[((c(x,z) -> c(x,y)) <-> p(z,y))]
2023-04-02 16:32:30,942 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(pp(x,y) <-> (p(x,y) & ~p(y,x)))]
2023-04-02 16:32:30,942 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(pp(x,y) <-> (p(x,y) & ~p(y,x)))]
2023-04-02 16:32:30,950 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-02 16:32:30,950 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-02 16:32:30,950 macleod.logical.axiom          DEBUG    Term: p(y,z)
2023-04-02 16:32:30,958 macleod.logical.axiom          DEBUG    Term: ~p(y,z)
2023-04-02 16:32:30,959 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-02 16:32:30,959 macleod.logical.axiom          DEBUG    Term: (p(z,y) & ~p(y,z))
2023-04-02 16:32:30,959 macleod.logical.connective     DEBUG    Coalesced Called: (p(z,y) & ~p(y,z))
2023-04-02 16:32:30,960 macleod.logical.axiom          DEBUG    Coalesced Term: (p(z,y) & ~p(y,z))
2023-04-02 16:32:30,960 macleod.logical.connective     DEBUG    Rescope Called: (p(z,y) & ~p(y,z))
2023-04-02 16:32:30,961 macleod.logical.connective     DEBUG    No Quantifier children: (p(z,y) & ~p(y,z))
2023-04-02 16:32:30,962 macleod.logical.axiom          DEBUG    Rescoped Term: (p(z,y) & ~p(y,z))
2023-04-02 16:32:30,962 macleod.logical.axiom          DEBUG    Term: pp(z,y)
2023-04-02 16:32:30,962 macleod.logical.axiom          DEBUG    Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-02 16:32:30,964 macleod.logical.connective     DEBUG    Coalesced Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-02 16:32:30,964 macleod.logical.axiom          DEBUG    Coalesced Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-02 16:32:30,964 macleod.logical.connective     DEBUG    Rescope Called: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-02 16:32:30,965 macleod.logical.connective     DEBUG    No Quantifier children: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-02 16:32:30,966 macleod.logical.axiom          DEBUG    Rescoped Term: (pp(z,y) <-> (p(z,y) & ~p(y,z)))
2023-04-02 16:32:30,966 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-02 16:32:30,966 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-02 16:32:30,966 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-02 16:32:30,966 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[(pp(z,y) <-> (p(z,y) & ~p(y,z)))]
2023-04-02 16:32:30,974 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(o(x,y) <-> \exists z\;[(p(z,x) & p(z,y))])]
2023-04-02 16:32:30,974 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(o(x,y) <-> \exists z\;[(p(z,x) & p(z,y))])]
2023-04-02 16:32:30,974 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])]
2023-04-02 16:32:30,974 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])]
2023-04-02 16:32:30,974 macleod.logical.axiom          DEBUG    Term: p(x,y)
2023-04-02 16:32:30,974 macleod.logical.axiom          DEBUG    Term: p(x,z)
2023-04-02 16:32:30,974 macleod.logical.axiom          DEBUG    Term: (p(x,z) & p(x,y))
2023-04-02 16:32:30,974 macleod.logical.connective     DEBUG    Coalesced Called: (p(x,z) & p(x,y))
2023-04-02 16:32:30,974 macleod.logical.axiom          DEBUG    Coalesced Term: (p(x,z) & p(x,y))
2023-04-02 16:32:30,974 macleod.logical.connective     DEBUG    Rescope Called: (p(x,z) & p(x,y))
2023-04-02 16:32:30,974 macleod.logical.connective     DEBUG    No Quantifier children: (p(x,z) & p(x,y))
2023-04-02 16:32:30,982 macleod.logical.axiom          DEBUG    Rescoped Term: (p(x,z) & p(x,y))
2023-04-02 16:32:30,982 macleod.logical.axiom          DEBUG    Term: \exists x\;[(p(x,z) & p(x,y))]
2023-04-02 16:32:30,982 macleod.logical.axiom          DEBUG    Term: o(z,y)
2023-04-02 16:32:30,982 macleod.logical.axiom          DEBUG    Term: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-02 16:32:30,982 macleod.logical.connective     DEBUG    Coalesced Called: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-02 16:32:30,982 macleod.logical.axiom          DEBUG    Coalesced Term: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-02 16:32:30,982 macleod.logical.connective     DEBUG    Rescope Called: (o(z,y) <-> \exists x\;[(p(x,z) & p(x,y))])
2023-04-02 16:32:30,985 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-02 16:32:30,985 macleod.logical.connective     DEBUG    Rescope Called: ((p(x,z) & p(x,y)) <-> o(z,y))
2023-04-02 16:32:30,985 macleod.logical.connective     DEBUG    No Quantifier children: ((p(x,z) & p(x,y)) <-> o(z,y))
2023-04-02 16:32:30,985 macleod.logical.axiom          DEBUG    Rescoped Term: \exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]
2023-04-02 16:32:30,985 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-02 16:32:30,985 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-02 16:32:30,990 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-02 16:32:30,990 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[\exists x\;[((p(x,z) & p(x,y)) <-> o(z,y))]]
2023-04-02 16:32:30,990 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(ec(x,y) <-> (c(x,y) & ~o(x,y)))]
2023-04-02 16:32:30,990 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(ec(x,y) <-> (c(x,y) & ~o(x,y)))]
2023-04-02 16:32:30,990 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-02 16:32:30,998 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-02 16:32:30,998 macleod.logical.axiom          DEBUG    Term: o(z,y)
2023-04-02 16:32:30,998 macleod.logical.axiom          DEBUG    Term: ~o(z,y)
2023-04-02 16:32:30,998 macleod.logical.axiom          DEBUG    Term: c(z,y)
2023-04-02 16:32:30,998 macleod.logical.axiom          DEBUG    Term: (c(z,y) & ~o(z,y))
2023-04-02 16:32:30,998 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,y) & ~o(z,y))
2023-04-02 16:32:30,998 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,y) & ~o(z,y))
2023-04-02 16:32:30,998 macleod.logical.connective     DEBUG    Rescope Called: (c(z,y) & ~o(z,y))
2023-04-02 16:32:30,998 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,y) & ~o(z,y))
2023-04-02 16:32:30,998 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,y) & ~o(z,y))
2023-04-02 16:32:30,998 macleod.logical.axiom          DEBUG    Term: ec(z,y)
2023-04-02 16:32:30,998 macleod.logical.axiom          DEBUG    Term: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-02 16:32:31,006 macleod.logical.connective     DEBUG    Coalesced Called: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-02 16:32:31,006 macleod.logical.axiom          DEBUG    Coalesced Term: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-02 16:32:31,006 macleod.logical.connective     DEBUG    Rescope Called: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-02 16:32:31,006 macleod.logical.connective     DEBUG    No Quantifier children: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-02 16:32:31,006 macleod.logical.axiom          DEBUG    Rescoped Term: (ec(z,y) <-> (c(z,y) & ~o(z,y)))
2023-04-02 16:32:31,006 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-02 16:32:31,006 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-02 16:32:31,006 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-02 16:32:31,006 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[(ec(z,y) <-> (c(z,y) & ~o(z,y)))]
2023-04-02 16:32:31,006 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(ntpp(x,y) <-> (pp(x,y) & ~\exists z\;[(ec(z,x) & ec(z,y))]))]
2023-04-02 16:32:31,014 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(ntpp(x,y) <-> (pp(x,y) & ~\exists z\;[(ec(z,x) & ec(z,y))]))]
2023-04-02 16:32:31,014 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(ntpp(z,y) <-> (pp(z,y) & ~\exists x\;[(ec(x,z) & ec(x,y))]))]
2023-04-02 16:32:31,022 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(ntpp(z,y) <-> (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))]))]
2023-04-02 16:32:31,022 macleod.logical.axiom          DEBUG    Term: ec(x,y)
2023-04-02 16:32:31,022 macleod.logical.axiom          DEBUG    Term: ec(x,z)
2023-04-02 16:32:31,022 macleod.logical.axiom          DEBUG    Term: ~ec(x,y)
2023-04-02 16:32:31,022 macleod.logical.axiom          DEBUG    Term: ~ec(x,z)
2023-04-02 16:32:31,022 macleod.logical.axiom          DEBUG    Term: (~ec(x,z) | ~ec(x,y))
2023-04-02 16:32:31,022 macleod.logical.connective     DEBUG    Coalesced Called: (~ec(x,z) | ~ec(x,y))
2023-04-02 16:32:31,022 macleod.logical.axiom          DEBUG    Coalesced Term: (~ec(x,z) | ~ec(x,y))
2023-04-02 16:32:31,022 macleod.logical.connective     DEBUG    Rescope Called: (~ec(x,z) | ~ec(x,y))
2023-04-02 16:32:31,022 macleod.logical.connective     DEBUG    No Quantifier children: (~ec(x,z) | ~ec(x,y))
2023-04-02 16:32:31,030 macleod.logical.axiom          DEBUG    Rescoped Term: (~ec(x,z) | ~ec(x,y))
2023-04-02 16:32:31,030 macleod.logical.axiom          DEBUG    Term: \forall x\;[(~ec(x,z) | ~ec(x,y))]
2023-04-02 16:32:31,030 macleod.logical.axiom          DEBUG    Term: pp(z,y)
2023-04-02 16:32:31,030 macleod.logical.axiom          DEBUG    Term: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-02 16:32:31,030 macleod.logical.connective     DEBUG    Coalesced Called: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-02 16:32:31,030 macleod.logical.axiom          DEBUG    Coalesced Term: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-02 16:32:31,030 macleod.logical.connective     DEBUG    Rescope Called: (pp(z,y) & \forall x\;[(~ec(x,z) | ~ec(x,y))])
2023-04-02 16:32:31,030 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-02 16:32:31,030 macleod.logical.connective     DEBUG    Rescope Called: ((~ec(x,z) | ~ec(x,y)) & pp(z,y))
2023-04-02 16:32:31,030 macleod.logical.connective     DEBUG    No Quantifier children: ((~ec(x,z) | ~ec(x,y)) & pp(z,y))
2023-04-02 16:32:31,038 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))]
2023-04-02 16:32:31,038 macleod.logical.axiom          DEBUG    Term: ntpp(z,y)
2023-04-02 16:32:31,038 macleod.logical.axiom          DEBUG    Term: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-02 16:32:31,038 macleod.logical.connective     DEBUG    Coalesced Called: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-02 16:32:31,038 macleod.logical.axiom          DEBUG    Coalesced Term: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-02 16:32:31,038 macleod.logical.connective     DEBUG    Rescope Called: (ntpp(z,y) <-> \forall x\;[((~ec(x,z) | ~ec(x,y)) & pp(z,y))])
2023-04-02 16:32:31,038 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-02 16:32:31,038 macleod.logical.connective     DEBUG    Rescope Called: (((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))
2023-04-02 16:32:31,038 macleod.logical.connective     DEBUG    No Quantifier children: (((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))
2023-04-02 16:32:31,038 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]
2023-04-02 16:32:31,046 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\forall x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]]
2023-04-02 16:32:31,046 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\forall x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]]
2023-04-02 16:32:31,046 macleod.logical.quantifier     DEBUG    Found a matching quantifier
2023-04-02 16:32:31,046 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y,x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]
2023-04-02 16:32:31,046 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y,x\;[(((~ec(x,z) | ~ec(x,y)) & pp(z,y)) <-> ntpp(z,y))]
2023-04-02 16:32:31,046 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x\;[c(x,x)]
2023-04-02 16:32:31,046 macleod.logical.axiom          DEBUG    Function Free: \forall x\;[c(x,x)]
2023-04-02 16:32:31,046 macleod.logical.axiom          DEBUG    Unique Variables: \forall z\;[c(z,z)]
2023-04-02 16:32:31,046 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z\;[c(z,z)]
2023-04-02 16:32:31,054 macleod.logical.axiom          DEBUG    Term: c(z,z)
2023-04-02 16:32:31,056 macleod.logical.axiom          DEBUG    Term: \forall z\;[c(z,z)]
2023-04-02 16:32:31,056 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z\;[c(z,z)]
2023-04-02 16:32:31,056 macleod.logical.axiom          DEBUG    Prenex Form: \forall z\;[c(z,z)]
2023-04-02 16:32:31,056 macleod.logical.axiom          DEBUG    CNF Form: \forall z\;[c(z,z)]
2023-04-02 16:32:31,056 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(c(x,y) -> c(y,x))]
2023-04-02 16:32:31,059 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(c(x,y) -> c(y,x))]
2023-04-02 16:32:31,059 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-02 16:32:31,059 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-02 16:32:31,059 macleod.logical.axiom          DEBUG    Term: c(y,z)
2023-04-02 16:32:31,059 macleod.logical.axiom          DEBUG    Term: c(z,y)
2023-04-02 16:32:31,063 macleod.logical.axiom          DEBUG    Term: (c(z,y) -> c(y,z))
2023-04-02 16:32:31,063 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,y) -> c(y,z))
2023-04-02 16:32:31,063 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,y) -> c(y,z))
2023-04-02 16:32:31,063 macleod.logical.connective     DEBUG    Rescope Called: (c(z,y) -> c(y,z))
2023-04-02 16:32:31,063 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,y) -> c(y,z))
2023-04-02 16:32:31,063 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,y) -> c(y,z))
2023-04-02 16:32:31,063 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-02 16:32:31,063 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-02 16:32:31,063 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-02 16:32:31,063 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y\;[(c(z,y) -> c(y,z))]
2023-04-02 16:32:31,068 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x\;[c(x,uni)]
2023-04-02 16:32:31,070 macleod.logical.axiom          DEBUG    Function Free: \forall x\;[c(x,uni)]
2023-04-02 16:32:31,072 macleod.logical.utils          INFO     Found a constant!
2023-04-02 16:32:31,072 macleod.logical.axiom          DEBUG    Unique Variables: \forall z\;[c(z,uni)]
2023-04-02 16:32:31,075 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z\;[c(z,uni)]
2023-04-02 16:32:31,075 macleod.logical.axiom          DEBUG    Term: c(z,uni)
2023-04-02 16:32:31,075 macleod.logical.axiom          DEBUG    Term: \forall z\;[c(z,uni)]
2023-04-02 16:32:31,077 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z\;[c(z,uni)]
2023-04-02 16:32:31,077 macleod.logical.axiom          DEBUG    Prenex Form: \forall z\;[c(z,uni)]
2023-04-02 16:32:31,078 macleod.logical.axiom          DEBUG    CNF Form: \forall z\;[c(z,uni)]
2023-04-02 16:32:31,079 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y\;[(~=(y,uni) -> (o(x,compl(y)) <-> ~p(x,y)))]
2023-04-02 16:32:31,079 macleod.logical.axiom          DEBUG    Adding function declaration on: compl
2023-04-02 16:32:31,079 macleod.logical.axiom          DEBUG    Function Free: \forall x,y\;[(~=(y,uni) -> (\forall c2\;[(o(x,c2) | ~compl(y,c2))] <-> ~p(x,y)))]
2023-04-02 16:32:31,079 macleod.logical.utils          INFO     Found a constant!
2023-04-02 16:32:31,087 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y\;[(~=(y,uni) -> (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y)))]
2023-04-02 16:32:31,094 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y\;[(~=(y,uni) -> (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y)))]
2023-04-02 16:32:31,095 macleod.logical.axiom          DEBUG    Term: compl(y,x)
2023-04-02 16:32:31,095 macleod.logical.axiom          DEBUG    Term: ~compl(y,x)
2023-04-02 16:32:31,096 macleod.logical.axiom          DEBUG    Term: o(z,x)
2023-04-02 16:32:31,097 macleod.logical.axiom          DEBUG    Term: p(z,y)
2023-04-02 16:32:31,097 macleod.logical.axiom          DEBUG    Term: (o(z,x) | ~compl(y,x))
2023-04-02 16:32:31,097 macleod.logical.connective     DEBUG    Coalesced Called: (o(z,x) | ~compl(y,x))
2023-04-02 16:32:31,098 macleod.logical.axiom          DEBUG    Coalesced Term: (o(z,x) | ~compl(y,x))
2023-04-02 16:32:31,099 macleod.logical.connective     DEBUG    Rescope Called: (o(z,x) | ~compl(y,x))
2023-04-02 16:32:31,099 macleod.logical.connective     DEBUG    No Quantifier children: (o(z,x) | ~compl(y,x))
2023-04-02 16:32:31,101 macleod.logical.axiom          DEBUG    Rescoped Term: (o(z,x) | ~compl(y,x))
2023-04-02 16:32:31,101 macleod.logical.axiom          DEBUG    Term: ~p(z,y)
2023-04-02 16:32:31,103 macleod.logical.axiom          DEBUG    Term: \forall x\;[(o(z,x) | ~compl(y,x))]
2023-04-02 16:32:31,105 macleod.logical.axiom          DEBUG    Term: =(y,uni)
2023-04-02 16:32:31,105 macleod.logical.axiom          DEBUG    Term: (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y))
2023-04-02 16:32:31,107 macleod.logical.connective     DEBUG    Coalesced Called: (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y))
2023-04-02 16:32:31,107 macleod.logical.axiom          DEBUG    Coalesced Term: (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y))
2023-04-02 16:32:31,107 macleod.logical.connective     DEBUG    Rescope Called: (\forall x\;[(o(z,x) | ~compl(y,x))] <-> ~p(z,y))
2023-04-02 16:32:31,107 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-02 16:32:31,107 macleod.logical.connective     DEBUG    Rescope Called: ((o(z,x) | ~compl(y,x)) <-> ~p(z,y))
2023-04-02 16:32:31,112 macleod.logical.connective     DEBUG    No Quantifier children: ((o(z,x) | ~compl(y,x)) <-> ~p(z,y))
2023-04-02 16:32:31,112 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))]
2023-04-02 16:32:31,115 macleod.logical.axiom          DEBUG    Term: ~=(y,uni)
2023-04-02 16:32:31,115 macleod.logical.axiom          DEBUG    Term: (~=(y,uni) -> \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))])
2023-04-02 16:32:31,116 macleod.logical.connective     DEBUG    Coalesced Called: (~=(y,uni) -> \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))])
2023-04-02 16:32:31,116 macleod.logical.axiom          DEBUG    Coalesced Term: (~=(y,uni) -> \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))])
2023-04-02 16:32:31,116 macleod.logical.connective     DEBUG    Rescope Called: (~=(y,uni) -> \forall x\;[((o(z,x) | ~compl(y,x)) <-> ~p(z,y))])
2023-04-02 16:32:31,116 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-02 16:32:31,120 macleod.logical.connective     DEBUG    Rescope Called: (((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))
2023-04-02 16:32:31,121 macleod.logical.connective     DEBUG    No Quantifier children: (((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))
2023-04-02 16:32:31,122 macleod.logical.axiom          DEBUG    Rescoped Term: \forall x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]
2023-04-02 16:32:31,122 macleod.logical.axiom          DEBUG    Term: \forall z,y\;[\forall x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]]
2023-04-02 16:32:31,122 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y\;[\forall x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]]
2023-04-02 16:32:31,125 macleod.logical.quantifier     DEBUG    Found a matching quantifier
2023-04-02 16:32:31,125 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y,x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]
2023-04-02 16:32:31,128 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y,x\;[(((o(z,x) | ~compl(y,x)) <-> ~p(z,y)) -> ~=(y,uni))]
2023-04-02 16:32:31,130 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y,z\;[(c(x,sum(y,z)) <-> (c(x,y) | c(x,z)))]
2023-04-02 16:32:31,130 macleod.logical.axiom          DEBUG    Function Free: \forall x,y,z\;[(\forall s3\;[(c(x,s3) | ~sum(y,z,s3))] <-> (c(x,y) | c(x,z)))]
2023-04-02 16:32:31,130 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y,x\;[(\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))]
2023-04-02 16:32:31,136 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y,x\;[(\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))]
2023-04-02 16:32:31,136 macleod.logical.axiom          DEBUG    Term: sum(y,x,w)
2023-04-02 16:32:31,139 macleod.logical.axiom          DEBUG    Term: ~sum(y,x,w)
2023-04-02 16:32:31,139 macleod.logical.axiom          DEBUG    Term: c(z,w)
2023-04-02 16:32:31,139 macleod.logical.axiom          DEBUG    Term: c(z,x)
2023-04-02 16:32:31,139 macleod.logical.axiom          DEBUG    Term: c(z,y)
2023-04-02 16:32:31,139 macleod.logical.axiom          DEBUG    Term: (c(z,w) | ~sum(y,x,w))
2023-04-02 16:32:31,139 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,w) | ~sum(y,x,w))
2023-04-02 16:32:31,139 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,w) | ~sum(y,x,w))
2023-04-02 16:32:31,139 macleod.logical.connective     DEBUG    Rescope Called: (c(z,w) | ~sum(y,x,w))
2023-04-02 16:32:31,139 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,w) | ~sum(y,x,w))
2023-04-02 16:32:31,139 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,w) | ~sum(y,x,w))
2023-04-02 16:32:31,139 macleod.logical.axiom          DEBUG    Term: (c(z,y) | c(z,x))
2023-04-02 16:32:31,139 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,y) | c(z,x))
2023-04-02 16:32:31,139 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,y) | c(z,x))
2023-04-02 16:32:31,144 macleod.logical.connective     DEBUG    Rescope Called: (c(z,y) | c(z,x))
2023-04-02 16:32:31,144 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,y) | c(z,x))
2023-04-02 16:32:31,144 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,y) | c(z,x))
2023-04-02 16:32:31,144 macleod.logical.axiom          DEBUG    Term: \forall w\;[(c(z,w) | ~sum(y,x,w))]
2023-04-02 16:32:31,144 macleod.logical.axiom          DEBUG    Term: (\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))
2023-04-02 16:32:31,144 macleod.logical.connective     DEBUG    Coalesced Called: (\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))
2023-04-02 16:32:31,144 macleod.logical.axiom          DEBUG    Coalesced Term: (\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))
2023-04-02 16:32:31,144 macleod.logical.connective     DEBUG    Rescope Called: (\forall w\;[(c(z,w) | ~sum(y,x,w))] <-> (c(z,y) | c(z,x)))
2023-04-02 16:32:31,144 macleod.logical.connective     DEBUG    Rescoping: Single quantifier
2023-04-02 16:32:31,144 macleod.logical.connective     DEBUG    Rescope Called: ((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))
2023-04-02 16:32:31,144 macleod.logical.connective     DEBUG    No Quantifier children: ((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))
2023-04-02 16:32:31,144 macleod.logical.axiom          DEBUG    Rescoped Term: \forall w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]
2023-04-02 16:32:31,144 macleod.logical.axiom          DEBUG    Term: \forall z,y,x\;[\forall w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]]
2023-04-02 16:32:31,144 macleod.logical.axiom          DEBUG    Duplicated Prenex: \forall z,y,x\;[\forall w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]]
2023-04-02 16:32:31,152 macleod.logical.quantifier     DEBUG    Found a matching quantifier
2023-04-02 16:32:31,160 macleod.logical.axiom          DEBUG    Prenex Form: \forall z,y,x,w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]
2023-04-02 16:32:31,174 macleod.logical.axiom          DEBUG    CNF Form: \forall z,y,x,w\;[((c(z,w) | ~sum(y,x,w)) <-> (c(z,y) | c(z,x)))]
2023-04-02 16:32:31,177 macleod.logical.axiom          DEBUG    Starting Axiom: \forall x,y,z\;[(o(y,z) -> (c(x,prod(y,z)) <-> \exists w\;[(p(w,y) & p(w,z) & c(x,w))]))]
2023-04-02 16:32:31,177 macleod.logical.axiom          DEBUG    Function Free: \forall x,y,z\;[(o(y,z) -> (\forall p4\;[(c(x,p4) | ~prod(y,z,p4))] <-> \exists w\;[(p(w,y) & p(w,z) & c(x,w))]))]
2023-04-02 16:32:31,186 macleod.logical.axiom          DEBUG    Unique Variables: \forall z,y,x\;[(o(y,x) -> (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))]))]
2023-04-02 16:32:31,195 macleod.logical.axiom          DEBUG    Distributed Negation: \forall z,y,x\;[(o(y,x) -> (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))]))]
2023-04-02 16:32:31,195 macleod.logical.axiom          DEBUG    Term: prod(y,x,w)
2023-04-02 16:32:31,195 macleod.logical.axiom          DEBUG    Term: c(z,v)
2023-04-02 16:32:31,195 macleod.logical.axiom          DEBUG    Term: p(v,x)
2023-04-02 16:32:31,195 macleod.logical.axiom          DEBUG    Term: p(v,y)
2023-04-02 16:32:31,195 macleod.logical.axiom          DEBUG    Term: ~prod(y,x,w)
2023-04-02 16:32:31,195 macleod.logical.axiom          DEBUG    Term: c(z,w)
2023-04-02 16:32:31,195 macleod.logical.axiom          DEBUG    Term: (p(v,y) & p(v,x) & c(z,v))
2023-04-02 16:32:31,195 macleod.logical.connective     DEBUG    Coalesced Called: (p(v,y) & p(v,x) & c(z,v))
2023-04-02 16:32:31,195 macleod.logical.axiom          DEBUG    Coalesced Term: (p(v,y) & p(v,x) & c(z,v))
2023-04-02 16:32:31,195 macleod.logical.connective     DEBUG    Rescope Called: (p(v,y) & p(v,x) & c(z,v))
2023-04-02 16:32:31,195 macleod.logical.connective     DEBUG    No Quantifier children: (p(v,y) & p(v,x) & c(z,v))
2023-04-02 16:32:31,195 macleod.logical.axiom          DEBUG    Rescoped Term: (p(v,y) & p(v,x) & c(z,v))
2023-04-02 16:32:31,195 macleod.logical.axiom          DEBUG    Term: (c(z,w) | ~prod(y,x,w))
2023-04-02 16:32:31,195 macleod.logical.connective     DEBUG    Coalesced Called: (c(z,w) | ~prod(y,x,w))
2023-04-02 16:32:31,195 macleod.logical.axiom          DEBUG    Coalesced Term: (c(z,w) | ~prod(y,x,w))
2023-04-02 16:32:31,202 macleod.logical.connective     DEBUG    Rescope Called: (c(z,w) | ~prod(y,x,w))
2023-04-02 16:32:31,202 macleod.logical.connective     DEBUG    No Quantifier children: (c(z,w) | ~prod(y,x,w))
2023-04-02 16:32:31,202 macleod.logical.axiom          DEBUG    Rescoped Term: (c(z,w) | ~prod(y,x,w))
2023-04-02 16:32:31,202 macleod.logical.axiom          DEBUG    Term: \exists v\;[(p(v,y) & p(v,x) & c(z,v))]
2023-04-02 16:32:31,202 macleod.logical.axiom          DEBUG    Term: \forall w\;[(c(z,w) | ~prod(y,x,w))]
2023-04-02 16:32:31,202 macleod.logical.axiom          DEBUG    Term: (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))])
2023-04-02 16:32:31,202 macleod.logical.connective     DEBUG    Coalesced Called: (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))])
2023-04-02 16:32:31,202 macleod.logical.axiom          DEBUG    Coalesced Term: (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))])
2023-04-02 16:32:31,202 macleod.logical.connective     DEBUG    Rescope Called: (\forall w\;[(c(z,w) | ~prod(y,x,w))] <-> \exists v\;[(p(v,y) & p(v,x) & c(z,v))])
2023-04-02 16:47:10,285 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-02 16:47:10,285 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-02 16:47:10,285 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-02 16:47:10,285 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_basic.clif
2023-04-02 16:47:31,973 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-02 16:47:31,973 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-02 16:47:31,973 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-02 16:47:31,981 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_basic.clif
2023-04-02 16:47:40,252 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-02 16:47:40,260 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-02 16:47:40,260 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-02 16:47:40,260 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_basic.clif
2023-04-03 14:45:05,860 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-03 14:45:05,861 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-03 14:45:05,862 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-03 14:45:05,863 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-04-03 14:45:22,382 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-03 14:45:22,384 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-03 14:45:22,384 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-03 14:45:22,384 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_basic.clif
2023-04-03 14:50:52,595 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-03 14:50:52,595 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-03 14:50:52,595 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-03 14:50:52,595 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_basic.clif
2023-04-03 14:51:10,256 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-03 14:51:10,257 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-03 14:51:10,257 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-03 14:51:10,258 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-04-03 14:55:53,389 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-03 14:55:53,390 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-03 14:55:53,390 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-03 14:55:53,390 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_extended (1).clif
2023-04-03 14:57:03,216 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-03 14:57:03,216 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-03 14:57:03,216 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-03 14:57:03,224 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_restriction.clif
2023-04-03 14:57:26,994 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-03 14:57:26,995 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-03 14:57:26,995 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-03 14:57:26,995 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_restriction.clif
2023-04-03 14:59:13,792 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-03 14:59:13,793 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-03 14:59:13,793 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-03 14:59:13,794 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_restriction.clif
2023-04-03 14:59:23,377 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-03 14:59:23,378 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-03 14:59:23,378 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-03 14:59:29,934 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_restriction.clif
2023-04-03 15:01:14,442 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-03 15:01:14,443 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-03 15:01:14,443 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-03 15:01:22,653 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_restriction.clif
2023-04-03 15:02:10,325 macleod.Filemgt                INFO     Config file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\macleod_win.conf
2023-04-03 15:02:10,326 macleod.Filemgt                INFO     Logging configuration file read: C:\Users\gunna\AppData\Local\Packages\PythonSoftwareFoundation.Python.3.10_qbz5n2kfra8p0\LocalCache\local-packages\Python310\site-packages\macleod\conf\logging.conf
2023-04-03 15:02:10,326 macleod.Filemgt                DEBUG    Started logging with MacleodConfigParser
2023-04-03 15:02:10,327 macleod.scripts.parserlib      INFO     Starting to parse macleod/src/macleod/tests/rcc_restriction.clif
