TSTP Solution File: PUZ133+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : PUZ133+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n026.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 : Mon Jul 18 18:10:54 EDT 2022
% Result : Theorem 0.27s 6.45s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 10
% Syntax : Number of formulae : 89 ( 33 unt; 0 def)
% Number of atoms : 250 ( 96 equ)
% Maximal formula atoms : 18 ( 2 avg)
% Number of connectives : 276 ( 115 ~; 121 |; 29 &)
% ( 3 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 126 ( 8 sgn 49 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(queens_sym,conjecture,
( ( queens_p
& ! [X1] : q(X1) = p(perm(X1)) )
=> queens_q ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',queens_sym) ).
fof(queens_q,axiom,
( ! [X1,X2] :
( ( le(s(n0),X1)
& le(X1,n)
& le(s(X1),X2)
& le(X2,n)
& ( le(s(X1),X2)
<=> le(s(perm(X2)),perm(X1)) ) )
=> ( q(X1) != q(X2)
& plus(q(X1),X1) != plus(q(X2),X2)
& minus(q(X1),X1) != minus(q(X2),X2) ) )
=> queens_q ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',queens_q) ).
fof(le_trans,axiom,
! [X3,X4,X5] :
( ( le(X3,X4)
& le(X4,X5) )
=> le(X3,X5) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',le_trans) ).
fof(succ_le,axiom,
! [X3] : le(X3,s(X3)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',succ_le) ).
fof(permutation_range,axiom,
! [X1] :
( ( le(s(n0),X1)
& le(X1,n) )
=> ( le(s(n0),perm(X1))
& le(perm(X1),n) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',permutation_range) ).
fof(permutation,axiom,
! [X1] : perm(X1) = minus(s(n),X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',permutation) ).
fof(permutation_another_one,axiom,
! [X2,X1] : minus(X1,X2) = minus(perm(X2),perm(X1)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',permutation_another_one) ).
fof(queens_p,axiom,
( queens_p
=> ! [X1,X2] :
( ( le(s(n0),X1)
& le(X1,n)
& le(s(X1),X2)
& le(X2,n) )
=> ( p(X1) != p(X2)
& plus(p(X1),X1) != plus(p(X2),X2)
& minus(p(X1),X1) != minus(p(X2),X2) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',queens_p) ).
fof(plus1,axiom,
! [X1,X2,X6,X7] :
( plus(X1,X2) = plus(X6,X7)
<=> minus(X1,X6) = minus(X7,X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',plus1) ).
fof(minus1,axiom,
! [X1,X2,X6,X7] :
( minus(X1,X2) = minus(X6,X7)
<=> minus(X1,X6) = minus(X2,X7) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',minus1) ).
fof(c_0_10,negated_conjecture,
~ ( ( queens_p
& ! [X1] : q(X1) = p(perm(X1)) )
=> queens_q ),
inference(assume_negation,[status(cth)],[queens_sym]) ).
fof(c_0_11,plain,
( ( le(s(n0),esk1_0)
| queens_q )
& ( le(esk1_0,n)
| queens_q )
& ( le(s(esk1_0),esk2_0)
| queens_q )
& ( le(esk2_0,n)
| queens_q )
& ( ~ le(s(esk1_0),esk2_0)
| le(s(perm(esk2_0)),perm(esk1_0))
| queens_q )
& ( ~ le(s(perm(esk2_0)),perm(esk1_0))
| le(s(esk1_0),esk2_0)
| queens_q )
& ( q(esk1_0) = q(esk2_0)
| plus(q(esk1_0),esk1_0) = plus(q(esk2_0),esk2_0)
| minus(q(esk1_0),esk1_0) = minus(q(esk2_0),esk2_0)
| queens_q ) ),
inference(distribute,[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)],[queens_q])])])])])]) ).
fof(c_0_12,negated_conjecture,
! [X2] :
( queens_p
& q(X2) = p(perm(X2))
& ~ queens_q ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])]) ).
fof(c_0_13,plain,
! [X6,X7,X8] :
( ~ le(X6,X7)
| ~ le(X7,X8)
| le(X6,X8) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[le_trans])]) ).
fof(c_0_14,plain,
! [X4] : le(X4,s(X4)),
inference(variable_rename,[status(thm)],[succ_le]) ).
cnf(c_0_15,plain,
( queens_q
| le(s(esk1_0),esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
~ queens_q,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( le(X1,X2)
| ~ le(X3,X2)
| ~ le(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
le(X1,s(X1)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( queens_q
| le(s(n0),esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_20,plain,
! [X2] :
( ( le(s(n0),perm(X2))
| ~ le(s(n0),X2)
| ~ le(X2,n) )
& ( le(perm(X2),n)
| ~ le(s(n0),X2)
| ~ le(X2,n) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[permutation_range])])]) ).
fof(c_0_21,plain,
! [X2] : perm(X2) = minus(s(n),X2),
inference(variable_rename,[status(thm)],[permutation]) ).
cnf(c_0_22,plain,
le(s(esk1_0),esk2_0),
inference(sr,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,plain,
( le(X1,s(X2))
| ~ le(X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
le(s(n0),esk1_0),
inference(sr,[status(thm)],[c_0_19,c_0_16]) ).
fof(c_0_25,plain,
! [X3,X4] : minus(X4,X3) = minus(perm(X3),perm(X4)),
inference(variable_rename,[status(thm)],[permutation_another_one]) ).
fof(c_0_26,plain,
! [X3,X4] :
( ( p(X3) != p(X4)
| ~ le(s(n0),X3)
| ~ le(X3,n)
| ~ le(s(X3),X4)
| ~ le(X4,n)
| ~ queens_p )
& ( plus(p(X3),X3) != plus(p(X4),X4)
| ~ le(s(n0),X3)
| ~ le(X3,n)
| ~ le(s(X3),X4)
| ~ le(X4,n)
| ~ queens_p )
& ( minus(p(X3),X3) != minus(p(X4),X4)
| ~ le(s(n0),X3)
| ~ le(X3,n)
| ~ le(s(X3),X4)
| ~ le(X4,n)
| ~ queens_p ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[queens_p])])])])])]) ).
cnf(c_0_27,plain,
( le(s(n0),perm(X1))
| ~ le(X1,n)
| ~ le(s(n0),X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,plain,
perm(X1) = minus(s(n),X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,plain,
( le(X1,esk2_0)
| ~ le(X1,s(esk1_0)) ),
inference(spm,[status(thm)],[c_0_17,c_0_22]) ).
cnf(c_0_30,plain,
le(s(n0),s(esk1_0)),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,plain,
( queens_q
| le(esk2_0,n) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_32,plain,
( le(perm(X1),n)
| ~ le(X1,n)
| ~ le(s(n0),X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_33,plain,
( queens_q
| minus(q(esk1_0),esk1_0) = minus(q(esk2_0),esk2_0)
| plus(q(esk1_0),esk1_0) = plus(q(esk2_0),esk2_0)
| q(esk1_0) = q(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_34,negated_conjecture,
q(X1) = p(perm(X1)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_35,plain,
minus(X1,X2) = minus(perm(X2),perm(X1)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_36,plain,
! [X8,X9,X10,X11,X8,X9,X10,X11] :
( ( plus(X8,X9) != plus(X10,X11)
| minus(X8,X10) = minus(X11,X9) )
& ( minus(X8,X10) != minus(X11,X9)
| plus(X8,X9) = plus(X10,X11) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[plus1])])])]) ).
cnf(c_0_37,plain,
( ~ queens_p
| ~ le(X1,n)
| ~ le(s(X2),X1)
| ~ le(X2,n)
| ~ le(s(n0),X2)
| p(X2) != p(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_38,negated_conjecture,
queens_p,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_39,plain,
( le(s(n0),minus(s(n),X1))
| ~ le(X1,n)
| ~ le(s(n0),X1) ),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_40,plain,
le(s(n0),esk2_0),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_41,plain,
le(esk2_0,n),
inference(sr,[status(thm)],[c_0_31,c_0_16]) ).
cnf(c_0_42,plain,
( le(minus(s(n),X1),n)
| ~ le(X1,n)
| ~ le(s(n0),X1) ),
inference(rw,[status(thm)],[c_0_32,c_0_28]) ).
cnf(c_0_43,plain,
( queens_q
| le(s(perm(esk2_0)),perm(esk1_0))
| ~ le(s(esk1_0),esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_44,plain,
( queens_q
| le(esk1_0,n) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_45,plain,
( p(minus(s(n),esk2_0)) = p(minus(s(n),esk1_0))
| plus(p(minus(s(n),esk2_0)),esk2_0) = plus(p(minus(s(n),esk1_0)),esk1_0)
| minus(p(minus(s(n),esk2_0)),esk2_0) = minus(p(minus(s(n),esk1_0)),esk1_0)
| queens_q ),
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_33,c_0_34]),c_0_34]),c_0_34]),c_0_34]),c_0_34]),c_0_34]),c_0_28]),c_0_28]),c_0_28]),c_0_28]),c_0_28]),c_0_28]) ).
cnf(c_0_46,plain,
minus(X1,X2) = minus(minus(s(n),X2),minus(s(n),X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_28]),c_0_28]) ).
cnf(c_0_47,plain,
( plus(X1,X2) = plus(X3,X4)
| minus(X1,X3) != minus(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_48,plain,
( p(X1) != p(X2)
| ~ le(s(n0),X2)
| ~ le(s(X2),X1)
| ~ le(X2,n)
| ~ le(X1,n) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]) ).
cnf(c_0_49,plain,
le(s(n0),minus(s(n),esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]) ).
cnf(c_0_50,plain,
le(minus(s(n),esk2_0),n),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_40]),c_0_41])]) ).
cnf(c_0_51,plain,
( queens_q
| le(s(minus(s(n),esk2_0)),minus(s(n),esk1_0))
| ~ le(s(esk1_0),esk2_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_28]),c_0_28]) ).
cnf(c_0_52,plain,
le(esk1_0,n),
inference(sr,[status(thm)],[c_0_44,c_0_16]) ).
cnf(c_0_53,plain,
( minus(minus(s(n),esk2_0),minus(s(n),p(minus(s(n),esk2_0)))) = minus(minus(s(n),esk1_0),minus(s(n),p(minus(s(n),esk1_0))))
| plus(p(minus(s(n),esk2_0)),esk2_0) = plus(p(minus(s(n),esk1_0)),esk1_0)
| p(minus(s(n),esk2_0)) = p(minus(s(n),esk1_0)) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46]),c_0_46]),c_0_16]) ).
cnf(c_0_54,plain,
plus(X1,X2) = plus(X2,X1),
inference(er,[status(thm)],[c_0_47]) ).
cnf(c_0_55,plain,
( p(X1) != p(minus(s(n),esk2_0))
| ~ le(s(minus(s(n),esk2_0)),X1)
| ~ le(X1,n) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50])]) ).
cnf(c_0_56,plain,
le(s(minus(s(n),esk2_0)),minus(s(n),esk1_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_22])]),c_0_16]) ).
cnf(c_0_57,plain,
le(minus(s(n),esk1_0),n),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_24]),c_0_52])]) ).
fof(c_0_58,plain,
! [X8,X9,X10,X11,X8,X9,X10,X11] :
( ( minus(X8,X9) != minus(X10,X11)
| minus(X8,X10) = minus(X9,X11) )
& ( minus(X8,X10) != minus(X9,X11)
| minus(X8,X9) = minus(X10,X11) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[minus1])])])]) ).
cnf(c_0_59,plain,
( minus(minus(s(n),esk2_0),minus(s(n),p(minus(s(n),esk2_0)))) = minus(minus(s(n),esk1_0),minus(s(n),p(minus(s(n),esk1_0))))
| plus(esk2_0,p(minus(s(n),esk2_0))) = plus(esk1_0,p(minus(s(n),esk1_0)))
| p(minus(s(n),esk2_0)) = p(minus(s(n),esk1_0)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54]),c_0_54]) ).
cnf(c_0_60,plain,
p(minus(s(n),esk2_0)) != p(minus(s(n),esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57])]) ).
cnf(c_0_61,plain,
( minus(X1,X2) = minus(X3,X4)
| minus(X1,X3) != minus(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_62,plain,
( minus(X1,X2) = minus(X3,X4)
| plus(X1,X4) != plus(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_63,plain,
( minus(minus(s(n),esk2_0),minus(s(n),p(minus(s(n),esk2_0)))) = minus(minus(s(n),esk1_0),minus(s(n),p(minus(s(n),esk1_0))))
| plus(esk2_0,p(minus(s(n),esk2_0))) = plus(esk1_0,p(minus(s(n),esk1_0))) ),
inference(sr,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_64,plain,
( minus(X1,minus(s(n),X2)) = minus(X3,minus(s(n),X4))
| minus(X1,X3) != minus(X4,X2) ),
inference(spm,[status(thm)],[c_0_61,c_0_46]) ).
cnf(c_0_65,plain,
( minus(minus(s(n),esk2_0),minus(s(n),p(minus(s(n),esk2_0)))) = minus(minus(s(n),esk1_0),minus(s(n),p(minus(s(n),esk1_0))))
| minus(esk2_0,X1) = minus(X2,p(minus(s(n),esk2_0)))
| plus(esk1_0,p(minus(s(n),esk1_0))) != plus(X1,X2) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_66,plain,
minus(X1,minus(s(n),X2)) = minus(X2,minus(s(n),X1)),
inference(er,[status(thm)],[c_0_64]) ).
cnf(c_0_67,plain,
( minus(X1,minus(s(n),X2)) = minus(X3,minus(s(n),X4))
| minus(minus(s(n),X3),minus(s(n),X1)) != minus(X4,X2) ),
inference(spm,[status(thm)],[c_0_64,c_0_46]) ).
cnf(c_0_68,plain,
( minus(minus(s(n),esk2_0),minus(s(n),p(minus(s(n),esk2_0)))) = minus(minus(s(n),esk1_0),minus(s(n),p(minus(s(n),esk1_0))))
| minus(p(minus(s(n),esk1_0)),p(minus(s(n),esk2_0))) = minus(minus(s(n),esk1_0),minus(s(n),esk2_0)) ),
inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_65]),c_0_46]) ).
cnf(c_0_69,plain,
minus(X1,minus(s(n),minus(s(n),X2))) = minus(X1,X2),
inference(spm,[status(thm)],[c_0_46,c_0_66]) ).
cnf(c_0_70,plain,
( ~ queens_p
| ~ le(X1,n)
| ~ le(s(X2),X1)
| ~ le(X2,n)
| ~ le(s(n0),X2)
| minus(p(X2),X2) != minus(p(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_71,plain,
minus(minus(s(n),minus(s(n),X1)),minus(s(n),minus(s(n),X2))) = minus(X1,X2),
inference(spm,[status(thm)],[c_0_46,c_0_46]) ).
cnf(c_0_72,plain,
( minus(p(minus(s(n),esk1_0)),p(minus(s(n),esk2_0))) = minus(minus(s(n),esk1_0),minus(s(n),esk2_0))
| minus(X1,p(minus(s(n),esk2_0))) = minus(X2,esk2_0)
| minus(minus(s(n),X2),minus(s(n),X1)) != minus(minus(s(n),esk1_0),minus(s(n),p(minus(s(n),esk1_0)))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69]),c_0_69]) ).
cnf(c_0_73,plain,
( minus(minus(s(n),X1),minus(s(n),p(X1))) != minus(minus(s(n),X2),minus(s(n),p(X2)))
| ~ le(s(n0),X2)
| ~ le(s(X2),X1)
| ~ le(X2,n)
| ~ le(X1,n) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_46]),c_0_46]),c_0_38])]) ).
cnf(c_0_74,plain,
minus(minus(s(n),minus(s(n),X1)),X2) = minus(X1,X2),
inference(rw,[status(thm)],[c_0_71,c_0_69]) ).
cnf(c_0_75,plain,
( minus(p(minus(s(n),esk1_0)),p(minus(s(n),esk2_0))) = minus(minus(s(n),esk1_0),minus(s(n),esk2_0))
| minus(p(minus(s(n),esk1_0)),p(minus(s(n),esk2_0))) = minus(esk1_0,esk2_0) ),
inference(er,[status(thm)],[c_0_72]) ).
cnf(c_0_76,plain,
( minus(minus(s(n),X1),minus(s(n),p(X1))) != minus(esk2_0,minus(s(n),p(minus(s(n),esk2_0))))
| ~ le(s(minus(s(n),esk2_0)),X1)
| ~ le(X1,n) ),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_49]),c_0_50])]),c_0_74]) ).
cnf(c_0_77,plain,
( ~ queens_p
| ~ le(X1,n)
| ~ le(s(X2),X1)
| ~ le(X2,n)
| ~ le(s(n0),X2)
| plus(p(X2),X2) != plus(p(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_78,plain,
( minus(p(minus(s(n),esk1_0)),p(minus(s(n),esk2_0))) = minus(esk1_0,esk2_0)
| minus(p(minus(s(n),esk1_0)),X1) = minus(p(minus(s(n),esk2_0)),X2)
| minus(minus(s(n),esk1_0),minus(s(n),esk2_0)) != minus(X1,X2) ),
inference(spm,[status(thm)],[c_0_61,c_0_75]) ).
cnf(c_0_79,plain,
minus(esk2_0,minus(s(n),p(minus(s(n),esk2_0)))) != minus(esk1_0,minus(s(n),p(minus(s(n),esk1_0)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_56]),c_0_74]),c_0_57])]) ).
cnf(c_0_80,plain,
( plus(p(X1),X1) != plus(p(X2),X2)
| ~ le(s(n0),X2)
| ~ le(s(X2),X1)
| ~ le(X2,n)
| ~ le(X1,n) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_38])]) ).
cnf(c_0_81,plain,
( plus(X1,minus(s(n),X2)) = plus(X3,minus(s(n),X4))
| minus(X1,X3) != minus(X2,X4) ),
inference(spm,[status(thm)],[c_0_47,c_0_46]) ).
cnf(c_0_82,plain,
minus(p(minus(s(n),esk1_0)),p(minus(s(n),esk2_0))) = minus(esk1_0,esk2_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_78]),c_0_66]),c_0_66]),c_0_79]) ).
cnf(c_0_83,plain,
( plus(X1,p(X1)) != plus(X2,p(X2))
| ~ le(s(n0),X2)
| ~ le(s(X2),X1)
| ~ le(X2,n)
| ~ le(X1,n) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_54]),c_0_54]) ).
cnf(c_0_84,plain,
( plus(p(minus(s(n),esk1_0)),minus(s(n),X1)) = plus(p(minus(s(n),esk2_0)),minus(s(n),X2))
| minus(esk1_0,esk2_0) != minus(X1,X2) ),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_85,plain,
( plus(X1,p(X1)) != plus(minus(s(n),esk2_0),p(minus(s(n),esk2_0)))
| ~ le(s(minus(s(n),esk2_0)),X1)
| ~ le(X1,n) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_49]),c_0_50])]) ).
cnf(c_0_86,plain,
plus(minus(s(n),esk2_0),p(minus(s(n),esk2_0))) = plus(minus(s(n),esk1_0),p(minus(s(n),esk1_0))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_84]),c_0_54]),c_0_54]) ).
cnf(c_0_87,plain,
( plus(X1,p(X1)) != plus(minus(s(n),esk1_0),p(minus(s(n),esk1_0)))
| ~ le(s(minus(s(n),esk2_0)),X1)
| ~ le(X1,n) ),
inference(rw,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_88,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_87]),c_0_56]),c_0_57])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : PUZ133+1 : TPTP v8.1.0. Released v4.1.0.
% 0.12/0.13 % Command : run_ET %s %d
% 0.14/0.35 % Computer : n026.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sat May 28 22:57:24 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.27/6.45 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.27/6.45 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.27/6.45 # Preprocessing time : 0.015 s
% 0.27/6.45
% 0.27/6.45 # Proof found!
% 0.27/6.45 # SZS status Theorem
% 0.27/6.45 # SZS output start CNFRefutation
% See solution above
% 0.27/6.45 # Proof object total steps : 89
% 0.27/6.45 # Proof object clause steps : 68
% 0.27/6.45 # Proof object formula steps : 21
% 0.27/6.45 # Proof object conjectures : 6
% 0.27/6.45 # Proof object clause conjectures : 3
% 0.27/6.45 # Proof object formula conjectures : 3
% 0.27/6.45 # Proof object initial clauses used : 21
% 0.27/6.45 # Proof object initial formulas used : 10
% 0.27/6.45 # Proof object generating inferences : 28
% 0.27/6.45 # Proof object simplifying inferences : 72
% 0.27/6.45 # Training examples: 0 positive, 0 negative
% 0.27/6.45 # Parsed axioms : 10
% 0.27/6.45 # Removed by relevancy pruning/SinE : 0
% 0.27/6.45 # Initial clauses : 23
% 0.27/6.45 # Removed in clause preprocessing : 2
% 0.27/6.45 # Initial clauses in saturation : 21
% 0.27/6.45 # Processed clauses : 59875
% 0.27/6.45 # ...of these trivial : 4600
% 0.27/6.45 # ...subsumed : 48209
% 0.27/6.45 # ...remaining for further processing : 7066
% 0.27/6.45 # Other redundant clauses eliminated : 0
% 0.27/6.45 # Clauses deleted for lack of memory : 0
% 0.27/6.45 # Backward-subsumed : 713
% 0.27/6.45 # Backward-rewritten : 810
% 0.27/6.45 # Generated clauses : 185137
% 0.27/6.45 # ...of the previous two non-trivial : 173243
% 0.27/6.45 # Contextual simplify-reflections : 0
% 0.27/6.45 # Paramodulations : 183189
% 0.27/6.45 # Factorizations : 1
% 0.27/6.45 # Equation resolutions : 1946
% 0.27/6.45 # Current number of processed clauses : 5542
% 0.27/6.45 # Positive orientable unit clauses : 1209
% 0.27/6.45 # Positive unorientable unit clauses: 13
% 0.27/6.45 # Negative unit clauses : 15
% 0.27/6.45 # Non-unit-clauses : 4305
% 0.27/6.45 # Current number of unprocessed clauses: 34304
% 0.27/6.45 # ...number of literals in the above : 62288
% 0.27/6.45 # Current number of archived formulas : 0
% 0.27/6.45 # Current number of archived clauses : 1526
% 0.27/6.45 # Clause-clause subsumption calls (NU) : 7778647
% 0.27/6.45 # Rec. Clause-clause subsumption calls : 6630150
% 0.27/6.45 # Non-unit clause-clause subsumptions : 45657
% 0.27/6.45 # Unit Clause-clause subsumption calls : 13499
% 0.27/6.45 # Rewrite failures with RHS unbound : 1351
% 0.27/6.45 # BW rewrite match attempts : 155781
% 0.27/6.45 # BW rewrite match successes : 1947
% 0.27/6.45 # Condensation attempts : 0
% 0.27/6.45 # Condensation successes : 0
% 0.27/6.45 # Termbank termtop insertions : 5204127
% 0.27/6.45
% 0.27/6.45 # -------------------------------------------------
% 0.27/6.45 # User time : 5.974 s
% 0.27/6.45 # System time : 0.032 s
% 0.27/6.45 # Total time : 6.006 s
% 0.27/6.45 # Maximum resident set size: 44092 pages
% 0.27/23.42 eprover: CPU time limit exceeded, terminating
% 0.27/23.42 eprover: CPU time limit exceeded, terminating
% 0.27/23.42 eprover: CPU time limit exceeded, terminating
% 0.27/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.43 eprover: No such file or directory
% 0.27/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.43 eprover: No such file or directory
% 0.27/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.44 eprover: No such file or directory
% 0.27/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.27/23.44 eprover: No such file or directory
% 0.27/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.44 eprover: No such file or directory
% 0.27/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.44 eprover: No such file or directory
% 0.27/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.44 eprover: No such file or directory
% 0.27/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.27/23.44 eprover: No such file or directory
% 0.27/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.45 eprover: No such file or directory
% 0.27/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.45 eprover: No such file or directory
% 0.27/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.27/23.45 eprover: No such file or directory
% 0.27/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.45 eprover: No such file or directory
% 0.27/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.45 eprover: No such file or directory
% 0.27/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.27/23.46 eprover: No such file or directory
% 0.27/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.46 eprover: No such file or directory
% 0.27/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.46 eprover: No such file or directory
% 0.27/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.46 eprover: No such file or directory
% 0.27/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.27/23.46 eprover: No such file or directory
% 0.27/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.46 eprover: No such file or directory
% 0.27/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.47 eprover: No such file or directory
% 0.27/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.27/23.47 eprover: No such file or directory
% 0.27/23.47 eprover: eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.inCannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.47
% 0.27/23.47 eprover: No such file or directory
% 0.27/23.47 eprover: No such file or directory
% 0.27/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.47 eprover: No such file or directory
% 0.27/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.27/23.47 eprover: No such file or directory
% 0.27/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.48 eprover: No such file or directory
% 0.27/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.48 eprover: No such file or directory
% 0.27/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.27/23.48 eprover: No such file or directory
% 0.27/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.48 eprover: No such file or directory
% 0.27/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.27/23.49 eprover: No such file or directory
% 0.27/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.49 eprover: No such file or directory
% 0.27/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.27/23.49 eprover: No such file or directory
% 0.27/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.27/23.49 eprover: No such file or directory
%------------------------------------------------------------------------------