%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL403+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 : n002.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:10 PM UTC 2026 % Result : Unknown 0.97s 1.21s % Output : None % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL403+2 : TPTP v9.3.1. Released v9.1.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.08/0.33 % Computer : n002.cluster.edu % 0.08/0.33 % Model : x86_64 x86_64 % 0.08/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.33 % Memory : 8046.5625MB % 0.08/0.33 % OS : Linux 6.8.0-71-generic % 0.08/0.33 % CPULimit : 300 % 0.08/0.33 % WCLimit : 300 % 0.08/0.33 % DateTime : Fri Sep 4 21:25:50 UTC 2026 % 0.08/0.34 % CPUTime : % 0.08/0.35 # No SInE strategy applied % 0.08/0.35 # Auto-Mode selected heuristic G_E___209_C18_F1_AE_CS_SP_PI_S0Y % 0.08/0.35 # and selection function SelectMaxLComplexAvoidPosPred. % 0.08/0.35 # % 0.08/0.35 # Number of axioms: 3 Number of unprocessed: 3 % 0.08/0.35 # Tableaux proof search. % 0.08/0.35 # APR header successfully linked. % 0.08/0.35 # Hello from C++ % 0.24/0.49 # The folding up rule is enabled... % 0.24/0.49 # Local unification is enabled... % 0.24/0.49 # Any saturation attempts will use folding labels... % 0.24/0.49 # 3 beginning clauses after preprocessing and clausification % 0.24/0.49 # Creating start rules for all 1 conjectures. % 0.24/0.49 # There are 1 start rule candidates: % 0.24/0.49 # Found 2 unit axioms. % 0.24/0.49 # 1 start rule tableaux created. % 0.24/0.49 # 1 extension rule candidate clauses % 0.24/0.49 # 2 unit axiom clauses % 0.24/0.49 % 0.24/0.49 # Requested 8, 32 cores available to the main process. % 0.24/0.49 # There are not enough tableaux to fork, creating more from the initial 1 % 0.47/0.77 # Ran out of tableaux, making start rules for all clauses % 0.97/1.20 # Returning from population with 0 new_tableaux and 0 remaining starting tableaux. % 0.97/1.20 # We now have 0 tableaux to operate on % 0.97/1.21 # Proof search is over... % 0.97/1.21 # SZS status ResourceOut % 0.97/1.21 # Freeing feature tree %------------------------------------------------------------------------------