TSTP Solution File: LCL651+1.001 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL651+1.001 : TPTP v8.1.0. 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 : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 10:23:47 EDT 2022
% Result : CounterSatisfiable 0.14s 0.39s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LCL651+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.34 % Computer : n014.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sat Jul 2 10:36:55 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.37 # No SInE strategy applied
% 0.14/0.37 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 0.14/0.37 # and selection function SelectNewComplexAHP.
% 0.14/0.37 #
% 0.14/0.37 # Presaturation interreduction done
% 0.14/0.37 # Number of axioms: 28 Number of unprocessed: 28
% 0.14/0.37 # Tableaux proof search.
% 0.14/0.37 # APR header successfully linked.
% 0.14/0.37 # Hello from C++
% 0.14/0.37 # The folding up rule is enabled...
% 0.14/0.37 # Local unification is enabled...
% 0.14/0.37 # Any saturation attempts will use folding labels...
% 0.14/0.37 # 28 beginning clauses after preprocessing and clausification
% 0.14/0.37 # Creating start rules for all 28 conjectures.
% 0.14/0.37 # There are 28 start rule candidates:
% 0.14/0.37 # Found 12 unit axioms.
% 0.14/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.14/0.37 # 28 start rule tableaux created.
% 0.14/0.37 # 16 extension rule candidate clauses
% 0.14/0.37 # 12 unit axiom clauses
% 0.14/0.37
% 0.14/0.37 # Requested 8, 32 cores available to the main process.
% 0.14/0.39 # 1921 Satisfiable branch
% 0.14/0.39 # 1922 Satisfiable branch
% 0.14/0.39 # 1923 Satisfiable branch
% 0.14/0.39 # 1925 Satisfiable branch
% 0.14/0.39 # 1927 Satisfiable branch
% 0.14/0.39 # 1926 Satisfiable branch
% 0.14/0.39 # 1928 Satisfiable branch
% 0.14/0.39 # 1924 Satisfiable branch
% 0.14/0.39 # Satisfiable branch found.
% 0.14/0.39 # There were 1 total branch saturation attempts.
% 0.14/0.39 # There were 0 of these attempts blocked.
% 0.14/0.39 # There were 0 deferred branch saturation attempts.
% 0.14/0.39 # There were 0 free duplicated saturations.
% 0.14/0.39 # There were 0 total successful branch saturations.
% 0.14/0.39 # There were 0 successful branch saturations in interreduction.
% 0.14/0.39 # There were 0 successful branch saturations on the branch.
% 0.14/0.39 # There were 0 successful branch saturations after the branch.
% 0.14/0.39 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 # Begin clausification derivation
% 0.14/0.39
% 0.14/0.39 # End clausification derivation
% 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.39 cnf(i_0_28, negated_conjecture, (r1(esk1_0,esk2_0))).
% 0.14/0.39 cnf(i_0_22, negated_conjecture, (r1(esk1_0,esk7_0))).
% 0.14/0.39 cnf(i_0_6, negated_conjecture, (r1(esk1_0,esk11_0))).
% 0.14/0.39 cnf(i_0_27, negated_conjecture, (r1(esk2_0,esk3_0))).
% 0.14/0.39 cnf(i_0_26, negated_conjecture, (r1(esk3_0,esk4_0))).
% 0.14/0.39 cnf(i_0_25, negated_conjecture, (r1(esk4_0,esk5_0))).
% 0.14/0.39 cnf(i_0_24, negated_conjecture, (r1(esk5_0,esk6_0))).
% 0.14/0.39 cnf(i_0_5, negated_conjecture, (r1(esk11_0,esk12_0))).
% 0.14/0.39 cnf(i_0_4, negated_conjecture, (r1(esk12_0,esk13_0))).
% 0.14/0.39 cnf(i_0_3, negated_conjecture, (r1(esk13_0,esk14_0))).
% 0.14/0.39 cnf(i_0_2, negated_conjecture, (r1(esk14_0,esk15_0))).
% 0.14/0.39 cnf(i_0_21, negated_conjecture, (~p6(esk7_0))).
% 0.14/0.39 cnf(i_0_17, negated_conjecture, (~p5(esk8_1(X1))|~r1(esk1_0,X1))).
% 0.14/0.39 cnf(i_0_1, negated_conjecture, (~p3(esk15_0)|~p5(esk15_0)|~p1(esk15_0)|~p2(esk15_0)|~p4(esk15_0))).
% 0.14/0.39 cnf(i_0_23, negated_conjecture, (p2(esk6_0)|p4(esk6_0)|p6(esk6_0)|p8(esk6_0)|p10(esk6_0))).
% 0.14/0.39 cnf(i_0_18, negated_conjecture, (r1(X1,esk8_1(X1))|~r1(esk1_0,X1))).
% 0.14/0.39 cnf(i_0_14, negated_conjecture, (r1(X1,esk9_2(X2,X1))|~r1(esk1_0,X2)|~r1(X2,X1))).
% 0.14/0.39 cnf(i_0_10, negated_conjecture, (r1(X1,esk10_3(X2,X3,X1))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))).
% 0.14/0.39 cnf(i_0_13, negated_conjecture, (~p4(esk9_2(X1,X2))|~r1(esk1_0,X1)|~r1(X1,X2))).
% 0.14/0.39 cnf(i_0_9, negated_conjecture, (~p3(esk10_3(X1,X2,X3))|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))).
% 0.14/0.39 cnf(i_0_19, negated_conjecture, (~p1(X1)|~p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_15, negated_conjecture, (~p3(X1)|~p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_20, negated_conjecture, (p1(X1)|p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_7, negated_conjecture, (~p1(X1)|~p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_11, negated_conjecture, (~p3(X1)|~p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_16, negated_conjecture, (p3(X1)|p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_8, negated_conjecture, (p1(X1)|p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_12, negated_conjecture, (p3(X1)|p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.39 # Begin printing tableau
% 0.14/0.39 # Found 18 steps
% 0.14/0.39 cnf(i_0_12, negated_conjecture, (p3(esk15_0)|p2(esk15_0)|~r1(esk1_0,esk11_0)|~r1(esk11_0,esk12_0)|~r1(esk12_0,esk13_0)|~r1(esk13_0,esk14_0)|~r1(esk14_0,esk15_0)), inference(start_rule)).
% 0.14/0.39 cnf(i_0_31, plain, (~r1(esk1_0,esk11_0)), inference(closure_rule, [i_0_6])).
% 0.14/0.39 cnf(i_0_32, plain, (~r1(esk11_0,esk12_0)), inference(closure_rule, [i_0_5])).
% 0.14/0.39 cnf(i_0_33, plain, (~r1(esk12_0,esk13_0)), inference(closure_rule, [i_0_4])).
% 0.14/0.39 cnf(i_0_34, plain, (~r1(esk13_0,esk14_0)), inference(closure_rule, [i_0_3])).
% 0.14/0.39 cnf(i_0_35, plain, (~r1(esk14_0,esk15_0)), inference(closure_rule, [i_0_2])).
% 0.14/0.39 cnf(i_0_29, plain, (p3(esk15_0)), inference(extension_rule, [i_0_15])).
% 0.14/0.39 cnf(i_0_169, plain, (~r1(esk1_0,esk11_0)), inference(closure_rule, [i_0_6])).
% 0.14/0.39 cnf(i_0_170, plain, (~r1(esk11_0,esk12_0)), inference(closure_rule, [i_0_5])).
% 0.14/0.39 cnf(i_0_171, plain, (~r1(esk12_0,esk13_0)), inference(closure_rule, [i_0_4])).
% 0.14/0.39 cnf(i_0_172, plain, (~r1(esk13_0,esk14_0)), inference(closure_rule, [i_0_3])).
% 0.14/0.39 cnf(i_0_173, plain, (~r1(esk14_0,esk15_0)), inference(closure_rule, [i_0_2])).
% 0.14/0.39 cnf(i_0_168, plain, (~p4(esk15_0)), inference(extension_rule, [i_0_20])).
% 0.14/0.39 cnf(i_0_211, plain, (~r1(esk1_0,esk11_0)), inference(closure_rule, [i_0_6])).
% 0.14/0.39 cnf(i_0_212, plain, (~r1(esk11_0,esk12_0)), inference(closure_rule, [i_0_5])).
% 0.14/0.39 cnf(i_0_213, plain, (~r1(esk12_0,esk13_0)), inference(closure_rule, [i_0_4])).
% 0.14/0.39 cnf(i_0_214, plain, (~r1(esk13_0,esk14_0)), inference(closure_rule, [i_0_3])).
% 0.14/0.39 cnf(i_0_215, plain, # Satisfiable branch found.
% 0.14/0.39 # There were 1 total branch saturation attempts.
% 0.14/0.39 # There were 0 of these attempts blocked.
% 0.14/0.39 # There were 0 deferred branch saturation attempts.
% 0.14/0.39 # There were 0 free duplicated saturations.
% 0.14/0.39 # There were 0 total successful branch saturations.
% 0.14/0.39 # There were 0 successful branch saturations in interreduction.
% 0.14/0.39 # There were 0 successful branch saturations on the branch.
% 0.14/0.39 # There were 0 successful branch saturations after the branch.
% 0.14/0.39 # Satisfiable branch found.
% 0.14/0.39 # There were 1 total branch saturation attempts.
% 0.14/0.39 # There were 0 of these attempts blocked.
% 0.14/0.39 # There were 0 deferred branch saturation attempts.
% 0.14/0.39 # There were 0 free duplicated saturations.
% 0.14/0.39 # There were 0 total successful branch saturations.
% 0.14/0.39 # There were 0 successful branch saturations in interreduction.
% 0.14/0.39 # There were 0 successful branch saturations on the branch.
% 0.14/0.39 # There were 0 successful branch saturations after the branch.
% 0.14/0.39 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 # Begin clausification derivation
% 0.14/0.39
% 0.14/0.39 # End clausification derivation
% 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.39 cnf(i_0_28, negated_conjecture, (r1(esk1_0,esk2_0))).
% 0.14/0.39 cnf(i_0_22, negated_conjecture, (r1(esk1_0,esk7_0))).
% 0.14/0.39 cnf(i_0_6, negated_conjecture, (r1(esk1_0,esk11_0))).
% 0.14/0.39 cnf(i_0_27, negated_conjecture, (r1(esk2_0,esk3_0))).
% 0.14/0.39 cnf(i_0_26, negated_conjecture, (r1(esk3_0,esk4_0))).
% 0.14/0.39 cnf(i_0_25, negated_conjecture, (r1(esk4_0,esk5_0))).
% 0.14/0.39 cnf(i_0_24, negated_conjecture, (r1(esk5_0,esk6_0))).
% 0.14/0.39 cnf(i_0_5, negated_conjecture, (r1(esk11_0,esk12_0))).
% 0.14/0.39 cnf(i_0_4, negated_conjecture, (r1(esk12_0,esk13_0))).
% 0.14/0.39 cnf(i_0_3, negated_conjecture, (r1(esk13_0,esk14_0))).
% 0.14/0.39 cnf(i_0_2, negated_conjecture, (r1(esk14_0,esk15_0))).
% 0.14/0.39 cnf(i_0_21, negated_conjecture, (~p6(esk7_0))).
% 0.14/0.39 cnf(i_0_17, negated_conjecture, (~p5(esk8_1(X1))|~r1(esk1_0,X1))).
% 0.14/0.39 cnf(i_0_1, negated_conjecture, (~p3(esk15_0)|~p5(esk15_0)|~p1(esk15_0)|~p2(esk15_0)|~p4(esk15_0))).
% 0.14/0.39 cnf(i_0_23, negated_conjecture, (p2(esk6_0)|p4(esk6_0)|p6(esk6_0)|p8(esk6_0)|p10(esk6_0))).
% 0.14/0.39 cnf(i_0_18, negated_conjecture, (r1(X1,esk8_1(X1))|~r1(esk1_0,X1))).
% 0.14/0.39 cnf(i_0_14, negated_conjecture, (r1(X1,esk9_2(X2,X1))|~r1(esk1_0,X2)|~r1(X2,X1))).
% 0.14/0.39 cnf(i_0_10, negated_conjecture, (r1(X1,esk10_3(X2,X3,X1))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))).
% 0.14/0.39 cnf(i_0_13, negated_conjecture, (~p4(esk9_2(X1,X2))|~r1(esk1_0,X1)|~r1(X1,X2))).
% 0.14/0.39 cnf(i_0_9, negated_conjecture, (~p3(esk10_3(X1,X2,X3))|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))).
% 0.14/0.39 cnf(i_0_19, negated_conjecture, (~p1(X1)|~p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_15, negated_conjecture, (~p3(X1)|~p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_20, negated_conjecture, (p1(X1)|p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_7, negated_conjecture, (~p1(X1)|~p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_11, negated_conjecture, (~p3(X1)|~p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_16, negated_conjecture, (p3(X1)|p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_8, negated_conjecture, (p1(X1)|p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_12, negated_conjecture, (p3(X1)|p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.39 # Begin printing tableau
% 0.14/0.39 # Found 18 steps
% 0.14/0.39 cnf(i_0_8, negated_conjecture, (p1(esk15_0)|p2(esk15_0)|~r1(esk1_0,esk11_0)|~r1(esk11_0,esk12_0)|~r1(esk12_0,esk13_0)|~r1(esk13_0,esk14_0)|~r1(esk14_0,esk15_0)), inference(start_rule)).
% 0.14/0.39 cnf(i_0_38, plain, (~r1(esk1_0,esk11_0)), inference(closure_rule, [i_0_6])).
% 0.14/0.39 cnf(i_0_39, plain, (~r1(esk11_0,esk12_0)), inference(closure_rule, [i_0_5])).
% 0.14/0.39 cnf(i_0_40, plain, (~r1(esk12_0,esk13_0)), inference(closure_rule, [i_0_4])).
% 0.14/0.39 cnf(i_0_41, plain, (~r1(esk13_0,esk14_0)), inference(closure_rule, [i_0_3])).
% 0.14/0.39 cnf(i_0_42, plain, (~r1(esk14_0,esk15_0)), inference(closure_rule, [i_0_2])).
% 0.14/0.39 cnf(i_0_36, plain, (p1(esk15_0)), inference(extension_rule, [i_0_19])).
% 0.14/0.39 cnf(i_0_176, plain, (~r1(esk1_0,esk11_0)), inference(closure_rule, [i_0_6])).
% 0.14/0.39 cnf(i_0_177, plain, (~r1(esk11_0,esk12_0)), inference(closure_rule, [i_0_5])).
% 0.14/0.39 cnf(i_0_178, plain, (~r1(esk12_0,esk13_0)), inference(closure_rule, [i_0_4])).
% 0.14/0.39 cnf(i_0_179, plain, (~r1(esk13_0,esk14_0)), inference(closure_rule, [i_0_3])).
% 0.14/0.39 cnf(i_0_180, plain, (~r1(esk14_0,esk15_0)), inference(closure_rule, [i_0_2])).
% 0.14/0.39 cnf(i_0_175, plain, (~p4(esk15_0)), inference(extension_rule, [i_0_16])).
% 0.14/0.39 cnf(i_0_197, plain, (~r1(esk1_0,esk11_0)), inference(closure_rule, [i_0_6])).
% 0.14/0.39 cnf(i_0_198, plain, (~r1(esk11_0,esk12_0)), inference(closure_rule, [i_0_5])).
% 0.14/0.39 cnf(i_0_199, plain, (~r1(esk12_0,esk13_0)), inference(closure_rule, [i_0_4])).
% 0.14/0.39 cnf(i_0_200, plain, (~r1(esk13_0,esk14_0)), inference(closure_rule, [i_0_3])).
% 0.14/0.39 cnf(i_0_201, plain, (~r1(esk14_0,esk15_0)), inference(closure_rule, [i_0_2])).
% 0.14/0.39 # End printing tableau
% 0.14/0.39 # SZS output end
% 0.14/0.39 # Branches closed with saturation will be marked with an "s"
% 0.14/0.39 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 # Begin clausification derivation
% 0.14/0.39
% 0.14/0.39 # End clausification derivation
% 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.39 cnf(i_0_28, negated_conjecture, (r1(esk1_0,esk2_0))).
% 0.14/0.39 cnf(i_0_22, negated_conjecture, (r1(esk1_0,esk7_0))).
% 0.14/0.39 cnf(i_0_6, negated_conjecture, (r1(esk1_0,esk11_0))).
% 0.14/0.39 cnf(i_0_27, negated_conjecture, (r1(esk2_0,esk3_0))).
% 0.14/0.39 cnf(i_0_26, negated_conjecture, (r1(esk3_0,esk4_0))).
% 0.14/0.39 cnf(i_0_25, negated_conjecture, (r1(esk4_0,esk5_0))).
% 0.14/0.39 cnf(i_0_24, negated_conjecture, (r1(esk5_0,esk6_0))).
% 0.14/0.39 cnf(i_0_5, negated_conjecture, (r1(esk11_0,esk12_0))).
% 0.14/0.39 cnf(i_0_4, negated_conjecture, (r1(esk12_0,esk13_0))).
% 0.14/0.39 cnf(i_0_3, negated_conjecture, (r1(esk13_0,esk14_0))).
% 0.14/0.39 cnf(i_0_2, negated_conjecture, (r1(esk14_0,esk15_0))).
% 0.14/0.39 cnf(i_0_21, negated_conjecture, (~p6(esk7_0))).
% 0.14/0.39 cnf(i_0_17, negated_conjecture, (~p5(esk8_1(X1))|~r1(esk1_0,X1))).
% 0.14/0.39 cnf(i_0_1, negated_conjecture, (~p3(esk15_0)|~p5(esk15_0)|~p1(esk15_0)|~p2(esk15_0)|~p4(esk15_0))).
% 0.14/0.39 cnf(i_0_23, negated_conjecture, (p2(esk6_0)|p4(esk6_0)|p6(esk6_0)|p8(esk6_0)|p10(esk6_0))).
% 0.14/0.39 cnf(i_0_18, negated_conjecture, (r1(X1,esk8_1(X1))|~r1(esk1_0,X1))).
% 0.14/0.39 cnf(i_0_14, negated_conjecture, (r1(X1,esk9_2(X2,X1))|~r1(esk1_0,X2)|~r1(X2,X1))).
% 0.14/0.39 cnf(i_0_10, negated_conjecture, (r1(X1,esk10_3(X2,X3,X1))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))).
% 0.14/0.39 cnf(i_0_13, negated_conjecture, (~p4(esk9_2(X1,X2))|~r1(esk1_0,X1)|~r1(X1,X2))).
% 0.14/0.39 cnf(i_0_9, negated_conjecture, (~p3(esk10_3(X1,X2,X3))|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))).
% 0.14/0.39 cnf(i_0_19, negated_conjecture, (~p1(X1)|~p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_15, negated_conjecture, (~p3(X1)|~p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_20, negated_conjecture, (p1(X1)|p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_7, negated_conjecture, (~p1(X1)|~p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_11, negated_conjecture, (~p3(X1)|~p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_16, negated_conjecture, (p3(X1)|p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_8, negated_conjecture, (p1(X1)|p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_12, negated_conjecture, (p3(X1)|p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.39 # Begin printing tableau
% 0.14/0.39 # Found 18 steps
% 0.14/0.39 cnf(i_0_16, negated_conjecture, (p3(esk15_0)|p4(esk15_0)|~r1(esk1_0,esk11_0)|~r1(esk11_0,esk12_0)|~r1(esk12_0,esk13_0)|~r1(esk13_0,esk14_0)|~r1(esk14_0,esk15_0)), inference(start_rule)).
% 0.14/0.39 cnf(i_0_45, plain, (~r1(esk1_0,esk11_0)), inference(closure_rule, [i_0_6])).
% 0.14/0.39 cnf(i_0_46, plain, (~r1(esk11_0,esk12_0)), inference(closure_rule, [i_0_5])).
% 0.14/0.39 cnf(i_0_47, plain, (~r1(esk12_0,esk13_0)), inference(closure_rule, [i_0_4])).
% 0.14/0.39 cnf(i_0_48, plain, (~r1(esk13_0,esk14_0)), inference(closure_rule, [i_0_3])).
% 0.14/0.39 cnf(i_0_49, plain, (~r1(esk14_0,esk15_0)), inference(closure_rule, [i_0_2])).
% 0.14/0.39 cnf(i_0_43, plain, (p3(esk15_0)), inference(extension_rule, [i_0_11])).
% 0.14/0.39 cnf(i_0_148, plain, (~r1(esk1_0,esk11_0)), inference(closure_rule, [i_0_6])).
% 0.14/0.39 cnf(i_0_149, plain, (~r1(esk11_0,esk12_0)), inference(closure_rule, [i_0_5])).
% 0.14/0.39 cnf(i_0_150, plain, (~r1(esk12_0,esk13_0)), inference(closure_rule, [i_0_4])).
% 0.14/0.39 cnf(i_0_151, plain, (~r1(esk13_0,esk14_0)), inference(closure_rule, [i_0_3])).
% 0.14/0.39 cnf(i_0_152, plain, (~r1(esk14_0,esk15_0)), inference(closure_rule, [i_0_2])).
% 0.14/0.39 cnf(i_0_147, plain, (~p2(esk15_0)), inference(extension_rule, [i_0_8])).
% 0.14/0.39 cnf(i_0_162, plain, (~r1(esk1_0,esk11_0)), inference(closure_rule, [i_0_6])).
% 0.14/0.39 cnf(i_0_163, plain, (~r1(esk11_0,esk12_0)), inference(closure_rule, [i_0_5])).
% 0.14/0.39 cnf(i_0_164, plain, (~r1(esk12_0,esk13_0)), inference(closure_rule, [i_0_4])).
% 0.14/0.39 cnf(i_0_165, plain, (~r1(esk13_0,esk14_0)), inference(closure_rule, [i_0_3])).
% 0.14/0.39 cnf(i_0_166, plain, (~r1(esk14_0,esk15_0)), inference(closure_rule, [i_0_2])).
% 0.14/0.39 # End printing tableau
% 0.14/0.39 # SZS output end
% 0.14/0.39 # Branches closed with saturation will be marked with an "s"
% 0.14/0.39 # Satisfiable branch found.
% 0.14/0.39 # There were 1 total branch saturation attempts.
% 0.14/0.39 # There were 0 of these attempts blocked.
% 0.14/0.39 # There were 0 deferred branch saturation attempts.
% 0.14/0.39 # There were 0 free duplicated saturations.
% 0.14/0.39 # There were 0 total successful branch saturations.
% 0.14/0.39 # There were 0 successful branch saturations in interreduction.
% 0.14/0.39 # There were 0 successful branch saturations on the branch.
% 0.14/0.39 # There were 0 successful branch saturations after the branch.
% 0.14/0.39 # Satisfiable branch found.
% 0.14/0.39 # There were 1 total branch saturation attempts.
% 0.14/0.39 # There were 0 of these attempts blocked.
% 0.14/0.39 # There were 0 deferred branch saturation attempts.
% 0.14/0.39 # There were 0 free duplicated saturations.
% 0.14/0.39 # There were 0 total successful branch saturations.
% 0.14/0.39 # There were 0 successful branch saturations in interreduction.
% 0.14/0.39 # There were 0 successful branch saturations on the branch.
% 0.14/0.39 # There were 0 successful branch saturations after the branch.
% 0.14/0.39 # Satisfiable branch found.
% 0.14/0.39 # There were 1 total branch saturation attempts.
% 0.14/0.39 # There were 0 of these attempts blocked.
% 0.14/0.39 # There were 0 deferred branch saturation attempts.
% 0.14/0.39 # There were 0 free duplicated saturations.
% 0.14/0.39 # There were 0 total successful branch saturations.
% 0.14/0.39 # There were 0 successful branch saturations in interreduction.
% 0.14/0.39 # There were 0 successful branch saturations on the branch.
% 0.14/0.39 # There were 0 successful branch saturations after the branch.
% 0.14/0.39 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 # Begin clausification derivation
% 0.14/0.39
% 0.14/0.39 # End clausification derivation
% 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.39 cnf(i_0_28, negated_conjecture, (r1(esk1_0,esk2_0))).
% 0.14/0.39 cnf(i_0_22, negated_conjecture, (r1(esk1_0,esk7_0))).
% 0.14/0.39 cnf(i_0_6, negated_conjecture, (r1(esk1_0,esk11_0))).
% 0.14/0.39 cnf(i_0_27, negated_conjecture, (r1(esk2_0,esk3_0))).
% 0.14/0.39 cnf(i_0_26, negated_conjecture, (r1(esk3_0,esk4_0))).
% 0.14/0.39 cnf(i_0_25, negated_conjecture, (r1(esk4_0,esk5_0))).
% 0.14/0.39 cnf(i_0_24, negated_conjecture, (r1(esk5_0,esk6_0))).
% 0.14/0.39 cnf(i_0_5, negated_conjecture, (r1(esk11_0,esk12_0))).
% 0.14/0.39 cnf(i_0_4, negated_conjecture, (r1(esk12_0,esk13_0))).
% 0.14/0.39 cnf(i_0_3, negated_conjecture, (r1(esk13_0,esk14_0))).
% 0.14/0.39 cnf(i_0_2, negated_conjecture, (r1(esk14_0,esk15_0))).
% 0.14/0.39 cnf(i_0_21, negated_conjecture, (~p6(esk7_0))).
% 0.14/0.39 cnf(i_0_17, negated_conjecture, (~p5(esk8_1(X1))|~r1(esk1_0,X1))).
% 0.14/0.39 cnf(i_0_1, negated_conjecture, (~p3(esk15_0)|~p5(esk15_0)|~p1(esk15_0)|~p2(esk15_0)|~p4(esk15_0))).
% 0.14/0.39 cnf(i_0_23, negated_conjecture, (p2(esk6_0)|p4(esk6_0)|p6(esk6_0)|p8(esk6_0)|p10(esk6_0))).
% 0.14/0.39 cnf(i_0_18, negated_conjecture, (r1(X1,esk8_1(X1))|~r1(esk1_0,X1))).
% 0.14/0.39 cnf(i_0_14, negated_conjecture, (r1(X1,esk9_2(X2,X1))|~r1(esk1_0,X2)|~r1(X2,X1))).
% 0.14/0.39 cnf(i_0_10, negated_conjecture, (r1(X1,esk10_3(X2,X3,X1))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))).
% 0.14/0.39 cnf(i_0_13, negated_conjecture, (~p4(esk9_2(X1,X2))|~r1(esk1_0,X1)|~r1(X1,X2))).
% 0.14/0.39 cnf(i_0_9, negated_conjecture, (~p3(esk10_3(X1,X2,X3))|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))).
% 0.14/0.39 cnf(i_0_19, negated_conjecture, (~p1(X1)|~p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_15, negated_conjecture, (~p3(X1)|~p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_20, negated_conjecture, (p1(X1)|p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_7, negated_conjecture, (~p1(X1)|~p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_11, negated_conjecture, (~p3(X1)|~p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_16, negated_conjecture, (p3(X1)|p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_8, negated_conjecture, (p1(X1)|p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_12, negated_conjecture, (p3(X1)|p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.39 # Begin printing tableau
% 0.14/0.39 # Found 18 steps
% 0.14/0.39 cnf(i_0_15, negated_conjecture, (~p3(esk15_0)|~p4(esk15_0)|~r1(esk1_0,esk11_0)|~r1(esk11_0,esk12_0)|~r1(esk12_0,esk13_0)|~r1(esk13_0,esk14_0)|~r1(esk14_0,esk15_0)), inference(start_rule)).
% 0.14/0.39 cnf(i_0_73, plain, (~r1(esk1_0,esk11_0)), inference(closure_rule, [i_0_6])).
% 0.14/0.39 cnf(i_0_74, plain, (~r1(esk11_0,esk12_0)), inference(closure_rule, [i_0_5])).
% 0.14/0.39 cnf(i_0_75, plain, (~r1(esk12_0,esk13_0)), inference(closure_rule, [i_0_4])).
% 0.14/0.39 cnf(i_0_76, plain, (~r1(esk13_0,esk14_0)), inference(closure_rule, [i_0_3])).
% 0.14/0.39 cnf(i_0_77, plain, (~r1(esk14_0,esk15_0)), inference(closure_rule, [i_0_2])).
% 0.14/0.39 cnf(i_0_71, plain, (~p3(esk15_0)), inference(extension_rule, [i_0_12])).
% 0.14/0.39 cnf(i_0_127, plain, (~r1(esk1_0,esk11_0)), inference(closure_rule, [i_0_6])).
% 0.14/0.39 cnf(i_0_128, plain, (~r1(esk11_0,esk12_0)), inference(closure_rule, [i_0_5])).
% 0.14/0.39 cnf(i_0_129, plain, (~r1(esk12_0,esk13_0)), inference(closure_rule, [i_0_4])).
% 0.14/0.39 cnf(i_0_130, plain, (~r1(esk13_0,esk14_0)), inference(closure_rule, [i_0_3])).
% 0.14/0.39 cnf(i_0_131, plain, (~r1(esk14_0,esk15_0)), inference(closure_rule, [i_0_2])).
% 0.14/0.39 cnf(i_0_126, plain, (p2(esk15_0)), inference(extension_rule, [i_0_7])).
% 0.14/0.39 cnf(i_0_155, plain, (~r1(esk1_0,esk11_0)), inference(closure_rule, [i_0_6])).
% 0.14/0.39 cnf(i_0_156, plain, (~r1(esk11_0,esk12_0)), inference(closure_rule, [i_0_5])).
% 0.14/0.39 cnf(i_0_157, plain, (~r1(esk12_0,esk13_0)), inference(closure_rule, [i_0_4])).
% 0.14/0.39 cnf(i_0_158, plain, (~r1(esk13_0,esk14_0)), inference(closure_rule, [i_0_3])).
% 0.14/0.39 cnf(i_0_159, plain, (~r1(esk14_0,esk15_0)), inference(closure_rule, [i_0_2])).
% 0.14/0.39 # End printing tableau
% 0.14/0.39 # SZS output end
% 0.14/0.39 # Branches closed with saturation will be marked with an "s"
% 0.14/0.39 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 # Begin clausification derivation
% 0.14/0.39
% 0.14/0.39 # End clausification derivation
% 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.39 cnf(i_0_28, negated_conjecture, (r1(esk1_0,esk2_0))).
% 0.14/0.39 cnf(i_0_22, negated_conjecture, (r1(esk1_0,esk7_0))).
% 0.14/0.39 cnf(i_0_6, negated_conjecture, (r1(esk1_0,esk11_0))).
% 0.14/0.39 cnf(i_0_27, negated_conjecture, (r1(esk2_0,esk3_0))).
% 0.14/0.39 cnf(i_0_26, negated_conjecture, (r1(esk3_0,esk4_0))).
% 0.14/0.39 cnf(i_0_25, negated_conjecture, (r1(esk4_0,esk5_0))).
% 0.14/0.39 cnf(i_0_24, negated_conjecture, (r1(esk5_0,esk6_0))).
% 0.14/0.39 cnf(i_0_5, negated_conjecture, (r1(esk11_0,esk12_0))).
% 0.14/0.39 cnf(i_0_4, negated_conjecture, (r1(esk12_0,esk13_0))).
% 0.14/0.39 cnf(i_0_3, negated_conjecture, (r1(esk13_0,esk14_0))).
% 0.14/0.39 cnf(i_0_2, negated_conjecture, (r1(esk14_0,esk15_0))).
% 0.14/0.39 cnf(i_0_21, negated_conjecture, (~p6(esk7_0))).
% 0.14/0.39 cnf(i_0_17, negated_conjecture, (~p5(esk8_1(X1))|~r1(esk1_0,X1))).
% 0.14/0.39 cnf(i_0_1, negated_conjecture, (~p3(esk15_0)|~p5(esk15_0)|~p1(esk15_0)|~p2(esk15_0)|~p4(esk15_0))).
% 0.14/0.39 cnf(i_0_23, negated_conjecture, (p2(esk6_0)|p4(esk6_0)|p6(esk6_0)|p8(esk6_0)|p10(esk6_0))).
% 0.14/0.39 cnf(i_0_18, negated_conjecture, (r1(X1,esk8_1(X1))|~r1(esk1_0,X1))).
% 0.14/0.39 cnf(i_0_14, negated_conjecture, (r1(X1,esk9_2(X2,X1))|~r1(esk1_0,X2)|~r1(X2,X1))).
% 0.14/0.39 cnf(i_0_10, negated_conjecture, (r1(X1,esk10_3(X2,X3,X1))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))).
% 0.14/0.39 cnf(i_0_13, negated_conjecture, (~p4(esk9_2(X1,X2))|~r1(esk1_0,X1)|~r1(X1,X2))).
% 0.14/0.39 cnf(i_0_9, negated_conjecture, (~p3(esk10_3(X1,X2,X3))|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))).
% 0.14/0.39 cnf(i_0_19, negated_conjecture, (~p1(X1)|~p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_15, negated_conjecture, (~p3(X1)|~p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_20, negated_conjecture, (p1(X1)|p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_7, negated_conjecture, (~p1(X1)|~p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_11, negated_conjecture, (~p3(X1)|~p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_16, negated_conjecture, (p3(X1)|p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_8, negated_conjecture, (p1(X1)|p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_12, negated_conjecture, (p3(X1)|p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.39 # Begin printing tableau
% 0.14/0.39 # Found 18 steps
% 0.14/0.39 cnf(i_0_7, negated_conjecture, (~p1(esk15_0)|~p2(esk15_0)|~r1(esk1_0,esk11_0)|~r1(esk11_0,esk12_0)|~r1(esk12_0,esk13_0)|~r1(esk13_0,esk14_0)|~r1(esk14_0,esk15_0)), inference(start_rule)).
% 0.14/0.39 cnf(i_0_59, plain, (~r1(esk1_0,esk11_0)), inference(closure_rule, [i_0_6])).
% 0.14/0.39 cnf(i_0_60, plain, (~r1(esk11_0,esk12_0)), inference(closure_rule, [i_0_5])).
% 0.14/0.39 cnf(i_0_61, plain, (~r1(esk12_0,esk13_0)), inference(closure_rule, [i_0_4])).
% 0.14/0.39 cnf(i_0_62, plain, (~r1(esk13_0,esk14_0)), inference(closure_rule, [i_0_3])).
% 0.14/0.39 cnf(i_0_63, plain, (~r1(esk14_0,esk15_0)), inference(closure_rule, [i_0_2])).
% 0.14/0.39 cnf(i_0_57, plain, (~p1(esk15_0)), inference(extension_rule, [i_0_20])).
% 0.14/0.39 cnf(i_0_162, plain, (~r1(esk1_0,esk11_0)), inference(closure_rule, [i_0_6])).
% 0.14/0.39 cnf(i_0_163, plain, (~r1(esk11_0,esk12_0)), inference(closure_rule, [i_0_5])).
% 0.14/0.39 cnf(i_0_164, plain, (~r1(esk12_0,esk13_0)), inference(closure_rule, [i_0_4])).
% 0.14/0.39 cnf(i_0_165, plain, (~r1(esk13_0,esk14_0)), inference(closure_rule, [i_0_3])).
% 0.14/0.39 cnf(i_0_166, plain, (~r1(esk14_0,esk15_0)), inference(closure_rule, [i_0_2])).
% 0.14/0.39 cnf(i_0_161, plain, (p4(esk15_0)), inference(extension_rule, [i_0_15])).
% 0.14/0.39 cnf(i_0_204, plain, (~r1(esk1_0,esk11_0)), inference(closure_rule, [i_0_6])).
% 0.14/0.39 cnf(i_0_205, plain, (~r1(esk11_0,esk12_0)), inference(closure_rule, [i_0_5])).
% 0.14/0.39 cnf(i_0_206, plain, (~r1(esk12_0,esk13_0)), inference(closure_rule, [i_0_4])).
% 0.14/0.39 cnf(i_0_207, plain, (~r1(esk13_0,esk14_0)), inference(closure_rule, [i_0_3])).
% 0.14/0.39 cnf(i_0_208, plain, (~r1(esk14_0,esk15_0)), inference(closure_rule, [i_0_2])).
% 0.14/0.39 # End printing tableau
% 0.14/0.39 # SZS output end
% 0.14/0.39 # Branches closed with saturation will be marked with an "s"
% 0.14/0.39 # Satisfiable branch found.
% 0.14/0.39 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 # Begin clausification derivation
% 0.14/0.39
% 0.14/0.39 # End clausification derivation
% 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.39 cnf(i_0_28, negated_conjecture, (r1(esk1_0,esk2_0))).
% 0.14/0.39 cnf(i_0_22, negated_conjecture, (r1(esk1_0,esk7_0))).
% 0.14/0.39 cnf(i_0_6, negated_conjecture, (r1(esk1_0,esk11_0))).
% 0.14/0.39 cnf(i_0_27, negated_conjecture, (r1(esk2_0,esk3_0))).
% 0.14/0.39 cnf(i_0_26, negated_conjecture, (r1(esk3_0,esk4_0))).
% 0.14/0.39 cnf(i_0_25, negated_conjecture, (r1(esk4_0,esk5_0))).
% 0.14/0.39 cnf(i_0_24, negated_conjecture, (r1(esk5_0,esk6_0))).
% 0.14/0.39 cnf(i_0_5, negated_conjecture, (r1(esk11_0,esk12_0))).
% 0.14/0.39 cnf(i_0_4, negated_conjecture, (r1(esk12_0,esk13_0))).
% 0.14/0.39 cnf(i_0_3, negated_conjecture, (r1(esk13_0,esk14_0))).
% 0.14/0.39 cnf(i_0_2, negated_conjecture, (r1(esk14_0,esk15_0))).
% 0.14/0.39 cnf(i_0_21, negated_conjecture, (~p6(esk7_0))).
% 0.14/0.39 cnf(i_0_17, negated_conjecture, (~p5(esk8_1(X1))|~r1(esk1_0,X1))).
% 0.14/0.39 cnf(i_0_1, negated_conjecture, (~p3(esk15_0)|~p5(esk15_0)|~p1(esk15_0)|~p2(esk15_0)|~p4(esk15_0))).
% 0.14/0.39 cnf(i_0_23, negated_conjecture, (p2(esk6_0)|p4(esk6_0)|p6(esk6_0)|p8(esk6_0)|p10(esk6_0))).
% 0.14/0.39 cnf(i_0_18, negated_conjecture, (r1(X1,esk8_1(X1))|~r1(esk1_0,X1))).
% 0.14/0.39 cnf(i_0_14, negated_conjecture, (r1(X1,esk9_2(X2,X1))|~r1(esk1_0,X2)|~r1(X2,X1))).
% 0.14/0.39 cnf(i_0_10, negated_conjecture, (r1(X1,esk10_3(X2,X3,X1))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))).
% 0.14/0.39 cnf(i_0_13, negated_conjecture, (~p4(esk9_2(X1,X2))|~r1(esk1_0,X1)|~r1(X1,X2))).
% 0.14/0.39 cnf(i_0_9, negated_conjecture, (~p3(esk10_3(X1,X2,X3))|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))).
% 0.14/0.39 cnf(i_0_19, negated_conjecture, (~p1(X1)|~p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_15, negated_conjecture, (~p3(X1)|~p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_20, negated_conjecture, (p1(X1)|p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_7, negated_conjecture, (~p1(X1)|~p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_11, negated_conjecture, (~p3(X1)|~p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_16, negated_conjecture, (p3(X1)|p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_8, negated_conjecture, (p1(X1)|p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_12, negated_conjecture, (p3(X1)|p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.39 # Begin printing tableau
% 0.14/0.39 # Found 18 steps
% 0.14/0.39 cnf(i_0_20, negated_conjecture, (p1(esk15_0)|p4(esk15_0)|~r1(esk1_0,esk11_0)|~r1(esk11_0,esk12_0)|~r1(esk12_0,esk13_0)|~r1(esk13_0,esk14_0)|~r1(esk14_0,esk15_0)), inference(start_rule)).
% 0.14/0.39 cnf(i_0_66, plain, (~r1(esk1_0,esk11_0)), inference(closure_rule, [i_0_6])).
% 0.14/0.39 cnf(i_0_67, plain, (~r1(esk11_0,esk12_0)), inference(closure_rule, [i_0_5])).
% 0.14/0.39 cnf(i_0_68, plain, (~r1(esk12_0,esk13_0)), inference(closure_rule, [i_0_4])).
% 0.14/0.39 cnf(i_0_69, plain, (~r1(esk13_0,esk14_0)), inference(closure_rule, [i_0_3])).
% 0.14/0.39 cnf(i_0_70, plain, (~r1(esk14_0,esk15_0)), inference(closure_rule, [i_0_2])).
% 0.14/0.39 cnf(i_0_64, plain, (p1(esk15_0)), inference(extension_rule, [i_0_7])).
% 0.14/0.39 cnf(i_0_155, plain, (~r1(esk1_0,esk11_0)), inference(closure_rule, [i_0_6])).
% 0.14/0.39 cnf(i_0_156, plain, (~r1(esk11_0,esk12_0)), inference(closure_rule, [i_0_5])).
% 0.14/0.39 cnf(i_0_157, plain, (~r1(esk12_0,esk13_0)), inference(closure_rule, [i_0_4])).
% 0.14/0.39 cnf(i_0_158, plain, (~r1(esk13_0,esk14_0)), inference(closure_rule, [i_0_3])).
% 0.14/0.39 cnf(i_0_159, plain, (~r1(esk14_0,esk15_0)), inference(closure_rule, [i_0_2])).
% 0.14/0.39 cnf(i_0_154, plain, (~p2(esk15_0)), inference(extension_rule, [i_0_12])).
% 0.14/0.39 cnf(i_0_162, plain, (~r1(esk1_0,esk11_0)), inference(closure_rule, [i_0_6])).
% 0.14/0.39 cnf(i_0_163, plain, (~r1(esk11_0,esk12_0)), inference(closure_rule, [i_0_5])).
% 0.14/0.39 cnf(i_0_164, plain, (~r1(esk12_0,esk13_0)), inference(closure_rule, [i_0_4])).
% 0.14/0.39 cnf(i_0_165, plain, (~r1(esk13_0,esk14_0)), inference(closure_rule, [i_0_3])).
% 0.14/0.39 cnf(i_0_166, plain, (~r1(esk14_0,esk15_0)), inference(closure_rule, [i_0_2])).
% 0.14/0.39 # End printing tableau
% 0.14/0.39 # SZS output end
% 0.14/0.39 # Branches closed with saturation will be marked with an "s"
% 0.14/0.39 # There were 1 total branch saturation attempts.
% 0.14/0.39 # There were 0 of these attempts blocked.
% 0.14/0.39 # There were 0 deferred branch saturation attempts.
% 0.14/0.39 # There were 0 free duplicated saturations.
% 0.14/0.39 # There were 0 total successful branch saturations.
% 0.14/0.39 # There were 0 successful branch saturations in interreduction.
% 0.14/0.39 # There were 0 successful branch saturations on the branch.
% 0.14/0.39 # There were 0 successful branch saturations after the branch.
% 0.14/0.39 # Satisfiable branch found.
% 0.14/0.39 # There were 1 total branch saturation attempts.
% 0.14/0.39 # There were 0 of these attempts blocked.
% 0.14/0.39 # There were 0 deferred branch saturation attempts.
% 0.14/0.39 # There were 0 free duplicated saturations.
% 0.14/0.39 # There were 0 total successful branch saturations.
% 0.14/0.39 # There were 0 successful branch saturations in interreduction.
% 0.14/0.39 # There were 0 successful branch saturations on the branch.
% 0.14/0.39 # There were 0 successful branch saturations after the branch.
% 0.14/0.39 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 # Begin clausification derivation
% 0.14/0.39
% 0.14/0.39 # End clausification derivation
% 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.39 cnf(i_0_28, negated_conjecture, (r1(esk1_0,esk2_0))).
% 0.14/0.39 cnf(i_0_22, negated_conjecture, (r1(esk1_0,esk7_0))).
% 0.14/0.39 cnf(i_0_6, negated_conjecture, (r1(esk1_0,esk11_0))).
% 0.14/0.39 cnf(i_0_27, negated_conjecture, (r1(esk2_0,esk3_0))).
% 0.14/0.39 cnf(i_0_26, negated_conjecture, (r1(esk3_0,esk4_0))).
% 0.14/0.39 cnf(i_0_25, negated_conjecture, (r1(esk4_0,esk5_0))).
% 0.14/0.39 cnf(i_0_24, negated_conjecture, (r1(esk5_0,esk6_0))).
% 0.14/0.39 cnf(i_0_5, negated_conjecture, (r1(esk11_0,esk12_0))).
% 0.14/0.39 cnf(i_0_4, negated_conjecture, (r1(esk12_0,esk13_0))).
% 0.14/0.39 cnf(i_0_3, negated_conjecture, (r1(esk13_0,esk14_0))).
% 0.14/0.39 cnf(i_0_2, negated_conjecture, (r1(esk14_0,esk15_0))).
% 0.14/0.39 cnf(i_0_21, negated_conjecture, (~p6(esk7_0))).
% 0.14/0.39 cnf(i_0_17, negated_conjecture, (~p5(esk8_1(X1))|~r1(esk1_0,X1))).
% 0.14/0.39 cnf(i_0_1, negated_conjecture, (~p3(esk15_0)|~p5(esk15_0)|~p1(esk15_0)|~p2(esk15_0)|~p4(esk15_0))).
% 0.14/0.39 cnf(i_0_23, negated_conjecture, (p2(esk6_0)|p4(esk6_0)|p6(esk6_0)|p8(esk6_0)|p10(esk6_0))).
% 0.14/0.39 cnf(i_0_18, negated_conjecture, (r1(X1,esk8_1(X1))|~r1(esk1_0,X1))).
% 0.14/0.39 cnf(i_0_14, negated_conjecture, (r1(X1,esk9_2(X2,X1))|~r1(esk1_0,X2)|~r1(X2,X1))).
% 0.14/0.39 cnf(i_0_10, negated_conjecture, (r1(X1,esk10_3(X2,X3,X1))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))).
% 0.14/0.39 cnf(i_0_13, negated_conjecture, (~p4(esk9_2(X1,X2))|~r1(esk1_0,X1)|~r1(X1,X2))).
% 0.14/0.39 cnf(i_0_9, negated_conjecture, (~p3(esk10_3(X1,X2,X3))|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))).
% 0.14/0.39 cnf(i_0_19, negated_conjecture, (~p1(X1)|~p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_15, negated_conjecture, (~p3(X1)|~p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_20, negated_conjecture, (p1(X1)|p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_7, negated_conjecture, (~p1(X1)|~p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_11, negated_conjecture, (~p3(X1)|~p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_16, negated_conjecture, (p3(X1)|p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_8, negated_conjecture, (p1(X1)|p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_12, negated_conjecture, (p3(X1)|p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.39 # Begin printing tableau
% 0.14/0.39 # Found 18 steps
% 0.14/0.39 cnf(i_0_19, negated_conjecture, (~p1(esk15_0)|~p4(esk15_0)|~r1(esk1_0,esk11_0)|~r1(esk11_0,esk12_0)|~r1(esk12_0,esk13_0)|~r1(esk13_0,esk14_0)|~r1(esk14_0,esk15_0)), inference(start_rule)).
% 0.14/0.39 cnf(i_0_80, plain, (~r1(esk1_0,esk11_0)), inference(closure_rule, [i_0_6])).
% 0.14/0.39 cnf(i_0_81, plain, (~r1(esk11_0,esk12_0)), inference(closure_rule, [i_0_5])).
% 0.14/0.39 cnf(i_0_82, plain, (~r1(esk12_0,esk13_0)), inference(closure_rule, [i_0_4])).
% 0.14/0.39 cnf(i_0_83, plain, (~r1(esk13_0,esk14_0)), inference(closure_rule, [i_0_3])).
% 0.14/0.39 cnf(i_0_84, plain, (~r1(esk14_0,esk15_0)), inference(closure_rule, [i_0_2])).
% 0.14/0.39 cnf(i_0_78, plain, (~p1(esk15_0)), inference(extension_rule, [i_0_8])).
% 0.14/0.39 cnf(i_0_134, plain, (~r1(esk1_0,esk11_0)), inference(closure_rule, [i_0_6])).
% 0.14/0.39 cnf(i_0_135, plain, (~r1(esk11_0,esk12_0)), inference(closure_rule, [i_0_5])).
% 0.14/0.39 cnf(i_0_136, plain, (~r1(esk12_0,esk13_0)), inference(closure_rule, [i_0_4])).
% 0.14/0.39 cnf(i_0_137, plain, (~r1(esk13_0,esk14_0)), inference(closure_rule, [i_0_3])).
% 0.14/0.39 cnf(i_0_138, plain, (~r1(esk14_0,esk15_0)), inference(closure_rule, [i_0_2])).
% 0.14/0.39 cnf(i_0_133, plain, (p2(esk15_0)), inference(extension_rule, [i_0_11])).
% 0.14/0.39 cnf(i_0_155, plain, (~r1(esk1_0,esk11_0)), inference(closure_rule, [i_0_6])).
% 0.14/0.39 cnf(i_0_156, plain, (~r1(esk11_0,esk12_0)), inference(closure_rule, [i_0_5])).
% 0.14/0.39 cnf(i_0_157, plain, (~r1(esk12_0,esk13_0)), inference(closure_rule, [i_0_4])).
% 0.14/0.39 cnf(i_0_158, plain, (~r1(esk13_0,esk14_0)), inference(closure_rule, [i_0_3])).
% 0.14/0.39 cnf(i_0_159, plain, (~r1(esk14_0,esk15_0)), inference(closure_rule, [i_0_2])).
% 0.14/0.39 # End printing tableau
% 0.14/0.39 # SZS output end
% 0.14/0.39 # Branches closed with saturation will be marked with an "s"
% 0.14/0.39 # SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 # Begin clausification derivation
% 0.14/0.39
% 0.14/0.39 # End clausification derivation
% 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.39 cnf(i_0_28, negated_conjecture, (r1(esk1_0,esk2_0))).
% 0.14/0.39 cnf(i_0_22, negated_conjecture, (r1(esk1_0,esk7_0))).
% 0.14/0.39 cnf(i_0_6, negated_conjecture, (r1(esk1_0,esk11_0))).
% 0.14/0.39 cnf(i_0_27, negated_conjecture, (r1(esk2_0,esk3_0))).
% 0.14/0.39 cnf(i_0_26, negated_conjecture, (r1(esk3_0,esk4_0))).
% 0.14/0.39 cnf(i_0_25, negated_conjecture, (r1(esk4_0,esk5_0))).
% 0.14/0.39 cnf(i_0_24, negated_conjecture, (r1(esk5_0,esk6_0))).
% 0.14/0.39 cnf(i_0_5, negated_conjecture, (r1(esk11_0,esk12_0))).
% 0.14/0.39 cnf(i_0_4, negated_conjecture, (r1(esk12_0,esk13_0))).
% 0.14/0.39 cnf(i_0_3, negated_conjecture, (r1(esk13_0,esk14_0))).
% 0.14/0.39 cnf(i_0_2, negated_conjecture, (r1(esk14_0,esk15_0))).
% 0.14/0.39 cnf(i_0_21, negated_conjecture, (~p6(esk7_0))).
% 0.14/0.39 cnf(i_0_17, negated_conjecture, (~p5(esk8_1(X1))|~r1(esk1_0,X1))).
% 0.14/0.39 cnf(i_0_1, negated_conjecture, (~p3(esk15_0)|~p5(esk15_0)|~p1(esk15_0)|~p2(esk15_0)|~p4(esk15_0))).
% 0.14/0.39 cnf(i_0_23, negated_conjecture, (p2(esk6_0)|p4(esk6_0)|p6(esk6_0)|p8(esk6_0)|p10(esk6_0))).
% 0.14/0.39 cnf(i_0_18, negated_conjecture, (r1(X1,esk8_1(X1))|~r1(esk1_0,X1))).
% 0.14/0.39 cnf(i_0_14, negated_conjecture, (r1(X1,esk9_2(X2,X1))|~r1(esk1_0,X2)|~r1(X2,X1))).
% 0.14/0.39 cnf(i_0_10, negated_conjecture, (r1(X1,esk10_3(X2,X3,X1))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))).
% 0.14/0.39 cnf(i_0_13, negated_conjecture, (~p4(esk9_2(X1,X2))|~r1(esk1_0,X1)|~r1(X1,X2))).
% 0.14/0.39 cnf(i_0_9, negated_conjecture, (~p3(esk10_3(X1,X2,X3))|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))).
% 0.14/0.39 cnf(i_0_19, negated_conjecture, (~p1(X1)|~p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_15, negated_conjecture, (~p3(X1)|~p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_20, negated_conjecture, (p1(X1)|p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_7, negated_conjecture, (~p1(X1)|~p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_11, negated_conjecture, (~p3(X1)|~p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_16, negated_conjecture, (p3(X1)|p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_8, negated_conjecture, (p1(X1)|p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 cnf(i_0_12, negated_conjecture, (p3(X1)|p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X1))).
% 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.39 # Begin printing tableau
% 0.14/0.39 # Found 18 steps
% 0.14/0.39 cnf(i_0_11, negated_conjecture, (~p3(esk15_0)|~p2(esk15_0)|~r1(esk1_0,esk11_0)|~r1(esk11_0,esk12_0)|~r1(esk12_0,esk13_0)|~r1(esk13_0,esk14_0)|~r1(esk14_0,esk15_0)), inference(start_rule)).
% 0.14/0.39 cnf(i_0_52, plain, (~r1(esk1_0,esk11_0)), inference(closure_rule, [i_0_6])).
% 0.14/0.39 cnf(i_0_53, plain, (~r1(esk11_0,esk12_0)), inference(closure_rule, [i_0_5])).
% 0.14/0.39 cnf(i_0_54, plain, (~r1(esk12_0,esk13_0)), inference(closure_rule, [i_0_4])).
% 0.14/0.39 cnf(i_0_55, plain, (~r1(esk13_0,esk14_0)), inference(closure_rule, [i_0_3])).
% 0.14/0.39 cnf(i_0_56, plain, (~r1(esk14_0,esk15_0)), inference(closure_rule, [i_0_2])).
% 0.14/0.39 cnf(i_0_50, plain, (~p3(esk15_0)), inference(extension_rule, [i_0_16])).
% 0.14/0.39 cnf(i_0_141, plain, (~r1(esk1_0,esk11_0)), inference(closure_rule, [i_0_6])).
% 0.14/0.39 cnf(i_0_142, plain, (~r1(esk11_0,esk12_0)), inference(closure_rule, [i_0_5])).
% 0.14/0.39 cnf(i_0_143, plain, (~r1(esk12_0,esk13_0)), inference(closure_rule, [i_0_4])).
% 0.14/0.39 cnf(i_0_144, plain, (~r1(esk13_0,esk14_0)), inference(closure_rule, [i_0_3])).
% 0.14/0.39 cnf(i_0_145, plain, (~r1(esk14_0,esk15_0)), inference(closure_rule, [i_0_2])).
% 0.14/0.39 cnf(i_0_140, plain, (p4(esk15_0)), inference(extension_rule, [i_0_19])).
% 0.14/0.39 cnf(i_0_190, plain, (~r1(esk1_0,esk11_0)), inference(closure_rule, [i_0_6])).
% 0.14/0.39 cnf(i_0_191, plain, (~r1(esk11_0,esk12_0)), inference(closure_rule, [i_0_5])).
% 0.14/0.39 cnf(i_0_192, plain, (~r1(esk12_0,esk13_0)), inference(closure_rule, [i_0_4])).
% 0.14/0.39 cnf(i_0_193, plain, (~r1(esk13_0,esk14_0)), inference(closure_rule, [i_0_3])).
% 0.14/0.40 cnf(i_0_194, plain, (~r1(esk14_0,esk15_0)), inference(closure_rule, [i_0_2])).
% 0.14/0.40 # End printing tableau
% 0.14/0.40 # SZS output end
% 0.14/0.40 # Branches closed with saturation will be marked with an "s"
% 0.14/0.40 # Child (1922) has found a proof.
% 0.14/0.40
% 0.14/0.40 # Proof search is over...
% 0.14/0.40 # Freeing feature tree
%------------------------------------------------------------------------------