%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL647+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 : n018.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:34 PM UTC 2026 % Result : CounterSatisfiable 0.13s 0.38s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL647+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.09/0.35 % Computer : n018.cluster.edu % 0.09/0.35 % Model : x86_64 x86_64 % 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.35 % Memory : 8046.5625MB % 0.09/0.35 % OS : Linux 6.8.0-71-generic % 0.09/0.35 % CPULimit : 300 % 0.09/0.35 % WCLimit : 300 % 0.09/0.35 % DateTime : Sat Sep 5 13:25:19 UTC 2026 % 0.09/0.35 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 36 Number of unprocessed: 36 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.13/0.37 # The folding up rule is enabled... % 0.13/0.37 # Local unification is enabled... % 0.13/0.37 # Any saturation attempts will use folding labels... % 0.13/0.37 # 36 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 36 conjectures. % 0.13/0.37 # There are 36 start rule candidates: % 0.13/0.37 # Found 8 unit axioms. % 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.37 # 36 start rule tableaux created. % 0.13/0.37 # 28 extension rule candidate clauses % 0.13/0.37 # 8 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 0.13/0.38 # 961305 Satisfiable branch % 0.13/0.38 # 961304 Satisfiable branch % 0.13/0.38 # 961306 Satisfiable branch % 0.13/0.38 # 961307 Satisfiable branch % 0.13/0.38 # 961308 Satisfiable branch % 0.13/0.38 # 961309 Satisfiable branch % 0.13/0.38 # Satisfiable branch found. % 0.13/0.38 # There were 1 total branch saturation attempts. % 0.13/0.38 # There were 0 of these attempts blocked. % 0.13/0.38 # There were 0 deferred branch saturation attempts. % 0.13/0.38 # There were 0 free duplicated saturations. % 0.13/0.38 # There were 0 total successful branch saturations. % 0.13/0.38 # There were 0 successful branch saturations in interreduction. % 0.13/0.38 # There were 0 successful branch saturations on the branch. % 0.13/0.38 # There were 0 successful branch saturations after the branch. % 0.13/0.38 # Satisfiable branch found. % 0.13/0.38 # There were 1 total branch saturation attempts. % 0.13/0.38 # There were 0 of these attempts blocked. % 0.13/0.38 # There were 0 deferred branch saturation attempts. % 0.13/0.38 # There were 0 free duplicated saturations. % 0.13/0.38 # There were 0 total successful branch saturations. % 0.13/0.38 # There were 0 successful branch saturations in interreduction. % 0.13/0.38 # There were 0 successful branch saturations on the branch. % 0.13/0.38 # There were 0 successful branch saturations after the branch. % 0.13/0.38 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # Begin clausification derivation % 0.13/0.38 % 0.13/0.38 # End clausification derivation % 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.38 cnf(i_0_8, negated_conjecture, (r1(esk1_0,esk14_0))). % 0.13/0.38 cnf(i_0_6, negated_conjecture, (r1(esk1_0,esk15_0))). % 0.13/0.38 cnf(i_0_4, negated_conjecture, (r1(esk1_0,esk16_0))). % 0.13/0.38 cnf(i_0_2, negated_conjecture, (r1(esk1_0,esk17_0))). % 0.13/0.38 cnf(i_0_7, negated_conjecture, (~p5(esk14_0))). % 0.13/0.38 cnf(i_0_3, negated_conjecture, (~p2(esk16_0))). % 0.13/0.38 cnf(i_0_5, negated_conjecture, (~p3(esk15_0))). % 0.13/0.38 cnf(i_0_1, negated_conjecture, (~p1(esk17_0))). % 0.13/0.38 cnf(i_0_31, negated_conjecture, (p6(X1)|~p6(esk2_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_27, negated_conjecture, (p6(X1)|~p4(esk4_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_23, negated_conjecture, (p6(X1)|~p2(esk6_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_19, negated_conjecture, (p5(X1)|~p3(esk8_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_17, negated_conjecture, (p5(X1)|~p1(esk9_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_29, negated_conjecture, (p4(X1)|~p6(esk3_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_25, negated_conjecture, (p4(X1)|~p4(esk5_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_21, negated_conjecture, (p4(X1)|~p2(esk7_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_15, negated_conjecture, (p3(X1)|~p3(esk10_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_13, negated_conjecture, (p3(X1)|~p1(esk11_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_11, negated_conjecture, (p1(X1)|~p3(esk12_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_9, negated_conjecture, (p1(X1)|~p1(esk13_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_36, negated_conjecture, (p6(X1)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.13/0.38 cnf(i_0_35, negated_conjecture, (p5(X1)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.13/0.38 cnf(i_0_32, negated_conjecture, (p6(X1)|r1(X1,esk2_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_34, negated_conjecture, (p4(X1)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.13/0.38 cnf(i_0_33, negated_conjecture, (p2(X1)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.13/0.38 cnf(i_0_28, negated_conjecture, (p6(X1)|r1(X1,esk4_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_24, negated_conjecture, (p6(X1)|r1(X1,esk6_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_20, negated_conjecture, (p5(X1)|r1(X1,esk8_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_18, negated_conjecture, (p5(X1)|r1(X1,esk9_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_30, negated_conjecture, (p4(X1)|r1(X1,esk3_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_26, negated_conjecture, (p4(X1)|r1(X1,esk5_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_22, negated_conjecture, (p4(X1)|r1(X1,esk7_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_16, negated_conjecture, (p3(X1)|r1(X1,esk10_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_14, negated_conjecture, (p3(X1)|r1(X1,esk11_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_12, negated_conjecture, (p1(X1)|r1(X1,esk12_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_10, negated_conjecture, (p1(X1)|r1(X1,esk13_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.38 # Begin printing tableau % 0.13/0.38 # Found 5 steps % 0.13/0.38 cnf(i_0_11, negated_conjecture, (p1(esk17_0)|~p3(esk12_1(esk17_0))|~r1(esk1_0,esk17_0)), inference(start_rule)). % 0.13/0.38 cnf(i_0_88, plain, (p1(esk17_0)), inference(closure_rule, [i_0_1])). % 0.13/0.38 cnf(i_0_90, plain, (~r1(esk1_0,esk17_0)), inference(closure_rule, [i_0_2])). % 0.13/0.38 cnf(i_0_89, plain, (~p3(esk12_1(esk17_0))), inference(extension_rule, [i_0_13])). % 0.13/0.38 cnf(i_0_616, plain, (~p1(esk11_1(esk12_1(esk17_0)))), inference(extension_rule, [i_0_10])). % 0.13/0.38 # End printing tableau % 0.13/0.38 # SZS output end % 0.13/0.38 # Branches closed with saturation will be marked with an "s" % 0.13/0.38 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # Begin clausification derivation % 0.13/0.38 % 0.13/0.38 # End clausification derivation % 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.38 cnf(i_0_8, negated_conjecture, (r1(esk1_0,esk14_0))). % 0.13/0.38 cnf(i_0_6, negated_conjecture, (r1(esk1_0,esk15_0))). % 0.13/0.38 cnf(i_0_4, negated_conjecture, (r1(esk1_0,esk16_0))). % 0.13/0.38 cnf(i_0_2, negated_conjecture, (r1(esk1_0,esk17_0))). % 0.13/0.38 cnf(i_0_7, negated_conjecture, (~p5(esk14_0))). % 0.13/0.38 cnf(i_0_3, negated_conjecture, (~p2(esk16_0))). % 0.13/0.38 cnf(i_0_5, negated_conjecture, (~p3(esk15_0))). % 0.13/0.38 cnf(i_0_1, negated_conjecture, (~p1(esk17_0))). % 0.13/0.38 cnf(i_0_31, negated_conjecture, (p6(X1)|~p6(esk2_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_27, negated_conjecture, (p6(X1)|~p4(esk4_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_23, negated_conjecture, (p6(X1)|~p2(esk6_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_19, negated_conjecture, (p5(X1)|~p3(esk8_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_17, negated_conjecture, (p5(X1)|~p1(esk9_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_29, negated_conjecture, (p4(X1)|~p6(esk3_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_25, negated_conjecture, (p4(X1)|~p4(esk5_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_21, negated_conjecture, (p4(X1)|~p2(esk7_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_15, negated_conjecture, (p3(X1)|~p3(esk10_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_13, negated_conjecture, (p3(X1)|~p1(esk11_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_11, negated_conjecture, (p1(X1)|~p3(esk12_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_9, negated_conjecture, (p1(X1)|~p1(esk13_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_36, negated_conjecture, (p6(X1)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.13/0.38 cnf(i_0_35, negated_conjecture, (p5(X1)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.13/0.38 cnf(i_0_32, negated_conjecture, (p6(X1)|r1(X1,esk2_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_34, negated_conjecture, (p4(X1)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.13/0.38 cnf(i_0_33, negated_conjecture, (p2(X1)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.13/0.38 cnf(i_0_28, negated_conjecture, (p6(X1)|r1(X1,esk4_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_24, negated_conjecture, (p6(X1)|r1(X1,esk6_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_20, negated_conjecture, (p5(X1)|r1(X1,esk8_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_18, negated_conjecture, (p5(X1)|r1(X1,esk9_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_30, negated_conjecture, (p4(X1)|r1(X1,esk3_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_26, negated_conjecture, (p4(X1)|r1(X1,esk5_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_22, negated_conjecture, (p4(X1)|r1(X1,esk7_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_16, negated_conjecture, (p3(X1)|r1(X1,esk10_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_14, negated_conjecture, (p3(X1)|r1(X1,esk11_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_12, negated_conjecture, (p1(X1)|r1(X1,esk12_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_10, negated_conjecture, (p1(X1)|r1(X1,esk13_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.38 # Begin printing tableau % 0.13/0.38 # Found 5 steps % 0.13/0.38 cnf(i_0_19, negated_conjecture, (p5(esk14_0)|~p3(esk8_1(esk14_0))|~r1(esk1_0,esk14_0)), inference(start_rule)). % 0.13/0.38 cnf(i_0_109, plain, (p5(esk14_0)), inference(closure_rule, [i_0_7])). % 0.13/0.38 cnf(i_0_111, plain, (~r1(esk1_0,esk14_0)), inference(closure_rule, [i_0_8])). % 0.13/0.38 cnf(i_0_110, plain, (~p3(esk8_1(esk14_0))), inference(extension_rule, [i_0_13])). % 0.13/0.38 cnf(i_0_532, plain, (~p1(esk11_1(esk8_1(esk14_0)))), inference(extension_rule, [i_0_10])). % 0.13/0.38 # End printing tableau % 0.13/0.38 # SZS output end % 0.13/0.38 # Branches closed with saturation will be marked with an "s" % 0.13/0.38 # Satisfiable branch found. % 0.13/0.38 # There were 1 total branch saturation attempts. % 0.13/0.38 # There were 0 of these attempts blocked. % 0.13/0.38 # There were 0 deferred branch saturation attempts. % 0.13/0.38 # There were 0 free duplicated saturations. % 0.13/0.38 # There were 0 total successful branch saturations. % 0.13/0.38 # There were 0 successful branch saturations in interreduction. % 0.13/0.38 # There were 0 successful branch saturations on the branch. % 0.13/0.38 # There were 0 successful branch saturations after the branch. % 0.13/0.38 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # Begin clausification derivation % 0.13/0.38 % 0.13/0.38 # End clausification derivation % 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.38 cnf(i_0_8, negated_conjecture, (r1(esk1_0,esk14_0))). % 0.13/0.38 cnf(i_0_6, negated_conjecture, (r1(esk1_0,esk15_0))). % 0.13/0.38 cnf(i_0_4, negated_conjecture, (r1(esk1_0,esk16_0))). % 0.13/0.38 cnf(i_0_2, negated_conjecture, (r1(esk1_0,esk17_0))). % 0.13/0.38 cnf(i_0_7, negated_conjecture, (~p5(esk14_0))). % 0.13/0.38 cnf(i_0_3, negated_conjecture, (~p2(esk16_0))). % 0.13/0.38 cnf(i_0_5, negated_conjecture, (~p3(esk15_0))). % 0.13/0.38 cnf(i_0_1, negated_conjecture, (~p1(esk17_0))). % 0.13/0.38 cnf(i_0_31, negated_conjecture, (p6(X1)|~p6(esk2_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_27, negated_conjecture, (p6(X1)|~p4(esk4_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_23, negated_conjecture, (p6(X1)|~p2(esk6_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_19, negated_conjecture, (p5(X1)|~p3(esk8_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_17, negated_conjecture, (p5(X1)|~p1(esk9_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_29, negated_conjecture, (p4(X1)|~p6(esk3_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_25, negated_conjecture, (p4(X1)|~p4(esk5_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_21, negated_conjecture, (p4(X1)|~p2(esk7_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_15, negated_conjecture, (p3(X1)|~p3(esk10_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_13, negated_conjecture, (p3(X1)|~p1(esk11_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_11, negated_conjecture, (p1(X1)|~p3(esk12_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_9, negated_conjecture, (p1(X1)|~p1(esk13_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_36, negated_conjecture, (p6(X1)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.13/0.38 cnf(i_0_35, negated_conjecture, (p5(X1)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.13/0.38 cnf(i_0_32, negated_conjecture, (p6(X1)|r1(X1,esk2_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_34, negated_conjecture, (p4(X1)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.13/0.38 cnf(i_0_33, negated_conjecture, (p2(X1)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.13/0.38 cnf(i_0_28, negated_conjecture, (p6(X1)|r1(X1,esk4_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_24, negated_conjecture, (p6(X1)|r1(X1,esk6_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_20, negated_conjecture, (p5(X1)|r1(X1,esk8_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_18, negated_conjecture, (p5(X1)|r1(X1,esk9_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_30, negated_conjecture, (p4(X1)|r1(X1,esk3_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_26, negated_conjecture, (p4(X1)|r1(X1,esk5_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_22, negated_conjecture, (p4(X1)|r1(X1,esk7_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_16, negated_conjecture, (p3(X1)|r1(X1,esk10_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_14, negated_conjecture, (p3(X1)|r1(X1,esk11_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_12, negated_conjecture, (p1(X1)|r1(X1,esk12_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_10, negated_conjecture, (p1(X1)|r1(X1,esk13_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.38 # Begin printing tableau % 0.13/0.38 # Found 5 steps % 0.13/0.38 cnf(i_0_13, negated_conjecture, (p3(esk15_0)|~p1(esk11_1(esk15_0))|~r1(esk1_0,esk15_0)), inference(start_rule)). % 0.13/0.38 cnf(i_0_91, plain, (p3(esk15_0)), inference(closure_rule, [i_0_5])). % 0.13/0.38 cnf(i_0_93, plain, (~r1(esk1_0,esk15_0)), inference(closure_rule, [i_0_6])). % 0.13/0.38 cnf(i_0_92, plain, (~p1(esk11_1(esk15_0))), inference(extension_rule, [i_0_9])). % 0.13/0.38 cnf(i_0_598, plain, (~p1(esk13_1(esk11_1(esk15_0)))), inference(extension_rule, [i_0_11])). % 0.13/0.38 # End printing tableau % 0.13/0.38 # SZS output end % 0.13/0.38 # Branches closed with saturation will be marked with an "s" % 0.13/0.38 # Satisfiable branch found. % 0.13/0.38 # There were 1 total branch saturation attempts. % 0.13/0.38 # There were 0 of these attempts blocked. % 0.13/0.38 # There were 0 deferred branch saturation attempts. % 0.13/0.38 # There were 0 free duplicated saturations. % 0.13/0.38 # There were 0 total successful branch saturations. % 0.13/0.38 # There were 0 successful branch saturations in interreduction. % 0.13/0.38 # There were 0 successful branch saturations on the branch. % 0.13/0.38 # There were 0 successful branch saturations after the branch. % 0.13/0.38 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # Begin clausification derivation % 0.13/0.38 % 0.13/0.38 # End clausification derivation % 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.38 cnf(i_0_8, negated_conjecture, (r1(esk1_0,esk14_0))). % 0.13/0.38 cnf(i_0_6, negated_conjecture, (r1(esk1_0,esk15_0))). % 0.13/0.38 cnf(i_0_4, negated_conjecture, (r1(esk1_0,esk16_0))). % 0.13/0.38 cnf(i_0_2, negated_conjecture, (r1(esk1_0,esk17_0))). % 0.13/0.38 cnf(i_0_7, negated_conjecture, (~p5(esk14_0))). % 0.13/0.38 cnf(i_0_3, negated_conjecture, (~p2(esk16_0))). % 0.13/0.38 cnf(i_0_5, negated_conjecture, (~p3(esk15_0))). % 0.13/0.38 cnf(i_0_1, negated_conjecture, (~p1(esk17_0))). % 0.13/0.38 cnf(i_0_31, negated_conjecture, (p6(X1)|~p6(esk2_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_27, negated_conjecture, (p6(X1)|~p4(esk4_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_23, negated_conjecture, (p6(X1)|~p2(esk6_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_19, negated_conjecture, (p5(X1)|~p3(esk8_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_17, negated_conjecture, (p5(X1)|~p1(esk9_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_29, negated_conjecture, (p4(X1)|~p6(esk3_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_25, negated_conjecture, (p4(X1)|~p4(esk5_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_21, negated_conjecture, (p4(X1)|~p2(esk7_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_15, negated_conjecture, (p3(X1)|~p3(esk10_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_13, negated_conjecture, (p3(X1)|~p1(esk11_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_11, negated_conjecture, (p1(X1)|~p3(esk12_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_9, negated_conjecture, (p1(X1)|~p1(esk13_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_36, negated_conjecture, (p6(X1)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.13/0.38 cnf(i_0_35, negated_conjecture, (p5(X1)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.13/0.38 cnf(i_0_32, negated_conjecture, (p6(X1)|r1(X1,esk2_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_34, negated_conjecture, (p4(X1)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.13/0.38 cnf(i_0_33, negated_conjecture, (p2(X1)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.13/0.38 cnf(i_0_28, negated_conjecture, (p6(X1)|r1(X1,esk4_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_24, negated_conjecture, (p6(X1)|r1(X1,esk6_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_20, negated_conjecture, (p5(X1)|r1(X1,esk8_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_18, negated_conjecture, (p5(X1)|r1(X1,esk9_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_30, negated_conjecture, (p4(X1)|r1(X1,esk3_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_26, negated_conjecture, (p4(X1)|r1(X1,esk5_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_22, negated_conjecture, (p4(X1)|r1(X1,esk7_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_16, negated_conjecture, (p3(X1)|r1(X1,esk10_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_14, negated_conjecture, (p3(X1)|r1(X1,esk11_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_12, negated_conjecture, (p1(X1)|r1(X1,esk12_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 cnf(i_0_10, negated_conjecture, (p1(X1)|r1(X1,esk13_1(X1))|~r1(esk1_0,X1))). % 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.38 # Begin printing tableau % 0.13/0.38 # Found 5 steps % 0.13/0.38 cnf(i_0_15, negated_conjecture, (p3(esk15_0)|~p3(esk10_1(esk15_0))|~r1(esk1_0,esk15_0)), inference(start_rule)). % 0.13/0.38 cnf(i_0_94, plain, (p3(esk15_0)), inference(closure_rule, [i_0_5])). % 0.13/0.39 cnf(i_0_96, plain, (~r1(esk1_0,esk15_0)), inference(closure_rule, [i_0_6])). % 0.13/0.39 cnf(i_0_95, plain, (~p3(esk10_1(esk15_0))), inference(extension_rule, [i_0_13])). % 0.13/0.39 cnf(i_0_616, plain, (~p1(esk11_1(esk10_1(esk15_0)))), inference(extension_rule, [i_0_10])). % 0.13/0.39 # End printing tableau % 0.13/0.39 # SZS output end % 0.13/0.39 # Branches closed with saturation will be marked with an "s" % 0.13/0.39 # Satisfiable branch found. % 0.13/0.39 # There were 1 total branch saturation attempts. % 0.13/0.39 # There were 0 of these attempts blocked. % 0.13/0.39 # There were 0 deferred branch saturation attempts. % 0.13/0.39 # There were 0 free duplicated saturations. % 0.13/0.39 # There were 0 total successful branch saturations. % 0.13/0.39 # There were 0 successful branch saturations in interreduction. % 0.13/0.39 # There were 0 successful branch saturations on the branch. % 0.13/0.39 # There were 0 successful branch saturations after the branch. % 0.13/0.39 # Satisfiable branch found. % 0.13/0.39 # There were 1 total branch saturation attempts. % 0.13/0.39 # There were 0 of these attempts blocked. % 0.13/0.39 # There were 0 deferred branch saturation attempts. % 0.13/0.39 # There were 0 free duplicated saturations. % 0.13/0.39 # There were 0 total successful branch saturations. % 0.13/0.39 # There were 0 successful branch saturations in interreduction. % 0.13/0.39 # There were 0 successful branch saturations on the branch. % 0.13/0.39 # There were 0 successful branch saturations after the branch. % 0.13/0.39 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.39 # Begin clausification derivation % 0.13/0.39 % 0.13/0.39 # End clausification derivation % 0.13/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.39 cnf(i_0_8, negated_conjecture, (r1(esk1_0,esk14_0))). % 0.13/0.39 cnf(i_0_6, negated_conjecture, (r1(esk1_0,esk15_0))). % 0.13/0.39 cnf(i_0_4, negated_conjecture, (r1(esk1_0,esk16_0))). % 0.13/0.39 cnf(i_0_2, negated_conjecture, (r1(esk1_0,esk17_0))). % 0.13/0.39 cnf(i_0_7, negated_conjecture, (~p5(esk14_0))). % 0.13/0.39 cnf(i_0_3, negated_conjecture, (~p2(esk16_0))). % 0.13/0.39 cnf(i_0_5, negated_conjecture, (~p3(esk15_0))). % 0.13/0.39 cnf(i_0_1, negated_conjecture, (~p1(esk17_0))). % 0.13/0.39 cnf(i_0_31, negated_conjecture, (p6(X1)|~p6(esk2_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_27, negated_conjecture, (p6(X1)|~p4(esk4_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_23, negated_conjecture, (p6(X1)|~p2(esk6_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_19, negated_conjecture, (p5(X1)|~p3(esk8_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_17, negated_conjecture, (p5(X1)|~p1(esk9_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_29, negated_conjecture, (p4(X1)|~p6(esk3_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_25, negated_conjecture, (p4(X1)|~p4(esk5_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_21, negated_conjecture, (p4(X1)|~p2(esk7_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_15, negated_conjecture, (p3(X1)|~p3(esk10_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_13, negated_conjecture, (p3(X1)|~p1(esk11_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_11, negated_conjecture, (p1(X1)|~p3(esk12_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_9, negated_conjecture, (p1(X1)|~p1(esk13_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_36, negated_conjecture, (p6(X1)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.13/0.39 cnf(i_0_35, negated_conjecture, (p5(X1)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.13/0.39 cnf(i_0_32, negated_conjecture, (p6(X1)|r1(X1,esk2_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_34, negated_conjecture, (p4(X1)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.13/0.39 cnf(i_0_33, negated_conjecture, (p2(X1)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.13/0.39 cnf(i_0_28, negated_conjecture, (p6(X1)|r1(X1,esk4_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_24, negated_conjecture, (p6(X1)|r1(X1,esk6_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_20, negated_conjecture, (p5(X1)|r1(X1,esk8_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_18, negated_conjecture, (p5(X1)|r1(X1,esk9_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_30, negated_conjecture, (p4(X1)|r1(X1,esk3_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_26, negated_conjecture, (p4(X1)|r1(X1,esk5_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_22, negated_conjecture, (p4(X1)|r1(X1,esk7_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_16, negated_conjecture, (p3(X1)|r1(X1,esk10_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_14, negated_conjecture, (p3(X1)|r1(X1,esk11_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_12, negated_conjecture, (p1(X1)|r1(X1,esk12_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_10, negated_conjecture, (p1(X1)|r1(X1,esk13_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.39 # Begin printing tableau % 0.13/0.39 # Found 6 steps % 0.13/0.39 cnf(i_0_34, negated_conjecture, (p4(esk5_1(esk4_1(esk17_0)))|~r1(esk1_0,esk17_0)|~r1(esk17_0,esk5_1(esk4_1(esk17_0)))), inference(start_rule)). % 0.13/0.39 cnf(i_0_278, plain, (~r1(esk1_0,esk4_1(esk17_0))), inference(closure_rule, [i_0_0])). % 0.13/0.39 cnf(i_0_74, plain, (~r1(esk1_0,esk17_0)), inference(closure_rule, [i_0_2])). % 0.13/0.39 cnf(i_0_73, plain, (p4(esk5_1(esk4_1(esk17_0)))), inference(extension_rule, [i_0_25])). % 0.13/0.39 cnf(i_0_276, plain, (p4(esk4_1(esk17_0))), inference(extension_rule, [i_0_27])). % 0.13/0.39 cnf(i_0_440, plain, (~r1(esk1_0,esk17_0)), inference(closure_rule, [i_0_2])). % 0.13/0.39 # End printing tableau % 0.13/0.39 # SZS output end % 0.13/0.39 # Branches closed with saturation will be marked with an "s" % 0.13/0.39 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.39 # Begin clausification derivation % 0.13/0.39 % 0.13/0.39 # End clausification derivation % 0.13/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.39 cnf(i_0_8, negated_conjecture, (r1(esk1_0,esk14_0))). % 0.13/0.39 cnf(i_0_6, negated_conjecture, (r1(esk1_0,esk15_0))). % 0.13/0.39 cnf(i_0_4, negated_conjecture, (r1(esk1_0,esk16_0))). % 0.13/0.39 cnf(i_0_2, negated_conjecture, (r1(esk1_0,esk17_0))). % 0.13/0.39 cnf(i_0_7, negated_conjecture, (~p5(esk14_0))). % 0.13/0.39 cnf(i_0_3, negated_conjecture, (~p2(esk16_0))). % 0.13/0.39 cnf(i_0_5, negated_conjecture, (~p3(esk15_0))). % 0.13/0.39 cnf(i_0_1, negated_conjecture, (~p1(esk17_0))). % 0.13/0.39 cnf(i_0_31, negated_conjecture, (p6(X1)|~p6(esk2_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_27, negated_conjecture, (p6(X1)|~p4(esk4_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_23, negated_conjecture, (p6(X1)|~p2(esk6_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_19, negated_conjecture, (p5(X1)|~p3(esk8_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_17, negated_conjecture, (p5(X1)|~p1(esk9_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_29, negated_conjecture, (p4(X1)|~p6(esk3_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_25, negated_conjecture, (p4(X1)|~p4(esk5_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_21, negated_conjecture, (p4(X1)|~p2(esk7_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_15, negated_conjecture, (p3(X1)|~p3(esk10_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_13, negated_conjecture, (p3(X1)|~p1(esk11_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_11, negated_conjecture, (p1(X1)|~p3(esk12_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_9, negated_conjecture, (p1(X1)|~p1(esk13_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_36, negated_conjecture, (p6(X1)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.13/0.39 cnf(i_0_35, negated_conjecture, (p5(X1)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.13/0.39 cnf(i_0_32, negated_conjecture, (p6(X1)|r1(X1,esk2_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_34, negated_conjecture, (p4(X1)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.13/0.39 cnf(i_0_33, negated_conjecture, (p2(X1)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.13/0.39 cnf(i_0_28, negated_conjecture, (p6(X1)|r1(X1,esk4_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_24, negated_conjecture, (p6(X1)|r1(X1,esk6_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_20, negated_conjecture, (p5(X1)|r1(X1,esk8_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_18, negated_conjecture, (p5(X1)|r1(X1,esk9_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_30, negated_conjecture, (p4(X1)|r1(X1,esk3_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_26, negated_conjecture, (p4(X1)|r1(X1,esk5_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_22, negated_conjecture, (p4(X1)|r1(X1,esk7_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_16, negated_conjecture, (p3(X1)|r1(X1,esk10_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_14, negated_conjecture, (p3(X1)|r1(X1,esk11_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_12, negated_conjecture, (p1(X1)|r1(X1,esk12_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_10, negated_conjecture, (p1(X1)|r1(X1,esk13_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.39 # Begin printing tableau % 0.13/0.39 # Found 4 steps % 0.13/0.39 cnf(i_0_5, negated_conjecture, (~p3(esk15_0)), inference(start_rule)). % 0.13/0.39 cnf(i_0_122, plain, (~p3(esk15_0)), inference(extension_rule, [i_0_13])). % 0.13/0.39 cnf(i_0_785, plain, (~r1(esk1_0,esk15_0)), inference(closure_rule, [i_0_6])). % 0.13/0.39 cnf(i_0_784, plain, (~p1(esk11_1(esk15_0))), inference(extension_rule, [i_0_10])). % 0.13/0.39 # End printing tableau % 0.13/0.39 # SZS output end % 0.13/0.39 # Branches closed with saturation will be marked with an "s" % 0.13/0.39 # Ran out of tableaux, making start rules for all clauses % 0.13/0.39 # 961310 Satisfiable branch % 0.13/0.39 # Satisfiable branch found. % 0.13/0.39 # There were 1 total branch saturation attempts. % 0.13/0.39 # There were 0 of these attempts blocked. % 0.13/0.39 # There were 0 deferred branch saturation attempts. % 0.13/0.39 # There were 0 free duplicated saturations. % 0.13/0.39 # There were 0 total successful branch saturations. % 0.13/0.39 # There were 0 successful branch saturations in interreduction. % 0.13/0.39 # There were 0 successful branch saturations on the branch. % 0.13/0.39 # There were 0 successful branch saturations after the branch. % 0.13/0.39 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.39 # Begin clausification derivation % 0.13/0.39 % 0.13/0.39 # End clausification derivation % 0.13/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.39 cnf(i_0_8, negated_conjecture, (r1(esk1_0,esk14_0))). % 0.13/0.39 cnf(i_0_6, negated_conjecture, (r1(esk1_0,esk15_0))). % 0.13/0.39 cnf(i_0_4, negated_conjecture, (r1(esk1_0,esk16_0))). % 0.13/0.39 cnf(i_0_2, negated_conjecture, (r1(esk1_0,esk17_0))). % 0.13/0.39 cnf(i_0_7, negated_conjecture, (~p5(esk14_0))). % 0.13/0.39 cnf(i_0_3, negated_conjecture, (~p2(esk16_0))). % 0.13/0.39 cnf(i_0_5, negated_conjecture, (~p3(esk15_0))). % 0.13/0.39 cnf(i_0_1, negated_conjecture, (~p1(esk17_0))). % 0.13/0.39 cnf(i_0_31, negated_conjecture, (p6(X1)|~p6(esk2_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_27, negated_conjecture, (p6(X1)|~p4(esk4_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_23, negated_conjecture, (p6(X1)|~p2(esk6_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_19, negated_conjecture, (p5(X1)|~p3(esk8_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_17, negated_conjecture, (p5(X1)|~p1(esk9_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_29, negated_conjecture, (p4(X1)|~p6(esk3_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_25, negated_conjecture, (p4(X1)|~p4(esk5_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_21, negated_conjecture, (p4(X1)|~p2(esk7_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_15, negated_conjecture, (p3(X1)|~p3(esk10_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_13, negated_conjecture, (p3(X1)|~p1(esk11_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_11, negated_conjecture, (p1(X1)|~p3(esk12_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_9, negated_conjecture, (p1(X1)|~p1(esk13_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_36, negated_conjecture, (p6(X1)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.13/0.39 cnf(i_0_35, negated_conjecture, (p5(X1)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.13/0.39 cnf(i_0_32, negated_conjecture, (p6(X1)|r1(X1,esk2_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_34, negated_conjecture, (p4(X1)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.13/0.39 cnf(i_0_33, negated_conjecture, (p2(X1)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.13/0.39 cnf(i_0_28, negated_conjecture, (p6(X1)|r1(X1,esk4_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_24, negated_conjecture, (p6(X1)|r1(X1,esk6_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_20, negated_conjecture, (p5(X1)|r1(X1,esk8_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_18, negated_conjecture, (p5(X1)|r1(X1,esk9_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_30, negated_conjecture, (p4(X1)|r1(X1,esk3_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_26, negated_conjecture, (p4(X1)|r1(X1,esk5_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_22, negated_conjecture, (p4(X1)|r1(X1,esk7_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_16, negated_conjecture, (p3(X1)|r1(X1,esk10_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_14, negated_conjecture, (p3(X1)|r1(X1,esk11_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_12, negated_conjecture, (p1(X1)|r1(X1,esk12_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 cnf(i_0_10, negated_conjecture, (p1(X1)|r1(X1,esk13_1(X1))|~r1(esk1_0,X1))). % 0.13/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.39 # Begin printing tableau % 0.13/0.39 # Found 5 steps % 0.13/0.39 cnf(i_0_10, negated_conjecture, (p1(esk1_0)|r1(esk1_0,esk13_1(esk1_0))|~r1(esk1_0,esk1_0)), inference(start_rule)). % 0.13/0.39 cnf(i_0_758, plain, (p1(esk1_0)), inference(closure_rule, [i_0_0])). % 0.13/0.39 cnf(i_0_760, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_0])). % 0.13/0.39 cnf(i_0_759, plain, (r1(esk1_0,esk13_1(esk1_0))), inference(extension_rule, [i_0_10])). % 0.13/0.39 cnf(i_0_929, plain, (p1(esk13_1(esk1_0))), inference(extension_rule, [i_0_9])). % 0.13/0.39 # End printing tableau % 0.13/0.39 # SZS output end % 0.13/0.39 # Branches closed with saturation will be marked with an "s" % 0.13/0.39 # Child (961304) has found a proof. % 0.13/0.39 % 0.13/0.39 # Proof search is over... % 0.13/0.39 # Freeing feature tree %------------------------------------------------------------------------------