%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL032-1 : TPTP v9.3.1. Released v1.0.0. % Transfm : none % Format : tptp:raw % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % Computer : n010.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8046.5625MB % OS : Linux 6.8.0-71-generic % CPULimit : 300s % WCLimit : 300s % DateTime : Mon Sep 7 12:00:30 PM UTC 2026 % Result : Unknown 2.26s 2.52s % Output : None % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL032-1 : TPTP v9.3.1. Released v1.0.0. % 0.00/0.04 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.09/0.36 % Computer : n010.cluster.edu % 0.09/0.36 % Model : x86_64 x86_64 % 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.36 % Memory : 8046.5625MB % 0.09/0.36 % OS : Linux 6.8.0-71-generic % 0.09/0.36 % CPULimit : 300 % 0.09/0.36 % WCLimit : 300 % 0.09/0.36 % DateTime : Sat Sep 5 23:20:54 UTC 2026 % 0.09/0.36 % CPUTime : % 0.09/0.38 # No SInE strategy applied % 0.09/0.38 # Auto-Mode selected heuristic G_____0019_C18_F1_PI_SE_CS_SP_S0Y % 0.09/0.38 # and selection function SelectMaxLComplexAvoidPosPred. % 0.09/0.38 # % 0.09/0.38 # Number of axioms: 3 Number of unprocessed: 3 % 0.09/0.38 # Tableaux proof search. % 0.09/0.38 # APR header successfully linked. % 0.09/0.38 # Hello from C++ % 0.32/0.62 # The folding up rule is enabled... % 0.32/0.62 # Local unification is enabled... % 0.32/0.62 # Any saturation attempts will use folding labels... % 0.32/0.62 # 3 beginning clauses after preprocessing and clausification % 0.32/0.62 # Creating start rules for all 1 conjectures. % 0.32/0.62 # There are 1 start rule candidates: % 0.32/0.62 # Found 2 unit axioms. % 0.32/0.62 # 1 start rule tableaux created. % 0.32/0.62 # 1 extension rule candidate clauses % 0.32/0.62 # 2 unit axiom clauses % 0.32/0.62 % 0.32/0.62 # Requested 8, 32 cores available to the main process. % 0.32/0.62 # There are not enough tableaux to fork, creating more from the initial 1 % 0.90/1.15 # Ran out of tableaux, making start rules for all clauses % 2.26/2.51 # Returning from population with 0 new_tableaux and 0 remaining starting tableaux. % 2.26/2.51 # We now have 0 tableaux to operate on % 2.26/2.52 # Proof search is over... % 2.26/2.52 # SZS status ResourceOut % 2.26/2.52 # Freeing feature tree %------------------------------------------------------------------------------