TSTP Solution File: KLE028+4 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : KLE028+4 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:44 EDT 2023
% Result : Theorem 15.76s 2.42s
% Output : CNFRefutation 15.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 11
% Syntax : Number of formulae : 92 ( 57 unt; 0 def)
% Number of atoms : 161 ( 77 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 119 ( 50 ~; 46 |; 15 &)
% ( 4 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-2 aty)
% Number of variables : 107 ( 1 sgn; 56 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5,X6,X7,X8,X9] :
( ( test(X8)
& test(X9) )
=> ( leq(addition(multiplication(X8,addition(multiplication(X9,X4),multiplication(c(X9),X5))),multiplication(c(X8),addition(multiplication(X9,X6),multiplication(c(X9),X7)))),addition(multiplication(X9,addition(multiplication(X8,X4),multiplication(c(X8),X6))),multiplication(c(X9),addition(multiplication(X8,X5),multiplication(c(X8),X7)))))
& leq(addition(multiplication(X9,addition(multiplication(X8,X4),multiplication(c(X8),X6))),multiplication(c(X9),addition(multiplication(X8,X5),multiplication(c(X8),X7)))),addition(multiplication(X8,addition(multiplication(X9,X4),multiplication(c(X9),X5))),multiplication(c(X8),addition(multiplication(X9,X6),multiplication(c(X9),X7))))) ) ),
file('/export/starexec/sandbox/tmp/tmp.DMrwQ6Mbzk/E---3.1_28510.p',goals) ).
fof(test_1,axiom,
! [X4] :
( test(X4)
<=> ? [X5] : complement(X5,X4) ),
file('/export/starexec/sandbox/tmp/tmp.DMrwQ6Mbzk/E---3.1_28510.p',test_1) ).
fof(test_3,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/export/starexec/sandbox/tmp/tmp.DMrwQ6Mbzk/E---3.1_28510.p',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/sandbox/tmp/tmp.DMrwQ6Mbzk/E---3.1_28510.p',test_2) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.DMrwQ6Mbzk/E---3.1_28510.p',additive_commutativity) ).
fof(test_deMorgan1,axiom,
! [X4,X5] :
( ( test(X4)
& test(X5) )
=> c(addition(X4,X5)) = multiplication(c(X4),c(X5)) ),
file('/export/starexec/sandbox/tmp/tmp.DMrwQ6Mbzk/E---3.1_28510.p',test_deMorgan1) ).
fof(right_distributivity,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox/tmp/tmp.DMrwQ6Mbzk/E---3.1_28510.p',right_distributivity) ).
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.DMrwQ6Mbzk/E---3.1_28510.p',additive_associativity) ).
fof(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.DMrwQ6Mbzk/E---3.1_28510.p',multiplicative_associativity) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox/tmp/tmp.DMrwQ6Mbzk/E---3.1_28510.p',order) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.DMrwQ6Mbzk/E---3.1_28510.p',additive_idempotence) ).
fof(c_0_11,negated_conjecture,
~ ! [X4,X5,X6,X7,X8,X9] :
( ( test(X8)
& test(X9) )
=> ( leq(addition(multiplication(X8,addition(multiplication(X9,X4),multiplication(c(X9),X5))),multiplication(c(X8),addition(multiplication(X9,X6),multiplication(c(X9),X7)))),addition(multiplication(X9,addition(multiplication(X8,X4),multiplication(c(X8),X6))),multiplication(c(X9),addition(multiplication(X8,X5),multiplication(c(X8),X7)))))
& leq(addition(multiplication(X9,addition(multiplication(X8,X4),multiplication(c(X8),X6))),multiplication(c(X9),addition(multiplication(X8,X5),multiplication(c(X8),X7)))),addition(multiplication(X8,addition(multiplication(X9,X4),multiplication(c(X9),X5))),multiplication(c(X8),addition(multiplication(X9,X6),multiplication(c(X9),X7))))) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_12,plain,
! [X47,X49,X50] :
( ( ~ test(X47)
| complement(esk7_1(X47),X47) )
& ( ~ complement(X50,X49)
| test(X49) ) ),
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])])])])]) ).
fof(c_0_13,negated_conjecture,
( test(esk5_0)
& test(esk6_0)
& ( ~ leq(addition(multiplication(esk5_0,addition(multiplication(esk6_0,esk1_0),multiplication(c(esk6_0),esk2_0))),multiplication(c(esk5_0),addition(multiplication(esk6_0,esk3_0),multiplication(c(esk6_0),esk4_0)))),addition(multiplication(esk6_0,addition(multiplication(esk5_0,esk1_0),multiplication(c(esk5_0),esk3_0))),multiplication(c(esk6_0),addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)))))
| ~ leq(addition(multiplication(esk6_0,addition(multiplication(esk5_0,esk1_0),multiplication(c(esk5_0),esk3_0))),multiplication(c(esk6_0),addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)))),addition(multiplication(esk5_0,addition(multiplication(esk6_0,esk1_0),multiplication(c(esk6_0),esk2_0))),multiplication(c(esk5_0),addition(multiplication(esk6_0,esk3_0),multiplication(c(esk6_0),esk4_0))))) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
fof(c_0_14,plain,
! [X44,X45] :
( ( c(X44) != X45
| complement(X44,X45)
| ~ test(X44) )
& ( ~ complement(X44,X45)
| c(X44) = X45
| ~ test(X44) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_3])])]) ).
fof(c_0_15,plain,
! [X31,X32] :
( ( multiplication(X31,X32) = zero
| ~ complement(X32,X31) )
& ( multiplication(X32,X31) = zero
| ~ complement(X32,X31) )
& ( addition(X31,X32) = one
| ~ complement(X32,X31) )
& ( multiplication(X31,X32) != zero
| multiplication(X32,X31) != zero
| addition(X31,X32) != one
| complement(X32,X31) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_2])])]) ).
fof(c_0_16,plain,
! [X18,X19] : addition(X18,X19) = addition(X19,X18),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_17,plain,
( complement(esk7_1(X1),X1)
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
test(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( complement(X2,X1)
| multiplication(X1,X2) != zero
| multiplication(X2,X1) != zero
| addition(X1,X2) != one ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,negated_conjecture,
complement(esk7_1(esk6_0),esk6_0),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
( multiplication(X1,X2) = zero
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_25,plain,
( multiplication(X1,X2) = zero
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_26,plain,
( complement(X1,c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[c_0_19]) ).
cnf(c_0_27,negated_conjecture,
test(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_28,plain,
( c(X1) = X2
| ~ complement(X1,X2)
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_29,plain,
( complement(X1,X2)
| addition(X1,X2) != one
| multiplication(X1,X2) != zero
| multiplication(X2,X1) != zero ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_30,negated_conjecture,
addition(esk6_0,esk7_1(esk6_0)) = one,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_31,negated_conjecture,
multiplication(esk6_0,esk7_1(esk6_0)) = zero,
inference(spm,[status(thm)],[c_0_24,c_0_23]) ).
cnf(c_0_32,negated_conjecture,
multiplication(esk7_1(esk6_0),esk6_0) = zero,
inference(spm,[status(thm)],[c_0_25,c_0_23]) ).
cnf(c_0_33,plain,
( test(X2)
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_34,negated_conjecture,
complement(esk5_0,c(esk5_0)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_35,negated_conjecture,
complement(esk6_0,c(esk6_0)),
inference(spm,[status(thm)],[c_0_26,c_0_18]) ).
cnf(c_0_36,negated_conjecture,
( c(esk6_0) = X1
| ~ complement(esk6_0,X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_18]) ).
cnf(c_0_37,negated_conjecture,
complement(esk6_0,esk7_1(esk6_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32])]) ).
cnf(c_0_38,negated_conjecture,
test(c(esk5_0)),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
test(c(esk6_0)),
inference(spm,[status(thm)],[c_0_33,c_0_35]) ).
cnf(c_0_40,negated_conjecture,
esk7_1(esk6_0) = c(esk6_0),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,negated_conjecture,
complement(esk7_1(esk5_0),esk5_0),
inference(spm,[status(thm)],[c_0_17,c_0_27]) ).
cnf(c_0_42,negated_conjecture,
complement(c(esk5_0),c(c(esk5_0))),
inference(spm,[status(thm)],[c_0_26,c_0_38]) ).
fof(c_0_43,plain,
! [X33,X34] :
( ~ test(X33)
| ~ test(X34)
| c(addition(X33,X34)) = multiplication(c(X33),c(X34)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_deMorgan1])]) ).
cnf(c_0_44,negated_conjecture,
( c(c(esk6_0)) = X1
| ~ complement(c(esk6_0),X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_39]) ).
cnf(c_0_45,negated_conjecture,
complement(c(esk6_0),esk6_0),
inference(rw,[status(thm)],[c_0_23,c_0_40]) ).
cnf(c_0_46,negated_conjecture,
addition(esk5_0,esk7_1(esk5_0)) = one,
inference(spm,[status(thm)],[c_0_22,c_0_41]) ).
cnf(c_0_47,negated_conjecture,
multiplication(esk5_0,esk7_1(esk5_0)) = zero,
inference(spm,[status(thm)],[c_0_24,c_0_41]) ).
cnf(c_0_48,negated_conjecture,
multiplication(esk7_1(esk5_0),esk5_0) = zero,
inference(spm,[status(thm)],[c_0_25,c_0_41]) ).
cnf(c_0_49,negated_conjecture,
test(c(c(esk5_0))),
inference(spm,[status(thm)],[c_0_33,c_0_42]) ).
cnf(c_0_50,plain,
( c(addition(X1,X2)) = multiplication(c(X1),c(X2))
| ~ test(X1)
| ~ test(X2) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_51,negated_conjecture,
c(c(esk6_0)) = esk6_0,
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_52,negated_conjecture,
( c(esk5_0) = X1
| ~ complement(esk5_0,X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_27]) ).
cnf(c_0_53,negated_conjecture,
complement(esk5_0,esk7_1(esk5_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_46]),c_0_47]),c_0_48])]) ).
cnf(c_0_54,negated_conjecture,
complement(c(c(esk5_0)),c(c(c(esk5_0)))),
inference(spm,[status(thm)],[c_0_26,c_0_49]) ).
cnf(c_0_55,negated_conjecture,
( c(addition(X1,c(esk6_0))) = multiplication(c(X1),esk6_0)
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_39]),c_0_51]) ).
cnf(c_0_56,negated_conjecture,
esk7_1(esk5_0) = c(esk5_0),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_57,negated_conjecture,
( c(addition(X1,esk6_0)) = multiplication(c(X1),c(esk6_0))
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_18]) ).
cnf(c_0_58,negated_conjecture,
test(c(c(c(esk5_0)))),
inference(spm,[status(thm)],[c_0_33,c_0_54]) ).
cnf(c_0_59,negated_conjecture,
( c(addition(X1,esk5_0)) = multiplication(c(X1),c(esk5_0))
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_27]) ).
cnf(c_0_60,negated_conjecture,
( c(addition(X1,c(esk5_0))) = multiplication(c(X1),c(c(esk5_0)))
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_38]) ).
cnf(c_0_61,negated_conjecture,
c(addition(c(esk5_0),c(esk6_0))) = multiplication(c(c(esk5_0)),esk6_0),
inference(spm,[status(thm)],[c_0_55,c_0_38]) ).
cnf(c_0_62,negated_conjecture,
( c(c(esk5_0)) = X1
| ~ complement(c(esk5_0),X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_38]) ).
cnf(c_0_63,negated_conjecture,
complement(c(esk5_0),esk5_0),
inference(rw,[status(thm)],[c_0_41,c_0_56]) ).
fof(c_0_64,plain,
! [X25,X26,X27] : multiplication(X25,addition(X26,X27)) = addition(multiplication(X25,X26),multiplication(X25,X27)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
fof(c_0_65,plain,
! [X20,X21,X22] : addition(X22,addition(X21,X20)) = addition(addition(X22,X21),X20),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_66,plain,
! [X37,X38,X39] : multiplication(X37,multiplication(X38,X39)) = multiplication(multiplication(X37,X38),X39),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
cnf(c_0_67,negated_conjecture,
c(addition(esk6_0,c(c(c(esk5_0))))) = multiplication(c(c(c(c(esk5_0)))),c(esk6_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_21]) ).
cnf(c_0_68,negated_conjecture,
c(addition(esk5_0,c(esk6_0))) = multiplication(esk6_0,c(esk5_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_39]),c_0_21]),c_0_51]) ).
cnf(c_0_69,negated_conjecture,
multiplication(c(c(esk5_0)),esk6_0) = multiplication(esk6_0,c(c(esk5_0))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_39]),c_0_21]),c_0_61]),c_0_51]) ).
cnf(c_0_70,negated_conjecture,
c(c(esk5_0)) = esk5_0,
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_71,negated_conjecture,
c(addition(esk5_0,esk6_0)) = multiplication(c(esk5_0),c(esk6_0)),
inference(spm,[status(thm)],[c_0_57,c_0_27]) ).
fof(c_0_72,plain,
! [X16,X17] :
( ( ~ leq(X16,X17)
| addition(X16,X17) = X17 )
& ( addition(X16,X17) != X17
| leq(X16,X17) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])]) ).
fof(c_0_73,plain,
! [X24] : addition(X24,X24) = X24,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
cnf(c_0_74,negated_conjecture,
( ~ leq(addition(multiplication(esk5_0,addition(multiplication(esk6_0,esk1_0),multiplication(c(esk6_0),esk2_0))),multiplication(c(esk5_0),addition(multiplication(esk6_0,esk3_0),multiplication(c(esk6_0),esk4_0)))),addition(multiplication(esk6_0,addition(multiplication(esk5_0,esk1_0),multiplication(c(esk5_0),esk3_0))),multiplication(c(esk6_0),addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)))))
| ~ leq(addition(multiplication(esk6_0,addition(multiplication(esk5_0,esk1_0),multiplication(c(esk5_0),esk3_0))),multiplication(c(esk6_0),addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)))),addition(multiplication(esk5_0,addition(multiplication(esk6_0,esk1_0),multiplication(c(esk6_0),esk2_0))),multiplication(c(esk5_0),addition(multiplication(esk6_0,esk3_0),multiplication(c(esk6_0),esk4_0))))) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_75,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_76,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_77,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_78,negated_conjecture,
multiplication(c(c(c(c(esk5_0)))),c(esk6_0)) = multiplication(c(esk6_0),c(c(c(c(esk5_0))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_67]),c_0_58]),c_0_18])]) ).
cnf(c_0_79,negated_conjecture,
multiplication(c(esk5_0),esk6_0) = multiplication(esk6_0,c(esk5_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_68]),c_0_51]),c_0_39]),c_0_27])]) ).
cnf(c_0_80,negated_conjecture,
multiplication(esk6_0,esk5_0) = multiplication(esk5_0,esk6_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_70]),c_0_70]) ).
cnf(c_0_81,negated_conjecture,
multiplication(c(esk6_0),c(esk5_0)) = multiplication(c(esk5_0),c(esk6_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_18]),c_0_21]),c_0_71]) ).
cnf(c_0_82,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_72]) ).
cnf(c_0_83,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_73]) ).
cnf(c_0_84,negated_conjecture,
( ~ leq(addition(multiplication(esk5_0,multiplication(esk6_0,esk1_0)),addition(multiplication(esk5_0,multiplication(c(esk6_0),esk2_0)),addition(multiplication(c(esk5_0),multiplication(esk6_0,esk3_0)),multiplication(c(esk5_0),multiplication(c(esk6_0),esk4_0))))),addition(multiplication(esk6_0,multiplication(esk5_0,esk1_0)),addition(multiplication(esk6_0,multiplication(c(esk5_0),esk3_0)),addition(multiplication(c(esk6_0),multiplication(esk5_0,esk2_0)),multiplication(c(esk6_0),multiplication(c(esk5_0),esk4_0))))))
| ~ leq(addition(multiplication(esk6_0,multiplication(esk5_0,esk1_0)),addition(multiplication(esk6_0,multiplication(c(esk5_0),esk3_0)),addition(multiplication(c(esk6_0),multiplication(esk5_0,esk2_0)),multiplication(c(esk6_0),multiplication(c(esk5_0),esk4_0))))),addition(multiplication(esk5_0,multiplication(esk6_0,esk1_0)),addition(multiplication(esk5_0,multiplication(c(esk6_0),esk2_0)),addition(multiplication(c(esk5_0),multiplication(esk6_0,esk3_0)),multiplication(c(esk5_0),multiplication(c(esk6_0),esk4_0)))))) ),
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_74,c_0_75]),c_0_75]),c_0_76]),c_0_75]),c_0_75]),c_0_76]),c_0_75]),c_0_75]),c_0_76]),c_0_75]),c_0_75]),c_0_76]) ).
cnf(c_0_85,negated_conjecture,
multiplication(c(esk6_0),multiplication(esk5_0,X1)) = multiplication(esk5_0,multiplication(c(esk6_0),X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_77]),c_0_70]),c_0_70]),c_0_70]),c_0_70]) ).
cnf(c_0_86,plain,
addition(X1,addition(X2,X3)) = addition(X2,addition(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_21]),c_0_76]) ).
cnf(c_0_87,negated_conjecture,
multiplication(c(esk5_0),multiplication(esk6_0,X1)) = multiplication(esk6_0,multiplication(c(esk5_0),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_79]),c_0_77]) ).
cnf(c_0_88,negated_conjecture,
multiplication(esk6_0,multiplication(esk5_0,X1)) = multiplication(esk5_0,multiplication(esk6_0,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_80]),c_0_77]) ).
cnf(c_0_89,negated_conjecture,
multiplication(c(esk6_0),multiplication(c(esk5_0),X1)) = multiplication(c(esk5_0),multiplication(c(esk6_0),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_81]),c_0_77]) ).
cnf(c_0_90,plain,
leq(X1,X1),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_91,negated_conjecture,
$false,
inference(cn,[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(spm,[status(thm)],[c_0_84,c_0_85]),c_0_86]),c_0_87]),c_0_88]),c_0_89]),c_0_90]),c_0_88]),c_0_89]),c_0_86]),c_0_87]),c_0_90])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : KLE028+4 : TPTP v8.1.2. Released v4.0.0.
% 0.02/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n003.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 2400
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Tue Oct 3 04:49:48 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.17/0.43 Running first-order model finding
% 0.17/0.43 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.DMrwQ6Mbzk/E---3.1_28510.p
% 15.76/2.42 # Version: 3.1pre001
% 15.76/2.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 15.76/2.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.76/2.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 15.76/2.42 # Starting new_bool_3 with 300s (1) cores
% 15.76/2.42 # Starting new_bool_1 with 300s (1) cores
% 15.76/2.42 # Starting sh5l with 300s (1) cores
% 15.76/2.42 # sh5l with pid 28590 completed with status 0
% 15.76/2.42 # Result found by sh5l
% 15.76/2.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 15.76/2.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.76/2.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 15.76/2.42 # Starting new_bool_3 with 300s (1) cores
% 15.76/2.42 # Starting new_bool_1 with 300s (1) cores
% 15.76/2.42 # Starting sh5l with 300s (1) cores
% 15.76/2.42 # SinE strategy is gf500_gu_R04_F100_L20000
% 15.76/2.42 # Search class: FGHSM-FFMF21-MFFFFFNN
% 15.76/2.42 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 15.76/2.42 # Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with 163s (1) cores
% 15.76/2.42 # G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with pid 28598 completed with status 0
% 15.76/2.42 # Result found by G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN
% 15.76/2.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 15.76/2.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.76/2.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 15.76/2.42 # Starting new_bool_3 with 300s (1) cores
% 15.76/2.42 # Starting new_bool_1 with 300s (1) cores
% 15.76/2.42 # Starting sh5l with 300s (1) cores
% 15.76/2.42 # SinE strategy is gf500_gu_R04_F100_L20000
% 15.76/2.42 # Search class: FGHSM-FFMF21-MFFFFFNN
% 15.76/2.42 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 15.76/2.42 # Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with 163s (1) cores
% 15.76/2.42 # Preprocessing time : 0.001 s
% 15.76/2.42 # Presaturation interreduction done
% 15.76/2.42
% 15.76/2.42 # Proof found!
% 15.76/2.42 # SZS status Theorem
% 15.76/2.42 # SZS output start CNFRefutation
% See solution above
% 15.76/2.42 # Parsed axioms : 19
% 15.76/2.42 # Removed by relevancy pruning/SinE : 0
% 15.76/2.42 # Initial clauses : 27
% 15.76/2.42 # Removed in clause preprocessing : 0
% 15.76/2.42 # Initial clauses in saturation : 27
% 15.76/2.42 # Processed clauses : 11204
% 15.76/2.42 # ...of these trivial : 684
% 15.76/2.42 # ...subsumed : 8612
% 15.76/2.42 # ...remaining for further processing : 1908
% 15.76/2.42 # Other redundant clauses eliminated : 770
% 15.76/2.42 # Clauses deleted for lack of memory : 0
% 15.76/2.42 # Backward-subsumed : 234
% 15.76/2.42 # Backward-rewritten : 505
% 15.76/2.42 # Generated clauses : 107251
% 15.76/2.42 # ...of the previous two non-redundant : 86074
% 15.76/2.42 # ...aggressively subsumed : 0
% 15.76/2.42 # Contextual simplify-reflections : 12
% 15.76/2.42 # Paramodulations : 106478
% 15.76/2.42 # Factorizations : 3
% 15.76/2.42 # NegExts : 0
% 15.76/2.42 # Equation resolutions : 770
% 15.76/2.42 # Total rewrite steps : 258182
% 15.76/2.42 # Propositional unsat checks : 0
% 15.76/2.42 # Propositional check models : 0
% 15.76/2.42 # Propositional check unsatisfiable : 0
% 15.76/2.42 # Propositional clauses : 0
% 15.76/2.42 # Propositional clauses after purity: 0
% 15.76/2.42 # Propositional unsat core size : 0
% 15.76/2.42 # Propositional preprocessing time : 0.000
% 15.76/2.42 # Propositional encoding time : 0.000
% 15.76/2.42 # Propositional solver time : 0.000
% 15.76/2.42 # Success case prop preproc time : 0.000
% 15.76/2.42 # Success case prop encoding time : 0.000
% 15.76/2.42 # Success case prop solver time : 0.000
% 15.76/2.42 # Current number of processed clauses : 1131
% 15.76/2.42 # Positive orientable unit clauses : 390
% 15.76/2.42 # Positive unorientable unit clauses: 5
% 15.76/2.42 # Negative unit clauses : 0
% 15.76/2.42 # Non-unit-clauses : 736
% 15.76/2.42 # Current number of unprocessed clauses: 70720
% 15.76/2.42 # ...number of literals in the above : 178566
% 15.76/2.42 # Current number of archived formulas : 0
% 15.76/2.42 # Current number of archived clauses : 766
% 15.76/2.42 # Clause-clause subsumption calls (NU) : 285702
% 15.76/2.42 # Rec. Clause-clause subsumption calls : 260517
% 15.76/2.42 # Non-unit clause-clause subsumptions : 8305
% 15.76/2.42 # Unit Clause-clause subsumption calls : 7805
% 15.76/2.42 # Rewrite failures with RHS unbound : 0
% 15.76/2.42 # BW rewrite match attempts : 1092
% 15.76/2.42 # BW rewrite match successes : 221
% 15.76/2.42 # Condensation attempts : 0
% 15.76/2.42 # Condensation successes : 0
% 15.76/2.42 # Termbank termtop insertions : 1930479
% 15.76/2.42
% 15.76/2.42 # -------------------------------------------------
% 15.76/2.42 # User time : 1.878 s
% 15.76/2.42 # System time : 0.051 s
% 15.76/2.42 # Total time : 1.929 s
% 15.76/2.42 # Maximum resident set size: 1704 pages
% 15.76/2.42
% 15.76/2.42 # -------------------------------------------------
% 15.76/2.42 # User time : 1.879 s
% 15.76/2.42 # System time : 0.052 s
% 15.76/2.42 # Total time : 1.932 s
% 15.76/2.42 # Maximum resident set size: 1696 pages
% 15.76/2.42 % E---3.1 exiting
%------------------------------------------------------------------------------