TSTP Solution File: KLE010+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : KLE010+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n012.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 01:55:16 EDT 2022
% Result : Theorem 0.24s 1.41s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 12
% Syntax : Number of formulae : 84 ( 39 unt; 0 def)
% Number of atoms : 163 ( 94 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 146 ( 67 ~; 58 |; 14 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 120 ( 7 sgn 53 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5] :
( ( test(X5)
& test(X4) )
=> ( leq(one,addition(addition(addition(addition(multiplication(X5,X4),multiplication(c(X5),X4)),multiplication(X4,X5)),multiplication(c(X4),X5)),multiplication(c(X4),c(X5))))
& leq(addition(addition(addition(addition(multiplication(X5,X4),multiplication(c(X5),X4)),multiplication(X4,X5)),multiplication(c(X4),X5)),multiplication(c(X4),c(X5))),one) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',goals) ).
fof(test_3,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_3) ).
fof(test_2,axiom,
! [X4,X5] :
( complement(X5,X4)
<=> ( multiplication(X4,X5) = zero
& multiplication(X5,X4) = zero
& addition(X4,X5) = one ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_2) ).
fof(test_1,axiom,
! [X4] :
( test(X4)
<=> ? [X5] : complement(X5,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_1) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_associativity) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
fof(left_distributivity,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',left_distributivity) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).
fof(right_distributivity,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',right_distributivity) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',order) ).
fof(c_0_12,negated_conjecture,
~ ! [X4,X5] :
( ( test(X5)
& test(X4) )
=> ( leq(one,addition(addition(addition(addition(multiplication(X5,X4),multiplication(c(X5),X4)),multiplication(X4,X5)),multiplication(c(X4),X5)),multiplication(c(X4),c(X5))))
& leq(addition(addition(addition(addition(multiplication(X5,X4),multiplication(c(X5),X4)),multiplication(X4,X5)),multiplication(c(X4),X5)),multiplication(c(X4),c(X5))),one) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_13,plain,
! [X6,X7,X7] :
( ( c(X6) != X7
| complement(X6,X7)
| ~ test(X6) )
& ( ~ complement(X6,X7)
| c(X6) = X7
| ~ test(X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_3])])])])]) ).
fof(c_0_14,negated_conjecture,
( test(esk3_0)
& test(esk2_0)
& ( ~ leq(one,addition(addition(addition(addition(multiplication(esk3_0,esk2_0),multiplication(c(esk3_0),esk2_0)),multiplication(esk2_0,esk3_0)),multiplication(c(esk2_0),esk3_0)),multiplication(c(esk2_0),c(esk3_0))))
| ~ leq(addition(addition(addition(addition(multiplication(esk3_0,esk2_0),multiplication(c(esk3_0),esk2_0)),multiplication(esk2_0,esk3_0)),multiplication(c(esk2_0),esk3_0)),multiplication(c(esk2_0),c(esk3_0))),one) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
fof(c_0_15,plain,
! [X6,X7,X6,X7] :
( ( multiplication(X6,X7) = zero
| ~ complement(X7,X6) )
& ( multiplication(X7,X6) = zero
| ~ complement(X7,X6) )
& ( addition(X6,X7) = one
| ~ complement(X7,X6) )
& ( multiplication(X6,X7) != zero
| multiplication(X7,X6) != zero
| addition(X6,X7) != one
| complement(X7,X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_2])])])])]) ).
cnf(c_0_16,plain,
( complement(X1,X2)
| ~ test(X1)
| c(X1) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
test(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_18,plain,
! [X6,X6,X8] :
( ( ~ test(X6)
| complement(esk1_1(X6),X6) )
& ( ~ complement(X8,X6)
| test(X6) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_1])])])])])]) ).
cnf(c_0_19,plain,
( addition(X2,X1) = one
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
( complement(esk3_0,X1)
| c(esk3_0) != X1 ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_21,plain,
! [X3,X4] : addition(X3,X4) = addition(X4,X3),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_22,plain,
( multiplication(X1,X2) = zero
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
( multiplication(X2,X1) = zero
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,plain,
( test(X1)
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
( c(X1) = X2
| ~ test(X1)
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_26,plain,
( complement(X1,X2)
| addition(X2,X1) != one
| multiplication(X1,X2) != zero
| multiplication(X2,X1) != zero ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_27,negated_conjecture,
( addition(X1,esk3_0) = one
| c(esk3_0) != X1 ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_28,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,negated_conjecture,
( multiplication(esk3_0,X1) = zero
| c(esk3_0) != X1 ),
inference(spm,[status(thm)],[c_0_22,c_0_20]) ).
cnf(c_0_30,negated_conjecture,
( multiplication(X1,esk3_0) = zero
| c(esk3_0) != X1 ),
inference(spm,[status(thm)],[c_0_23,c_0_20]) ).
fof(c_0_31,plain,
! [X4,X5,X6] : addition(X6,addition(X5,X4)) = addition(addition(X6,X5),X4),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_32,plain,
! [X2] : addition(X2,X2) = X2,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
cnf(c_0_33,negated_conjecture,
( test(X1)
| c(esk3_0) != X1 ),
inference(spm,[status(thm)],[c_0_24,c_0_20]) ).
cnf(c_0_34,plain,
( c(X1) = X2
| addition(X2,X1) != one
| multiplication(X2,X1) != zero
| multiplication(X1,X2) != zero
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_35,negated_conjecture,
addition(esk3_0,c(esk3_0)) = one,
inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_27]),c_0_28]) ).
cnf(c_0_36,negated_conjecture,
multiplication(esk3_0,c(esk3_0)) = zero,
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_37,negated_conjecture,
multiplication(c(esk3_0),esk3_0) = zero,
inference(er,[status(thm)],[c_0_30]) ).
fof(c_0_38,plain,
! [X4,X5,X6] : multiplication(addition(X4,X5),X6) = addition(multiplication(X4,X6),multiplication(X5,X6)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
cnf(c_0_39,negated_conjecture,
test(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_40,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_41,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_42,plain,
( complement(esk1_1(X1),X1)
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_43,negated_conjecture,
( complement(X1,X2)
| c(esk3_0) != X1
| c(X1) != X2 ),
inference(spm,[status(thm)],[c_0_16,c_0_33]) ).
cnf(c_0_44,negated_conjecture,
( c(c(esk3_0)) = esk3_0
| ~ test(c(esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),c_0_37])]) ).
cnf(c_0_45,negated_conjecture,
( ~ leq(addition(addition(addition(addition(multiplication(esk3_0,esk2_0),multiplication(c(esk3_0),esk2_0)),multiplication(esk2_0,esk3_0)),multiplication(c(esk2_0),esk3_0)),multiplication(c(esk2_0),c(esk3_0))),one)
| ~ leq(one,addition(addition(addition(addition(multiplication(esk3_0,esk2_0),multiplication(c(esk3_0),esk2_0)),multiplication(esk2_0,esk3_0)),multiplication(c(esk2_0),esk3_0)),multiplication(c(esk2_0),c(esk3_0)))) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_46,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
fof(c_0_47,plain,
! [X2] : multiplication(one,X2) = X2,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_48,negated_conjecture,
( complement(esk2_0,X1)
| c(esk2_0) != X1 ),
inference(spm,[status(thm)],[c_0_16,c_0_39]) ).
cnf(c_0_49,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_50,plain,
( addition(X1,esk1_1(X1)) = one
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_42]) ).
cnf(c_0_51,negated_conjecture,
( test(X1)
| c(esk3_0) != X2
| c(X2) != X1 ),
inference(spm,[status(thm)],[c_0_24,c_0_43]) ).
cnf(c_0_52,negated_conjecture,
c(c(esk3_0)) = esk3_0,
inference(spm,[status(thm)],[c_0_44,c_0_33]) ).
cnf(c_0_53,negated_conjecture,
( ~ leq(one,addition(multiplication(c(esk2_0),c(esk3_0)),addition(multiplication(c(esk2_0),esk3_0),addition(multiplication(esk2_0,esk3_0),multiplication(addition(esk3_0,c(esk3_0)),esk2_0)))))
| ~ leq(addition(multiplication(c(esk2_0),c(esk3_0)),addition(multiplication(c(esk2_0),esk3_0),addition(multiplication(esk2_0,esk3_0),multiplication(addition(esk3_0,c(esk3_0)),esk2_0)))),one) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_28]),c_0_28]),c_0_28]),c_0_28]),c_0_28]),c_0_28]),c_0_46]),c_0_46]) ).
cnf(c_0_54,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_47]) ).
fof(c_0_55,plain,
! [X4,X5,X6] : multiplication(X4,addition(X5,X6)) = addition(multiplication(X4,X5),multiplication(X4,X6)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
fof(c_0_56,plain,
! [X2] : multiplication(X2,one) = X2,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_57,negated_conjecture,
( addition(X1,esk2_0) = one
| c(esk2_0) != X1 ),
inference(spm,[status(thm)],[c_0_19,c_0_48]) ).
cnf(c_0_58,plain,
( addition(X1,one) = one
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_59,negated_conjecture,
( test(X1)
| esk3_0 != X1 ),
inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_51]),c_0_52]) ).
cnf(c_0_60,negated_conjecture,
( ~ leq(one,addition(multiplication(c(esk2_0),c(esk3_0)),addition(multiplication(c(esk2_0),esk3_0),addition(esk2_0,multiplication(esk2_0,esk3_0)))))
| ~ leq(addition(multiplication(c(esk2_0),c(esk3_0)),addition(multiplication(c(esk2_0),esk3_0),addition(esk2_0,multiplication(esk2_0,esk3_0)))),one) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_35]),c_0_54]),c_0_28]),c_0_35]),c_0_54]),c_0_28]) ).
cnf(c_0_61,plain,
addition(X1,addition(X2,X3)) = addition(X3,addition(X1,X2)),
inference(spm,[status(thm)],[c_0_28,c_0_40]) ).
cnf(c_0_62,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_63,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_64,plain,
addition(X1,addition(X2,X3)) = addition(X2,addition(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_28]),c_0_40]) ).
cnf(c_0_65,negated_conjecture,
addition(esk2_0,c(esk2_0)) = one,
inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_57]),c_0_28]) ).
cnf(c_0_66,negated_conjecture,
addition(esk3_0,addition(c(esk3_0),X1)) = addition(one,X1),
inference(spm,[status(thm)],[c_0_40,c_0_35]) ).
cnf(c_0_67,negated_conjecture,
( addition(X1,one) = one
| esk3_0 != X1 ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_68,negated_conjecture,
( ~ leq(one,addition(esk2_0,addition(multiplication(esk2_0,esk3_0),c(esk2_0))))
| ~ leq(addition(esk2_0,addition(multiplication(esk2_0,esk3_0),c(esk2_0))),one) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_61]),c_0_40]),c_0_61]),c_0_40]),c_0_62]),c_0_28]),c_0_35]),c_0_63]),c_0_61]),c_0_40]),c_0_61]),c_0_40]),c_0_62]),c_0_28]),c_0_35]),c_0_63]) ).
cnf(c_0_69,negated_conjecture,
addition(esk2_0,addition(X1,c(esk2_0))) = addition(X1,one),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
fof(c_0_70,plain,
! [X3,X4,X3,X4] :
( ( ~ leq(X3,X4)
| addition(X3,X4) = X4 )
& ( addition(X3,X4) != X4
| leq(X3,X4) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])])])]) ).
cnf(c_0_71,negated_conjecture,
addition(c(esk3_0),addition(X1,addition(X2,esk3_0))) = addition(X2,addition(one,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_66]),c_0_40]) ).
cnf(c_0_72,negated_conjecture,
( addition(one,X1) = one
| esk3_0 != X1 ),
inference(spm,[status(thm)],[c_0_28,c_0_67]) ).
cnf(c_0_73,negated_conjecture,
addition(one,c(esk3_0)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_41]),c_0_35]) ).
cnf(c_0_74,negated_conjecture,
( ~ leq(one,addition(one,multiplication(esk2_0,esk3_0)))
| ~ leq(addition(one,multiplication(esk2_0,esk3_0)),one) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_69]),c_0_28]),c_0_69]),c_0_28]) ).
cnf(c_0_75,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_76,negated_conjecture,
( addition(X1,one) = one
| addition(X1,esk3_0) != esk3_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_28]),c_0_73]),c_0_41]) ).
cnf(c_0_77,negated_conjecture,
( addition(one,multiplication(esk2_0,esk3_0)) != one
| ~ leq(one,addition(one,multiplication(esk2_0,esk3_0))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_40]),c_0_28]),c_0_49]) ).
cnf(c_0_78,negated_conjecture,
( addition(one,X1) = one
| addition(X1,esk3_0) != esk3_0 ),
inference(spm,[status(thm)],[c_0_28,c_0_76]) ).
cnf(c_0_79,negated_conjecture,
addition(one,multiplication(esk2_0,esk3_0)) != one,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_75]),c_0_49])]) ).
cnf(c_0_80,negated_conjecture,
( addition(one,X1) = one
| addition(esk3_0,X1) != esk3_0 ),
inference(spm,[status(thm)],[c_0_78,c_0_28]) ).
cnf(c_0_81,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_54]),c_0_28]) ).
cnf(c_0_82,negated_conjecture,
addition(esk2_0,one) = one,
inference(spm,[status(thm)],[c_0_49,c_0_65]) ).
cnf(c_0_83,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_81]),c_0_82]),c_0_54])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KLE010+2 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n012.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 16 15:09:09 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.24/1.41 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.24/1.41 # Preprocessing time : 0.037 s
% 0.24/1.41
% 0.24/1.41 # Proof found!
% 0.24/1.41 # SZS status Theorem
% 0.24/1.41 # SZS output start CNFRefutation
% See solution above
% 0.24/1.41 # Proof object total steps : 84
% 0.24/1.41 # Proof object clause steps : 59
% 0.24/1.41 # Proof object formula steps : 25
% 0.24/1.41 # Proof object conjectures : 39
% 0.24/1.41 # Proof object clause conjectures : 36
% 0.24/1.41 # Proof object formula conjectures : 3
% 0.24/1.41 # Proof object initial clauses used : 19
% 0.24/1.41 # Proof object initial formulas used : 12
% 0.24/1.41 # Proof object generating inferences : 36
% 0.24/1.41 # Proof object simplifying inferences : 56
% 0.24/1.41 # Training examples: 0 positive, 0 negative
% 0.24/1.41 # Parsed axioms : 17
% 0.24/1.41 # Removed by relevancy pruning/SinE : 0
% 0.24/1.41 # Initial clauses : 25
% 0.24/1.41 # Removed in clause preprocessing : 0
% 0.24/1.41 # Initial clauses in saturation : 25
% 0.24/1.41 # Processed clauses : 1145
% 0.24/1.41 # ...of these trivial : 118
% 0.24/1.41 # ...subsumed : 614
% 0.24/1.41 # ...remaining for further processing : 413
% 0.24/1.41 # Other redundant clauses eliminated : 12
% 0.24/1.41 # Clauses deleted for lack of memory : 0
% 0.24/1.41 # Backward-subsumed : 24
% 0.24/1.41 # Backward-rewritten : 92
% 0.24/1.41 # Generated clauses : 8707
% 0.24/1.41 # ...of the previous two non-trivial : 6513
% 0.24/1.41 # Contextual simplify-reflections : 166
% 0.24/1.41 # Paramodulations : 8677
% 0.24/1.41 # Factorizations : 2
% 0.24/1.41 # Equation resolutions : 28
% 0.24/1.41 # Current number of processed clauses : 297
% 0.24/1.41 # Positive orientable unit clauses : 92
% 0.24/1.41 # Positive unorientable unit clauses: 4
% 0.24/1.41 # Negative unit clauses : 19
% 0.24/1.41 # Non-unit-clauses : 182
% 0.24/1.41 # Current number of unprocessed clauses: 4440
% 0.24/1.41 # ...number of literals in the above : 11265
% 0.24/1.41 # Current number of archived formulas : 0
% 0.24/1.41 # Current number of archived clauses : 116
% 0.24/1.41 # Clause-clause subsumption calls (NU) : 9143
% 0.24/1.41 # Rec. Clause-clause subsumption calls : 7400
% 0.24/1.41 # Non-unit clause-clause subsumptions : 549
% 0.24/1.41 # Unit Clause-clause subsumption calls : 1444
% 0.24/1.41 # Rewrite failures with RHS unbound : 0
% 0.24/1.41 # BW rewrite match attempts : 161
% 0.24/1.41 # BW rewrite match successes : 103
% 0.24/1.41 # Condensation attempts : 0
% 0.24/1.41 # Condensation successes : 0
% 0.24/1.41 # Termbank termtop insertions : 112272
% 0.24/1.41
% 0.24/1.41 # -------------------------------------------------
% 0.24/1.41 # User time : 0.148 s
% 0.24/1.41 # System time : 0.007 s
% 0.24/1.41 # Total time : 0.155 s
% 0.24/1.41 # Maximum resident set size: 8100 pages
% 0.24/23.41 eprover: CPU time limit exceeded, terminating
% 0.24/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.42 eprover: No such file or directory
% 0.24/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.43 eprover: No such file or directory
% 0.24/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.43 eprover: No such file or directory
% 0.24/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.44 eprover: No such file or directory
% 0.24/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.44 eprover: No such file or directory
% 0.24/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45 eprover: No such file or directory
% 0.24/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.46 eprover: No such file or directory
% 0.24/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.46 eprover: No such file or directory
% 0.24/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.47 eprover: No such file or directory
% 0.24/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.47 eprover: No such file or directory
% 0.24/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.48 eprover: No such file or directory
%------------------------------------------------------------------------------