TSTP Solution File: PUZ133+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : PUZ133+2 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n029.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 18:10:54 EDT 2022
% Result : Theorem 0.41s 47.60s
% Output : CNFRefutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 9
% Syntax : Number of formulae : 89 ( 32 unt; 0 def)
% Number of atoms : 246 ( 98 equ)
% Maximal formula atoms : 18 ( 2 avg)
% Number of connectives : 271 ( 114 ~; 117 |; 29 &)
% ( 3 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 5 ( 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 : 139 ( 8 sgn 47 !; 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(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(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(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(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(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(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(c_0_9,negated_conjecture,
~ ( ( queens_p
& ! [X1] : q(X1) = p(perm(X1)) )
=> queens_q ),
inference(assume_negation,[status(cth)],[queens_sym]) ).
fof(c_0_10,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_11,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_9])])])])]) ).
fof(c_0_12,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])])]) ).
cnf(c_0_13,plain,
( queens_q
| le(esk1_0,n) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
~ queens_q,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( queens_q
| le(s(n0),esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_16,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])]) ).
cnf(c_0_17,plain,
( queens_q
| le(s(esk1_0),esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
( le(perm(X1),n)
| ~ le(X1,n)
| ~ le(s(n0),X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
le(esk1_0,n),
inference(sr,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
le(s(n0),esk1_0),
inference(sr,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_21,plain,
( le(X1,X2)
| ~ le(X3,X2)
| ~ le(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
le(s(esk1_0),esk2_0),
inference(sr,[status(thm)],[c_0_17,c_0_14]) ).
fof(c_0_23,plain,
! [X4] : le(X4,s(X4)),
inference(variable_rename,[status(thm)],[succ_le]) ).
cnf(c_0_24,plain,
le(perm(esk1_0),n),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_25,plain,
( queens_q
| le(s(perm(esk2_0)),perm(esk1_0))
| ~ le(s(esk1_0),esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_26,plain,
( le(X1,esk2_0)
| ~ le(X1,s(esk1_0)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
le(X1,s(X1)),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,plain,
( le(X1,n)
| ~ le(X1,perm(esk1_0)) ),
inference(spm,[status(thm)],[c_0_21,c_0_24]) ).
cnf(c_0_29,plain,
le(s(perm(esk2_0)),perm(esk1_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_22])]),c_0_14]) ).
cnf(c_0_30,plain,
le(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
fof(c_0_31,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_32,plain,
le(s(perm(esk2_0)),n),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
( queens_q
| le(esk2_0,n) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_34,plain,
( le(X1,esk2_0)
| ~ le(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_30]) ).
cnf(c_0_35,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_31]) ).
cnf(c_0_36,negated_conjecture,
queens_p,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_37,plain,
( le(X1,n)
| ~ le(X1,s(perm(esk2_0))) ),
inference(spm,[status(thm)],[c_0_21,c_0_32]) ).
cnf(c_0_38,plain,
( le(s(n0),perm(X1))
| ~ le(X1,n)
| ~ le(s(n0),X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_39,plain,
le(esk2_0,n),
inference(sr,[status(thm)],[c_0_33,c_0_14]) ).
cnf(c_0_40,plain,
le(s(n0),esk2_0),
inference(spm,[status(thm)],[c_0_34,c_0_20]) ).
fof(c_0_41,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])])])]) ).
fof(c_0_42,plain,
! [X3,X4] : minus(X4,X3) = minus(perm(X3),perm(X4)),
inference(variable_rename,[status(thm)],[permutation_another_one]) ).
fof(c_0_43,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_44,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_10]) ).
cnf(c_0_45,negated_conjecture,
q(X1) = p(perm(X1)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_46,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_35,c_0_36])]) ).
cnf(c_0_47,plain,
le(perm(esk2_0),n),
inference(spm,[status(thm)],[c_0_37,c_0_27]) ).
cnf(c_0_48,plain,
le(s(n0),perm(esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
cnf(c_0_49,plain,
( minus(X1,X2) = minus(X3,X4)
| minus(X1,X3) != minus(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_50,plain,
minus(X1,X2) = minus(perm(X2),perm(X1)),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_51,plain,
( minus(X1,X2) = minus(X3,X4)
| plus(X1,X4) != plus(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_52,plain,
( plus(X1,X2) = plus(X3,X4)
| minus(X1,X3) != minus(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_53,plain,
( p(perm(esk2_0)) = p(perm(esk1_0))
| plus(p(perm(esk2_0)),esk2_0) = plus(p(perm(esk1_0)),esk1_0)
| minus(p(perm(esk2_0)),esk2_0) = minus(p(perm(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)],[c_0_44,c_0_45]),c_0_45]),c_0_45]),c_0_45]),c_0_45]),c_0_45]) ).
cnf(c_0_54,plain,
( p(X1) != p(perm(esk2_0))
| ~ le(s(perm(esk2_0)),X1)
| ~ le(X1,n) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48])]) ).
cnf(c_0_55,plain,
( minus(X1,perm(X2)) = minus(X3,perm(X4))
| minus(X1,X3) != minus(X4,X2) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_56,plain,
minus(X1,X1) = minus(X2,X2),
inference(er,[status(thm)],[c_0_51]) ).
cnf(c_0_57,plain,
plus(X1,X2) = plus(X2,X1),
inference(er,[status(thm)],[c_0_52]) ).
cnf(c_0_58,plain,
( plus(p(perm(esk2_0)),esk2_0) = plus(p(perm(esk1_0)),esk1_0)
| minus(p(perm(esk2_0)),esk2_0) = minus(p(perm(esk1_0)),esk1_0)
| p(perm(esk2_0)) = p(perm(esk1_0)) ),
inference(sr,[status(thm)],[c_0_53,c_0_14]) ).
cnf(c_0_59,plain,
p(perm(esk2_0)) != p(perm(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_24]),c_0_29])]) ).
cnf(c_0_60,plain,
minus(X1,perm(X2)) = minus(X2,perm(X1)),
inference(er,[status(thm)],[c_0_55]) ).
cnf(c_0_61,plain,
( plus(X1,X2) = plus(X3,X2)
| minus(X1,X3) != minus(X4,X4) ),
inference(spm,[status(thm)],[c_0_52,c_0_56]) ).
cnf(c_0_62,plain,
( minus(X1,X2) = minus(X3,X4)
| plus(X1,X4) != plus(X3,X2) ),
inference(spm,[status(thm)],[c_0_51,c_0_57]) ).
cnf(c_0_63,plain,
( plus(esk2_0,p(perm(esk2_0))) = plus(esk1_0,p(perm(esk1_0)))
| minus(p(perm(esk2_0)),esk2_0) = minus(p(perm(esk1_0)),esk1_0) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_57]),c_0_57]),c_0_59]) ).
cnf(c_0_64,plain,
minus(X1,perm(perm(X2))) = minus(X1,X2),
inference(spm,[status(thm)],[c_0_50,c_0_60]) ).
cnf(c_0_65,plain,
( plus(X1,X2) = plus(perm(X3),X2)
| minus(X3,perm(X1)) != minus(X4,X4) ),
inference(spm,[status(thm)],[c_0_61,c_0_60]) ).
cnf(c_0_66,plain,
( minus(p(perm(esk2_0)),esk2_0) = minus(p(perm(esk1_0)),esk1_0)
| minus(esk2_0,X1) = minus(X2,p(perm(esk2_0)))
| plus(esk1_0,p(perm(esk1_0))) != plus(X2,X1) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_67,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_31]) ).
cnf(c_0_68,plain,
minus(perm(X1),X2) = minus(perm(X2),X1),
inference(spm,[status(thm)],[c_0_50,c_0_64]) ).
cnf(c_0_69,plain,
plus(perm(perm(X1)),X2) = plus(X1,X2),
inference(er,[status(thm)],[c_0_65]) ).
cnf(c_0_70,plain,
( minus(perm(X1),X2) = minus(perm(X3),X4)
| minus(X3,X1) != minus(X2,X4) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_71,plain,
( minus(p(perm(esk2_0)),esk2_0) = minus(p(perm(esk1_0)),esk1_0)
| minus(esk2_0,p(perm(esk1_0))) = minus(esk1_0,p(perm(esk2_0))) ),
inference(er,[status(thm)],[c_0_66]) ).
cnf(c_0_72,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_67,c_0_36])]) ).
cnf(c_0_73,plain,
( plus(X1,X2) = plus(X3,perm(X4))
| minus(X1,X3) != minus(perm(X2),X4) ),
inference(spm,[status(thm)],[c_0_52,c_0_68]) ).
cnf(c_0_74,plain,
plus(X1,perm(perm(X2))) = plus(X2,X1),
inference(spm,[status(thm)],[c_0_57,c_0_69]) ).
cnf(c_0_75,plain,
( minus(esk2_0,p(perm(esk1_0))) = minus(esk1_0,p(perm(esk2_0)))
| minus(perm(X1),p(perm(esk2_0))) = minus(perm(X2),esk2_0)
| minus(X2,X1) != minus(p(perm(esk1_0)),esk1_0) ),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_76,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_72,c_0_57]),c_0_57]) ).
cnf(c_0_77,plain,
( plus(X1,X2) = plus(X3,X4)
| minus(X1,X4) != minus(X3,X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_60]),c_0_74]),c_0_64]) ).
cnf(c_0_78,plain,
( minus(perm(esk2_0),p(perm(esk1_0))) = minus(perm(esk1_0),p(perm(esk2_0)))
| minus(esk2_0,p(perm(esk1_0))) = minus(esk1_0,p(perm(esk2_0))) ),
inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_75]),c_0_68]) ).
cnf(c_0_79,plain,
( plus(X1,p(X1)) != plus(perm(esk2_0),p(perm(esk2_0)))
| ~ le(s(perm(esk2_0)),X1)
| ~ le(X1,n) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_47]),c_0_48])]) ).
cnf(c_0_80,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_31]) ).
cnf(c_0_81,plain,
( minus(esk2_0,p(perm(esk1_0))) = minus(esk1_0,p(perm(esk2_0)))
| plus(X1,p(perm(esk1_0))) = plus(perm(esk2_0),X2)
| minus(X1,X2) != minus(perm(esk1_0),p(perm(esk2_0))) ),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_82,plain,
plus(perm(esk2_0),p(perm(esk2_0))) != plus(perm(esk1_0),p(perm(esk1_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_24]),c_0_29])]) ).
cnf(c_0_83,plain,
( minus(p(X1),X1) != minus(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_80,c_0_36])]) ).
cnf(c_0_84,plain,
minus(esk2_0,p(perm(esk1_0))) = minus(esk1_0,p(perm(esk2_0))),
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_81]),c_0_82]) ).
cnf(c_0_85,plain,
( minus(p(X1),X1) != minus(esk2_0,perm(p(perm(esk2_0))))
| ~ le(s(perm(esk2_0)),X1)
| ~ le(X1,n) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_47]),c_0_60]),c_0_48])]) ).
cnf(c_0_86,plain,
( minus(esk2_0,perm(X1)) = minus(p(perm(esk1_0)),perm(X2))
| minus(esk1_0,p(perm(esk2_0))) != minus(X2,X1) ),
inference(spm,[status(thm)],[c_0_55,c_0_84]) ).
cnf(c_0_87,plain,
minus(esk2_0,perm(p(perm(esk2_0)))) != minus(esk1_0,perm(p(perm(esk1_0)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_24]),c_0_60]),c_0_29])]) ).
cnf(c_0_88,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_86]),c_0_60]),c_0_87]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : PUZ133+2 : TPTP v8.1.0. Released v4.1.0.
% 0.02/0.11 % Command : run_ET %s %d
% 0.11/0.32 % Computer : n029.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Sun May 29 01:57:13 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.29/23.38 eprover: CPU time limit exceeded, terminating
% 0.29/23.38 eprover: CPU time limit exceeded, terminating
% 0.29/23.39 eprover: CPU time limit exceeded, terminating
% 0.29/23.42 eprover: CPU time limit exceeded, terminating
% 0.40/46.40 eprover: CPU time limit exceeded, terminating
% 0.40/46.40 eprover: CPU time limit exceeded, terminating
% 0.40/46.43 eprover: CPU time limit exceeded, terminating
% 0.40/46.45 eprover: CPU time limit exceeded, terminating
% 0.41/47.60 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.41/47.60
% 0.41/47.60 # Failure: Resource limit exceeded (time)
% 0.41/47.60 # OLD status Res
% 0.41/47.60 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.41/47.60 # Preprocessing time : 0.015 s
% 0.41/47.60 # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 0.41/47.60 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 0.41/47.60 # Preprocessing time : 0.014 s
% 0.41/47.60
% 0.41/47.60 # Failure: Out of unprocessed clauses!
% 0.41/47.60 # OLD status GaveUp
% 0.41/47.60 # Parsed axioms : 10
% 0.41/47.60 # Removed by relevancy pruning/SinE : 6
% 0.41/47.60 # Initial clauses : 14
% 0.41/47.60 # Removed in clause preprocessing : 1
% 0.41/47.60 # Initial clauses in saturation : 13
% 0.41/47.60 # Processed clauses : 21
% 0.41/47.60 # ...of these trivial : 1
% 0.41/47.60 # ...subsumed : 0
% 0.41/47.60 # ...remaining for further processing : 20
% 0.41/47.60 # Other redundant clauses eliminated : 0
% 0.41/47.60 # Clauses deleted for lack of memory : 0
% 0.41/47.60 # Backward-subsumed : 0
% 0.41/47.60 # Backward-rewritten : 0
% 0.41/47.60 # Generated clauses : 8
% 0.41/47.60 # ...of the previous two non-trivial : 8
% 0.41/47.60 # Contextual simplify-reflections : 0
% 0.41/47.60 # Paramodulations : 8
% 0.41/47.60 # Factorizations : 0
% 0.41/47.60 # Equation resolutions : 0
% 0.41/47.60 # Current number of processed clauses : 20
% 0.41/47.60 # Positive orientable unit clauses : 7
% 0.41/47.60 # Positive unorientable unit clauses: 0
% 0.41/47.60 # Negative unit clauses : 4
% 0.41/47.60 # Non-unit-clauses : 9
% 0.41/47.60 # Current number of unprocessed clauses: 0
% 0.41/47.60 # ...number of literals in the above : 0
% 0.41/47.60 # Current number of archived formulas : 0
% 0.41/47.60 # Current number of archived clauses : 1
% 0.41/47.60 # Clause-clause subsumption calls (NU) : 13
% 0.41/47.60 # Rec. Clause-clause subsumption calls : 0
% 0.41/47.60 # Non-unit clause-clause subsumptions : 0
% 0.41/47.60 # Unit Clause-clause subsumption calls : 8
% 0.41/47.60 # Rewrite failures with RHS unbound : 0
% 0.41/47.60 # BW rewrite match attempts : 0
% 0.41/47.60 # BW rewrite match successes : 0
% 0.41/47.60 # Condensation attempts : 0
% 0.41/47.60 # Condensation successes : 0
% 0.41/47.60 # Termbank termtop insertions : 1301
% 0.41/47.60
% 0.41/47.60 # -------------------------------------------------
% 0.41/47.60 # User time : 0.013 s
% 0.41/47.60 # System time : 0.002 s
% 0.41/47.60 # Total time : 0.015 s
% 0.41/47.60 # Maximum resident set size: 2788 pages
% 0.41/47.60 # Running protocol protocol_eprover_48e494e00e0717ec2eabf59b73b2d711334607de for 23 seconds:
% 0.41/47.60
% 0.41/47.60 # Failure: Resource limit exceeded (time)
% 0.41/47.60 # OLD status Res
% 0.41/47.60 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,03,20000,1.0)
% 0.41/47.60 # Preprocessing time : 0.014 s
% 0.41/47.60 # Running protocol protocol_eprover_33aa8a325940064c53b389b41203bb48a5cb5006 for 23 seconds:
% 0.41/47.60 # Preprocessing time : 0.008 s
% 0.41/47.60
% 0.41/47.60 # Proof found!
% 0.41/47.60 # SZS status Theorem
% 0.41/47.60 # SZS output start CNFRefutation
% See solution above
% 0.41/47.60 # Proof object total steps : 89
% 0.41/47.60 # Proof object clause steps : 70
% 0.41/47.60 # Proof object formula steps : 19
% 0.41/47.60 # Proof object conjectures : 6
% 0.41/47.60 # Proof object clause conjectures : 3
% 0.41/47.60 # Proof object formula conjectures : 3
% 0.41/47.60 # Proof object initial clauses used : 20
% 0.41/47.60 # Proof object initial formulas used : 9
% 0.41/47.60 # Proof object generating inferences : 38
% 0.41/47.60 # Proof object simplifying inferences : 49
% 0.41/47.60 # Training examples: 0 positive, 0 negative
% 0.41/47.60 # Parsed axioms : 10
% 0.41/47.60 # Removed by relevancy pruning/SinE : 0
% 0.41/47.60 # Initial clauses : 23
% 0.41/47.60 # Removed in clause preprocessing : 1
% 0.41/47.60 # Initial clauses in saturation : 22
% 0.41/47.60 # Processed clauses : 33167
% 0.41/47.60 # ...of these trivial : 14873
% 0.41/47.60 # ...subsumed : 12632
% 0.41/47.60 # ...remaining for further processing : 5662
% 0.41/47.60 # Other redundant clauses eliminated : 0
% 0.41/47.60 # Clauses deleted for lack of memory : 0
% 0.41/47.60 # Backward-subsumed : 71
% 0.41/47.60 # Backward-rewritten : 1834
% 0.41/47.60 # Generated clauses : 66066
% 0.41/47.60 # ...of the previous two non-trivial : 64893
% 0.41/47.60 # Contextual simplify-reflections : 0
% 0.41/47.60 # Paramodulations : 65798
% 0.41/47.60 # Factorizations : 0
% 0.41/47.60 # Equation resolutions : 268
% 0.41/47.60 # Current number of processed clauses : 3757
% 0.41/47.60 # Positive orientable unit clauses : 1060
% 0.41/47.60 # Positive unorientable unit clauses: 5
% 0.41/47.60 # Negative unit clauses : 20
% 0.41/47.60 # Non-unit-clauses : 2672
% 0.41/47.60 # Current number of unprocessed clauses: 16762
% 0.41/47.60 # ...number of literals in the above : 18315
% 0.41/47.60 # Current number of archived formulas : 0
% 0.41/47.60 # Current number of archived clauses : 1906
% 0.41/47.60 # Clause-clause subsumption calls (NU) : 1236426
% 0.41/47.60 # Rec. Clause-clause subsumption calls : 1008135
% 0.41/47.60 # Non-unit clause-clause subsumptions : 12334
% 0.41/47.60 # Unit Clause-clause subsumption calls : 58721
% 0.41/47.60 # Rewrite failures with RHS unbound : 76
% 0.41/47.60 # BW rewrite match attempts : 198169
% 0.41/47.60 # BW rewrite match successes : 53
% 0.41/47.60 # Condensation attempts : 0
% 0.41/47.60 # Condensation successes : 0
% 0.41/47.60 # Termbank termtop insertions : 1839065
% 0.41/47.60
% 0.41/47.60 # -------------------------------------------------
% 0.41/47.60 # User time : 1.000 s
% 0.41/47.60 # System time : 0.011 s
% 0.41/47.60 # Total time : 1.011 s
% 0.41/47.60 # Maximum resident set size: 23044 pages
% 0.41/69.41 eprover: CPU time limit exceeded, terminating
% 0.41/69.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/69.43 eprover: No such file or directory
% 0.41/69.43 eprover: CPU time limit exceeded, terminating
% 0.41/69.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/69.44 eprover: No such file or directory
% 0.41/69.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/69.44 eprover: No such file or directory
% 0.41/69.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/69.45 eprover: No such file or directory
% 0.41/69.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/69.45 eprover: No such file or directory
% 0.41/69.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/69.45 eprover: No such file or directory
% 0.41/69.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/69.45 eprover: No such file or directory
% 0.41/69.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/69.45 eprover: No such file or directory
% 0.41/69.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/69.46 eprover: No such file or directory
% 0.41/69.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/69.46 eprover: No such file or directory
% 0.41/69.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/69.46 eprover: No such file or directory
% 0.41/69.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/69.46 eprover: No such file or directory
% 0.41/69.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/69.47 eprover: No such file or directory
% 0.41/69.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/69.47 eprover: No such file or directory
% 0.41/69.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/69.48 eprover: No such file or directory
% 0.41/69.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/69.48 eprover: No such file or directory
% 0.41/69.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/69.49 eprover: No such file or directory
% 0.41/69.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/69.49 eprover: No such file or directory
%------------------------------------------------------------------------------