%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL390+2 : TPTP v9.3.1. Released v9.1.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 : n008.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:01:08 PM UTC 2026 % Result : Unknown 2.15s 2.44s % Output : None % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : LCL390+2 : TPTP v9.3.1. Released v9.1.0. % 0.00/0.03 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.07/0.34 % Computer : n008.cluster.edu % 0.07/0.34 % Model : x86_64 x86_64 % 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.07/0.34 % Memory : 8046.5625MB % 0.07/0.34 % OS : Linux 6.8.0-71-generic % 0.07/0.34 % CPULimit : 300 % 0.07/0.34 % WCLimit : 300 % 0.07/0.34 % DateTime : Sat Sep 5 07:29:38 UTC 2026 % 0.07/0.34 % CPUTime : % 0.11/0.37 # No SInE strategy applied % 0.11/0.37 # Auto-Mode selected heuristic G_E___209_C18_F1_AE_CS_SP_PI_S0Y % 0.11/0.37 # and selection function SelectMaxLComplexAvoidPosPred. % 0.11/0.37 # % 0.11/0.37 # Number of axioms: 3 Number of unprocessed: 3 % 0.11/0.37 # Tableaux proof search. % 0.11/0.37 # APR header successfully linked. % 0.11/0.37 # Hello from C++ % 0.39/0.69 # The folding up rule is enabled... % 0.39/0.69 # Local unification is enabled... % 0.39/0.69 # Any saturation attempts will use folding labels... % 0.39/0.69 # 3 beginning clauses after preprocessing and clausification % 0.39/0.69 # Creating start rules for all 1 conjectures. % 0.39/0.69 # There are 1 start rule candidates: % 0.39/0.69 # Found 2 unit axioms. % 0.39/0.69 # 1 start rule tableaux created. % 0.39/0.69 # 1 extension rule candidate clauses % 0.39/0.69 # 2 unit axiom clauses % 0.39/0.69 % 0.39/0.69 # Requested 8, 32 cores available to the main process. % 0.39/0.69 # There are not enough tableaux to fork, creating more from the initial 1 % 1.05/1.38 # Ran out of tableaux, making start rules for all clauses % 2.15/2.43 # Returning from population with 0 new_tableaux and 0 remaining starting tableaux. % 2.15/2.43 # We now have 0 tableaux to operate on % 2.15/2.44 # Proof search is over... % 2.15/2.44 # SZS status ResourceOut % 2.15/2.44 # Freeing feature tree %------------------------------------------------------------------------------