%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL671+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:43 PM UTC 2026 % Result : CounterSatisfiable 212.68s 28.43s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL671+1.001 : TPTP v9.3.1. Released v4.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.10/0.37 % Computer : n018.cluster.edu % 0.10/0.37 % Model : x86_64 x86_64 % 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.37 % Memory : 8046.5625MB % 0.10/0.37 % OS : Linux 6.8.0-71-generic % 0.10/0.37 % CPULimit : 300 % 0.10/0.37 % WCLimit : 300 % 0.10/0.37 % DateTime : Fri Sep 4 14:32:32 UTC 2026 % 0.10/0.38 % CPUTime : % 0.10/0.41 # No SInE strategy applied % 0.10/0.41 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI % 0.10/0.41 # and selection function SelectNewComplexAHP. % 0.10/0.41 # % 0.10/0.41 # Presaturation interreduction done % 0.10/0.41 # Number of axioms: 36 Number of unprocessed: 36 % 0.10/0.41 # Tableaux proof search. % 0.10/0.41 # APR header successfully linked. % 0.10/0.41 # Hello from C++ % 0.10/0.41 # The folding up rule is enabled... % 0.10/0.41 # Local unification is enabled... % 0.10/0.41 # Any saturation attempts will use folding labels... % 0.10/0.41 # 36 beginning clauses after preprocessing and clausification % 0.10/0.41 # Creating start rules for all 35 conjectures. % 0.10/0.41 # There are 35 start rule candidates: % 0.10/0.41 # Found 6 unit axioms. % 0.10/0.41 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.10/0.41 # 35 start rule tableaux created. % 0.10/0.41 # 30 extension rule candidate clauses % 0.10/0.41 # 6 unit axiom clauses % 0.10/0.41 % 0.10/0.41 # Requested 8, 32 cores available to the main process. % 127.90/16.98 # Ran out of tableaux, making start rules for all clauses % 195.82/26.26 # Ran out of tableaux, making start rules for all clauses % 212.68/28.41 # 4097186 Satisfiable branch % 212.68/28.43 # Satisfiable branch found. % 212.68/28.43 # There were 69 total branch saturation attempts. % 212.68/28.43 # There were 56 of these attempts blocked. % 212.68/28.43 # There were 0 deferred branch saturation attempts. % 212.68/28.43 # There were 0 free duplicated saturations. % 212.68/28.43 # There were 2 total successful branch saturations. % 212.68/28.43 # There were 2 successful branch saturations in interreduction. % 212.68/28.43 # There were 0 successful branch saturations on the branch. % 212.68/28.43 # There were 0 successful branch saturations after the branch. % 212.68/28.43 # SZS status CounterSatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 212.68/28.43 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 212.68/28.43 # Begin clausification derivation % 212.68/28.43 % 212.68/28.43 # End clausification derivation % 212.68/28.43 # Begin listing active clauses obtained from FOF to CNF conversion % 212.68/28.43 cnf(i_0_11, negated_conjecture, (r1(esk1_0,esk11_0))). % 212.68/28.43 cnf(i_0_6, negated_conjecture, (r1(esk1_0,esk14_0))). % 212.68/28.43 cnf(i_0_10, negated_conjecture, (r1(esk11_0,esk12_0))). % 212.68/28.43 cnf(i_0_8, negated_conjecture, (r1(esk11_0,esk13_0))). % 212.68/28.43 cnf(i_0_1, plain, (r1(X1,X1))). % 212.68/28.43 cnf(i_0_7, negated_conjecture, (~p1(esk13_0))). % 212.68/28.43 cnf(i_0_9, negated_conjecture, (p1(X1)|~r1(esk12_0,X1))). % 212.68/28.43 cnf(i_0_36, negated_conjecture, (~p4(X1)|~r1(esk1_0,X1))). % 212.68/28.43 cnf(i_0_4, negated_conjecture, (~p2(esk15_1(X1))|~r1(esk14_0,X1))). % 212.68/28.43 cnf(i_0_16, negated_conjecture, (~p2(X1)|~p3(esk8_1(X2))|~r1(esk9_1(X2),X1)|~r1(esk1_0,X2))). % 212.68/28.43 cnf(i_0_5, negated_conjecture, (r1(X1,esk15_1(X1))|~r1(esk14_0,X1))). % 212.68/28.43 cnf(i_0_15, negated_conjecture, (p2(esk7_1(X1))|r1(X1,esk9_1(X1))|~r1(esk1_0,X1))). % 212.68/28.43 cnf(i_0_17, negated_conjecture, (r1(X1,esk9_1(X1))|~p3(esk8_1(X1))|~r1(esk1_0,X1))). % 212.68/28.43 cnf(i_0_14, negated_conjecture, (p2(esk7_1(X1))|~p2(X2)|~r1(esk9_1(X1),X2)|~r1(esk1_0,X1))). % 212.68/28.43 cnf(i_0_20, negated_conjecture, (r1(X1,esk7_1(X1))|~p2(X2)|~r1(esk9_1(X1),X2)|~r1(esk1_0,X1))). % 212.68/28.43 cnf(i_0_18, negated_conjecture, (r1(esk7_1(X1),esk8_1(X1))|~p2(X2)|~r1(esk9_1(X1),X2)|~r1(esk1_0,X1))). % 212.68/28.43 cnf(i_0_21, negated_conjecture, (r1(X1,esk9_1(X1))|r1(X1,esk7_1(X1))|~r1(esk1_0,X1))). % 212.68/28.43 cnf(i_0_19, negated_conjecture, (r1(esk7_1(X1),esk8_1(X1))|r1(X1,esk9_1(X1))|~r1(esk1_0,X1))). % 212.68/28.43 cnf(i_0_12, negated_conjecture, (p1(X1)|~p1(esk10_1(X2))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))). % 212.68/28.43 cnf(i_0_3, negated_conjecture, (r1(X1,esk16_1(X1))|~p1(X2)|~r1(esk1_0,X1)|~r1(X3,X2)|~r1(X1,X3))). % 212.68/28.43 cnf(i_0_2, negated_conjecture, (p1(esk16_1(X1))|~p1(X2)|~r1(esk1_0,X1)|~r1(X3,X2)|~r1(X1,X3))). % 212.68/28.43 cnf(i_0_24, negated_conjecture, (~p2(X1)|~p3(esk5_3(X2,X3,X4))|~r1(esk6_1(X2),X1)|~r1(esk1_0,X2)|~r1(X3,X4)|~r1(X2,X3))). % 212.68/28.43 cnf(i_0_13, negated_conjecture, (p1(X1)|r1(X2,esk10_1(X2))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))). % 212.68/28.43 cnf(i_0_25, negated_conjecture, (r1(X1,esk6_1(X1))|~p3(esk5_3(X1,X2,X3))|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))). % 212.68/28.43 cnf(i_0_28, negated_conjecture, (r1(X1,esk4_3(X2,X3,X1))|~p2(X4)|~r1(esk6_1(X2),X4)|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))). % 212.68/28.43 cnf(i_0_23, negated_conjecture, (p2(esk4_3(X1,X2,X3))|r1(X1,esk6_1(X1))|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))). % 212.68/28.43 cnf(i_0_22, negated_conjecture, (p2(esk4_3(X1,X2,X3))|~p2(X4)|~r1(esk6_1(X1),X4)|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))). % 212.68/28.43 cnf(i_0_29, negated_conjecture, (r1(X1,esk4_3(X2,X3,X1))|r1(X2,esk6_1(X2))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))). % 212.68/28.43 cnf(i_0_31, negated_conjecture, (p2(X1)|r1(X2,esk3_3(X3,X4,X2))|~p2(X4)|~r1(esk1_0,X3)|~r1(X4,X1)|~r1(X4,X2)|~r1(X3,X4))). % 212.68/28.43 cnf(i_0_32, negated_conjecture, (~p2(X1)|~p2(X2)|~p3(esk2_3(X3,X2,X4))|~r1(esk3_3(X3,X2,X5),X1)|~r1(esk1_0,X3)|~r1(X2,X4)|~r1(X2,X5)|~r1(X3,X2))). % 212.68/28.43 cnf(i_0_30, negated_conjecture, (p2(X1)|~p2(X2)|~p2(X3)|~r1(esk3_3(X4,X3,X5),X2)|~r1(esk1_0,X4)|~r1(X3,X1)|~r1(X3,X5)|~r1(X4,X3))). % 212.68/28.43 cnf(i_0_33, negated_conjecture, (r1(X1,esk3_3(X2,X3,X1))|~p2(X3)|~p3(esk2_3(X2,X3,X4))|~r1(esk1_0,X2)|~r1(X3,X4)|~r1(X3,X1)|~r1(X2,X3))). % 212.68/28.43 cnf(i_0_26, negated_conjecture, (r1(esk4_3(X1,X2,X3),esk5_3(X1,X2,X3))|~p2(X4)|~r1(esk6_1(X1),X4)|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))). % 212.68/28.43 cnf(i_0_27, negated_conjecture, (r1(esk4_3(X1,X2,X3),esk5_3(X1,X2,X3))|r1(X1,esk6_1(X1))|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))). % 212.68/28.43 cnf(i_0_34, negated_conjecture, (r1(X1,esk2_3(X2,X3,X1))|~p2(X4)|~p2(X3)|~r1(esk3_3(X2,X3,X5),X4)|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X3,X5)|~r1(X2,X3))). % 212.68/28.43 cnf(i_0_35, negated_conjecture, (r1(X1,esk3_3(X2,X3,X1))|r1(X4,esk2_3(X2,X3,X4))|~p2(X3)|~r1(esk1_0,X2)|~r1(X3,X4)|~r1(X3,X1)|~r1(X2,X3))). % 212.68/28.43 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 212.68/28.43 # Begin printing tableau % 212.68/28.43 # Found 8 steps % 212.68/28.43 cnf(i_0_8, negated_conjecture, (r1(esk11_0,esk13_0)), inference(start_rule)). % 212.68/28.43 cnf(i_0_341799, plain, (p2(esk4_3(X5,esk11_0,esk13_0))), inference(closure_rule, [i_0_0])). % 212.68/28.43 cnf(i_0_341801, plain, (~r1(esk6_1(X5),esk7_1(esk1_0))), inference(closure_rule, [i_0_0])). % 212.68/28.43 cnf(i_0_341802, plain, (~r1(esk1_0,X5)), inference(closure_rule, [i_0_0])). % 212.68/28.43 cnf(i_0_341804, plain, (~r1(X5,esk11_0)), inference(closure_rule, [i_0_0])). % 212.68/28.43 cnf(i_0_183, plain, (r1(esk11_0,esk13_0)), inference(extension_rule, [i_0_22])). % 212.68/28.43 cnf(i_0_341800, plain, (~p2(esk7_1(esk1_0))), inference(extension_rule, [i_0_15])). % 212.68/28.43 cnf(i_0_598379, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 212.68/28.43 # End printing tableau % 212.68/28.43 # SZS output end % 212.68/28.43 # Branches closed with saturation will be marked with an "s" % 212.68/28.44 # Child (4097186) has found a proof. % 212.68/28.44 % 212.68/28.44 # Proof search is over... % 212.68/28.44 # Freeing feature tree %------------------------------------------------------------------------------