%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL665+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 : n016.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:41 PM UTC 2026 % Result : CounterSatisfiable 0.15s 0.43s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL665+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 : n016.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 : Sat Sep 5 03:06:59 UTC 2026 % 0.10/0.37 % CPUTime : % 0.15/0.40 # No SInE strategy applied % 0.15/0.40 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.15/0.40 # and selection function SelectComplexExceptUniqMaxHorn. % 0.15/0.40 # % 0.15/0.40 # Presaturation interreduction done % 0.15/0.40 # Number of axioms: 37 Number of unprocessed: 37 % 0.15/0.40 # Tableaux proof search. % 0.15/0.40 # APR header successfully linked. % 0.15/0.40 # Hello from C++ % 0.15/0.41 # The folding up rule is enabled... % 0.15/0.41 # Local unification is enabled... % 0.15/0.41 # Any saturation attempts will use folding labels... % 0.15/0.41 # 37 beginning clauses after preprocessing and clausification % 0.15/0.41 # Creating start rules for all 36 conjectures. % 0.15/0.41 # There are 36 start rule candidates: % 0.15/0.41 # Found 9 unit axioms. % 0.15/0.41 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.15/0.41 # 36 start rule tableaux created. % 0.15/0.41 # 28 extension rule candidate clauses % 0.15/0.41 # 9 unit axiom clauses % 0.15/0.41 % 0.15/0.41 # Requested 8, 32 cores available to the main process. % 0.15/0.43 # 1475580 Satisfiable branch % 0.15/0.43 # Satisfiable branch found. % 0.15/0.43 # There were 1 total branch saturation attempts. % 0.15/0.43 # There were 0 of these attempts blocked. % 0.15/0.43 # There were 0 deferred branch saturation attempts. % 0.15/0.43 # There were 0 free duplicated saturations. % 0.15/0.43 # There were 0 total successful branch saturations. % 0.15/0.43 # There were 0 successful branch saturations in interreduction. % 0.15/0.43 # There were 0 successful branch saturations on the branch. % 0.15/0.43 # There were 0 successful branch saturations after the branch. % 0.15/0.43 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.43 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.15/0.43 # Begin clausification derivation % 0.15/0.43 % 0.15/0.43 # End clausification derivation % 0.15/0.43 # Begin listing active clauses obtained from FOF to CNF conversion % 0.15/0.43 cnf(i_0_9, negated_conjecture, (r1(esk1_0,esk14_0))). % 0.15/0.43 cnf(i_0_7, negated_conjecture, (r1(esk1_0,esk15_0))). % 0.15/0.43 cnf(i_0_5, negated_conjecture, (r1(esk1_0,esk16_0))). % 0.15/0.43 cnf(i_0_1, plain, (r1(X1,X1))). % 0.15/0.43 cnf(i_0_3, negated_conjecture, (r1(esk1_0,esk17_0))). % 0.15/0.43 cnf(i_0_8, negated_conjecture, (~p15(esk14_0))). % 0.15/0.43 cnf(i_0_6, negated_conjecture, (~p13(esk15_0))). % 0.15/0.43 cnf(i_0_2, negated_conjecture, (~p11(esk17_0))). % 0.15/0.43 cnf(i_0_4, negated_conjecture, (~p12(esk16_0))). % 0.15/0.43 cnf(i_0_32, negated_conjecture, (p16(X1)|~p26(esk2_1(X1))|~r1(esk1_0,X1))). % 0.15/0.43 cnf(i_0_28, negated_conjecture, (p16(X1)|~p24(esk4_1(X1))|~r1(esk1_0,X1))). % 0.15/0.43 cnf(i_0_24, negated_conjecture, (p16(X1)|~p22(esk6_1(X1))|~r1(esk1_0,X1))). % 0.15/0.43 cnf(i_0_30, negated_conjecture, (p14(X1)|~p26(esk3_1(X1))|~r1(esk1_0,X1))). % 0.15/0.43 cnf(i_0_26, negated_conjecture, (p14(X1)|~p24(esk5_1(X1))|~r1(esk1_0,X1))). % 0.15/0.43 cnf(i_0_22, negated_conjecture, (p14(X1)|~p22(esk7_1(X1))|~r1(esk1_0,X1))). % 0.15/0.43 cnf(i_0_20, negated_conjecture, (p15(X1)|~p23(esk8_1(X1))|~r1(esk1_0,X1))). % 0.15/0.43 cnf(i_0_18, negated_conjecture, (p15(X1)|~p21(esk9_1(X1))|~r1(esk1_0,X1))). % 0.15/0.43 cnf(i_0_16, negated_conjecture, (p13(X1)|~p23(esk10_1(X1))|~r1(esk1_0,X1))). % 0.15/0.43 cnf(i_0_14, negated_conjecture, (p13(X1)|~p21(esk11_1(X1))|~r1(esk1_0,X1))). % 0.15/0.43 cnf(i_0_12, negated_conjecture, (p11(X1)|~p23(esk12_1(X1))|~r1(esk1_0,X1))). % 0.15/0.43 cnf(i_0_10, negated_conjecture, (p11(X1)|~p21(esk13_1(X1))|~r1(esk1_0,X1))). % 0.15/0.43 cnf(i_0_37, negated_conjecture, (p26(X1)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.15/0.43 cnf(i_0_33, negated_conjecture, (p16(X1)|r1(X1,esk2_1(X1))|~r1(esk1_0,X1))). % 0.15/0.43 cnf(i_0_36, negated_conjecture, (p25(X1)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.15/0.43 cnf(i_0_35, negated_conjecture, (p24(X1)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.15/0.43 cnf(i_0_34, negated_conjecture, (p22(X1)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.15/0.43 cnf(i_0_29, negated_conjecture, (p16(X1)|r1(X1,esk4_1(X1))|~r1(esk1_0,X1))). % 0.15/0.43 cnf(i_0_25, negated_conjecture, (p16(X1)|r1(X1,esk6_1(X1))|~r1(esk1_0,X1))). % 0.15/0.43 cnf(i_0_31, negated_conjecture, (p14(X1)|r1(X1,esk3_1(X1))|~r1(esk1_0,X1))). % 0.15/0.43 cnf(i_0_27, negated_conjecture, (p14(X1)|r1(X1,esk5_1(X1))|~r1(esk1_0,X1))). % 0.15/0.43 cnf(i_0_23, negated_conjecture, (p14(X1)|r1(X1,esk7_1(X1))|~r1(esk1_0,X1))). % 0.15/0.43 cnf(i_0_21, negated_conjecture, (p15(X1)|r1(X1,esk8_1(X1))|~r1(esk1_0,X1))). % 0.15/0.43 cnf(i_0_19, negated_conjecture, (p15(X1)|r1(X1,esk9_1(X1))|~r1(esk1_0,X1))). % 0.15/0.43 cnf(i_0_17, negated_conjecture, (p13(X1)|r1(X1,esk10_1(X1))|~r1(esk1_0,X1))). % 0.15/0.43 cnf(i_0_15, negated_conjecture, (p13(X1)|r1(X1,esk11_1(X1))|~r1(esk1_0,X1))). % 0.15/0.43 cnf(i_0_13, negated_conjecture, (p11(X1)|r1(X1,esk12_1(X1))|~r1(esk1_0,X1))). % 0.15/0.43 cnf(i_0_11, negated_conjecture, (p11(X1)|r1(X1,esk13_1(X1))|~r1(esk1_0,X1))). % 0.15/0.43 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.15/0.43 # Begin printing tableau % 0.15/0.43 # Found 5 steps % 0.15/0.43 cnf(i_0_5, negated_conjecture, (r1(esk1_0,esk16_0)), inference(start_rule)). % 0.15/0.43 cnf(i_0_1425, plain, (~r1(esk16_0,esk7_1(esk1_0))), inference(closure_rule, [i_0_0])). % 0.15/0.43 cnf(i_0_127, plain, (r1(esk1_0,esk16_0)), inference(extension_rule, [i_0_34])). % 0.15/0.43 cnf(i_0_1423, plain, (p22(esk7_1(esk1_0))), inference(extension_rule, [i_0_22])). % 0.15/0.43 cnf(i_0_1542, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 0.15/0.43 # End printing tableau % 0.15/0.43 # SZS output end % 0.15/0.43 # Branches closed with saturation will be marked with an "s" % 0.15/0.43 # Child (1475580) has found a proof. % 0.15/0.43 % 0.15/0.43 # Proof search is over... % 0.15/0.43 # Freeing feature tree %------------------------------------------------------------------------------