TSTP Solution File: PUZ133+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : PUZ133+1 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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 : 300s
% DateTime : Tue May 21 02:25:16 EDT 2024
% Result : Theorem 3.13s 0.83s
% Output : CNFRefutation 3.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 10
% Syntax : Number of formulae : 87 ( 35 unt; 0 def)
% Number of atoms : 250 ( 96 equ)
% Maximal formula atoms : 18 ( 2 avg)
% Number of connectives : 278 ( 115 ~; 107 |; 40 &)
% ( 4 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 4 ( 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 : 118 ( 0 sgn 45 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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/benchmark/theBenchmark.p',queens_q) ).
fof(queens_sym,conjecture,
( ( queens_p
& ! [X1] : q(X1) = p(perm(X1)) )
=> queens_q ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',queens_sym) ).
fof(le_trans,axiom,
! [X3,X4,X5] :
( ( le(X3,X4)
& le(X4,X5) )
=> le(X3,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',le_trans) ).
fof(succ_le,axiom,
! [X3] : le(X3,s(X3)),
file('/export/starexec/sandbox2/benchmark/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/benchmark/theBenchmark.p',queens_p) ).
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/benchmark/theBenchmark.p',permutation_range) ).
fof(minus1,axiom,
! [X1,X2,X6,X7] :
( minus(X1,X2) = minus(X6,X7)
<=> minus(X1,X6) = minus(X2,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',minus1) ).
fof(permutation,axiom,
! [X1] : perm(X1) = minus(s(n),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',permutation) ).
fof(permutation_another_one,axiom,
! [X2,X1] : minus(X1,X2) = minus(perm(X2),perm(X1)),
file('/export/starexec/sandbox2/benchmark/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/benchmark/theBenchmark.p',plus1) ).
fof(c_0_10,plain,
( ! [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 ),
inference(fof_simplification,[status(thm)],[queens_q]) ).
fof(c_0_11,negated_conjecture,
~ ( ( queens_p
& ! [X1] : q(X1) = p(perm(X1)) )
=> queens_q ),
inference(assume_negation,[status(cth)],[queens_sym]) ).
fof(c_0_12,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(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])]) ).
fof(c_0_13,negated_conjecture,
! [X8] :
( queens_p
& q(X8) = p(perm(X8))
& ~ queens_q ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
fof(c_0_14,plain,
! [X25,X26,X27] :
( ~ le(X25,X26)
| ~ le(X26,X27)
| le(X25,X27) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[le_trans])])]) ).
cnf(c_0_15,plain,
( le(s(esk1_0),esk2_0)
| queens_q ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
~ queens_q,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
( le(X1,X3)
| ~ le(X1,X2)
| ~ le(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
le(s(esk1_0),esk2_0),
inference(sr,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_19,plain,
! [X28] : le(X28,s(X28)),
inference(variable_rename,[status(thm)],[succ_le]) ).
cnf(c_0_20,plain,
( le(X1,esk2_0)
| ~ le(X1,s(esk1_0)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
le(X1,s(X1)),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_22,plain,
( 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) ) ) ),
inference(fof_simplification,[status(thm)],[queens_p]) ).
cnf(c_0_23,plain,
le(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
( le(s(n0),esk1_0)
| queens_q ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_25,plain,
! [X11,X12] :
( ( p(X11) != p(X12)
| ~ le(s(n0),X11)
| ~ le(X11,n)
| ~ le(s(X11),X12)
| ~ le(X12,n)
| ~ queens_p )
& ( plus(p(X11),X11) != plus(p(X12),X12)
| ~ le(s(n0),X11)
| ~ le(X11,n)
| ~ le(s(X11),X12)
| ~ le(X12,n)
| ~ queens_p )
& ( minus(p(X11),X11) != minus(p(X12),X12)
| ~ le(s(n0),X11)
| ~ le(X11,n)
| ~ le(s(X11),X12)
| ~ le(X12,n)
| ~ queens_p ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])])])]) ).
fof(c_0_26,plain,
! [X14] :
( ( le(s(n0),perm(X14))
| ~ le(s(n0),X14)
| ~ le(X14,n) )
& ( le(perm(X14),n)
| ~ le(s(n0),X14)
| ~ le(X14,n) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[permutation_range])])])]) ).
cnf(c_0_27,plain,
( le(X1,esk2_0)
| ~ le(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_23]) ).
cnf(c_0_28,plain,
le(s(n0),esk1_0),
inference(sr,[status(thm)],[c_0_24,c_0_16]) ).
cnf(c_0_29,plain,
( le(esk2_0,n)
| queens_q ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_30,plain,
! [X21,X22,X23,X24] :
( ( minus(X21,X22) != minus(X23,X24)
| minus(X21,X23) = minus(X22,X24) )
& ( minus(X21,X23) != minus(X22,X24)
| minus(X21,X22) = minus(X23,X24) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[minus1])])]) ).
fof(c_0_31,plain,
! [X13] : perm(X13) = minus(s(n),X13),
inference(variable_rename,[status(thm)],[permutation]) ).
fof(c_0_32,plain,
! [X15,X16] : minus(X16,X15) = minus(perm(X15),perm(X16)),
inference(variable_rename,[status(thm)],[permutation_another_one]) ).
cnf(c_0_33,plain,
( p(X1) != p(X2)
| ~ le(s(n0),X1)
| ~ le(X1,n)
| ~ le(s(X1),X2)
| ~ le(X2,n)
| ~ queens_p ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_34,negated_conjecture,
queens_p,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_35,plain,
( le(s(n0),perm(X1))
| ~ le(s(n0),X1)
| ~ le(X1,n) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_36,plain,
le(s(n0),esk2_0),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_37,plain,
le(esk2_0,n),
inference(sr,[status(thm)],[c_0_29,c_0_16]) ).
cnf(c_0_38,plain,
( le(perm(X1),n)
| ~ le(s(n0),X1)
| ~ le(X1,n) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_39,plain,
( le(esk1_0,n)
| queens_q ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_40,plain,
( minus(X1,X3) = minus(X2,X4)
| minus(X1,X2) != minus(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_41,plain,
perm(X1) = minus(s(n),X1),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_42,plain,
minus(X1,X2) = minus(perm(X2),perm(X1)),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_43,plain,
! [X17,X18,X19,X20] :
( ( plus(X17,X18) != plus(X19,X20)
| minus(X17,X19) = minus(X20,X18) )
& ( minus(X17,X19) != minus(X20,X18)
| plus(X17,X18) = plus(X19,X20) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[plus1])])]) ).
cnf(c_0_44,plain,
( p(X1) != p(X2)
| ~ le(s(n0),X1)
| ~ le(s(X1),X2)
| ~ le(X2,n)
| ~ le(X1,n) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
cnf(c_0_45,plain,
le(s(n0),perm(esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).
cnf(c_0_46,negated_conjecture,
q(X1) = p(perm(X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_47,plain,
le(perm(esk2_0),n),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_36]),c_0_37])]) ).
cnf(c_0_48,plain,
( le(s(perm(esk2_0)),perm(esk1_0))
| queens_q
| ~ le(s(esk1_0),esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_49,plain,
le(esk1_0,n),
inference(sr,[status(thm)],[c_0_39,c_0_16]) ).
cnf(c_0_50,plain,
( perm(X1) = minus(X2,X3)
| perm(X2) != minus(X1,X3) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_41]) ).
cnf(c_0_51,plain,
minus(perm(X1),perm(s(n))) = perm(X1),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_52,plain,
( 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(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_53,plain,
( plus(X1,X4) = plus(X2,X3)
| minus(X1,X2) != minus(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_54,plain,
( p(X1) != q(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_44,c_0_45]),c_0_46]),c_0_47])]) ).
cnf(c_0_55,plain,
le(s(perm(esk2_0)),perm(esk1_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_18])]),c_0_16]) ).
cnf(c_0_56,plain,
le(perm(esk1_0),n),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_28]),c_0_49])]) ).
cnf(c_0_57,plain,
( perm(perm(X1)) = minus(X2,perm(s(n)))
| perm(X2) != perm(X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_58,plain,
( minus(q(esk2_0),esk2_0) = minus(q(esk1_0),esk1_0)
| plus(q(esk2_0),esk2_0) = plus(q(esk1_0),esk1_0)
| q(esk2_0) = q(esk1_0) ),
inference(sr,[status(thm)],[c_0_52,c_0_16]) ).
cnf(c_0_59,plain,
plus(X1,X2) = plus(X2,X1),
inference(er,[status(thm)],[c_0_53]) ).
cnf(c_0_60,plain,
q(esk2_0) != q(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_46]),c_0_56])]) ).
cnf(c_0_61,plain,
minus(X1,perm(s(n))) = perm(perm(X1)),
inference(er,[status(thm)],[c_0_57]) ).
cnf(c_0_62,plain,
( minus(X1,X3) = minus(X4,X2)
| plus(X1,X2) != plus(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_63,plain,
( plus(esk2_0,q(esk2_0)) = plus(esk1_0,q(esk1_0))
| minus(q(esk2_0),esk2_0) = minus(q(esk1_0),esk1_0) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_59]),c_0_59]),c_0_60]) ).
cnf(c_0_64,plain,
( minus(p(X1),X1) != minus(p(X2),X2)
| ~ le(s(n0),X1)
| ~ le(X1,n)
| ~ le(s(X1),X2)
| ~ le(X2,n)
| ~ queens_p ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_65,plain,
minus(perm(perm(X1)),perm(perm(X2))) = minus(X1,X2),
inference(spm,[status(thm)],[c_0_42,c_0_42]) ).
cnf(c_0_66,plain,
perm(perm(perm(X1))) = perm(X1),
inference(rw,[status(thm)],[c_0_51,c_0_61]) ).
cnf(c_0_67,plain,
( minus(q(esk2_0),esk2_0) = minus(q(esk1_0),esk1_0)
| minus(X1,esk2_0) = minus(q(esk2_0),X2)
| plus(X1,X2) != plus(esk1_0,q(esk1_0)) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_68,plain,
( minus(perm(X1),perm(p(X1))) != minus(perm(X2),perm(p(X2)))
| ~ le(s(n0),X1)
| ~ le(s(X1),X2)
| ~ le(X2,n)
| ~ le(X1,n) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_42]),c_0_42]),c_0_34])]) ).
cnf(c_0_69,plain,
minus(perm(perm(X1)),X2) = minus(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_65]) ).
cnf(c_0_70,plain,
( minus(X1,perm(X2)) = minus(X3,perm(X4))
| minus(X1,X3) != minus(X4,X2) ),
inference(spm,[status(thm)],[c_0_40,c_0_42]) ).
cnf(c_0_71,plain,
( minus(q(esk2_0),q(esk1_0)) = minus(esk1_0,esk2_0)
| minus(q(esk2_0),esk2_0) = minus(q(esk1_0),esk1_0) ),
inference(er,[status(thm)],[c_0_67]) ).
cnf(c_0_72,plain,
( minus(perm(X1),perm(p(X1))) != minus(esk2_0,perm(q(esk2_0)))
| ~ le(s(perm(esk2_0)),X1)
| ~ le(X1,n) ),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_45]),c_0_46]),c_0_47])]),c_0_69]) ).
cnf(c_0_73,plain,
( minus(q(esk2_0),perm(X1)) = minus(q(esk1_0),perm(X2))
| minus(q(esk2_0),esk2_0) = minus(q(esk1_0),esk1_0)
| minus(esk1_0,esk2_0) != minus(X2,X1) ),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_74,plain,
minus(X1,perm(X2)) = minus(X2,perm(X1)),
inference(er,[status(thm)],[c_0_70]) ).
cnf(c_0_75,plain,
minus(esk2_0,perm(q(esk2_0))) != minus(esk1_0,perm(q(esk1_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_55]),c_0_46]),c_0_69]),c_0_56])]) ).
cnf(c_0_76,plain,
( plus(p(X1),X1) != plus(p(X2),X2)
| ~ le(s(n0),X1)
| ~ le(X1,n)
| ~ le(s(X1),X2)
| ~ le(X2,n)
| ~ queens_p ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_77,plain,
minus(q(esk2_0),esk2_0) = minus(q(esk1_0),esk1_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_73]),c_0_74]),c_0_74]),c_0_75]) ).
cnf(c_0_78,plain,
( plus(p(X1),X1) != plus(p(X2),X2)
| ~ le(s(n0),X1)
| ~ le(s(X1),X2)
| ~ le(X2,n)
| ~ le(X1,n) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_34])]) ).
cnf(c_0_79,plain,
( minus(q(esk2_0),X1) = minus(esk2_0,X2)
| minus(q(esk1_0),esk1_0) != minus(X1,X2) ),
inference(spm,[status(thm)],[c_0_40,c_0_77]) ).
cnf(c_0_80,plain,
( plus(X1,p(X1)) != plus(X2,p(X2))
| ~ le(s(n0),X1)
| ~ le(s(X1),X2)
| ~ le(X2,n)
| ~ le(X1,n) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_59]),c_0_59]) ).
cnf(c_0_81,plain,
( plus(X1,perm(X2)) = plus(X3,perm(X4))
| minus(X1,X3) != minus(X2,X4) ),
inference(spm,[status(thm)],[c_0_53,c_0_42]) ).
cnf(c_0_82,plain,
minus(q(esk2_0),q(esk1_0)) = minus(esk2_0,esk1_0),
inference(er,[status(thm)],[c_0_79]) ).
cnf(c_0_83,plain,
( plus(q(esk2_0),perm(esk2_0)) != plus(X1,p(X1))
| ~ le(s(perm(esk2_0)),X1)
| ~ le(X1,n) ),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_45]),c_0_46]),c_0_47])]),c_0_59]) ).
cnf(c_0_84,plain,
( plus(q(esk2_0),perm(X1)) = plus(q(esk1_0),perm(X2))
| minus(esk2_0,esk1_0) != minus(X1,X2) ),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_85,plain,
plus(q(esk2_0),perm(esk2_0)) != plus(q(esk1_0),perm(esk1_0)),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_55]),c_0_46]),c_0_56])]),c_0_59]) ).
cnf(c_0_86,plain,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_84]),c_0_85]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : PUZ133+1 : TPTP v8.2.0. Released v4.1.0.
% 0.11/0.12 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n020.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Sat May 18 10:42:08 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.16/0.40 Running first-order theorem proving
% 0.16/0.40 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.13/0.83 # Version: 3.1.0
% 3.13/0.83 # Preprocessing class: FSMSSLSSSSSNFFN.
% 3.13/0.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.13/0.83 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 3.13/0.83 # Starting new_bool_3 with 300s (1) cores
% 3.13/0.83 # Starting new_bool_1 with 300s (1) cores
% 3.13/0.83 # Starting sh5l with 300s (1) cores
% 3.13/0.83 # sh5l with pid 6976 completed with status 0
% 3.13/0.83 # Result found by sh5l
% 3.13/0.83 # Preprocessing class: FSMSSLSSSSSNFFN.
% 3.13/0.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.13/0.83 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 3.13/0.83 # Starting new_bool_3 with 300s (1) cores
% 3.13/0.83 # Starting new_bool_1 with 300s (1) cores
% 3.13/0.83 # Starting sh5l with 300s (1) cores
% 3.13/0.83 # SinE strategy is gf500_gu_R04_F100_L20000
% 3.13/0.83 # Search class: FGHSM-FFMM21-SFFFFFNN
% 3.13/0.83 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 3.13/0.83 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 163s (1) cores
% 3.13/0.83 # G-E--_200_B02_F1_SE_CS_SP_PI_S0S with pid 6984 completed with status 0
% 3.13/0.83 # Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S0S
% 3.13/0.83 # Preprocessing class: FSMSSLSSSSSNFFN.
% 3.13/0.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.13/0.83 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 3.13/0.83 # Starting new_bool_3 with 300s (1) cores
% 3.13/0.83 # Starting new_bool_1 with 300s (1) cores
% 3.13/0.83 # Starting sh5l with 300s (1) cores
% 3.13/0.83 # SinE strategy is gf500_gu_R04_F100_L20000
% 3.13/0.83 # Search class: FGHSM-FFMM21-SFFFFFNN
% 3.13/0.83 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 3.13/0.83 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 163s (1) cores
% 3.13/0.83 # Preprocessing time : 0.001 s
% 3.13/0.83
% 3.13/0.83 # Proof found!
% 3.13/0.83 # SZS status Theorem
% 3.13/0.83 # SZS output start CNFRefutation
% See solution above
% 3.13/0.83 # Parsed axioms : 10
% 3.13/0.83 # Removed by relevancy pruning/SinE : 0
% 3.13/0.83 # Initial clauses : 23
% 3.13/0.83 # Removed in clause preprocessing : 0
% 3.13/0.83 # Initial clauses in saturation : 23
% 3.13/0.83 # Processed clauses : 8074
% 3.13/0.83 # ...of these trivial : 1181
% 3.13/0.83 # ...subsumed : 4165
% 3.13/0.83 # ...remaining for further processing : 2728
% 3.13/0.83 # Other redundant clauses eliminated : 0
% 3.13/0.83 # Clauses deleted for lack of memory : 0
% 3.13/0.83 # Backward-subsumed : 308
% 3.13/0.83 # Backward-rewritten : 334
% 3.13/0.83 # Generated clauses : 16290
% 3.13/0.83 # ...of the previous two non-redundant : 15125
% 3.13/0.83 # ...aggressively subsumed : 0
% 3.13/0.83 # Contextual simplify-reflections : 1
% 3.13/0.83 # Paramodulations : 16082
% 3.13/0.83 # Factorizations : 1
% 3.13/0.83 # NegExts : 0
% 3.13/0.83 # Equation resolutions : 207
% 3.13/0.83 # Disequality decompositions : 0
% 3.13/0.83 # Total rewrite steps : 8345
% 3.13/0.83 # ...of those cached : 7527
% 3.13/0.83 # Propositional unsat checks : 0
% 3.13/0.83 # Propositional check models : 0
% 3.13/0.83 # Propositional check unsatisfiable : 0
% 3.13/0.83 # Propositional clauses : 0
% 3.13/0.83 # Propositional clauses after purity: 0
% 3.13/0.83 # Propositional unsat core size : 0
% 3.13/0.83 # Propositional preprocessing time : 0.000
% 3.13/0.83 # Propositional encoding time : 0.000
% 3.13/0.83 # Propositional solver time : 0.000
% 3.13/0.83 # Success case prop preproc time : 0.000
% 3.13/0.83 # Success case prop encoding time : 0.000
% 3.13/0.83 # Success case prop solver time : 0.000
% 3.13/0.83 # Current number of processed clauses : 2086
% 3.13/0.83 # Positive orientable unit clauses : 479
% 3.13/0.83 # Positive unorientable unit clauses: 5
% 3.13/0.83 # Negative unit clauses : 8
% 3.13/0.83 # Non-unit-clauses : 1594
% 3.13/0.83 # Current number of unprocessed clauses: 6519
% 3.13/0.83 # ...number of literals in the above : 13446
% 3.13/0.83 # Current number of archived formulas : 0
% 3.13/0.83 # Current number of archived clauses : 642
% 3.13/0.83 # Clause-clause subsumption calls (NU) : 341106
% 3.13/0.83 # Rec. Clause-clause subsumption calls : 158495
% 3.13/0.83 # Non-unit clause-clause subsumptions : 4347
% 3.13/0.83 # Unit Clause-clause subsumption calls : 35658
% 3.13/0.83 # Rewrite failures with RHS unbound : 36
% 3.13/0.83 # BW rewrite match attempts : 15942
% 3.13/0.83 # BW rewrite match successes : 187
% 3.13/0.83 # Condensation attempts : 0
% 3.13/0.83 # Condensation successes : 0
% 3.13/0.83 # Termbank termtop insertions : 328918
% 3.13/0.83 # Search garbage collected termcells : 353
% 3.13/0.83
% 3.13/0.83 # -------------------------------------------------
% 3.13/0.83 # User time : 0.381 s
% 3.13/0.83 # System time : 0.012 s
% 3.13/0.83 # Total time : 0.393 s
% 3.13/0.83 # Maximum resident set size: 1704 pages
% 3.13/0.83
% 3.13/0.83 # -------------------------------------------------
% 3.13/0.83 # User time : 0.383 s
% 3.13/0.83 # System time : 0.013 s
% 3.13/0.83 # Total time : 0.396 s
% 3.13/0.83 # Maximum resident set size: 1704 pages
% 3.13/0.83 % E---3.1 exiting
% 3.13/0.83 % E exiting
%------------------------------------------------------------------------------