TSTP Solution File: KLE010+3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : KLE010+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% 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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:04:36 EDT 2023
% Result : Theorem 0.35s 0.61s
% Output : CNFRefutation 0.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 17
% Syntax : Number of formulae : 105 ( 62 unt; 0 def)
% Number of atoms : 180 ( 106 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 139 ( 64 ~; 52 |; 13 &)
% ( 3 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 132 ( 3 sgn; 61 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5] :
( ( test(X5)
& test(X4) )
=> one = addition(addition(addition(addition(multiplication(X5,X4),multiplication(c(X5),X4)),multiplication(X4,X5)),multiplication(c(X4),X5)),multiplication(c(X4),c(X5))) ),
file('/export/starexec/sandbox2/tmp/tmp.QXSdnKZ3RF/E---3.1_3182.p',goals) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.QXSdnKZ3RF/E---3.1_3182.p',additive_commutativity) ).
fof(test_3,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/export/starexec/sandbox2/tmp/tmp.QXSdnKZ3RF/E---3.1_3182.p',test_3) ).
fof(left_distributivity,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.QXSdnKZ3RF/E---3.1_3182.p',left_distributivity) ).
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/tmp/tmp.QXSdnKZ3RF/E---3.1_3182.p',test_2) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.QXSdnKZ3RF/E---3.1_3182.p',multiplicative_left_identity) ).
fof(test_deMorgan1,axiom,
! [X4,X5] :
( ( test(X4)
& test(X5) )
=> c(addition(X4,X5)) = multiplication(c(X4),c(X5)) ),
file('/export/starexec/sandbox2/tmp/tmp.QXSdnKZ3RF/E---3.1_3182.p',test_deMorgan1) ).
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.QXSdnKZ3RF/E---3.1_3182.p',additive_associativity) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.QXSdnKZ3RF/E---3.1_3182.p',additive_idempotence) ).
fof(test_1,axiom,
! [X4] :
( test(X4)
<=> ? [X5] : complement(X5,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.QXSdnKZ3RF/E---3.1_3182.p',test_1) ).
fof(test_4,axiom,
! [X4] :
( ~ test(X4)
=> c(X4) = zero ),
file('/export/starexec/sandbox2/tmp/tmp.QXSdnKZ3RF/E---3.1_3182.p',test_4) ).
fof(right_distributivity,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.QXSdnKZ3RF/E---3.1_3182.p',right_distributivity) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox2/tmp/tmp.QXSdnKZ3RF/E---3.1_3182.p',additive_identity) ).
fof(right_annihilation,axiom,
! [X1] : multiplication(X1,zero) = zero,
file('/export/starexec/sandbox2/tmp/tmp.QXSdnKZ3RF/E---3.1_3182.p',right_annihilation) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox2/tmp/tmp.QXSdnKZ3RF/E---3.1_3182.p',left_annihilation) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/tmp.QXSdnKZ3RF/E---3.1_3182.p',multiplicative_right_identity) ).
fof(test_deMorgan2,axiom,
! [X4,X5] :
( ( test(X4)
& test(X5) )
=> c(multiplication(X4,X5)) = addition(c(X4),c(X5)) ),
file('/export/starexec/sandbox2/tmp/tmp.QXSdnKZ3RF/E---3.1_3182.p',test_deMorgan2) ).
fof(c_0_17,negated_conjecture,
~ ! [X4,X5] :
( ( test(X5)
& test(X4) )
=> one = addition(addition(addition(addition(multiplication(X5,X4),multiplication(c(X5),X4)),multiplication(X4,X5)),multiplication(c(X4),X5)),multiplication(c(X4),c(X5))) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_18,negated_conjecture,
( test(esk3_0)
& test(esk2_0)
& 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(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])]) ).
fof(c_0_19,plain,
! [X6,X7] : addition(X6,X7) = addition(X7,X6),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_20,plain,
! [X34,X35] :
( ( c(X34) != X35
| complement(X34,X35)
| ~ test(X34) )
& ( ~ complement(X34,X35)
| c(X34) = X35
| ~ test(X34) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_3])])]) ).
cnf(c_0_21,negated_conjecture,
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_18]) ).
cnf(c_0_22,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_23,plain,
! [X21,X22,X23] : multiplication(addition(X21,X22),X23) = addition(multiplication(X21,X23),multiplication(X22,X23)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
fof(c_0_24,plain,
! [X32,X33] :
( ( multiplication(X32,X33) = zero
| ~ complement(X33,X32) )
& ( multiplication(X33,X32) = zero
| ~ complement(X33,X32) )
& ( addition(X32,X33) = one
| ~ complement(X33,X32) )
& ( multiplication(X32,X33) != zero
| multiplication(X33,X32) != zero
| addition(X32,X33) != one
| complement(X33,X32) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_2])])]) ).
cnf(c_0_25,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,negated_conjecture,
addition(multiplication(c(esk2_0),c(esk3_0)),addition(multiplication(c(esk2_0),esk3_0),addition(multiplication(esk2_0,esk3_0),addition(multiplication(esk3_0,esk2_0),multiplication(c(esk3_0),esk2_0))))) != one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_22]),c_0_22]) ).
cnf(c_0_27,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,plain,
( complement(X1,c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[c_0_25]) ).
fof(c_0_30,plain,
! [X17] : multiplication(one,X17) = X17,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_31,negated_conjecture,
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(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
( addition(X1,c(X1)) = one
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_22]) ).
cnf(c_0_33,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_34,negated_conjecture,
test(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_35,plain,
! [X37,X38] :
( ~ test(X37)
| ~ test(X38)
| c(addition(X37,X38)) = multiplication(c(X37),c(X38)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_deMorgan1])]) ).
fof(c_0_36,plain,
! [X8,X9,X10] : addition(X10,addition(X9,X8)) = addition(addition(X10,X9),X8),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
cnf(c_0_37,negated_conjecture,
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(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34])]),c_0_22]) ).
cnf(c_0_38,plain,
( c(addition(X1,X2)) = multiplication(c(X1),c(X2))
| ~ test(X1)
| ~ test(X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_39,negated_conjecture,
test(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_40,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_41,negated_conjecture,
addition(c(addition(esk2_0,esk3_0)),addition(multiplication(c(esk2_0),esk3_0),addition(esk2_0,multiplication(esk2_0,esk3_0)))) != one,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_34]),c_0_39])]) ).
cnf(c_0_42,plain,
addition(X1,addition(X2,X3)) = addition(X3,addition(X1,X2)),
inference(spm,[status(thm)],[c_0_22,c_0_40]) ).
cnf(c_0_43,negated_conjecture,
addition(esk2_0,addition(multiplication(esk2_0,esk3_0),addition(multiplication(c(esk2_0),esk3_0),c(addition(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)],[c_0_41,c_0_42]),c_0_40]),c_0_42]),c_0_40]),c_0_22]) ).
cnf(c_0_44,plain,
addition(multiplication(X1,X2),addition(multiplication(X3,X2),X4)) = addition(multiplication(addition(X1,X3),X2),X4),
inference(spm,[status(thm)],[c_0_40,c_0_27]) ).
fof(c_0_45,plain,
! [X12] : addition(X12,X12) = X12,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
fof(c_0_46,plain,
! [X28,X30,X31] :
( ( ~ test(X28)
| complement(esk1_1(X28),X28) )
& ( ~ complement(X31,X30)
| test(X30) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[test_1])])])])]) ).
cnf(c_0_47,negated_conjecture,
addition(esk2_0,addition(c(addition(esk2_0,esk3_0)),multiplication(addition(esk2_0,c(esk2_0)),esk3_0))) != one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44]),c_0_22]) ).
fof(c_0_48,plain,
! [X4] :
( ~ test(X4)
=> c(X4) = zero ),
inference(fof_simplification,[status(thm)],[test_4]) ).
cnf(c_0_49,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_50,plain,
( complement(esk1_1(X1),X1)
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
fof(c_0_51,plain,
! [X18,X19,X20] : multiplication(X18,addition(X19,X20)) = addition(multiplication(X18,X19),multiplication(X18,X20)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
cnf(c_0_52,negated_conjecture,
addition(esk2_0,addition(esk3_0,c(addition(esk2_0,esk3_0)))) != one,
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_32]),c_0_33]),c_0_39])]),c_0_22]) ).
cnf(c_0_53,plain,
( addition(X1,addition(X2,c(addition(X1,X2)))) = one
| ~ test(addition(X1,X2)) ),
inference(spm,[status(thm)],[c_0_40,c_0_32]) ).
fof(c_0_54,plain,
! [X36] :
( test(X36)
| c(X36) = zero ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_48])]) ).
fof(c_0_55,plain,
! [X11] : addition(X11,zero) = X11,
inference(variable_rename,[status(thm)],[additive_identity]) ).
cnf(c_0_56,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_40,c_0_49]) ).
cnf(c_0_57,plain,
( addition(X1,esk1_1(X1)) = one
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_50]) ).
cnf(c_0_58,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_59,negated_conjecture,
~ test(addition(esk2_0,esk3_0)),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_60,plain,
( test(X1)
| c(X1) = zero ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_61,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_62,plain,
( addition(X1,one) = one
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_63,plain,
( test(X2)
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_64,plain,
( complement(X2,X1)
| multiplication(X1,X2) != zero
| multiplication(X2,X1) != zero
| addition(X1,X2) != one ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_65,plain,
! [X24] : multiplication(X24,zero) = zero,
inference(variable_rename,[status(thm)],[right_annihilation]) ).
fof(c_0_66,plain,
! [X25] : multiplication(zero,X25) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
cnf(c_0_67,plain,
( addition(c(addition(X1,X2)),multiplication(c(X1),X3)) = multiplication(c(X1),addition(c(X2),X3))
| ~ test(X2)
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_58,c_0_38]) ).
cnf(c_0_68,negated_conjecture,
c(addition(esk2_0,esk3_0)) = zero,
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_69,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_61,c_0_22]) ).
fof(c_0_70,plain,
! [X16] : multiplication(X16,one) = X16,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_71,plain,
addition(X1,addition(X2,X3)) = addition(X2,addition(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_22]),c_0_40]) ).
cnf(c_0_72,negated_conjecture,
addition(esk2_0,one) = one,
inference(spm,[status(thm)],[c_0_62,c_0_39]) ).
cnf(c_0_73,plain,
( test(X1)
| addition(X1,X2) != one
| multiplication(X2,X1) != zero
| multiplication(X1,X2) != zero ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_74,plain,
multiplication(X1,zero) = zero,
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_75,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_76,negated_conjecture,
multiplication(c(esk2_0),addition(c(esk3_0),X1)) = multiplication(c(esk2_0),X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69]),c_0_34]),c_0_39])]) ).
cnf(c_0_77,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_78,plain,
( addition(X1,addition(c(X1),X2)) = addition(one,X2)
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_32]) ).
cnf(c_0_79,negated_conjecture,
addition(esk2_0,addition(X1,one)) = addition(X1,one),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
fof(c_0_80,plain,
! [X39,X40] :
( ~ test(X39)
| ~ test(X40)
| c(multiplication(X39,X40)) = addition(c(X39),c(X40)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_deMorgan2])]) ).
cnf(c_0_81,plain,
( c(zero) = one
| ~ test(zero) ),
inference(spm,[status(thm)],[c_0_69,c_0_32]) ).
cnf(c_0_82,plain,
test(zero),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_69]),c_0_74]),c_0_75])])]) ).
cnf(c_0_83,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_33]),c_0_22]) ).
cnf(c_0_84,negated_conjecture,
( multiplication(c(esk2_0),c(c(esk3_0))) = c(esk2_0)
| ~ test(c(esk3_0)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_32]),c_0_77]) ).
cnf(c_0_85,negated_conjecture,
addition(one,c(esk2_0)) = one,
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_49]),c_0_39])]),c_0_22]) ).
cnf(c_0_86,plain,
( multiplication(X1,X2) = zero
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_87,plain,
( c(multiplication(X1,X2)) = addition(c(X1),c(X2))
| ~ test(X1)
| ~ test(X2) ),
inference(split_conjunct,[status(thm)],[c_0_80]) ).
cnf(c_0_88,plain,
c(zero) = one,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_81,c_0_82])]) ).
cnf(c_0_89,negated_conjecture,
( addition(c(esk2_0),c(c(esk3_0))) = c(c(esk3_0))
| ~ test(c(esk3_0)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_22]),c_0_85]),c_0_33]),c_0_22]) ).
cnf(c_0_90,plain,
( multiplication(X1,c(X1)) = zero
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_86,c_0_29]) ).
cnf(c_0_91,plain,
( addition(one,c(X1)) = one
| ~ test(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_75]),c_0_88]),c_0_82])]) ).
cnf(c_0_92,negated_conjecture,
( addition(one,c(c(esk3_0))) = addition(esk2_0,c(c(esk3_0)))
| ~ test(c(esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_89]),c_0_39])]) ).
cnf(c_0_93,plain,
( multiplication(X1,addition(X2,c(X1))) = multiplication(X1,X2)
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_90]),c_0_61]) ).
cnf(c_0_94,negated_conjecture,
( addition(esk2_0,c(c(esk3_0))) = one
| ~ test(c(esk3_0)) ),
inference(spm,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_95,negated_conjecture,
addition(esk3_0,one) = one,
inference(spm,[status(thm)],[c_0_62,c_0_34]) ).
cnf(c_0_96,negated_conjecture,
( multiplication(c(esk3_0),esk2_0) = c(esk3_0)
| ~ test(c(esk3_0)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_77]) ).
cnf(c_0_97,plain,
( test(c(X1))
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_63,c_0_29]) ).
cnf(c_0_98,negated_conjecture,
addition(esk3_0,addition(X1,one)) = addition(X1,one),
inference(spm,[status(thm)],[c_0_71,c_0_95]) ).
cnf(c_0_99,negated_conjecture,
multiplication(c(esk3_0),esk2_0) = c(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_34])]) ).
cnf(c_0_100,negated_conjecture,
addition(one,c(esk3_0)) = one,
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_98]),c_0_49]),c_0_34])]),c_0_22]) ).
cnf(c_0_101,negated_conjecture,
addition(esk2_0,c(esk3_0)) = esk2_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_99]),c_0_22]),c_0_100]),c_0_33]) ).
cnf(c_0_102,negated_conjecture,
addition(esk2_0,addition(X1,c(esk3_0))) = addition(X1,esk2_0),
inference(spm,[status(thm)],[c_0_71,c_0_101]) ).
cnf(c_0_103,negated_conjecture,
addition(esk2_0,esk3_0) != one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_68]),c_0_61]) ).
cnf(c_0_104,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_32]),c_0_72]),c_0_22]),c_0_34])]),c_0_103]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.15 % Problem : KLE010+3 : TPTP v8.1.2. Released v4.0.0.
% 0.04/0.16 % Command : run_E %s %d THM
% 0.14/0.38 % Computer : n014.cluster.edu
% 0.14/0.38 % Model : x86_64 x86_64
% 0.14/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.38 % Memory : 8042.1875MB
% 0.14/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.38 % CPULimit : 2400
% 0.14/0.38 % WCLimit : 300
% 0.14/0.38 % DateTime : Tue Oct 3 04:49:49 EDT 2023
% 0.14/0.38 % CPUTime :
% 0.34/0.52 Running first-order model finding
% 0.34/0.52 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.QXSdnKZ3RF/E---3.1_3182.p
% 0.35/0.61 # Version: 3.1pre001
% 0.35/0.61 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.35/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.35/0.61 # Starting new_bool_3 with 300s (1) cores
% 0.35/0.61 # Starting new_bool_1 with 300s (1) cores
% 0.35/0.61 # Starting sh5l with 300s (1) cores
% 0.35/0.61 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3259 completed with status 0
% 0.35/0.61 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.35/0.61 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.35/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.35/0.61 # No SInE strategy applied
% 0.35/0.61 # Search class: FGUSM-FFMF21-DFFFFFNN
% 0.35/0.61 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.35/0.61 # Starting SAT001_MinMin_p005000_rr_RG with 675s (1) cores
% 0.35/0.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.35/0.61 # Starting new_bool_3 with 169s (1) cores
% 0.35/0.61 # Starting new_bool_1 with 169s (1) cores
% 0.35/0.61 # Starting sh5l with 169s (1) cores
% 0.35/0.61 # SAT001_MinMin_p005000_rr_RG with pid 3265 completed with status 0
% 0.35/0.61 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.35/0.61 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.35/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.35/0.61 # No SInE strategy applied
% 0.35/0.61 # Search class: FGUSM-FFMF21-DFFFFFNN
% 0.35/0.61 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.35/0.61 # Starting SAT001_MinMin_p005000_rr_RG with 675s (1) cores
% 0.35/0.61 # Preprocessing time : 0.001 s
% 0.35/0.61 # Presaturation interreduction done
% 0.35/0.61
% 0.35/0.61 # Proof found!
% 0.35/0.61 # SZS status Theorem
% 0.35/0.61 # SZS output start CNFRefutation
% See solution above
% 0.35/0.61 # Parsed axioms : 19
% 0.35/0.61 # Removed by relevancy pruning/SinE : 0
% 0.35/0.61 # Initial clauses : 27
% 0.35/0.61 # Removed in clause preprocessing : 0
% 0.35/0.61 # Initial clauses in saturation : 27
% 0.35/0.61 # Processed clauses : 793
% 0.35/0.61 # ...of these trivial : 66
% 0.35/0.61 # ...subsumed : 349
% 0.35/0.61 # ...remaining for further processing : 378
% 0.35/0.62 # Other redundant clauses eliminated : 6
% 0.35/0.62 # Clauses deleted for lack of memory : 0
% 0.35/0.62 # Backward-subsumed : 75
% 0.35/0.62 # Backward-rewritten : 55
% 0.35/0.62 # Generated clauses : 7125
% 0.35/0.62 # ...of the previous two non-redundant : 4702
% 0.35/0.62 # ...aggressively subsumed : 0
% 0.35/0.62 # Contextual simplify-reflections : 8
% 0.35/0.62 # Paramodulations : 7117
% 0.35/0.62 # Factorizations : 1
% 0.35/0.62 # NegExts : 0
% 0.35/0.62 # Equation resolutions : 6
% 0.35/0.62 # Total rewrite steps : 10495
% 0.35/0.62 # Propositional unsat checks : 0
% 0.35/0.62 # Propositional check models : 0
% 0.35/0.62 # Propositional check unsatisfiable : 0
% 0.35/0.62 # Propositional clauses : 0
% 0.35/0.62 # Propositional clauses after purity: 0
% 0.35/0.62 # Propositional unsat core size : 0
% 0.35/0.62 # Propositional preprocessing time : 0.000
% 0.35/0.62 # Propositional encoding time : 0.000
% 0.35/0.62 # Propositional solver time : 0.000
% 0.35/0.62 # Success case prop preproc time : 0.000
% 0.35/0.62 # Success case prop encoding time : 0.000
% 0.35/0.62 # Success case prop solver time : 0.000
% 0.35/0.62 # Current number of processed clauses : 219
% 0.35/0.62 # Positive orientable unit clauses : 104
% 0.35/0.62 # Positive unorientable unit clauses: 3
% 0.35/0.62 # Negative unit clauses : 13
% 0.35/0.62 # Non-unit-clauses : 99
% 0.35/0.62 # Current number of unprocessed clauses: 3803
% 0.35/0.62 # ...number of literals in the above : 8706
% 0.35/0.62 # Current number of archived formulas : 0
% 0.35/0.62 # Current number of archived clauses : 158
% 0.35/0.62 # Clause-clause subsumption calls (NU) : 4015
% 0.35/0.62 # Rec. Clause-clause subsumption calls : 3880
% 0.35/0.62 # Non-unit clause-clause subsumptions : 316
% 0.35/0.62 # Unit Clause-clause subsumption calls : 1024
% 0.35/0.62 # Rewrite failures with RHS unbound : 0
% 0.35/0.62 # BW rewrite match attempts : 197
% 0.35/0.62 # BW rewrite match successes : 91
% 0.35/0.62 # Condensation attempts : 0
% 0.35/0.62 # Condensation successes : 0
% 0.35/0.62 # Termbank termtop insertions : 94190
% 0.35/0.62
% 0.35/0.62 # -------------------------------------------------
% 0.35/0.62 # User time : 0.078 s
% 0.35/0.62 # System time : 0.004 s
% 0.35/0.62 # Total time : 0.081 s
% 0.35/0.62 # Maximum resident set size: 1756 pages
% 0.35/0.62
% 0.35/0.62 # -------------------------------------------------
% 0.35/0.62 # User time : 0.382 s
% 0.35/0.62 # System time : 0.014 s
% 0.35/0.62 # Total time : 0.396 s
% 0.35/0.62 # Maximum resident set size: 1692 pages
% 0.35/0.62 % E---3.1 exiting
%------------------------------------------------------------------------------