%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL655+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 : n027.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:37 PM UTC 2026 % Result : CounterSatisfiable 181.54s 23.44s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL655+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.12/0.36 % Computer : n027.cluster.edu % 0.12/0.36 % Model : x86_64 x86_64 % 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.36 % Memory : 8046.5625MB % 0.12/0.36 % OS : Linux 6.8.0-71-generic % 0.12/0.36 % CPULimit : 300 % 0.12/0.36 % WCLimit : 300 % 0.12/0.36 % DateTime : Fri Sep 4 22:00:12 UTC 2026 % 0.12/0.36 % CPUTime : % 0.12/0.39 # No SInE strategy applied % 0.12/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.39 # % 0.12/0.39 # Presaturation interreduction done % 0.12/0.39 # Number of axioms: 24 Number of unprocessed: 24 % 0.12/0.39 # Tableaux proof search. % 0.12/0.39 # APR header successfully linked. % 0.12/0.39 # Hello from C++ % 0.12/0.40 # The folding up rule is enabled... % 0.12/0.40 # Local unification is enabled... % 0.12/0.40 # Any saturation attempts will use folding labels... % 0.12/0.40 # 24 beginning clauses after preprocessing and clausification % 0.12/0.40 # Creating start rules for all 23 conjectures. % 0.12/0.40 # There are 23 start rule candidates: % 0.12/0.40 # Found 5 unit axioms. % 0.12/0.40 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.40 # 23 start rule tableaux created. % 0.12/0.40 # 19 extension rule candidate clauses % 0.12/0.40 # 5 unit axiom clauses % 0.12/0.40 % 0.12/0.40 # Requested 8, 32 cores available to the main process. % 80.22/10.63 # Ran out of tableaux, making start rules for all clauses % 116.76/15.21 # Ran out of tableaux, making start rules for all clauses % 138.25/17.92 # Ran out of tableaux, making start rules for all clauses % 180.74/23.40 # 1458053 Satisfiable branch % 181.54/23.44 # Satisfiable branch found. % 181.54/23.44 # There were 6 total branch saturation attempts. % 181.54/23.44 # There were 0 of these attempts blocked. % 181.54/23.44 # There were 0 deferred branch saturation attempts. % 181.54/23.44 # There were 0 free duplicated saturations. % 181.54/23.44 # There were 0 total successful branch saturations. % 181.54/23.44 # There were 0 successful branch saturations in interreduction. % 181.54/23.44 # There were 0 successful branch saturations on the branch. % 181.54/23.44 # There were 0 successful branch saturations after the branch. % 181.54/23.44 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 181.54/23.44 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 181.54/23.44 # Begin clausification derivation % 181.54/23.44 % 181.54/23.44 # End clausification derivation % 181.54/23.44 # Begin listing active clauses obtained from FOF to CNF conversion % 181.54/23.44 cnf(i_0_6, negated_conjecture, (r1(esk1_0,esk10_0))). % 181.54/23.44 cnf(i_0_5, negated_conjecture, (r1(esk10_0,esk11_0))). % 181.54/23.44 cnf(i_0_3, negated_conjecture, (r1(esk10_0,esk12_0))). % 181.54/23.44 cnf(i_0_1, plain, (r1(X1,X1))). % 181.54/23.44 cnf(i_0_2, negated_conjecture, (~p1(esk12_0))). % 181.54/23.44 cnf(i_0_4, negated_conjecture, (p1(X1)|~r1(esk11_0,X1))). % 181.54/23.44 cnf(i_0_13, negated_conjecture, (p1(X1)|~p1(esk6_1(X1))|~r1(esk1_0,X1))). % 181.54/23.44 cnf(i_0_14, negated_conjecture, (p1(X1)|r1(X1,esk6_1(X1))|~r1(esk1_0,X1))). % 181.54/23.44 cnf(i_0_7, negated_conjecture, (p1(X1)|~p1(esk9_1(X2))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))). % 181.54/23.44 cnf(i_0_20, negated_conjecture, (p1(X1)|~p1(esk2_3(X2,X3,X1))|~p1(esk3_1(X2))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))). % 181.54/23.44 cnf(i_0_8, negated_conjecture, (p1(X1)|r1(X2,esk9_1(X2))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))). % 181.54/23.44 cnf(i_0_10, negated_conjecture, (p1(esk7_3(X1,X2,X3))|r1(X1,esk8_1(X1))|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))). % 181.54/23.44 cnf(i_0_17, negated_conjecture, (p1(X1)|~p1(esk4_1(X2))|~p1(X3)|~r1(esk1_0,X2)|~r1(X1,X3)|~r1(X4,X1)|~r1(X2,X4))). % 181.54/23.44 cnf(i_0_21, negated_conjecture, (p1(X1)|r1(X2,esk3_1(X2))|~p1(esk2_3(X2,X3,X1))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))). % 181.54/23.44 cnf(i_0_19, negated_conjecture, (p1(X1)|p1(X2)|~p1(esk2_3(X3,X4,X2))|~r1(esk3_1(X3),X1)|~r1(esk1_0,X3)|~r1(X4,X2)|~r1(X3,X4))). % 181.54/23.44 cnf(i_0_9, negated_conjecture, (p1(esk7_3(X1,X2,X3))|~p1(X4)|~r1(esk8_1(X1),X4)|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))). % 181.54/23.44 cnf(i_0_15, negated_conjecture, (p1(esk5_1(X1))|p1(X2)|~p1(X3)|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X4,X2)|~r1(X1,X4))). % 181.54/23.44 cnf(i_0_23, negated_conjecture, (p1(X1)|r1(X1,esk2_3(X2,X3,X1))|~p1(esk3_1(X2))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))). % 181.54/23.44 cnf(i_0_11, negated_conjecture, (r1(X1,esk7_3(X2,X3,X1))|~p1(X4)|~r1(esk8_1(X2),X4)|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))). % 181.54/23.44 cnf(i_0_18, negated_conjecture, (p1(X1)|r1(X2,esk4_1(X2))|~p1(X3)|~r1(esk1_0,X2)|~r1(X1,X3)|~r1(X4,X1)|~r1(X2,X4))). % 181.54/23.44 cnf(i_0_12, negated_conjecture, (r1(X1,esk7_3(X2,X3,X1))|r1(X2,esk8_1(X2))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))). % 181.54/23.44 cnf(i_0_22, negated_conjecture, (p1(X1)|p1(X2)|r1(X2,esk2_3(X3,X4,X2))|~r1(esk3_1(X3),X1)|~r1(esk1_0,X3)|~r1(X4,X2)|~r1(X3,X4))). % 181.54/23.44 cnf(i_0_24, negated_conjecture, (p1(X1)|r1(X1,esk2_3(X2,X3,X1))|r1(X2,esk3_1(X2))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))). % 181.54/23.44 cnf(i_0_16, negated_conjecture, (p1(X1)|r1(esk4_1(X2),esk5_1(X2))|~p1(X3)|~r1(esk1_0,X2)|~r1(X1,X3)|~r1(X4,X1)|~r1(X2,X4))). % 181.54/23.44 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 181.54/23.44 # Begin printing tableau % 181.54/23.44 # Found 30 steps % 181.54/23.44 cnf(i_0_9, negated_conjecture, (p1(esk7_3(esk1_0,esk1_0,esk1_0))|~p1(esk8_1(esk1_0))|~r1(esk8_1(esk1_0),esk8_1(esk1_0))|~r1(esk1_0,esk1_0)|~r1(esk1_0,esk1_0)|~r1(esk1_0,esk1_0)), inference(start_rule)). % 181.54/23.44 cnf(i_0_78, plain, (~r1(esk8_1(esk1_0),esk8_1(esk1_0))), inference(closure_rule, [i_0_1])). % 181.54/23.44 cnf(i_0_79, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 181.54/23.44 cnf(i_0_80, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 181.54/23.44 cnf(i_0_81, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 181.54/23.44 cnf(i_0_77, plain, (~p1(esk8_1(esk1_0))), inference(extension_rule, [i_0_13])). % 181.54/23.44 cnf(i_0_572939, plain, (~r1(esk1_0,esk8_1(esk1_0))), inference(extension_rule, [i_0_12])). % 181.54/23.44 cnf(i_0_573354, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 181.54/23.44 cnf(i_0_573355, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 181.54/23.44 cnf(i_0_573356, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 181.54/23.44 cnf(i_0_573352, plain, (r1(esk1_0,esk7_3(esk1_0,esk1_0,esk1_0))), inference(extension_rule, [i_0_8])). % 181.54/23.44 cnf(i_0_573359, plain, (p1(esk12_0)), inference(closure_rule, [i_0_2])). % 181.54/23.44 cnf(i_0_573362, plain, (~r1(esk12_0,esk12_0)), inference(closure_rule, [i_0_1])). % 181.54/23.44 cnf(i_0_572938, plain, (~p1(esk6_1(esk8_1(esk1_0)))), inference(extension_rule, [i_0_20])). % 181.54/23.44 cnf(i_0_573476, plain, (~r1(esk8_1(esk1_0),esk6_1(esk8_1(esk1_0)))), inference(extension_rule, [i_0_14])). % 181.54/23.44 cnf(i_0_573477, plain, (~r1(esk8_1(esk1_0),esk8_1(esk1_0))), inference(closure_rule, [i_0_1])). % 181.54/23.44 cnf(i_0_575498, plain, (p1(esk8_1(esk1_0))), inference(closure_rule, [i_0_77])). % 181.54/23.44 cnf(i_0_573473, plain, (~p1(esk2_3(esk8_1(esk1_0),esk8_1(esk1_0),esk6_1(esk8_1(esk1_0))))), inference(extension_rule, [i_0_17])). % 181.54/23.44 cnf(i_0_575504, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 181.54/23.44 cnf(i_0_575506, plain, (~r1(esk2_3(esk8_1(esk1_0),esk8_1(esk1_0),esk6_1(esk8_1(esk1_0))),esk2_3(esk8_1(esk1_0),esk8_1(esk1_0),esk6_1(esk8_1(esk1_0))))), inference(closure_rule, [i_0_1])). % 181.54/23.44 cnf(i_0_573474, plain, (~p1(esk3_1(esk8_1(esk1_0)))), inference(extension_rule, [i_0_18])). % 181.54/23.44 cnf(i_0_575511, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 181.54/23.44 cnf(i_0_575513, plain, (~r1(esk3_1(esk8_1(esk1_0)),esk3_1(esk8_1(esk1_0)))), inference(closure_rule, [i_0_1])). % 181.54/23.44 cnf(i_0_573475, plain, (~r1(esk1_0,esk8_1(esk1_0))), inference(extension_rule, [i_0_10])). % 181.54/23.44 cnf(i_0_575552, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 181.54/23.44 cnf(i_0_575553, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 181.54/23.44 cnf(i_0_575554, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 181.54/23.44 cnf(i_0_76, plain, (p1(esk7_3(esk1_0,esk1_0,esk1_0))), inference(extension_rule, [i_0_9])). % 181.54/23.44 cnf(i_0_575584, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 181.54/23.44 cnf(i_0_575585, plain, (~r1(X6,X6)), inference(closure_rule, [i_0_1])). % 181.54/23.44 # End printing tableau % 181.54/23.44 # SZS output end % 181.54/23.44 # Branches closed with saturation will be marked with an "s" % 181.54/23.45 # Child (1458053) has found a proof. % 181.54/23.45 % 181.54/23.45 # Proof search is over... % 181.54/23.45 # Freeing feature tree %------------------------------------------------------------------------------