%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL657+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:38 PM UTC 2026 % Result : CounterSatisfiable 0.10s 0.42s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL657+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 : n019.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 20:51:38 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___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN % 0.10/0.41 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.10/0.41 # % 0.10/0.41 # Presaturation interreduction done % 0.10/0.41 # Number of axioms: 17 Number of unprocessed: 17 % 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 # 17 beginning clauses after preprocessing and clausification % 0.10/0.41 # Creating start rules for all 16 conjectures. % 0.10/0.41 # There are 16 start rule candidates: % 0.10/0.41 # Found 3 unit axioms. % 0.10/0.41 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.10/0.41 # 16 start rule tableaux created. % 0.10/0.41 # 14 extension rule candidate clauses % 0.10/0.41 # 3 unit axiom clauses % 0.10/0.41 % 0.10/0.41 # Requested 8, 32 cores available to the main process. % 0.10/0.42 # Ran out of tableaux, making start rules for all clauses % 0.10/0.42 # 1282315 Satisfiable branch % 0.10/0.42 # Satisfiable branch found. % 0.10/0.42 # There were 1 total branch saturation attempts. % 0.10/0.42 # There were 0 of these attempts blocked. % 0.10/0.42 # There were 0 deferred branch saturation attempts. % 0.10/0.42 # There were 0 free duplicated saturations. % 0.10/0.42 # There were 0 total successful branch saturations. % 0.10/0.42 # There were 0 successful branch saturations in interreduction. % 0.10/0.42 # There were 0 successful branch saturations on the branch. % 0.10/0.42 # There were 0 successful branch saturations after the branch. % 0.10/0.42 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.10/0.42 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.10/0.42 # Begin clausification derivation % 0.10/0.42 % 0.10/0.42 # End clausification derivation % 0.10/0.42 # Begin listing active clauses obtained from FOF to CNF conversion % 0.10/0.42 cnf(i_0_2, negated_conjecture, (p100(esk1_0))). % 0.10/0.42 cnf(i_0_1, plain, (r1(X1,X1))). % 0.10/0.42 cnf(i_0_3, negated_conjecture, (~p101(esk1_0))). % 0.10/0.42 cnf(i_0_5, negated_conjecture, (p101(X1)|~p102(X1)|~r1(esk1_0,X1))). % 0.10/0.42 cnf(i_0_4, negated_conjecture, (p100(X1)|~p101(X1)|~r1(esk1_0,X1))). % 0.10/0.42 cnf(i_0_12, negated_conjecture, (p101(X1)|p2(esk3_1(X1))|~p100(X1)|~r1(esk1_0,X1))). % 0.10/0.42 cnf(i_0_14, negated_conjecture, (p101(esk2_1(X1))|p101(X1)|~p100(X1)|~r1(esk1_0,X1))). % 0.10/0.42 cnf(i_0_16, negated_conjecture, (p101(X1)|~p100(X1)|~p2(esk2_1(X1))|~r1(esk1_0,X1))). % 0.10/0.42 cnf(i_0_15, negated_conjecture, (p101(X1)|~p100(X1)|~p102(esk2_1(X1))|~r1(esk1_0,X1))). % 0.10/0.42 cnf(i_0_11, negated_conjecture, (p101(X1)|~p100(X1)|~p102(esk3_1(X1))|~r1(esk1_0,X1))). % 0.10/0.42 cnf(i_0_10, negated_conjecture, (p101(esk3_1(X1))|p101(X1)|~p100(X1)|~r1(esk1_0,X1))). % 0.10/0.42 cnf(i_0_17, negated_conjecture, (p101(X1)|r1(X1,esk2_1(X1))|~p100(X1)|~r1(esk1_0,X1))). % 0.10/0.42 cnf(i_0_13, negated_conjecture, (p101(X1)|r1(X1,esk3_1(X1))|~p100(X1)|~r1(esk1_0,X1))). % 0.10/0.42 cnf(i_0_8, negated_conjecture, (p2(X1)|~p101(X1)|~p101(X2)|~p2(X2)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.10/0.42 cnf(i_0_9, negated_conjecture, (p2(X1)|~p101(X2)|~p101(X1)|~p2(X2)|~r1(esk1_0,X1)|~r1(X1,X2))). % 0.10/0.42 cnf(i_0_6, negated_conjecture, (p1(X1)|~p1(X2)|~p100(X1)|~p100(X2)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.10/0.42 cnf(i_0_7, negated_conjecture, (p1(X1)|~p1(X2)|~p100(X2)|~p100(X1)|~r1(esk1_0,X1)|~r1(X1,X2))). % 0.10/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.10/0.42 # Begin printing tableau % 0.10/0.42 # Found 10 steps % 0.10/0.42 cnf(i_0_1, plain, (r1(esk1_0,esk1_0)), inference(start_rule)). % 0.10/0.42 cnf(i_0_1617, plain, (p101(esk3_1(esk1_0))), inference(closure_rule, [i_0_0])). % 0.10/0.42 cnf(i_0_1618, plain, (~p100(esk3_1(esk1_0))), inference(closure_rule, [i_0_0])). % 0.10/0.42 cnf(i_0_1534, plain, (~r1(esk1_0,esk2_1(esk3_1(esk1_0)))), inference(closure_rule, [i_0_0])). % 0.10/0.42 cnf(i_0_207, plain, (r1(esk1_0,esk1_0)), inference(extension_rule, [i_0_8])). % 0.10/0.42 cnf(i_0_1529, plain, (p2(esk2_1(esk3_1(esk1_0)))), inference(extension_rule, [i_0_16])). % 0.10/0.42 cnf(i_0_1620, plain, (~r1(esk1_0,esk3_1(esk1_0))), inference(extension_rule, [i_0_13])). % 0.10/0.42 cnf(i_0_1807, plain, (p101(esk1_0)), inference(closure_rule, [i_0_3])). % 0.10/0.42 cnf(i_0_1809, plain, (~p100(esk1_0)), inference(closure_rule, [i_0_2])). % 0.10/0.42 cnf(i_0_1810, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 0.10/0.42 # End printing tableau % 0.10/0.42 # SZS output end % 0.10/0.42 # Branches closed with saturation will be marked with an "s" % 0.10/0.42 # Child (1282315) has found a proof. % 0.10/0.42 % 0.10/0.42 # Proof search is over... % 0.10/0.42 # Freeing feature tree %------------------------------------------------------------------------------