%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : PUZ133+2 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:02:41 PM UTC 2026
% Result : Theorem 15.12s 2.64s
% Output : CNFRefutation 15.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 32
% Number of leaves : 10
% Syntax : Number of formulae : 133 ( 44 unt; 0 def)
% Number of atoms : 367 ( 182 equ)
% Maximal formula atoms : 18 ( 2 avg)
% Number of connectives : 387 ( 153 ~; 176 |; 41 &)
% ( 4 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 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 : 172 ( 0 sgn 45 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(queens_q,axiom,
( ! [X1,X2] :
( ( ( le(s(X1),X2)
<=> le(s(perm(X2)),perm(X1)) )
& le(X2,n)
& le(s(X1),X2)
& le(X1,n)
& le(s(n0),X1) )
=> ( minus(q(X1),X1) != minus(q(X2),X2)
& plus(q(X1),X1) != plus(q(X2),X2)
& q(X1) != q(X2) ) )
=> queens_q ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',queens_q) ).
fof(queens_sym,conjecture,
( ( ! [X1] : q(X1) = p(perm(X1))
& queens_p )
=> queens_q ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',queens_sym) ).
fof(le_trans,axiom,
! [X3,X4,X5] :
( ( le(X4,X5)
& le(X3,X4) )
=> le(X3,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',le_trans) ).
fof(succ_le,axiom,
! [X3] : le(X3,s(X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',succ_le) ).
fof(permutation_range,axiom,
! [X1] :
( ( le(X1,n)
& le(s(n0),X1) )
=> ( le(perm(X1),n)
& le(s(n0),perm(X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',permutation_range) ).
fof(plus1,axiom,
! [X1,X2,X6,X7] :
( plus(X1,X2) = plus(X6,X7)
<=> minus(X1,X6) = minus(X7,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus1) ).
fof(permutation_another_one,axiom,
! [X2,X1] : minus(X1,X2) = minus(perm(X2),perm(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',permutation_another_one) ).
fof(minus1,axiom,
! [X1,X2,X6,X7] :
( minus(X1,X2) = minus(X6,X7)
<=> minus(X1,X6) = minus(X2,X7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',minus1) ).
fof(queens_p,axiom,
( queens_p
=> ! [X1,X2] :
( ( le(X2,n)
& le(s(X1),X2)
& le(X1,n)
& le(s(n0),X1) )
=> ( minus(p(X1),X1) != minus(p(X2),X2)
& plus(p(X1),X1) != plus(p(X2),X2)
& p(X1) != p(X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',queens_p) ).
fof(permutation,axiom,
! [X1] :
( ( le(X1,n)
& le(s(n0),X1) )
=> perm(X1) = minus(s(n),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',permutation) ).
fof(c_0_10,plain,
( ! [X1,X2] :
( ( ( le(s(X1),X2)
<=> le(s(perm(X2)),perm(X1)) )
& le(X2,n)
& le(s(X1),X2)
& le(X1,n)
& le(s(n0),X1) )
=> ( minus(q(X1),X1) != minus(q(X2),X2)
& plus(q(X1),X1) != plus(q(X2),X2)
& q(X1) != q(X2) ) )
=> queens_q ),
inference(fof_simplification,[status(thm)],[queens_q]) ).
fof(c_0_11,negated_conjecture,
~ ( ( ! [X1] : q(X1) = p(perm(X1))
& queens_p )
=> queens_q ),
inference(assume_negation,[status(cth)],[queens_sym]) ).
fof(c_0_12,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) )
& ( 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
| le(esk2_0,n) )
& ( queens_q
| le(s(esk1_0),esk2_0) )
& ( queens_q
| le(esk1_0,n) )
& ( queens_q
| le(s(n0),esk1_0) ) ),
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,
! [X13] :
( ~ queens_q
& q(X13) = p(perm(X13))
& queens_p ),
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,
! [X17,X18,X19] :
( le(X17,X19)
| ~ le(X18,X19)
| ~ le(X17,X18) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[le_trans])])]) ).
cnf(c_0_15,plain,
( queens_q
| le(s(esk1_0),esk2_0) ),
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(X2,X3)
| ~ le(X1,X2)
| le(X1,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,
! [X20] : le(X20,s(X20)),
inference(variable_rename,[status(thm)],[succ_le]) ).
cnf(c_0_20,plain,
( ~ le(X1,s(esk1_0))
| le(X1,esk2_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]) ).
cnf(c_0_22,plain,
le(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,plain,
( queens_q
| le(s(n0),esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_24,plain,
! [X14] :
( ( ~ le(X14,n)
| ~ le(s(n0),X14)
| le(perm(X14),n) )
& ( ~ le(X14,n)
| ~ le(s(n0),X14)
| le(s(n0),perm(X14)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[permutation_range])])])]) ).
cnf(c_0_25,plain,
( queens_q
| le(esk2_0,n) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_26,plain,
( ~ le(X1,esk1_0)
| le(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_22]) ).
cnf(c_0_27,plain,
le(s(n0),esk1_0),
inference(sr,[status(thm)],[c_0_23,c_0_16]) ).
fof(c_0_28,plain,
! [X21,X22,X23,X24] :
( ( plus(X21,X22) = plus(X23,X24)
| minus(X21,X23) != minus(X24,X22) )
& ( minus(X21,X23) = minus(X24,X22)
| plus(X21,X22) != plus(X23,X24) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[plus1])])]) ).
fof(c_0_29,plain,
! [X15,X16] : minus(X16,X15) = minus(perm(X15),perm(X16)),
inference(variable_rename,[status(thm)],[permutation_another_one]) ).
cnf(c_0_30,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_12]) ).
cnf(c_0_31,negated_conjecture,
q(X1) = p(perm(X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_32,plain,
( ~ le(X1,n)
| ~ le(s(n0),X1)
| le(perm(X1),n) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_33,plain,
le(esk2_0,n),
inference(sr,[status(thm)],[c_0_25,c_0_16]) ).
cnf(c_0_34,plain,
le(s(n0),esk2_0),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
fof(c_0_35,plain,
! [X25,X26,X27,X28] :
( ( minus(X25,X26) = minus(X27,X28)
| minus(X25,X27) != minus(X26,X28) )
& ( minus(X25,X27) = minus(X26,X28)
| minus(X25,X26) != minus(X27,X28) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[minus1])])]) ).
cnf(c_0_36,plain,
( minus(X1,X2) != minus(X3,X4)
| plus(X1,X4) = plus(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_37,plain,
minus(X1,X2) = minus(perm(X2),perm(X1)),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_38,negated_conjecture,
( queens_q
| minus(p(perm(esk2_0)),esk2_0) = minus(p(perm(esk1_0)),esk1_0)
| plus(p(perm(esk2_0)),esk2_0) = plus(p(perm(esk1_0)),esk1_0)
| p(perm(esk2_0)) = p(perm(esk1_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)],[c_0_30,c_0_31]),c_0_31]),c_0_31]),c_0_31]),c_0_31]),c_0_31]) ).
cnf(c_0_39,plain,
le(perm(esk2_0),n),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
cnf(c_0_40,plain,
( ~ le(X1,n)
| ~ le(s(n0),X1)
| le(s(n0),perm(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_41,plain,
( queens_q
| le(esk1_0,n) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_42,plain,
( minus(X1,X2) != minus(X3,X4)
| minus(X1,X3) = minus(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_43,plain,
( minus(X1,X3) != minus(X2,X4)
| plus(X1,perm(X2)) = plus(X3,perm(X4)) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_44,negated_conjecture,
( 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) ),
inference(sr,[status(thm)],[c_0_38,c_0_16]) ).
cnf(c_0_45,plain,
plus(X1,X2) = plus(X2,X1),
inference(er,[status(thm)],[c_0_36]) ).
fof(c_0_46,plain,
( queens_p
=> ! [X1,X2] :
( ( le(X2,n)
& le(s(X1),X2)
& le(X1,n)
& le(s(n0),X1) )
=> ( minus(p(X1),X1) != minus(p(X2),X2)
& plus(p(X1),X1) != plus(p(X2),X2)
& p(X1) != p(X2) ) ) ),
inference(fof_simplification,[status(thm)],[queens_p]) ).
fof(c_0_47,plain,
! [X10] :
( perm(X10) = minus(s(n),X10)
| ~ le(X10,n)
| ~ le(s(n0),X10) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[permutation])])]) ).
cnf(c_0_48,plain,
( ~ le(s(n0),perm(esk2_0))
| le(perm(perm(esk2_0)),n) ),
inference(spm,[status(thm)],[c_0_32,c_0_39]) ).
cnf(c_0_49,plain,
le(s(n0),perm(esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_33]),c_0_34])]) ).
cnf(c_0_50,plain,
le(esk1_0,n),
inference(sr,[status(thm)],[c_0_41,c_0_16]) ).
cnf(c_0_51,plain,
( minus(X1,X3) != minus(X4,X2)
| minus(X1,perm(X2)) = minus(X3,perm(X4)) ),
inference(spm,[status(thm)],[c_0_42,c_0_37]) ).
cnf(c_0_52,plain,
( minus(X1,X3) != minus(X4,X2)
| plus(X1,perm(perm(X2))) = plus(X3,perm(perm(X4))) ),
inference(spm,[status(thm)],[c_0_43,c_0_37]) ).
cnf(c_0_53,plain,
( plus(X1,X2) != plus(X3,X4)
| minus(X1,X3) = minus(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_54,negated_conjecture,
( p(perm(esk2_0)) = p(perm(esk1_0))
| 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(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45]),c_0_45]) ).
fof(c_0_55,plain,
! [X8,X9] :
( ( ~ queens_p
| ~ le(X9,n)
| ~ le(s(X8),X9)
| ~ le(X8,n)
| ~ le(s(n0),X8)
| minus(p(X8),X8) != minus(p(X9),X9) )
& ( ~ queens_p
| ~ le(X9,n)
| ~ le(s(X8),X9)
| ~ le(X8,n)
| ~ le(s(n0),X8)
| plus(p(X8),X8) != plus(p(X9),X9) )
& ( ~ queens_p
| ~ le(X9,n)
| ~ le(s(X8),X9)
| ~ le(X8,n)
| ~ le(s(n0),X8)
| p(X8) != p(X9) ) ),
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_46])])])])]) ).
cnf(c_0_56,plain,
( ~ le(X1,n)
| ~ le(s(n0),X1)
| perm(X1) = minus(s(n),X1) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_57,plain,
le(perm(perm(esk2_0)),n),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49])]) ).
cnf(c_0_58,plain,
le(perm(esk1_0),n),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_50]),c_0_27])]) ).
cnf(c_0_59,plain,
minus(X1,perm(X2)) = minus(X2,perm(X1)),
inference(er,[status(thm)],[c_0_51]) ).
cnf(c_0_60,plain,
plus(X1,perm(perm(X2))) = plus(X2,perm(perm(X1))),
inference(er,[status(thm)],[c_0_52]) ).
cnf(c_0_61,negated_conjecture,
( plus(X1,X2) != plus(esk1_0,p(perm(esk1_0)))
| p(perm(esk2_0)) = p(perm(esk1_0))
| minus(X1,esk2_0) = minus(p(perm(esk2_0)),X2)
| minus(p(perm(esk2_0)),esk2_0) = minus(p(perm(esk1_0)),esk1_0) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_62,plain,
( ~ queens_p
| ~ le(X2,n)
| ~ le(s(X1),X2)
| ~ le(X1,n)
| ~ le(s(n0),X1)
| minus(p(X1),X1) != minus(p(X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_63,negated_conjecture,
queens_p,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_64,plain,
( ~ le(s(n0),perm(perm(esk2_0)))
| minus(s(n),perm(perm(esk2_0))) = perm(perm(perm(esk2_0))) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_65,plain,
le(s(n0),perm(perm(esk2_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_39]),c_0_49])]) ).
cnf(c_0_66,plain,
( ~ le(s(n0),perm(esk1_0))
| le(perm(perm(esk1_0)),n) ),
inference(spm,[status(thm)],[c_0_32,c_0_58]) ).
cnf(c_0_67,plain,
le(s(n0),perm(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_50]),c_0_27])]) ).
cnf(c_0_68,plain,
minus(X1,perm(perm(X2))) = minus(X1,X2),
inference(spm,[status(thm)],[c_0_37,c_0_59]) ).
cnf(c_0_69,plain,
plus(perm(perm(X1)),X2) = plus(X1,perm(perm(X2))),
inference(spm,[status(thm)],[c_0_45,c_0_60]) ).
cnf(c_0_70,negated_conjecture,
( plus(X2,X1) != plus(esk1_0,p(perm(esk1_0)))
| p(perm(esk2_0)) = p(perm(esk1_0))
| minus(X1,esk2_0) = minus(p(perm(esk2_0)),X2)
| minus(p(perm(esk2_0)),esk2_0) = minus(p(perm(esk1_0)),esk1_0) ),
inference(spm,[status(thm)],[c_0_61,c_0_45]) ).
cnf(c_0_71,plain,
( ~ le(X1,n)
| ~ le(X2,n)
| ~ le(s(X1),X2)
| ~ le(s(n0),X1)
| minus(p(X1),X1) != minus(p(X2),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_63])]) ).
cnf(c_0_72,plain,
minus(s(n),perm(perm(esk2_0))) = perm(perm(perm(esk2_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_65])]) ).
cnf(c_0_73,plain,
minus(s(n),esk2_0) = perm(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_33]),c_0_34])]) ).
cnf(c_0_74,plain,
le(perm(perm(esk1_0)),n),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_67])]) ).
cnf(c_0_75,plain,
( ~ queens_p
| ~ le(X2,n)
| ~ le(s(X1),X2)
| ~ le(X1,n)
| ~ le(s(n0),X1)
| plus(p(X1),X1) != plus(p(X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_76,plain,
( minus(X1,X3) != minus(X4,X2)
| plus(X1,X2) = plus(X3,perm(perm(X4))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_68]),c_0_69]) ).
cnf(c_0_77,negated_conjecture,
( p(perm(esk2_0)) = p(perm(esk1_0))
| minus(p(perm(esk2_0)),esk2_0) = minus(p(perm(esk1_0)),esk1_0)
| minus(p(perm(esk2_0)),esk1_0) = minus(p(perm(esk1_0)),esk2_0) ),
inference(er,[status(thm)],[c_0_70]) ).
cnf(c_0_78,plain,
( ~ le(X2,n)
| ~ le(perm(X1),n)
| ~ le(s(perm(X1)),X2)
| ~ le(s(n0),perm(X1))
| minus(X1,perm(p(perm(X1)))) != minus(p(X2),X2) ),
inference(spm,[status(thm)],[c_0_71,c_0_59]) ).
cnf(c_0_79,plain,
perm(perm(perm(esk2_0))) = perm(esk2_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_68]),c_0_73]) ).
cnf(c_0_80,plain,
( ~ le(s(n0),perm(perm(esk1_0)))
| minus(s(n),perm(perm(esk1_0))) = perm(perm(perm(esk1_0))) ),
inference(spm,[status(thm)],[c_0_56,c_0_74]) ).
cnf(c_0_81,plain,
le(s(n0),perm(perm(esk1_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_58]),c_0_67])]) ).
cnf(c_0_82,plain,
( ~ le(X1,n)
| ~ le(X2,n)
| ~ le(s(X1),X2)
| ~ le(s(n0),X1)
| plus(p(X1),X1) != plus(p(X2),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_63])]) ).
cnf(c_0_83,plain,
plus(X1,perm(perm(X2))) = plus(X2,X1),
inference(er,[status(thm)],[c_0_76]) ).
cnf(c_0_84,negated_conjecture,
( minus(p(perm(esk1_0)),esk1_0) != minus(X1,X2)
| p(perm(esk2_0)) = p(perm(esk1_0))
| minus(p(perm(esk2_0)),X1) = minus(esk2_0,X2)
| minus(p(perm(esk2_0)),esk1_0) = minus(p(perm(esk1_0)),esk2_0) ),
inference(spm,[status(thm)],[c_0_42,c_0_77]) ).
cnf(c_0_85,plain,
( minus(X3,X1) != minus(X2,X4)
| minus(perm(X1),X2) = minus(perm(X3),X4) ),
inference(spm,[status(thm)],[c_0_42,c_0_37]) ).
cnf(c_0_86,negated_conjecture,
( p(perm(esk2_0)) = p(perm(esk1_0))
| minus(p(perm(esk2_0)),esk2_0) = minus(p(perm(esk1_0)),esk1_0)
| minus(p(perm(esk2_0)),p(perm(esk1_0))) = minus(esk1_0,esk2_0) ),
inference(er,[status(thm)],[c_0_61]) ).
cnf(c_0_87,plain,
( ~ le(X1,n)
| ~ le(s(perm(esk2_0)),X1)
| minus(esk2_0,perm(p(perm(esk2_0)))) != minus(p(X1),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_37]),c_0_59]),c_0_49]),c_0_39])]) ).
cnf(c_0_88,plain,
minus(s(n),perm(perm(esk1_0))) = perm(perm(perm(esk1_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_81])]) ).
cnf(c_0_89,plain,
minus(s(n),esk1_0) = perm(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_50]),c_0_27])]) ).
cnf(c_0_90,plain,
( ~ le(s(esk1_0),esk2_0)
| queens_q
| le(s(perm(esk2_0)),perm(esk1_0)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_91,plain,
( ~ le(X1,n)
| ~ le(X2,n)
| ~ le(s(X1),X2)
| ~ le(s(n0),X1)
| plus(X1,p(X1)) != plus(X2,p(X2)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_82,c_0_45]),c_0_45]) ).
cnf(c_0_92,plain,
plus(perm(perm(X1)),X2) = plus(X2,X1),
inference(rw,[status(thm)],[c_0_69,c_0_83]) ).
cnf(c_0_93,negated_conjecture,
( p(perm(esk2_0)) = p(perm(esk1_0))
| minus(p(perm(esk2_0)),esk1_0) = minus(p(perm(esk1_0)),esk2_0)
| minus(p(perm(esk2_0)),p(perm(esk1_0))) = minus(esk2_0,esk1_0) ),
inference(er,[status(thm)],[c_0_84]) ).
cnf(c_0_94,plain,
( minus(X3,X1) != minus(X4,X2)
| plus(perm(X1),X2) = plus(perm(X3),X4) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_95,plain,
minus(perm(X1),X2) = minus(perm(X2),X1),
inference(er,[status(thm)],[c_0_85]) ).
cnf(c_0_96,plain,
( minus(X3,perm(X1)) != minus(X2,X4)
| plus(X1,perm(X2)) = plus(perm(X3),perm(X4)) ),
inference(spm,[status(thm)],[c_0_43,c_0_59]) ).
cnf(c_0_97,negated_conjecture,
( minus(X1,X2) != minus(esk1_0,esk2_0)
| p(perm(esk2_0)) = p(perm(esk1_0))
| minus(p(perm(esk2_0)),esk2_0) = minus(p(perm(esk1_0)),esk1_0)
| minus(X1,perm(p(perm(esk1_0)))) = minus(X2,perm(p(perm(esk2_0)))) ),
inference(spm,[status(thm)],[c_0_51,c_0_86]) ).
cnf(c_0_98,plain,
( ~ le(perm(perm(X1)),n)
| ~ le(s(perm(esk2_0)),perm(perm(X1)))
| minus(p(perm(perm(X1))),X1) != minus(esk2_0,perm(p(perm(esk2_0)))) ),
inference(spm,[status(thm)],[c_0_87,c_0_68]) ).
cnf(c_0_99,plain,
perm(perm(perm(esk1_0))) = perm(esk1_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_88,c_0_68]),c_0_89]) ).
cnf(c_0_100,plain,
le(s(perm(esk2_0)),perm(esk1_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_90,c_0_18])]),c_0_16]) ).
cnf(c_0_101,plain,
( ~ le(X1,n)
| ~ le(s(n0),X1)
| ~ le(perm(perm(X2)),n)
| ~ le(s(X1),perm(perm(X2)))
| plus(X1,p(X1)) != plus(X2,p(perm(perm(X2)))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_45]) ).
cnf(c_0_102,negated_conjecture,
( minus(esk2_0,esk1_0) != minus(X1,X2)
| p(perm(esk2_0)) = p(perm(esk1_0))
| minus(p(perm(esk2_0)),esk1_0) = minus(p(perm(esk1_0)),esk2_0)
| plus(p(perm(esk2_0)),perm(X1)) = plus(p(perm(esk1_0)),perm(X2)) ),
inference(spm,[status(thm)],[c_0_43,c_0_93]) ).
cnf(c_0_103,plain,
( minus(X3,X1) != minus(perm(X2),X4)
| plus(perm(X1),X2) = plus(perm(X3),perm(X4)) ),
inference(spm,[status(thm)],[c_0_94,c_0_95]) ).
cnf(c_0_104,plain,
plus(perm(X1),perm(perm(X2))) = plus(X2,perm(X1)),
inference(er,[status(thm)],[c_0_96]) ).
cnf(c_0_105,negated_conjecture,
( p(perm(esk2_0)) = p(perm(esk1_0))
| minus(p(perm(esk2_0)),esk2_0) = minus(p(perm(esk1_0)),esk1_0)
| minus(esk2_0,perm(p(perm(esk2_0)))) = minus(esk1_0,perm(p(perm(esk1_0)))) ),
inference(er,[status(thm)],[c_0_97]) ).
cnf(c_0_106,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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_59]),c_0_100]),c_0_58])]) ).
cnf(c_0_107,plain,
( ~ le(X1,n)
| ~ le(s(n0),X1)
| ~ le(s(X1),perm(esk1_0))
| plus(X1,p(X1)) != plus(perm(esk1_0),p(perm(esk1_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_99]),c_0_58])]) ).
cnf(c_0_108,negated_conjecture,
( p(perm(esk2_0)) = p(perm(esk1_0))
| minus(p(perm(esk2_0)),esk1_0) = minus(p(perm(esk1_0)),esk2_0)
| plus(perm(esk2_0),p(perm(esk2_0))) = plus(perm(esk1_0),p(perm(esk1_0))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_102]),c_0_45]),c_0_45]) ).
cnf(c_0_109,plain,
( minus(X2,X1) != minus(perm(esk1_0),X3)
| plus(esk1_0,perm(X1)) = plus(perm(X2),perm(X3)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_99]),c_0_104]) ).
cnf(c_0_110,negated_conjecture,
( p(perm(esk2_0)) = p(perm(esk1_0))
| minus(p(perm(esk2_0)),esk2_0) = minus(p(perm(esk1_0)),esk1_0) ),
inference(sr,[status(thm)],[c_0_105,c_0_106]) ).
cnf(c_0_111,plain,
( minus(X2,X1) != minus(perm(esk2_0),X3)
| plus(esk2_0,perm(X1)) = plus(perm(X2),perm(X3)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_79]),c_0_104]) ).
cnf(c_0_112,negated_conjecture,
( p(perm(esk2_0)) = p(perm(esk1_0))
| minus(p(perm(esk2_0)),esk1_0) = minus(p(perm(esk1_0)),esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_100]),c_0_49]),c_0_39])]) ).
cnf(c_0_113,negated_conjecture,
( minus(p(perm(esk1_0)),esk1_0) != minus(perm(esk1_0),X1)
| p(perm(esk2_0)) = p(perm(esk1_0))
| plus(perm(p(perm(esk2_0))),perm(X1)) = plus(esk1_0,perm(esk2_0)) ),
inference(spm,[status(thm)],[c_0_109,c_0_110]) ).
cnf(c_0_114,negated_conjecture,
( minus(p(perm(esk1_0)),esk2_0) != minus(perm(esk2_0),X1)
| p(perm(esk2_0)) = p(perm(esk1_0))
| plus(perm(p(perm(esk2_0))),perm(X1)) = plus(esk2_0,perm(esk1_0)) ),
inference(spm,[status(thm)],[c_0_111,c_0_112]) ).
cnf(c_0_115,negated_conjecture,
( minus(p(perm(esk1_0)),esk1_0) != minus(X1,esk1_0)
| p(perm(esk2_0)) = p(perm(esk1_0))
| plus(X1,perm(p(perm(esk2_0)))) = plus(esk1_0,perm(esk2_0)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_59]),c_0_83]),c_0_68]) ).
cnf(c_0_116,negated_conjecture,
( minus(p(perm(esk1_0)),esk2_0) != minus(X1,esk2_0)
| p(perm(esk2_0)) = p(perm(esk1_0))
| plus(X1,perm(p(perm(esk2_0)))) = plus(esk2_0,perm(esk1_0)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_59]),c_0_83]),c_0_68]) ).
cnf(c_0_117,negated_conjecture,
( p(perm(esk2_0)) = p(perm(esk1_0))
| plus(p(perm(esk1_0)),perm(p(perm(esk2_0)))) = plus(esk1_0,perm(esk2_0)) ),
inference(er,[status(thm)],[c_0_115]) ).
cnf(c_0_118,negated_conjecture,
( p(perm(esk2_0)) = p(perm(esk1_0))
| plus(p(perm(esk1_0)),perm(p(perm(esk2_0)))) = plus(esk2_0,perm(esk1_0)) ),
inference(er,[status(thm)],[c_0_116]) ).
cnf(c_0_119,negated_conjecture,
( p(perm(esk2_0)) = p(perm(esk1_0))
| plus(esk2_0,perm(esk1_0)) = plus(esk1_0,perm(esk2_0)) ),
inference(spm,[status(thm)],[c_0_117,c_0_118]) ).
cnf(c_0_120,plain,
( ~ queens_p
| ~ le(X2,n)
| ~ le(s(X1),X2)
| ~ le(X1,n)
| ~ le(s(n0),X1)
| p(X1) != p(X2) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_121,negated_conjecture,
( plus(X1,X2) != plus(esk1_0,perm(esk2_0))
| minus(X1,esk2_0) = minus(perm(esk1_0),X2)
| p(perm(esk2_0)) = p(perm(esk1_0)) ),
inference(spm,[status(thm)],[c_0_53,c_0_119]) ).
cnf(c_0_122,plain,
( ~ le(X1,n)
| ~ le(X2,n)
| ~ le(s(X1),X2)
| ~ le(s(n0),X1)
| p(X1) != p(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_120,c_0_63])]) ).
cnf(c_0_123,negated_conjecture,
( p(perm(esk2_0)) = p(perm(esk1_0))
| minus(esk2_0,esk1_0) = minus(esk1_0,esk2_0) ),
inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_121]),c_0_37]) ).
cnf(c_0_124,negated_conjecture,
( ~ le(X1,n)
| ~ le(s(perm(esk2_0)),X1)
| p(perm(esk1_0)) != p(X1)
| minus(esk2_0,esk1_0) = minus(esk1_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_123]),c_0_49]),c_0_39])]) ).
cnf(c_0_125,negated_conjecture,
minus(esk2_0,esk1_0) = minus(esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_124]),c_0_100]),c_0_58])]) ).
cnf(c_0_126,negated_conjecture,
( minus(esk1_0,esk2_0) != minus(X1,X2)
| plus(esk2_0,perm(X1)) = plus(esk1_0,perm(X2)) ),
inference(spm,[status(thm)],[c_0_43,c_0_125]) ).
cnf(c_0_127,plain,
( plus(X1,X4) != plus(X3,X2)
| minus(X1,X2) = minus(X3,X4) ),
inference(spm,[status(thm)],[c_0_53,c_0_45]) ).
cnf(c_0_128,negated_conjecture,
plus(esk2_0,perm(esk1_0)) = plus(esk1_0,perm(esk2_0)),
inference(er,[status(thm)],[c_0_126]) ).
cnf(c_0_129,negated_conjecture,
( plus(esk1_0,perm(esk2_0)) != plus(X2,X1)
| minus(esk2_0,X1) = minus(X2,perm(esk1_0)) ),
inference(spm,[status(thm)],[c_0_127,c_0_128]) ).
cnf(c_0_130,negated_conjecture,
p(perm(esk2_0)) = p(perm(esk1_0)),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_129,c_0_117]),c_0_59]),c_0_106]) ).
cnf(c_0_131,negated_conjecture,
( ~ le(X1,n)
| ~ le(s(perm(esk2_0)),X1)
| p(perm(esk1_0)) != p(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_130]),c_0_49]),c_0_39])]) ).
cnf(c_0_132,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_131]),c_0_100]),c_0_58])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PUZ133+2 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n020.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 03:53:02 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 15.12/2.64 % Version: 3.5.1
% 15.12/2.64 % Preprocessing class: FSMSSLSSSSSNFFN.
% 15.12/2.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.12/2.64 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 15.12/2.64 % Starting new_bool_3 with 300s (1) cores
% 15.12/2.64 % Starting new_bool_1 with 300s (1) cores
% 15.12/2.64 % Starting sh5l with 300s (1) cores
% 15.12/2.64 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 1942024 completed with status 0
% 15.12/2.64 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 15.12/2.64 % Preprocessing class: FSMSSLSSSSSNFFN.
% 15.12/2.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.12/2.64 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 15.12/2.64 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 15.12/2.64 % No SInE strategy applied
% 15.12/2.64 % Search class: FGHSS-FFMM21-MFFFFFNN
% 15.12/2.64 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 15.12/2.64 % Starting SubtermCWHack with 136s (1) cores
% 15.12/2.64 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 151s (1) cores
% 15.12/2.64 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 15.12/2.64 % Starting new_bool_3 with 136s (1) cores
% 15.12/2.64 % Starting new_bool_1 with 136s (1) cores
% 15.12/2.64 % new_bool_3 with pid 1942032 completed with status 0
% 15.12/2.64 % Result found by new_bool_3
% 15.12/2.64 % Preprocessing class: FSMSSLSSSSSNFFN.
% 15.12/2.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.12/2.64 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 15.12/2.64 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 15.12/2.64 % No SInE strategy applied
% 15.12/2.64 % Search class: FGHSS-FFMM21-MFFFFFNN
% 15.12/2.64 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 15.12/2.64 % Starting SubtermCWHack with 136s (1) cores
% 15.12/2.64 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 151s (1) cores
% 15.12/2.64 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 15.12/2.64 % Starting new_bool_3 with 136s (1) cores
% 15.12/2.64 % Preprocessing time : 0.001 s
% 15.12/2.64 % Presaturation interreduction done
% 15.12/2.64
% 15.12/2.64 % Proof found!
% 15.12/2.64 % SZS status Theorem
% 15.12/2.64 % SZS output start CNFRefutation
% See solution above
% 15.12/2.64 % Parsed axioms : 10
% 15.12/2.64 % Removed by relevancy pruning/SinE : 0
% 15.12/2.64 % Initial clauses : 23
% 15.12/2.64 % Removed in clause preprocessing : 1
% 15.12/2.64 % Initial clauses in saturation : 22
% 15.12/2.64 % Processed clauses : 18655
% 15.12/2.64 % ...of these trivial : 344
% 15.12/2.64 % ...subsumed : 14671
% 15.12/2.64 % ...remaining for further processing : 3640
% 15.12/2.64 % Other redundant clauses eliminated : 0
% 15.12/2.64 % Clauses deleted for lack of memory : 0
% 15.12/2.64 % Backward-subsumed : 1451
% 15.12/2.64 % Backward-rewritten : 486
% 15.12/2.64 % Generated clauses : 30298
% 15.12/2.64 % ...of the previous two non-redundant : 29585
% 15.12/2.64 % ...aggressively subsumed : 0
% 15.12/2.64 % Contextual simplify-reflections : 1
% 15.12/2.64 % Paramodulations : 29849
% 15.12/2.64 % Factorizations : 0
% 15.12/2.64 % NegExts : 0
% 15.12/2.64 % Equation resolutions : 448
% 15.12/2.64 % Disequality decompositions : 0
% 15.12/2.64 % Total rewrite steps : 25464
% 15.12/2.64 % ...of those cached : 24133
% 15.12/2.64 % Propositional unsat checks : 0
% 15.12/2.64 % Propositional check models : 0
% 15.12/2.64 % Propositional check unsatisfiable : 0
% 15.12/2.64 % Propositional clauses : 0
% 15.12/2.64 % Propositional clauses after purity: 0
% 15.12/2.64 % Propositional unsat core size : 0
% 15.12/2.64 % Propositional preprocessing time : 0.000
% 15.12/2.64 % Propositional encoding time : 0.000
% 15.12/2.64 % Propositional solver time : 0.000
% 15.12/2.64 % Success case prop preproc time : 0.000
% 15.12/2.64 % Success case prop encoding time : 0.000
% 15.12/2.64 % Success case prop solver time : 0.000
% 15.12/2.64 % Current number of processed clauses : 1682
% 15.12/2.64 % Positive orientable unit clauses : 256
% 15.12/2.64 % Positive unorientable unit clauses: 5
% 15.12/2.64 % Negative unit clauses : 17
% 15.12/2.64 % Non-unit-clauses : 1404
% 15.12/2.64 % Current number of unprocessed clauses: 8429
% 15.12/2.64 % ...number of literals in the above : 26083
% 15.12/2.64 % Current number of archived formulas : 0
% 15.12/2.64 % Current number of archived clauses : 1959
% 15.12/2.64 % Clause-clause subsumption calls (NU) : 2435300
% 15.12/2.64 % Rec. Clause-clause subsumption calls : 1252813
% 15.12/2.64 % Non-unit clause-clause subsumptions : 15565
% 15.12/2.64 % Unit Clause-clause subsumption calls : 8704
% 15.12/2.64 % Rewrite failures with RHS unbound : 135
% 15.12/2.64 % BW rewrite match attempts : 2803
% 15.12/2.64 % BW rewrite match successes : 137
% 15.12/2.64 % Condensation attempts : 0
% 15.12/2.64 % Condensation successes : 0
% 15.12/2.64 % Termbank termtop insertions : 624682
% 15.12/2.64 % Search garbage collected termcells : 362
% 15.12/2.64
% 15.12/2.64 % -------------------------------------------------
% 15.12/2.64 % User time : 2.138 s
% 15.12/2.64 % System time : 0.021 s
% 15.12/2.64 % Total time : 2.159 s
% 15.12/2.64 % Maximum resident set size: 3644 pages
% 15.12/2.64
% 15.12/2.64 % -------------------------------------------------
% 15.12/2.64 % User time : 10.633 s
% 15.12/2.64 % System time : 0.238 s
% 15.12/2.64 % Total time : 10.871 s
% 15.12/2.64 % Maximum resident set size: 4864 pages
% 15.12/2.64 % E exiting
%------------------------------------------------------------------------------