%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL657+1.005 : 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 : n002.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 3.94s 0.93s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL657+1.005 : 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.09/0.36 % Computer : n002.cluster.edu % 0.09/0.36 % Model : x86_64 x86_64 % 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.36 % Memory : 8046.5625MB % 0.09/0.36 % OS : Linux 6.8.0-71-generic % 0.09/0.36 % CPULimit : 300 % 0.09/0.36 % WCLimit : 300 % 0.09/0.36 % DateTime : Sat Sep 5 17:20:36 UTC 2026 % 0.09/0.36 % CPUTime : % 0.14/0.39 # No SInE strategy applied % 0.14/0.39 # Auto-Mode selected heuristic G_E___208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN % 0.14/0.39 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.14/0.39 # % 0.14/0.39 # Presaturation interreduction done % 0.14/0.39 # Number of axioms: 62 Number of unprocessed: 62 % 0.14/0.39 # Tableaux proof search. % 0.14/0.39 # APR header successfully linked. % 0.14/0.39 # Hello from C++ % 0.14/0.41 # The folding up rule is enabled... % 0.14/0.41 # Local unification is enabled... % 0.14/0.41 # Any saturation attempts will use folding labels... % 0.14/0.41 # 62 beginning clauses after preprocessing and clausification % 0.14/0.41 # Creating start rules for all 3 conjectures. % 0.14/0.41 # There are 3 start rule candidates: % 0.14/0.41 # Found 3 unit axioms. % 0.14/0.41 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.41 # 3 start rule tableaux created. % 0.14/0.41 # 59 extension rule candidate clauses % 0.14/0.41 # 3 unit axiom clauses % 0.14/0.41 % 0.14/0.41 # Requested 8, 32 cores available to the main process. % 0.14/0.41 # There are not enough tableaux to fork, creating more from the initial 3 % 0.14/0.41 # Returning from population with 60 new_tableaux and 0 remaining starting tableaux. % 0.14/0.41 # We now have 60 tableaux to operate on % 3.94/0.93 # 3088685 Satisfiable branch % 3.94/0.93 # Satisfiable branch found. % 3.94/0.93 # There were 1 total branch saturation attempts. % 3.94/0.93 # There were 0 of these attempts blocked. % 3.94/0.93 # There were 0 deferred branch saturation attempts. % 3.94/0.93 # There were 0 free duplicated saturations. % 3.94/0.93 # There were 0 total successful branch saturations. % 3.94/0.93 # There were 0 successful branch saturations in interreduction. % 3.94/0.93 # There were 0 successful branch saturations on the branch. % 3.94/0.93 # There were 0 successful branch saturations after the branch. % 3.94/0.93 # SZS status CounterSatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.94/0.93 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.94/0.93 # Begin clausification derivation % 3.94/0.93 % 3.94/0.93 # End clausification derivation % 3.94/0.93 # Begin listing active clauses obtained from FOF to CNF conversion % 3.94/0.93 cnf(i_0_2, negated_conjecture, (p100(esk1_0))). % 3.94/0.93 cnf(i_0_1, plain, (r1(X1,X1))). % 3.94/0.93 cnf(i_0_3, negated_conjecture, (~p101(esk1_0))). % 3.94/0.93 cnf(i_0_5, plain, (p100(X1)|~epred1_1(X1)|~p101(X1))). % 3.94/0.93 cnf(i_0_6, plain, (p101(X1)|~epred1_1(X1)|~p102(X1))). % 3.94/0.93 cnf(i_0_10, plain, (p105(X1)|~epred1_1(X1)|~p106(X1))). % 3.94/0.93 cnf(i_0_9, plain, (p104(X1)|~epred1_1(X1)|~p105(X1))). % 3.94/0.93 cnf(i_0_8, plain, (p103(X1)|~epred1_1(X1)|~p104(X1))). % 3.94/0.93 cnf(i_0_7, plain, (p102(X1)|~epred1_1(X1)|~p103(X1))). % 3.94/0.93 cnf(i_0_61, plain, (p105(X1)|~epred1_1(X1)|~p104(X1)|~p6(esk2_1(X1)))). % 3.94/0.93 cnf(i_0_60, plain, (p105(X1)|~epred1_1(X1)|~p104(X1)|~p106(esk2_1(X1)))). % 3.94/0.93 cnf(i_0_27, plain, (p101(esk10_1(X1))|p101(X1)|~epred1_1(X1)|~p100(X1))). % 3.94/0.93 cnf(i_0_28, plain, (p101(X1)|~epred1_1(X1)|~p100(X1)|~p102(esk10_1(X1)))). % 3.94/0.93 cnf(i_0_24, plain, (p101(X1)|~epred1_1(X1)|~p100(X1)|~p102(esk11_1(X1)))). % 3.94/0.93 cnf(i_0_29, plain, (p101(X1)|~epred1_1(X1)|~p100(X1)|~p2(esk10_1(X1)))). % 3.94/0.93 cnf(i_0_23, plain, (p101(esk11_1(X1))|p101(X1)|~epred1_1(X1)|~p100(X1))). % 3.94/0.93 cnf(i_0_57, plain, (p105(X1)|p6(esk3_1(X1))|~epred1_1(X1)|~p104(X1))). % 3.94/0.93 cnf(i_0_25, plain, (p2(esk11_1(X1))|p101(X1)|~epred1_1(X1)|~p100(X1))). % 3.94/0.93 cnf(i_0_56, plain, (p105(X1)|~epred1_1(X1)|~p104(X1)|~p106(esk3_1(X1)))). % 3.94/0.93 cnf(i_0_52, plain, (p104(X1)|~epred1_1(X1)|~p103(X1)|~p105(esk4_1(X1)))). % 3.94/0.93 cnf(i_0_48, plain, (p104(X1)|~epred1_1(X1)|~p103(X1)|~p105(esk5_1(X1)))). % 3.94/0.93 cnf(i_0_53, plain, (p104(X1)|~epred1_1(X1)|~p103(X1)|~p5(esk4_1(X1)))). % 3.94/0.93 cnf(i_0_35, plain, (p102(esk8_1(X1))|p102(X1)|~epred1_1(X1)|~p101(X1))). % 3.94/0.93 cnf(i_0_36, plain, (p102(X1)|~epred1_1(X1)|~p101(X1)|~p103(esk8_1(X1)))). % 3.94/0.93 cnf(i_0_32, plain, (p102(X1)|~epred1_1(X1)|~p101(X1)|~p103(esk9_1(X1)))). % 3.94/0.93 cnf(i_0_37, plain, (p102(X1)|~epred1_1(X1)|~p101(X1)|~p3(esk8_1(X1)))). % 3.94/0.93 cnf(i_0_44, plain, (p103(X1)|~epred1_1(X1)|~p102(X1)|~p104(esk6_1(X1)))). % 3.94/0.93 cnf(i_0_59, plain, (p105(esk2_1(X1))|p105(X1)|~epred1_1(X1)|~p104(X1))). % 3.94/0.93 cnf(i_0_31, plain, (p102(esk9_1(X1))|p102(X1)|~epred1_1(X1)|~p101(X1))). % 3.94/0.93 cnf(i_0_40, plain, (p103(X1)|~epred1_1(X1)|~p102(X1)|~p104(esk7_1(X1)))). % 3.94/0.93 cnf(i_0_45, plain, (p103(X1)|~epred1_1(X1)|~p102(X1)|~p4(esk6_1(X1)))). % 3.94/0.93 cnf(i_0_55, plain, (p105(esk3_1(X1))|p105(X1)|~epred1_1(X1)|~p104(X1))). % 3.94/0.93 cnf(i_0_51, plain, (p104(esk4_1(X1))|p104(X1)|~epred1_1(X1)|~p103(X1))). % 3.94/0.93 cnf(i_0_33, plain, (p3(esk9_1(X1))|p102(X1)|~epred1_1(X1)|~p101(X1))). % 3.94/0.93 cnf(i_0_30, plain, (p101(X1)|r1(X1,esk10_1(X1))|~epred1_1(X1)|~p100(X1))). % 3.94/0.93 cnf(i_0_26, plain, (p101(X1)|r1(X1,esk11_1(X1))|~epred1_1(X1)|~p100(X1))). % 3.94/0.93 cnf(i_0_38, plain, (p102(X1)|r1(X1,esk8_1(X1))|~epred1_1(X1)|~p101(X1))). % 3.94/0.93 cnf(i_0_34, plain, (p102(X1)|r1(X1,esk9_1(X1))|~epred1_1(X1)|~p101(X1))). % 3.94/0.93 cnf(i_0_47, plain, (p104(esk5_1(X1))|p104(X1)|~epred1_1(X1)|~p103(X1))). % 3.94/0.93 cnf(i_0_49, plain, (p5(esk5_1(X1))|p104(X1)|~epred1_1(X1)|~p103(X1))). % 3.94/0.93 cnf(i_0_43, plain, (p103(esk6_1(X1))|p103(X1)|~epred1_1(X1)|~p102(X1))). % 3.94/0.93 cnf(i_0_39, plain, (p103(esk7_1(X1))|p103(X1)|~epred1_1(X1)|~p102(X1))). % 3.94/0.93 cnf(i_0_41, plain, (p4(esk7_1(X1))|p103(X1)|~epred1_1(X1)|~p102(X1))). % 3.94/0.93 cnf(i_0_22, plain, (p6(X1)|~epred1_1(X1)|~p105(X2)|~p105(X1)|~p6(X2)|~r1(X1,X2))). % 3.94/0.93 cnf(i_0_62, plain, (p105(X1)|r1(X1,esk2_1(X1))|~epred1_1(X1)|~p104(X1))). % 3.94/0.93 cnf(i_0_58, plain, (p105(X1)|r1(X1,esk3_1(X1))|~epred1_1(X1)|~p104(X1))). % 3.94/0.93 cnf(i_0_54, plain, (p104(X1)|r1(X1,esk4_1(X1))|~epred1_1(X1)|~p103(X1))). % 3.94/0.93 cnf(i_0_50, plain, (p104(X1)|r1(X1,esk5_1(X1))|~epred1_1(X1)|~p103(X1))). % 3.94/0.93 cnf(i_0_46, plain, (p103(X1)|r1(X1,esk6_1(X1))|~epred1_1(X1)|~p102(X1))). % 3.94/0.93 cnf(i_0_42, plain, (p103(X1)|r1(X1,esk7_1(X1))|~epred1_1(X1)|~p102(X1))). % 3.94/0.93 cnf(i_0_13, plain, (p2(X1)|~epred1_1(X2)|~p2(X2)|~p101(X1)|~p101(X2)|~r1(X2,X1))). % 3.94/0.93 cnf(i_0_20, plain, (p5(X1)|~epred1_1(X1)|~p5(X2)|~p104(X2)|~p104(X1)|~r1(X1,X2))). % 3.94/0.93 cnf(i_0_18, plain, (p4(X1)|~epred1_1(X1)|~p4(X2)|~p103(X2)|~p103(X1)|~r1(X1,X2))). % 3.94/0.93 cnf(i_0_16, plain, (p3(X1)|~epred1_1(X1)|~p3(X2)|~p102(X2)|~p102(X1)|~r1(X1,X2))). % 3.94/0.93 cnf(i_0_14, plain, (p2(X1)|~epred1_1(X1)|~p2(X2)|~p101(X2)|~p101(X1)|~r1(X1,X2))). % 3.94/0.93 cnf(i_0_11, plain, (p1(X1)|~epred1_1(X2)|~p1(X2)|~p100(X1)|~p100(X2)|~r1(X2,X1))). % 3.94/0.93 cnf(i_0_12, plain, (p1(X1)|~epred1_1(X1)|~p1(X2)|~p100(X2)|~p100(X1)|~r1(X1,X2))). % 3.94/0.93 cnf(i_0_21, plain, (p6(X1)|~epred1_1(X2)|~p105(X1)|~p105(X2)|~p6(X2)|~r1(X2,X1))). % 3.94/0.93 cnf(i_0_19, plain, (p5(X1)|~epred1_1(X2)|~p5(X2)|~p104(X1)|~p104(X2)|~r1(X2,X1))). % 3.94/0.93 cnf(i_0_17, plain, (p4(X1)|~epred1_1(X2)|~p4(X2)|~p103(X1)|~p103(X2)|~r1(X2,X1))). % 3.94/0.93 cnf(i_0_15, plain, (p3(X1)|~epred1_1(X2)|~p3(X2)|~p102(X1)|~p102(X2)|~r1(X2,X1))). % 3.94/0.93 cnf(i_0_4, negated_conjecture, (epred1_1(X1)|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X4,X3)|~r1(X5,X4)|~r1(X2,X5))). % 3.94/0.93 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 3.94/0.93 # Begin printing tableau % 3.94/0.93 # Found 10 steps % 3.94/0.93 cnf(i_0_4, negated_conjecture, (epred1_1(esk1_0)|~r1(esk1_0,esk1_0)|~r1(esk1_0,esk1_0)|~r1(esk1_0,esk1_0)|~r1(esk1_0,esk1_0)|~r1(esk1_0,esk1_0)), inference(start_rule)). % 3.94/0.93 cnf(i_0_64, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 3.94/0.93 cnf(i_0_65, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 3.94/0.93 cnf(i_0_66, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 3.94/0.93 cnf(i_0_67, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 3.94/0.93 cnf(i_0_68, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 3.94/0.93 cnf(i_0_63, plain, (epred1_1(esk1_0)), inference(extension_rule, [i_0_27])). % 3.94/0.93 cnf(i_0_98, plain, (p101(esk1_0)), inference(closure_rule, [i_0_3])). % 3.94/0.93 cnf(i_0_100, plain, (~p100(esk1_0)), inference(closure_rule, [i_0_2])). % 3.94/0.93 cnf(i_0_97, plain, (p101(esk10_1(esk1_0))), inference(extension_rule, [i_0_5])). % 3.94/0.93 # End printing tableau % 3.94/0.93 # SZS output end % 3.94/0.93 # Branches closed with saturation will be marked with an "s" % 3.94/0.93 # Child (3088685) has found a proof. % 3.94/0.93 % 3.94/0.93 # Proof search is over... % 3.94/0.93 # Freeing feature tree %------------------------------------------------------------------------------