%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL683+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 : n019.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:47 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.03 % Problem : LCL683+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.36 % Computer : n019.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 : Sat Sep 5 10:32:08 UTC 2026 % 0.10/0.37 % CPUTime : % 0.10/0.38 # No SInE strategy applied % 0.10/0.38 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI % 0.10/0.38 # and selection function SelectNewComplexAHP. % 0.10/0.38 # % 0.10/0.38 # Presaturation interreduction done % 0.10/0.38 # Number of axioms: 42 Number of unprocessed: 42 % 0.10/0.38 # Tableaux proof search. % 0.10/0.38 # APR header successfully linked. % 0.10/0.38 # Hello from C++ % 0.10/0.38 # The folding up rule is enabled... % 0.10/0.38 # Local unification is enabled... % 0.10/0.38 # Any saturation attempts will use folding labels... % 0.10/0.38 # 42 beginning clauses after preprocessing and clausification % 0.10/0.38 # Creating start rules for all 40 conjectures. % 0.10/0.38 # There are 40 start rule candidates: % 0.10/0.38 # Found 13 unit axioms. % 0.10/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.10/0.38 # 40 start rule tableaux created. % 0.10/0.38 # 29 extension rule candidate clauses % 0.10/0.38 # 13 unit axiom clauses % 0.10/0.38 % 0.10/0.38 # Requested 8, 32 cores available to the main process. % 0.10/0.41 # 1936846 Satisfiable branch % 0.10/0.41 # Satisfiable branch found. % 0.10/0.41 # There were 3 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 2 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 2 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_14, negated_conjecture, (r1(esk1_0,esk14_0))). % 0.10/0.41 cnf(i_0_11, negated_conjecture, (r1(esk1_0,esk16_0))). % 0.10/0.41 cnf(i_0_8, negated_conjecture, (r1(esk1_0,esk18_0))). % 0.10/0.41 cnf(i_0_5, negated_conjecture, (r1(esk1_0,esk20_0))). % 0.10/0.41 cnf(i_0_13, negated_conjecture, (r1(esk14_0,esk15_0))). % 0.10/0.41 cnf(i_0_10, negated_conjecture, (r1(esk16_0,esk17_0))). % 0.10/0.41 cnf(i_0_7, negated_conjecture, (r1(esk18_0,esk19_0))). % 0.10/0.41 cnf(i_0_4, negated_conjecture, (r1(esk20_0,esk21_0))). % 0.10/0.41 cnf(i_0_1, plain, (r1(X1,X1))). % 0.10/0.41 cnf(i_0_12, negated_conjecture, (~p15(esk15_0))). % 0.10/0.41 cnf(i_0_9, negated_conjecture, (~p13(esk17_0))). % 0.10/0.41 cnf(i_0_3, negated_conjecture, (~p11(esk21_0))). % 0.10/0.41 cnf(i_0_6, negated_conjecture, (~p12(esk19_0))). % 0.10/0.41 cnf(i_0_37, negated_conjecture, (p16(X1)|~p26(esk2_1(X1))|~r1(esk1_0,X1))). % 0.10/0.41 cnf(i_0_33, negated_conjecture, (p16(X1)|~p24(esk4_1(X1))|~r1(esk1_0,X1))). % 0.10/0.41 cnf(i_0_29, negated_conjecture, (p16(X1)|~p22(esk6_1(X1))|~r1(esk1_0,X1))). % 0.10/0.41 cnf(i_0_35, negated_conjecture, (p14(X1)|~p26(esk3_1(X1))|~r1(esk1_0,X1))). % 0.10/0.41 cnf(i_0_31, negated_conjecture, (p14(X1)|~p24(esk5_1(X1))|~r1(esk1_0,X1))). % 0.10/0.41 cnf(i_0_27, negated_conjecture, (p14(X1)|~p22(esk7_1(X1))|~r1(esk1_0,X1))). % 0.10/0.41 cnf(i_0_25, negated_conjecture, (p15(X1)|~p23(esk8_1(X1))|~r1(esk1_0,X1))). % 0.10/0.41 cnf(i_0_23, negated_conjecture, (p15(X1)|~p21(esk9_1(X1))|~r1(esk1_0,X1))). % 0.10/0.41 cnf(i_0_21, negated_conjecture, (p13(X1)|~p23(esk10_1(X1))|~r1(esk1_0,X1))). % 0.10/0.41 cnf(i_0_19, negated_conjecture, (p13(X1)|~p21(esk11_1(X1))|~r1(esk1_0,X1))). % 0.10/0.41 cnf(i_0_17, negated_conjecture, (p11(X1)|~p23(esk12_1(X1))|~r1(esk1_0,X1))). % 0.10/0.41 cnf(i_0_15, negated_conjecture, (p11(X1)|~p21(esk13_1(X1))|~r1(esk1_0,X1))). % 0.10/0.41 cnf(i_0_42, negated_conjecture, (p26(X1)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.10/0.41 cnf(i_0_41, negated_conjecture, (p25(X1)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.10/0.41 cnf(i_0_38, negated_conjecture, (p16(X1)|r1(X1,esk2_1(X1))|~r1(esk1_0,X1))). % 0.10/0.41 cnf(i_0_40, negated_conjecture, (p24(X1)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.10/0.41 cnf(i_0_39, negated_conjecture, (p22(X1)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.10/0.41 cnf(i_0_34, negated_conjecture, (p16(X1)|r1(X1,esk4_1(X1))|~r1(esk1_0,X1))). % 0.10/0.41 cnf(i_0_30, negated_conjecture, (p16(X1)|r1(X1,esk6_1(X1))|~r1(esk1_0,X1))). % 0.10/0.41 cnf(i_0_36, negated_conjecture, (p14(X1)|r1(X1,esk3_1(X1))|~r1(esk1_0,X1))). % 0.10/0.41 cnf(i_0_32, negated_conjecture, (p14(X1)|r1(X1,esk5_1(X1))|~r1(esk1_0,X1))). % 0.10/0.41 cnf(i_0_28, negated_conjecture, (p14(X1)|r1(X1,esk7_1(X1))|~r1(esk1_0,X1))). % 0.10/0.41 cnf(i_0_26, negated_conjecture, (p15(X1)|r1(X1,esk8_1(X1))|~r1(esk1_0,X1))). % 0.10/0.41 cnf(i_0_24, negated_conjecture, (p15(X1)|r1(X1,esk9_1(X1))|~r1(esk1_0,X1))). % 0.10/0.41 cnf(i_0_22, negated_conjecture, (p13(X1)|r1(X1,esk10_1(X1))|~r1(esk1_0,X1))). % 0.10/0.41 cnf(i_0_20, negated_conjecture, (p13(X1)|r1(X1,esk11_1(X1))|~r1(esk1_0,X1))). % 0.10/0.41 cnf(i_0_18, negated_conjecture, (p11(X1)|r1(X1,esk12_1(X1))|~r1(esk1_0,X1))). % 0.10/0.41 cnf(i_0_16, negated_conjecture, (p11(X1)|r1(X1,esk13_1(X1))|~r1(esk1_0,X1))). % 0.10/0.41 cnf(i_0_2, plain, (r1(X1,X2)|~r1(X3,X2)|~r1(X1,X3))). % 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 6 steps % 0.10/0.41 cnf(i_0_9, negated_conjecture, (~p13(esk17_0)), inference(start_rule)). % 0.10/0.41 cnf(i_0_129, plain, (~p13(esk17_0)), inference(extension_rule, [i_0_20])). % 0.10/0.41 cnf(i_0_323, plain, (r1(esk17_0,esk11_1(esk17_0))), inference(extension_rule, [i_0_2])). % 0.10/0.41 cnf(i_0_324, plain, (~r1(esk1_0,esk17_0)), inference(etableau_closure_rule, [i_0_324, ...])). % 0.10/0.41 cnf(i_0_325, plain, (r1(esk1_0,esk11_1(esk17_0))), inference(extension_rule, [i_0_16])). % 0.10/0.41 cnf(i_0_327, plain, (~r1(esk1_0,esk17_0)), inference(etableau_closure_rule, [i_0_327, ...])). % 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 (1936846) has found a proof. % 0.10/0.41 % 0.10/0.42 # Proof search is over... % 0.10/0.42 # Freeing feature tree %------------------------------------------------------------------------------