%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL650+1.001 : TPTP v9.3.1. Released v4.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 : n018.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:36 PM UTC 2026 % Result : Theorem 0.12s 0.40s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : LCL650+1.001 : TPTP v9.3.1. Released v4.0.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.08/0.35 % Computer : n018.cluster.edu % 0.08/0.35 % Model : x86_64 x86_64 % 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.35 % Memory : 8046.5625MB % 0.08/0.35 % OS : Linux 6.8.0-71-generic % 0.08/0.35 % CPULimit : 300 % 0.08/0.35 % WCLimit : 300 % 0.08/0.35 % DateTime : Sat Sep 5 20:01:19 UTC 2026 % 0.08/0.35 % CPUTime : % 0.12/0.38 # No SInE strategy applied % 0.12/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.38 # % 0.12/0.38 # Presaturation interreduction done % 0.12/0.38 # Number of axioms: 22 Number of unprocessed: 22 % 0.12/0.38 # Tableaux proof search. % 0.12/0.38 # APR header successfully linked. % 0.12/0.38 # Hello from C++ % 0.12/0.38 # The folding up rule is enabled... % 0.12/0.38 # Local unification is enabled... % 0.12/0.38 # Any saturation attempts will use folding labels... % 0.12/0.38 # 22 beginning clauses after preprocessing and clausification % 0.12/0.38 # Creating start rules for all 22 conjectures. % 0.12/0.38 # There are 22 start rule candidates: % 0.12/0.38 # Found 10 unit axioms. % 0.12/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.38 # 22 start rule tableaux created. % 0.12/0.38 # 12 extension rule candidate clauses % 0.12/0.38 # 10 unit axiom clauses % 0.12/0.38 % 0.12/0.38 # Requested 8, 32 cores available to the main process. % 0.12/0.40 # There were 2 total branch saturation attempts. % 0.12/0.40 # There were 0 of these attempts blocked. % 0.12/0.40 # There were 0 deferred branch saturation attempts. % 0.12/0.40 # There were 0 free duplicated saturations. % 0.12/0.40 # There were 2 total successful branch saturations. % 0.12/0.40 # There were 0 successful branch saturations in interreduction. % 0.12/0.40 # There were 0 successful branch saturations on the branch. % 0.12/0.40 # There were 2 successful branch saturations after the branch. % 0.12/0.40 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.40 # Begin clausification derivation % 0.12/0.40 % 0.12/0.40 # End clausification derivation % 0.12/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.40 cnf(i_0_22, negated_conjecture, (r1(esk1_0,esk2_0))). % 0.12/0.40 cnf(i_0_17, negated_conjecture, (r1(esk1_0,esk6_0))). % 0.12/0.40 cnf(i_0_5, negated_conjecture, (r1(esk1_0,esk9_0))). % 0.12/0.40 cnf(i_0_21, negated_conjecture, (r1(esk2_0,esk3_0))). % 0.12/0.40 cnf(i_0_20, negated_conjecture, (r1(esk3_0,esk4_0))). % 0.12/0.40 cnf(i_0_19, negated_conjecture, (r1(esk4_0,esk5_0))). % 0.12/0.40 cnf(i_0_4, negated_conjecture, (r1(esk9_0,esk10_0))). % 0.12/0.40 cnf(i_0_3, negated_conjecture, (r1(esk10_0,esk11_0))). % 0.12/0.40 cnf(i_0_2, negated_conjecture, (r1(esk11_0,esk12_0))). % 0.12/0.40 cnf(i_0_16, negated_conjecture, (~p5(esk6_0))). % 0.12/0.40 cnf(i_0_12, negated_conjecture, (~p4(esk7_1(X1))|~r1(esk1_0,X1))). % 0.12/0.40 cnf(i_0_18, negated_conjecture, (p2(esk5_0)|p4(esk5_0)|p6(esk5_0)|p8(esk5_0))). % 0.12/0.40 cnf(i_0_1, negated_conjecture, (~p1(esk12_0)|~p3(esk12_0)|~p2(esk12_0)|~p4(esk12_0))). % 0.12/0.40 cnf(i_0_13, negated_conjecture, (r1(X1,esk7_1(X1))|~r1(esk1_0,X1))). % 0.12/0.40 cnf(i_0_8, negated_conjecture, (~p3(esk8_2(X1,X2))|~r1(esk1_0,X1)|~r1(X1,X2))). % 0.12/0.40 cnf(i_0_9, negated_conjecture, (r1(X1,esk8_2(X2,X1))|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.12/0.40 cnf(i_0_11, negated_conjecture, (p3(X1)|p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X1))). % 0.12/0.40 cnf(i_0_7, negated_conjecture, (p1(X1)|p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X1))). % 0.12/0.40 cnf(i_0_10, negated_conjecture, (~p3(X1)|~p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X1))). % 0.12/0.40 cnf(i_0_6, negated_conjecture, (~p1(X1)|~p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X1))). % 0.12/0.40 cnf(i_0_14, negated_conjecture, (~p1(X1)|~p3(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X1))). % 0.12/0.40 cnf(i_0_15, negated_conjecture, (p1(X1)|p3(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X1))). % 0.12/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.40 # Begin printing tableau % 0.12/0.40 # Found 17 steps % 0.12/0.40 cnf(i_0_15, negated_conjecture, (p1(esk12_0)|p3(esk12_0)|~r1(esk1_0,esk9_0)|~r1(esk9_0,esk10_0)|~r1(esk10_0,esk11_0)|~r1(esk11_0,esk12_0)), inference(start_rule)). % 0.12/0.40 cnf(i_0_25, plain, (~r1(esk1_0,esk9_0)), inference(closure_rule, [i_0_5])). % 0.12/0.40 cnf(i_0_26, plain, (~r1(esk9_0,esk10_0)), inference(closure_rule, [i_0_4])). % 0.12/0.40 cnf(i_0_27, plain, (~r1(esk10_0,esk11_0)), inference(closure_rule, [i_0_3])). % 0.12/0.40 cnf(i_0_28, plain, (~r1(esk11_0,esk12_0)), inference(closure_rule, [i_0_2])). % 0.12/0.40 cnf(i_0_23, plain, (p1(esk12_0)), inference(extension_rule, [i_0_6])). % 0.12/0.40 cnf(i_0_101, plain, (~r1(esk1_0,esk9_0)), inference(closure_rule, [i_0_5])). % 0.12/0.40 cnf(i_0_102, plain, (~r1(esk9_0,esk10_0)), inference(closure_rule, [i_0_4])). % 0.12/0.40 cnf(i_0_103, plain, (~r1(esk10_0,esk11_0)), inference(closure_rule, [i_0_3])). % 0.12/0.40 cnf(i_0_104, plain, (~r1(esk11_0,esk12_0)), inference(closure_rule, [i_0_2])). % 0.12/0.40 cnf(i_0_100, plain, (~p2(esk12_0)), inference(extension_rule, [i_0_11])). % 0.12/0.40 cnf(i_0_131, plain, (~r1(esk1_0,esk9_0)), inference(closure_rule, [i_0_5])). % 0.12/0.40 cnf(i_0_132, plain, (~r1(esk9_0,esk10_0)), inference(closure_rule, [i_0_4])). % 0.12/0.40 cnf(i_0_133, plain, (~r1(esk10_0,esk11_0)), inference(closure_rule, [i_0_3])). % 0.12/0.40 cnf(i_0_134, plain, (~r1(esk11_0,esk12_0)), inference(closure_rule, [i_0_2])). % 0.12/0.40 cnf(i_0_24, plain, (p3(esk12_0)), inference(etableau_closure_rule, [i_0_24, ...])). % 0.12/0.40 cnf(i_0_129, plain, (p3(esk12_0)), inference(etableau_closure_rule, [i_0_129, ...])). % 0.12/0.40 # End printing tableau % 0.12/0.40 # SZS output end % 0.12/0.40 # Branches closed with saturation will be marked with an "s" % 0.12/0.40 # Child (1288390) has found a proof. % 0.12/0.40 % 0.12/0.40 # Proof search is over... % 0.12/0.40 # Freeing feature tree %------------------------------------------------------------------------------