TSTP Solution File: LCL641+1.005 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL641+1.005 : 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 : n029.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:30 EDT 2022
% Result : CounterSatisfiable 4.32s 0.99s
% Output : CNFRefutation 4.32s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL641+1.005 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jul 2 16:35:55 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.39 # No SInE strategy applied
% 0.13/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.39 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.39 #
% 0.13/0.39 # Presaturation interreduction done
% 0.13/0.39 # Number of axioms: 86 Number of unprocessed: 86
% 0.13/0.39 # Tableaux proof search.
% 0.13/0.39 # APR header successfully linked.
% 0.13/0.39 # Hello from C++
% 0.13/0.40 # The folding up rule is enabled...
% 0.13/0.40 # Local unification is enabled...
% 0.13/0.40 # Any saturation attempts will use folding labels...
% 0.13/0.40 # 86 beginning clauses after preprocessing and clausification
% 0.13/0.40 # Creating start rules for all 38 conjectures.
% 0.13/0.40 # There are 38 start rule candidates:
% 0.13/0.40 # Found 8 unit axioms.
% 0.13/0.40 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.40 # 38 start rule tableaux created.
% 0.13/0.40 # 78 extension rule candidate clauses
% 0.13/0.40 # 8 unit axiom clauses
% 0.13/0.40
% 0.13/0.40 # Requested 8, 32 cores available to the main process.
% 4.32/0.99 # 28013 Satisfiable branch
% 4.32/0.99 # Satisfiable branch found.
% 4.32/0.99 # There were 1 total branch saturation attempts.
% 4.32/0.99 # There were 0 of these attempts blocked.
% 4.32/0.99 # There were 0 deferred branch saturation attempts.
% 4.32/0.99 # There were 0 free duplicated saturations.
% 4.32/0.99 # There were 0 total successful branch saturations.
% 4.32/0.99 # There were 0 successful branch saturations in interreduction.
% 4.32/0.99 # There were 0 successful branch saturations on the branch.
% 4.32/0.99 # There were 0 successful branch saturations after the branch.
% 4.32/0.99 # SZS status CounterSatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.32/0.99 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.32/0.99 # Begin clausification derivation
% 4.32/0.99
% 4.32/0.99 # End clausification derivation
% 4.32/0.99 # Begin listing active clauses obtained from FOF to CNF conversion
% 4.32/0.99 cnf(i_0_29, negated_conjecture, (r1(esk1_0,esk5_0))).
% 4.32/0.99 cnf(i_0_28, negated_conjecture, (r1(esk5_0,esk6_0))).
% 4.32/0.99 cnf(i_0_27, negated_conjecture, (r1(esk6_0,esk7_0))).
% 4.32/0.99 cnf(i_0_26, negated_conjecture, (r1(esk7_0,esk8_0))).
% 4.32/0.99 cnf(i_0_25, negated_conjecture, (r1(esk8_0,esk9_0))).
% 4.32/0.99 cnf(i_0_24, negated_conjecture, (r1(esk9_0,esk10_0))).
% 4.32/0.99 cnf(i_0_22, negated_conjecture, (r1(esk10_0,esk11_0))).
% 4.32/0.99 cnf(i_0_23, negated_conjecture, (~p1(esk10_0))).
% 4.32/0.99 cnf(i_0_21, negated_conjecture, (p1(X1)|~r1(esk11_0,X1))).
% 4.32/0.99 cnf(i_0_18, negated_conjecture, (p1(X1)|~p1(esk13_1(X1))|~r1(esk10_0,X1))).
% 4.32/0.99 cnf(i_0_17, negated_conjecture, (p1(esk12_1(X1))|p1(X1)|~r1(esk10_0,X1))).
% 4.32/0.99 cnf(i_0_20, negated_conjecture, (p1(X1)|r1(X1,esk12_1(X1))|~r1(esk10_0,X1))).
% 4.32/0.99 cnf(i_0_19, negated_conjecture, (p1(X1)|r1(esk12_1(X1),esk13_1(X1))|~r1(esk10_0,X1))).
% 4.32/0.99 cnf(i_0_43, plain, (p1(X1)|~epred1_1(X2)|~p1(esk29_3(X2,X3,X1))|~p1(esk30_1(X2))|~r1(X3,X1)|~r1(X2,X3))).
% 4.32/0.99 cnf(i_0_4, negated_conjecture, (p1(X1)|p1(X2)|~p1(esk17_2(X1,X3))|~p1(esk18_1(X1))|~r1(esk1_0,X1)|~r1(X1,X2)|~r1(X1,X3))).
% 4.32/0.99 cnf(i_0_1, negated_conjecture, (p1(X1)|~p1(esk19_2(X2,X3))|~r1(esk1_0,X2)|~r1(X4,X1)|~r1(X3,X4)|~r1(X2,X3))).
% 4.32/0.99 cnf(i_0_57, plain, (p1(X1)|p1(X2)|r1(X3,esk25_2(X1,X3))|~epred1_1(X1)|~p1(esk26_1(X1))|~r1(X1,X2)|~r1(X1,X3))).
% 4.32/0.99 cnf(i_0_40, plain, (p1(esk28_3(X1,X2,X3))|p1(X3)|~epred1_1(X1)|~p1(esk30_1(X1))|~r1(X2,X3)|~r1(X1,X2))).
% 4.32/0.99 cnf(i_0_51, plain, (p1(X1)|~epred1_1(X2)|~p1(esk27_2(X2,X3))|~r1(X4,X1)|~r1(X3,X4)|~r1(X2,X3))).
% 4.32/0.99 cnf(i_0_54, plain, (p1(X1)|p1(X2)|~epred1_1(X1)|~p1(esk25_2(X1,X3))|~p1(esk26_1(X1))|~r1(X1,X2)|~r1(X1,X3))).
% 4.32/0.99 cnf(i_0_9, negated_conjecture, (p1(X1)|~p1(esk16_3(X2,X3,X4))|~r1(esk1_0,X2)|~r1(X5,X1)|~r1(X4,X5)|~r1(X3,X4)|~r1(X2,X3))).
% 4.32/0.99 cnf(i_0_44, plain, (p1(X1)|r1(X2,esk30_1(X2))|~epred1_1(X2)|~p1(esk29_3(X2,X3,X1))|~r1(X3,X1)|~r1(X2,X3))).
% 4.32/0.99 cnf(i_0_49, plain, (p1(X1)|r1(X1,esk28_3(X2,X3,X1))|~epred1_1(X2)|~p1(esk30_1(X2))|~r1(X3,X1)|~r1(X2,X3))).
% 4.32/0.99 cnf(i_0_5, negated_conjecture, (p1(X1)|p1(X2)|r1(X1,esk18_1(X1))|~p1(esk17_2(X1,X3))|~r1(esk1_0,X1)|~r1(X1,X2)|~r1(X1,X3))).
% 4.32/0.99 cnf(i_0_7, negated_conjecture, (p1(X1)|p1(X2)|r1(X3,esk17_2(X1,X3))|~p1(esk18_1(X1))|~r1(esk1_0,X1)|~r1(X1,X2)|~r1(X1,X3))).
% 4.32/0.99 cnf(i_0_2, negated_conjecture, (p1(X1)|r1(X2,esk19_2(X3,X2))|~r1(esk1_0,X3)|~r1(X4,X1)|~r1(X3,X2)|~r1(X2,X4))).
% 4.32/0.99 cnf(i_0_12, negated_conjecture, (p1(X1)|p1(X2)|~p1(esk14_3(X3,X1,X4))|~p1(esk15_2(X3,X1))|~r1(esk1_0,X3)|~r1(X1,X2)|~r1(X1,X4)|~r1(X3,X1))).
% 4.32/0.99 cnf(i_0_52, plain, (p1(X1)|r1(X2,esk27_2(X3,X2))|~epred1_1(X3)|~r1(X4,X1)|~r1(X3,X2)|~r1(X2,X4))).
% 4.32/0.99 cnf(i_0_41, plain, (p1(esk28_3(X1,X2,X3))|p1(X3)|r1(X1,esk30_1(X1))|~epred1_1(X1)|~r1(X2,X3)|~r1(X1,X2))).
% 4.32/0.99 cnf(i_0_30, negated_conjecture, (epred1_1(X1)|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X4,X3)|~r1(X5,X4)|~r1(X6,X5)|~r1(X2,X6))).
% 4.32/0.99 cnf(i_0_55, plain, (p1(X1)|p1(X2)|r1(X1,esk26_1(X1))|~epred1_1(X1)|~p1(esk25_2(X1,X3))|~r1(X1,X2)|~r1(X1,X3))).
% 4.32/0.99 cnf(i_0_42, plain, (p1(X1)|p1(X2)|~epred1_1(X3)|~p1(esk29_3(X3,X4,X2))|~p1(X5)|~r1(esk30_1(X3),X5)|~r1(X4,X2)|~r1(X5,X1)|~r1(X3,X4))).
% 4.32/0.99 cnf(i_0_31, negated_conjecture, (p1(X1)|~p1(esk4_5(X2,X3,X4,X5,X6))|~r1(esk1_0,X2)|~r1(X7,X1)|~r1(X6,X7)|~r1(X5,X6)|~r1(X4,X5)|~r1(X3,X4)|~r1(X2,X3))).
% 4.32/0.99 cnf(i_0_50, plain, (p1(X1)|r1(X1,esk28_3(X2,X3,X1))|r1(X2,esk30_1(X2))|~epred1_1(X2)|~r1(X3,X1)|~r1(X2,X3))).
% 4.32/0.99 cnf(i_0_8, negated_conjecture, (p1(X1)|p1(X2)|r1(X3,esk17_2(X1,X3))|r1(X1,esk18_1(X1))|~r1(esk1_0,X1)|~r1(X1,X2)|~r1(X1,X3))).
% 4.32/0.99 cnf(i_0_10, negated_conjecture, (p1(X1)|r1(X2,esk16_3(X3,X4,X2))|~r1(esk1_0,X3)|~r1(X5,X1)|~r1(X4,X2)|~r1(X3,X4)|~r1(X2,X5))).
% 4.32/0.99 cnf(i_0_3, negated_conjecture, (p1(X1)|p1(X2)|p1(X3)|~p1(esk17_2(X1,X4))|~p1(X5)|~r1(esk18_1(X1),X5)|~r1(esk1_0,X1)|~r1(X5,X2)|~r1(X1,X3)|~r1(X1,X4))).
% 4.32/0.99 cnf(i_0_15, negated_conjecture, (p1(X1)|p1(X2)|r1(X3,esk14_3(X4,X1,X3))|~p1(esk15_2(X4,X1))|~r1(esk1_0,X4)|~r1(X1,X2)|~r1(X1,X3)|~r1(X4,X1))).
% 4.32/0.99 cnf(i_0_58, plain, (p1(X1)|p1(X2)|r1(X3,esk25_2(X1,X3))|r1(X1,esk26_1(X1))|~epred1_1(X1)|~r1(X1,X2)|~r1(X1,X3))).
% 4.32/0.99 cnf(i_0_46, plain, (p1(X1)|r1(esk28_3(X2,X3,X1),esk29_3(X2,X3,X1))|~epred1_1(X2)|~p1(esk30_1(X2))|~r1(X3,X1)|~r1(X2,X3))).
% 4.32/0.99 cnf(i_0_53, plain, (p1(X1)|p1(X2)|p1(X3)|~epred1_1(X1)|~p1(esk25_2(X1,X4))|~p1(X5)|~r1(esk26_1(X1),X5)|~r1(X5,X2)|~r1(X1,X3)|~r1(X1,X4))).
% 4.32/0.99 cnf(i_0_34, negated_conjecture, (p1(X1)|p1(X2)|~p1(esk2_5(X3,X4,X5,X1,X6))|~p1(esk3_4(X3,X4,X5,X1))|~r1(esk1_0,X3)|~r1(X1,X2)|~r1(X1,X6)|~r1(X5,X1)|~r1(X4,X5)|~r1(X3,X4))).
% 4.32/0.99 cnf(i_0_39, plain, (p1(esk28_3(X1,X2,X3))|p1(X4)|p1(X3)|~epred1_1(X1)|~p1(X5)|~r1(esk30_1(X1),X5)|~r1(X2,X3)|~r1(X5,X4)|~r1(X1,X2))).
% 4.32/0.99 cnf(i_0_13, negated_conjecture, (p1(X1)|p1(X2)|r1(X1,esk15_2(X3,X1))|~p1(esk14_3(X3,X1,X4))|~r1(esk1_0,X3)|~r1(X3,X1)|~r1(X1,X2)|~r1(X1,X4))).
% 4.32/0.99 cnf(i_0_47, plain, (p1(X1)|r1(esk28_3(X2,X3,X1),esk29_3(X2,X3,X1))|r1(X2,esk30_1(X2))|~epred1_1(X2)|~r1(X3,X1)|~r1(X2,X3))).
% 4.32/0.99 cnf(i_0_6, negated_conjecture, (p1(X1)|p1(X2)|p1(X3)|r1(X4,esk17_2(X1,X4))|~p1(X5)|~r1(esk18_1(X1),X5)|~r1(esk1_0,X1)|~r1(X5,X2)|~r1(X1,X3)|~r1(X1,X4))).
% 4.32/0.99 cnf(i_0_69, plain, (p1(esk22_1(X1))|p1(X2)|p1(X3)|~epred1_1(X1)|~p1(esk21_2(X1,X4))|~p1(X5)|~p1(X1)|~r1(X5,X2)|~r1(X1,X3)|~r1(X1,X5)|~r1(X1,X4))).
% 4.32/0.99 cnf(i_0_70, plain, (p1(X1)|p1(X2)|~epred1_1(X3)|~p1(esk21_2(X3,X4))|~p1(esk23_1(X3))|~p1(X5)|~p1(X3)|~r1(X5,X1)|~r1(X3,X2)|~r1(X3,X5)|~r1(X3,X4))).
% 4.32/0.99 cnf(i_0_11, negated_conjecture, (p1(X1)|p1(X2)|p1(X3)|~p1(esk14_3(X4,X1,X5))|~p1(X6)|~r1(esk15_2(X4,X1),X6)|~r1(esk1_0,X4)|~r1(X6,X2)|~r1(X1,X3)|~r1(X1,X5)|~r1(X4,X1))).
% 4.32/0.99 cnf(i_0_62, plain, (p1(esk20_2(X1,X2))|p1(esk22_1(X1))|p1(X3)|p1(X4)|~epred1_1(X1)|~p1(X5)|~p1(X1)|~r1(X5,X3)|~r1(X1,X4)|~r1(X1,X5)|~r1(X1,X2))).
% 4.32/0.99 cnf(i_0_16, negated_conjecture, (p1(X1)|p1(X2)|r1(X3,esk14_3(X4,X1,X3))|r1(X1,esk15_2(X4,X1))|~r1(esk1_0,X4)|~r1(X4,X1)|~r1(X1,X2)|~r1(X1,X3))).
% 4.32/0.99 cnf(i_0_48, plain, (p1(X1)|p1(X2)|r1(X2,esk28_3(X3,X4,X2))|~epred1_1(X3)|~p1(X5)|~r1(esk30_1(X3),X5)|~r1(X4,X2)|~r1(X5,X1)|~r1(X3,X4))).
% 4.32/0.99 cnf(i_0_32, negated_conjecture, (p1(X1)|r1(X2,esk4_5(X3,X4,X5,X6,X2))|~r1(esk1_0,X3)|~r1(X7,X1)|~r1(X6,X2)|~r1(X5,X6)|~r1(X4,X5)|~r1(X3,X4)|~r1(X2,X7))).
% 4.32/0.99 cnf(i_0_63, plain, (p1(esk20_2(X1,X2))|p1(X3)|p1(X4)|~epred1_1(X1)|~p1(esk23_1(X1))|~p1(X5)|~p1(X1)|~r1(X5,X3)|~r1(X1,X4)|~r1(X1,X5)|~r1(X1,X2))).
% 4.32/0.99 cnf(i_0_56, plain, (p1(X1)|p1(X2)|p1(X3)|r1(X4,esk25_2(X1,X4))|~epred1_1(X1)|~p1(X5)|~r1(esk26_1(X1),X5)|~r1(X5,X2)|~r1(X1,X3)|~r1(X1,X4))).
% 4.32/0.99 cnf(i_0_45, plain, (p1(X1)|p1(X2)|r1(esk28_3(X3,X4,X2),esk29_3(X3,X4,X2))|~epred1_1(X3)|~p1(X5)|~r1(esk30_1(X3),X5)|~r1(X4,X2)|~r1(X5,X1)|~r1(X3,X4))).
% 4.32/0.99 cnf(i_0_72, plain, (p1(X1)|p1(X2)|r1(X3,esk22_1(X3))|~epred1_1(X3)|~p1(esk21_2(X3,X4))|~p1(X5)|~p1(X3)|~r1(X5,X1)|~r1(X3,X2)|~r1(X3,X5)|~r1(X3,X4))).
% 4.32/0.99 cnf(i_0_83, plain, (p1(esk22_1(X1))|p1(X2)|p1(X3)|r1(X4,esk20_2(X1,X4))|~epred1_1(X1)|~p1(X5)|~p1(X1)|~r1(X5,X2)|~r1(X1,X3)|~r1(X1,X5)|~r1(X1,X4))).
% 4.32/0.99 cnf(i_0_84, plain, (p1(X1)|p1(X2)|r1(X3,esk20_2(X4,X3))|~epred1_1(X4)|~p1(esk23_1(X4))|~p1(X5)|~p1(X4)|~r1(X5,X1)|~r1(X4,X2)|~r1(X4,X5)|~r1(X4,X3))).
% 4.32/0.99 cnf(i_0_14, negated_conjecture, (p1(X1)|p1(X2)|p1(X3)|r1(X4,esk14_3(X5,X1,X4))|~p1(X6)|~r1(esk15_2(X5,X1),X6)|~r1(esk1_0,X5)|~r1(X6,X2)|~r1(X1,X3)|~r1(X1,X4)|~r1(X5,X1))).
% 4.32/0.99 cnf(i_0_65, plain, (p1(esk20_2(X1,X2))|p1(X3)|p1(X4)|r1(X1,esk22_1(X1))|~epred1_1(X1)|~p1(X5)|~p1(X1)|~r1(X5,X3)|~r1(X1,X4)|~r1(X1,X5)|~r1(X1,X2))).
% 4.32/0.99 cnf(i_0_37, negated_conjecture, (p1(X1)|p1(X2)|r1(X3,esk2_5(X4,X5,X6,X1,X3))|~p1(esk3_4(X4,X5,X6,X1))|~r1(esk1_0,X4)|~r1(X1,X2)|~r1(X1,X3)|~r1(X6,X1)|~r1(X5,X6)|~r1(X4,X5))).
% 4.32/0.99 cnf(i_0_71, plain, (p1(X1)|p1(X2)|r1(esk22_1(X3),esk23_1(X3))|~epred1_1(X3)|~p1(esk21_2(X3,X4))|~p1(X5)|~p1(X3)|~r1(X5,X1)|~r1(X3,X2)|~r1(X3,X5)|~r1(X3,X4))).
% 4.32/0.99 cnf(i_0_35, negated_conjecture, (p1(X1)|p1(X2)|r1(X1,esk3_4(X3,X4,X5,X1))|~p1(esk2_5(X3,X4,X5,X1,X6))|~r1(esk1_0,X3)|~r1(X5,X1)|~r1(X4,X5)|~r1(X3,X4)|~r1(X1,X2)|~r1(X1,X6))).
% 4.32/0.99 cnf(i_0_77, plain, (p1(X1)|p1(X2)|r1(esk20_2(X3,X4),esk21_2(X3,X4))|~epred1_1(X3)|~p1(esk23_1(X3))|~p1(X5)|~p1(X3)|~r1(X5,X1)|~r1(X3,X2)|~r1(X3,X5)|~r1(X3,X4))).
% 4.32/0.99 cnf(i_0_33, negated_conjecture, (p1(X1)|p1(X2)|p1(X3)|~p1(esk2_5(X4,X5,X6,X1,X7))|~p1(X8)|~r1(esk3_4(X4,X5,X6,X1),X8)|~r1(esk1_0,X4)|~r1(X8,X2)|~r1(X1,X3)|~r1(X1,X7)|~r1(X6,X1)|~r1(X5,X6)|~r1(X4,X5))).
% 4.32/0.99 cnf(i_0_64, plain, (p1(esk20_2(X1,X2))|p1(X3)|p1(X4)|r1(esk22_1(X1),esk23_1(X1))|~epred1_1(X1)|~p1(X5)|~p1(X1)|~r1(X5,X3)|~r1(X1,X4)|~r1(X1,X5)|~r1(X1,X2))).
% 4.32/0.99 cnf(i_0_86, plain, (p1(X1)|p1(X2)|r1(X3,esk20_2(X4,X3))|r1(X4,esk22_1(X4))|~epred1_1(X4)|~p1(X5)|~p1(X4)|~r1(X5,X1)|~r1(X4,X2)|~r1(X4,X5)|~r1(X4,X3))).
% 4.32/0.99 cnf(i_0_76, plain, (p1(esk22_1(X1))|p1(X2)|p1(X3)|r1(esk20_2(X1,X4),esk21_2(X1,X4))|~epred1_1(X1)|~p1(X5)|~p1(X1)|~r1(X5,X2)|~r1(X1,X3)|~r1(X1,X5)|~r1(X1,X4))).
% 4.32/0.99 cnf(i_0_79, plain, (p1(X1)|p1(X2)|r1(esk20_2(X3,X4),esk21_2(X3,X4))|r1(X3,esk22_1(X3))|~epred1_1(X3)|~p1(X5)|~p1(X3)|~r1(X5,X1)|~r1(X3,X2)|~r1(X3,X5)|~r1(X3,X4))).
% 4.32/0.99 cnf(i_0_85, plain, (p1(X1)|p1(X2)|r1(esk22_1(X3),esk23_1(X3))|r1(X4,esk20_2(X3,X4))|~epred1_1(X3)|~p1(X5)|~p1(X3)|~r1(X5,X1)|~r1(X3,X2)|~r1(X3,X5)|~r1(X3,X4))).
% 4.32/0.99 cnf(i_0_78, plain, (p1(X1)|p1(X2)|r1(esk20_2(X3,X4),esk21_2(X3,X4))|r1(esk22_1(X3),esk23_1(X3))|~epred1_1(X3)|~p1(X5)|~p1(X3)|~r1(X5,X1)|~r1(X3,X2)|~r1(X3,X5)|~r1(X3,X4))).
% 4.32/0.99 cnf(i_0_38, negated_conjecture, (p1(X1)|p1(X2)|r1(X3,esk2_5(X4,X5,X6,X1,X3))|r1(X1,esk3_4(X4,X5,X6,X1))|~r1(esk1_0,X4)|~r1(X6,X1)|~r1(X5,X6)|~r1(X4,X5)|~r1(X1,X2)|~r1(X1,X3))).
% 4.32/0.99 cnf(i_0_66, plain, (p1(X1)|p1(X2)|p1(X3)|p1(X4)|~epred1_1(X5)|~p1(esk21_2(X5,X6))|~p1(X7)|~p1(X8)|~p1(X5)|~r1(esk22_1(X5),X1)|~r1(X7,X3)|~r1(X8,X2)|~r1(X5,X4)|~r1(X5,X7)|~r1(X5,X6)|~r1(X1,X8))).
% 4.32/0.99 cnf(i_0_67, plain, (p1(X1)|p1(X2)|p1(X3)|~epred1_1(X4)|~p1(esk21_2(X4,X5))|~p1(esk24_2(X4,X6))|~p1(X7)|~p1(X8)|~p1(X4)|~r1(esk22_1(X4),X6)|~r1(X7,X2)|~r1(X8,X1)|~r1(X6,X8)|~r1(X4,X3)|~r1(X4,X7)|~r1(X4,X5))).
% 4.32/0.99 cnf(i_0_36, negated_conjecture, (p1(X1)|p1(X2)|p1(X3)|r1(X4,esk2_5(X5,X6,X7,X1,X4))|~p1(X8)|~r1(esk3_4(X5,X6,X7,X1),X8)|~r1(esk1_0,X5)|~r1(X8,X2)|~r1(X1,X3)|~r1(X1,X4)|~r1(X7,X1)|~r1(X6,X7)|~r1(X5,X6))).
% 4.32/0.99 cnf(i_0_59, plain, (p1(esk20_2(X1,X2))|p1(X3)|p1(X4)|p1(X5)|p1(X6)|~epred1_1(X1)|~p1(X7)|~p1(X8)|~p1(X1)|~r1(esk22_1(X1),X3)|~r1(X7,X5)|~r1(X8,X4)|~r1(X1,X6)|~r1(X1,X7)|~r1(X1,X2)|~r1(X3,X8))).
% 4.32/0.99 cnf(i_0_80, plain, (p1(X1)|p1(X2)|p1(X3)|p1(X4)|r1(X5,esk20_2(X6,X5))|~epred1_1(X6)|~p1(X7)|~p1(X8)|~p1(X6)|~r1(esk22_1(X6),X1)|~r1(X7,X3)|~r1(X8,X2)|~r1(X6,X4)|~r1(X6,X7)|~r1(X6,X5)|~r1(X1,X8))).
% 4.32/0.99 cnf(i_0_60, plain, (p1(esk20_2(X1,X2))|p1(X3)|p1(X4)|p1(X5)|~epred1_1(X1)|~p1(esk24_2(X1,X6))|~p1(X7)|~p1(X8)|~p1(X1)|~r1(esk22_1(X1),X6)|~r1(X7,X4)|~r1(X8,X3)|~r1(X6,X8)|~r1(X1,X5)|~r1(X1,X7)|~r1(X1,X2))).
% 4.32/0.99 cnf(i_0_81, plain, (p1(X1)|p1(X2)|p1(X3)|r1(X4,esk20_2(X5,X4))|~epred1_1(X5)|~p1(esk24_2(X5,X6))|~p1(X7)|~p1(X8)|~p1(X5)|~r1(esk22_1(X5),X6)|~r1(X7,X2)|~r1(X8,X1)|~r1(X6,X8)|~r1(X5,X3)|~r1(X5,X7)|~r1(X5,X4))).
% 4.32/0.99 cnf(i_0_68, plain, (p1(X1)|p1(X2)|p1(X3)|r1(X4,esk24_2(X5,X4))|~epred1_1(X5)|~p1(esk21_2(X5,X6))|~p1(X7)|~p1(X8)|~p1(X5)|~r1(esk22_1(X5),X4)|~r1(X7,X2)|~r1(X8,X1)|~r1(X5,X3)|~r1(X5,X7)|~r1(X5,X6)|~r1(X4,X8))).
% 4.32/0.99 cnf(i_0_61, plain, (p1(esk20_2(X1,X2))|p1(X3)|p1(X4)|p1(X5)|r1(X6,esk24_2(X1,X6))|~epred1_1(X1)|~p1(X7)|~p1(X8)|~p1(X1)|~r1(esk22_1(X1),X6)|~r1(X7,X4)|~r1(X8,X3)|~r1(X1,X5)|~r1(X1,X7)|~r1(X1,X2)|~r1(X6,X8))).
% 4.32/0.99 cnf(i_0_73, plain, (p1(X1)|p1(X2)|p1(X3)|p1(X4)|r1(esk20_2(X5,X6),esk21_2(X5,X6))|~epred1_1(X5)|~p1(X7)|~p1(X8)|~p1(X5)|~r1(esk22_1(X5),X1)|~r1(X7,X3)|~r1(X8,X2)|~r1(X5,X4)|~r1(X5,X7)|~r1(X5,X6)|~r1(X1,X8))).
% 4.32/0.99 cnf(i_0_82, plain, (p1(X1)|p1(X2)|p1(X3)|r1(X4,esk24_2(X5,X4))|r1(X6,esk20_2(X5,X6))|~epred1_1(X5)|~p1(X7)|~p1(X8)|~p1(X5)|~r1(esk22_1(X5),X4)|~r1(X7,X2)|~r1(X8,X1)|~r1(X5,X3)|~r1(X5,X7)|~r1(X5,X6)|~r1(X4,X8))).
% 4.32/0.99 cnf(i_0_74, plain, (p1(X1)|p1(X2)|p1(X3)|r1(esk20_2(X4,X5),esk21_2(X4,X5))|~epred1_1(X4)|~p1(esk24_2(X4,X6))|~p1(X7)|~p1(X8)|~p1(X4)|~r1(esk22_1(X4),X6)|~r1(X7,X2)|~r1(X8,X1)|~r1(X6,X8)|~r1(X4,X3)|~r1(X4,X7)|~r1(X4,X5))).
% 4.32/0.99 cnf(i_0_75, plain, (p1(X1)|p1(X2)|p1(X3)|r1(esk20_2(X4,X5),esk21_2(X4,X5))|r1(X6,esk24_2(X4,X6))|~epred1_1(X4)|~p1(X7)|~p1(X8)|~p1(X4)|~r1(esk22_1(X4),X6)|~r1(X7,X2)|~r1(X8,X1)|~r1(X4,X3)|~r1(X4,X7)|~r1(X4,X5)|~r1(X6,X8))).
% 4.32/0.99 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 4.32/0.99 # Begin printing tableau
% 4.32/0.99 # Found 20 steps
% 4.32/0.99 cnf(i_0_33, negated_conjecture, (p1(esk10_0)|p1(esk10_0)|p1(esk10_0)|~p1(esk2_5(esk5_0,esk8_0,esk9_0,esk10_0,esk11_0))|~p1(esk9_0)|~r1(esk3_4(esk5_0,esk8_0,esk9_0,esk10_0),esk9_0)|~r1(esk1_0,esk5_0)|~r1(esk9_0,esk10_0)|~r1(esk10_0,esk10_0)|~r1(esk10_0,esk11_0)|~r1(esk9_0,esk10_0)|~r1(esk8_0,esk9_0)|~r1(esk5_0,esk8_0)), inference(start_rule)).
% 4.32/0.99 cnf(i_0_110, plain, (p1(esk10_0)), inference(closure_rule, [i_0_23])).
% 4.32/0.99 cnf(i_0_111, plain, (p1(esk10_0)), inference(closure_rule, [i_0_23])).
% 4.32/0.99 cnf(i_0_112, plain, (p1(esk10_0)), inference(closure_rule, [i_0_23])).
% 4.32/0.99 cnf(i_0_116, plain, (~r1(esk1_0,esk5_0)), inference(closure_rule, [i_0_29])).
% 4.32/0.99 cnf(i_0_117, plain, (~r1(esk9_0,esk10_0)), inference(closure_rule, [i_0_24])).
% 4.32/0.99 cnf(i_0_119, plain, (~r1(esk10_0,esk11_0)), inference(closure_rule, [i_0_22])).
% 4.32/0.99 cnf(i_0_120, plain, (~r1(esk9_0,esk10_0)), inference(closure_rule, [i_0_24])).
% 4.32/0.99 cnf(i_0_121, plain, (~r1(esk8_0,esk9_0)), inference(closure_rule, [i_0_25])).
% 4.32/0.99 cnf(i_0_113, plain, (~p1(esk2_5(esk5_0,esk8_0,esk9_0,esk10_0,esk11_0))), inference(extension_rule, [i_0_43])).
% 4.32/0.99 cnf(i_0_333, plain, (~r1(esk10_0,esk11_0)), inference(closure_rule, [i_0_22])).
% 4.32/0.99 cnf(i_0_329, plain, (~epred1_1(esk10_0)), inference(extension_rule, [i_0_30])).
% 4.32/0.99 cnf(i_0_1005, plain, (~r1(esk1_0,esk5_0)), inference(closure_rule, [i_0_29])).
% 4.32/0.99 cnf(i_0_1006, plain, (~r1(esk9_0,esk10_0)), inference(closure_rule, [i_0_24])).
% 4.32/0.99 cnf(i_0_1007, plain, (~r1(esk8_0,esk9_0)), inference(closure_rule, [i_0_25])).
% 4.32/0.99 cnf(i_0_1008, plain, (~r1(esk7_0,esk8_0)), inference(closure_rule, [i_0_26])).
% 4.32/0.99 cnf(i_0_1009, plain, (~r1(esk6_0,esk7_0)), inference(closure_rule, [i_0_27])).
% 4.32/0.99 cnf(i_0_1010, plain, (~r1(esk5_0,esk6_0)), inference(closure_rule, [i_0_28])).
% 4.32/0.99 cnf(i_0_330, plain, (~p1(esk29_3(esk10_0,esk11_0,esk2_5(esk5_0,esk8_0,esk9_0,esk10_0,esk11_0)))), inference(extension_rule, [i_0_57])).
% 4.32/0.99 cnf(i_0_1012, plain, (p1(esk10_0)), inference(closure_rule, [i_0_23])).
% 4.32/0.99 # End printing tableau
% 4.32/0.99 # SZS output end
% 4.32/0.99 # Branches closed with saturation will be marked with an "s"
% 4.32/1.00 # Child (28013) has found a proof.
% 4.32/1.00
% 4.32/1.00 # Proof search is over...
% 4.32/1.00 # Freeing feature tree
%------------------------------------------------------------------------------