%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL651+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 : n006.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 : CounterSatisfiable 0.10s 0.41s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : LCL651+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.10/0.36 % Computer : n006.cluster.edu % 0.10/0.36 % Model : x86_64 x86_64 % 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.36 % Memory : 8046.5625MB % 0.10/0.36 % OS : Linux 6.8.0-71-generic % 0.10/0.36 % CPULimit : 300 % 0.10/0.36 % WCLimit : 300 % 0.10/0.36 % DateTime : Sun Sep 6 01:08:31 UTC 2026 % 0.10/0.36 % CPUTime : % 0.10/0.39 # No SInE strategy applied % 0.10/0.39 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI % 0.10/0.39 # and selection function SelectNewComplexAHP. % 0.10/0.39 # % 0.10/0.39 # Presaturation interreduction done % 0.10/0.39 # Number of axioms: 28 Number of unprocessed: 28 % 0.10/0.39 # Tableaux proof search. % 0.10/0.39 # APR header successfully linked. % 0.10/0.39 # Hello from C++ % 0.10/0.39 # The folding up rule is enabled... % 0.10/0.39 # Local unification is enabled... % 0.10/0.39 # Any saturation attempts will use folding labels... % 0.10/0.39 # 28 beginning clauses after preprocessing and clausification % 0.10/0.39 # Creating start rules for all 28 conjectures. % 0.10/0.39 # There are 28 start rule candidates: % 0.10/0.39 # Found 12 unit axioms. % 0.10/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.10/0.39 # 28 start rule tableaux created. % 0.10/0.39 # 16 extension rule candidate clauses % 0.10/0.39 # 12 unit axiom clauses % 0.10/0.39 % 0.10/0.39 # Requested 8, 32 cores available to the main process. % 0.10/0.41 # 2992180 Satisfiable branch % 0.10/0.41 # Satisfiable branch found. % 0.10/0.41 # There were 1 total branch saturation attempts. % 0.10/0.41 # There were 0 of these attempts blocked. % 0.10/0.41 # There were 0 deferred branch saturation attempts. % 0.10/0.41 # There were 0 free duplicated saturations. % 0.10/0.41 # There were 0 total successful branch saturations. % 0.10/0.41 # There were 0 successful branch saturations in interreduction. % 0.10/0.41 # There were 0 successful branch saturations on the branch. % 0.10/0.41 # There were 0 successful branch saturations after the branch. % 0.10/0.41 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.10/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.10/0.41 # Begin clausification derivation % 0.10/0.41 % 0.10/0.41 # End clausification derivation % 0.10/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.10/0.41 cnf(i_0_28, negated_conjecture, (r1(esk1_0,esk2_0))). % 0.10/0.41 cnf(i_0_22, negated_conjecture, (r1(esk1_0,esk7_0))). % 0.10/0.41 cnf(i_0_6, negated_conjecture, (r1(esk1_0,esk11_0))). % 0.10/0.41 cnf(i_0_27, negated_conjecture, (r1(esk2_0,esk3_0))). % 0.10/0.41 cnf(i_0_26, negated_conjecture, (r1(esk3_0,esk4_0))). % 0.10/0.41 cnf(i_0_25, negated_conjecture, (r1(esk4_0,esk5_0))). % 0.10/0.41 cnf(i_0_24, negated_conjecture, (r1(esk5_0,esk6_0))). % 0.10/0.41 cnf(i_0_5, negated_conjecture, (r1(esk11_0,esk12_0))). % 0.10/0.41 cnf(i_0_4, negated_conjecture, (r1(esk12_0,esk13_0))). % 0.10/0.41 cnf(i_0_3, negated_conjecture, (r1(esk13_0,esk14_0))). % 0.10/0.41 cnf(i_0_2, negated_conjecture, (r1(esk14_0,esk15_0))). % 0.10/0.41 cnf(i_0_21, negated_conjecture, (~p6(esk7_0))). % 0.10/0.41 cnf(i_0_17, negated_conjecture, (~p5(esk8_1(X1))|~r1(esk1_0,X1))). % 0.10/0.41 cnf(i_0_1, negated_conjecture, (~p3(esk15_0)|~p5(esk15_0)|~p1(esk15_0)|~p2(esk15_0)|~p4(esk15_0))). % 0.10/0.41 cnf(i_0_23, negated_conjecture, (p2(esk6_0)|p4(esk6_0)|p6(esk6_0)|p8(esk6_0)|p10(esk6_0))). % 0.10/0.41 cnf(i_0_18, negated_conjecture, (r1(X1,esk8_1(X1))|~r1(esk1_0,X1))). % 0.10/0.41 cnf(i_0_14, negated_conjecture, (r1(X1,esk9_2(X2,X1))|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.10/0.41 cnf(i_0_10, negated_conjecture, (r1(X1,esk10_3(X2,X3,X1))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))). % 0.10/0.41 cnf(i_0_13, negated_conjecture, (~p4(esk9_2(X1,X2))|~r1(esk1_0,X1)|~r1(X1,X2))). % 0.10/0.41 cnf(i_0_9, negated_conjecture, (~p3(esk10_3(X1,X2,X3))|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))). % 0.10/0.41 cnf(i_0_19, negated_conjecture, (~p1(X1)|~p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))). % 0.10/0.41 cnf(i_0_15, negated_conjecture, (~p3(X1)|~p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))). % 0.10/0.41 cnf(i_0_20, negated_conjecture, (p1(X1)|p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))). % 0.10/0.41 cnf(i_0_7, negated_conjecture, (~p1(X1)|~p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))). % 0.10/0.41 cnf(i_0_11, negated_conjecture, (~p3(X1)|~p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))). % 0.10/0.41 cnf(i_0_16, negated_conjecture, (p3(X1)|p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))). % 0.10/0.41 cnf(i_0_8, negated_conjecture, (p1(X1)|p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))). % 0.10/0.41 cnf(i_0_12, negated_conjecture, (p3(X1)|p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))). % 0.10/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.10/0.41 # Begin printing tableau % 0.10/0.41 # Found 18 steps % 0.10/0.41 cnf(i_0_12, negated_conjecture, (p3(esk15_0)|p2(esk15_0)|~r1(esk1_0,esk11_0)|~r1(esk11_0,esk12_0)|~r1(esk12_0,esk13_0)|~r1(esk13_0,esk14_0)|~r1(esk14_0,esk15_0)), inference(start_rule)). % 0.10/0.41 cnf(i_0_31, plain, (~r1(esk1_0,esk11_0)), inference(closure_rule, [i_0_6])). % 0.10/0.41 cnf(i_0_32, plain, (~r1(esk11_0,esk12_0)), inference(closure_rule, [i_0_5])). % 0.10/0.41 cnf(i_0_33, plain, (~r1(esk12_0,esk13_0)), inference(closure_rule, [i_0_4])). % 0.10/0.41 cnf(i_0_34, plain, (~r1(esk13_0,esk14_0)), inference(closure_rule, [i_0_3])). % 0.10/0.41 cnf(i_0_35, plain, (~r1(esk14_0,esk15_0)), inference(closure_rule, [i_0_2])). % 0.10/0.41 cnf(i_0_29, plain, (p3(esk15_0)), inference(extension_rule, [i_0_15])). % 0.10/0.41 cnf(i_0_169, plain, (~r1(esk1_0,esk11_0)), inference(closure_rule, [i_0_6])). % 0.10/0.41 cnf(i_0_170, plain, (~r1(esk11_0,esk12_0)), inference(closure_rule, [i_0_5])). % 0.10/0.41 cnf(i_0_171, plain, (~r1(esk12_0,esk13_0)), inference(closure_rule, [i_0_4])). % 0.10/0.41 cnf(i_0_172, plain, (~r1(esk13_0,esk14_0)), inference(closure_rule, [i_0_3])). % 0.10/0.41 cnf(i_0_173, plain, (~r1(esk14_0,esk15_0)), inference(closure_rule, [i_0_2])). % 0.10/0.41 cnf(i_0_168, plain, (~p4(esk15_0)), inference(extension_rule, [i_0_20])). % 0.10/0.41 cnf(i_0_211, plain, (~r1(esk1_0,esk11_0)), inference(closure_rule, [i_0_6])). % 0.10/0.41 cnf(i_0_212, plain, (~r1(esk11_0,esk12_0)), inference(closure_rule, [i_0_5])). % 0.10/0.41 cnf(i_0_213, plain, (~r1(esk12_0,esk13_0)), inference(closure_rule, [i_0_4])). % 0.10/0.41 cnf(i_0_214, plain, (~r1(esk13_0,esk14_0)), inference(closure_rule, [i_0_3])). % 0.10/0.41 cnf(i_0_215, plain, (~r1(esk14_0,esk15_0)), inference(closure_rule, [i_0_2])). % 0.10/0.41 # End printing tableau % 0.10/0.41 # SZS output end % 0.10/0.41 # Branches closed with saturation will be marked with an "s" % 0.10/0.41 # Child (2992180) has found a proof. % 0.10/0.41 % 0.10/0.41 # Proof search is over... % 0.10/0.41 # Freeing feature tree %------------------------------------------------------------------------------