TSTP Solution File: NUM529+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM529+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n019.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 09:33:27 EDT 2022
% Result : Theorem 0.54s 46.73s
% Output : CNFRefutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 15
% Syntax : Number of formulae : 65 ( 28 unt; 0 def)
% Number of atoms : 248 ( 115 equ)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 305 ( 122 ~; 129 |; 36 &)
% ( 2 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 65 ( 1 sgn 35 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__2963,hypothesis,
! [X1,X2,X3] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2)
& aNaturalNumber0(X3)
& X1 != sz00
& X2 != sz00
& X3 != sz00 )
=> ( sdtasdt0(X3,sdtasdt0(X2,X2)) = sdtasdt0(X1,X1)
=> ( iLess0(X1,xn)
=> ~ isPrime0(X3) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__2963) ).
fof(mDefPrime,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( isPrime0(X1)
<=> ( X1 != sz00
& X1 != sz10
& ! [X2] :
( ( aNaturalNumber0(X2)
& doDivides0(X2,X1) )
=> ( X2 = sz10
| X2 = X1 ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mDefPrime) ).
fof(mDefQuot,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( ( X1 != sz00
& doDivides0(X1,X2) )
=> ! [X3] :
( X3 = sdtsldt0(X2,X1)
<=> ( aNaturalNumber0(X3)
& X2 = sdtasdt0(X1,X3) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mDefQuot) ).
fof(m__3059,hypothesis,
xq = sdtsldt0(xn,xp),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__3059) ).
fof(m__3046,hypothesis,
( doDivides0(xp,sdtasdt0(xn,xn))
& doDivides0(xp,xn) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__3046) ).
fof(m__2987,hypothesis,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xp)
& xn != sz00
& xm != sz00
& xp != sz00 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__2987) ).
fof(m__3082,hypothesis,
sdtasdt0(xm,xm) = sdtasdt0(xp,sdtasdt0(xq,xq)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__3082) ).
fof(m__3025,hypothesis,
isPrime0(xp),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__3025) ).
fof(mIH_03,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( ( X1 != X2
& sdtlseqdt0(X1,X2) )
=> iLess0(X1,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mIH_03) ).
fof(mMulComm,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mMulComm) ).
fof(m_MulZero,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( sdtasdt0(X1,sz00) = sz00
& sz00 = sdtasdt0(sz00,X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m_MulZero) ).
fof(m__3124,hypothesis,
( xm != xn
& sdtlseqdt0(xm,xn) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__3124) ).
fof(mMulCanc,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( X1 != sz00
=> ! [X2,X3] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> ( ( sdtasdt0(X1,X2) = sdtasdt0(X1,X3)
| sdtasdt0(X2,X1) = sdtasdt0(X3,X1) )
=> X2 = X3 ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mMulCanc) ).
fof(m_MulUnit,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( sdtasdt0(X1,sz10) = X1
& X1 = sdtasdt0(sz10,X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m_MulUnit) ).
fof(mSortsC_01,axiom,
( aNaturalNumber0(sz10)
& sz10 != sz00 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mSortsC_01) ).
fof(c_0_15,hypothesis,
! [X4,X5,X6] :
( ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6)
| X4 = sz00
| X5 = sz00
| X6 = sz00
| sdtasdt0(X6,sdtasdt0(X5,X5)) != sdtasdt0(X4,X4)
| ~ iLess0(X4,xn)
| ~ isPrime0(X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[m__2963])])]) ).
fof(c_0_16,plain,
! [X3,X4] :
( ( X3 != sz00
| ~ isPrime0(X3)
| ~ aNaturalNumber0(X3) )
& ( X3 != sz10
| ~ isPrime0(X3)
| ~ aNaturalNumber0(X3) )
& ( ~ aNaturalNumber0(X4)
| ~ doDivides0(X4,X3)
| X4 = sz10
| X4 = X3
| ~ isPrime0(X3)
| ~ aNaturalNumber0(X3) )
& ( aNaturalNumber0(esk3_1(X3))
| X3 = sz00
| X3 = sz10
| isPrime0(X3)
| ~ aNaturalNumber0(X3) )
& ( doDivides0(esk3_1(X3),X3)
| X3 = sz00
| X3 = sz10
| isPrime0(X3)
| ~ aNaturalNumber0(X3) )
& ( esk3_1(X3) != sz10
| X3 = sz00
| X3 = sz10
| isPrime0(X3)
| ~ aNaturalNumber0(X3) )
& ( esk3_1(X3) != X3
| X3 = sz00
| X3 = sz10
| isPrime0(X3)
| ~ aNaturalNumber0(X3) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[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)],[mDefPrime])])])])])])]) ).
fof(c_0_17,plain,
! [X4,X5,X6,X6] :
( ( aNaturalNumber0(X6)
| X6 != sdtsldt0(X5,X4)
| X4 = sz00
| ~ doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( X5 = sdtasdt0(X4,X6)
| X6 != sdtsldt0(X5,X4)
| X4 = sz00
| ~ doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( ~ aNaturalNumber0(X6)
| X5 != sdtasdt0(X4,X6)
| X6 = sdtsldt0(X5,X4)
| X4 = sz00
| ~ doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) ) ),
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)],[mDefQuot])])])])])]) ).
cnf(c_0_18,hypothesis,
( X1 = sz00
| X3 = sz00
| X2 = sz00
| ~ isPrime0(X1)
| ~ iLess0(X2,xn)
| sdtasdt0(X1,sdtasdt0(X3,X3)) != sdtasdt0(X2,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
( ~ aNaturalNumber0(X1)
| ~ isPrime0(X1)
| X1 != sz00 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
( X2 = sz00
| aNaturalNumber0(X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X2,X1)
| X3 != sdtsldt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,hypothesis,
xq = sdtsldt0(xn,xp),
inference(split_conjunct,[status(thm)],[m__3059]) ).
cnf(c_0_22,hypothesis,
doDivides0(xp,xn),
inference(split_conjunct,[status(thm)],[m__3046]) ).
cnf(c_0_23,hypothesis,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[m__2987]) ).
cnf(c_0_24,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__2987]) ).
cnf(c_0_25,hypothesis,
xp != sz00,
inference(split_conjunct,[status(thm)],[m__2987]) ).
cnf(c_0_26,hypothesis,
( X1 = sz00
| X2 = sz00
| sdtasdt0(X3,sdtasdt0(X2,X2)) != sdtasdt0(X1,X1)
| ~ isPrime0(X3)
| ~ iLess0(X1,xn)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3) ),
inference(csr,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_27,hypothesis,
sdtasdt0(xm,xm) = sdtasdt0(xp,sdtasdt0(xq,xq)),
inference(split_conjunct,[status(thm)],[m__3082]) ).
cnf(c_0_28,hypothesis,
isPrime0(xp),
inference(split_conjunct,[status(thm)],[m__3025]) ).
cnf(c_0_29,hypothesis,
( aNaturalNumber0(X1)
| X1 != xq ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23]),c_0_24])]),c_0_25]) ).
fof(c_0_30,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| X3 = X4
| ~ sdtlseqdt0(X3,X4)
| iLess0(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIH_03])]) ).
fof(c_0_31,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| sdtasdt0(X3,X4) = sdtasdt0(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])]) ).
cnf(c_0_32,plain,
( X2 = sz00
| X1 = sdtasdt0(X2,X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X2,X1)
| X3 != sdtsldt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_33,plain,
! [X2] :
( ( sdtasdt0(X2,sz00) = sz00
| ~ aNaturalNumber0(X2) )
& ( sz00 = sdtasdt0(sz00,X2)
| ~ aNaturalNumber0(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_MulZero])])]) ).
cnf(c_0_34,hypothesis,
( sz00 = xq
| X1 = sz00
| sdtasdt0(xm,xm) != sdtasdt0(X1,X1)
| ~ iLess0(X1,xn)
| ~ aNaturalNumber0(xq)
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_23])]) ).
cnf(c_0_35,hypothesis,
aNaturalNumber0(xq),
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_36,plain,
( iLess0(X1,X2)
| X1 = X2
| ~ sdtlseqdt0(X1,X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_37,hypothesis,
sdtlseqdt0(xm,xn),
inference(split_conjunct,[status(thm)],[m__3124]) ).
cnf(c_0_38,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__2987]) ).
cnf(c_0_39,hypothesis,
xm != xn,
inference(split_conjunct,[status(thm)],[m__3124]) ).
fof(c_0_40,plain,
! [X4,X5,X6] :
( ( sdtasdt0(X4,X5) != sdtasdt0(X4,X6)
| X5 = X6
| ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6)
| X4 = sz00
| ~ aNaturalNumber0(X4) )
& ( sdtasdt0(X5,X4) != sdtasdt0(X6,X4)
| X5 = X6
| ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6)
| X4 = sz00
| ~ aNaturalNumber0(X4) ) ),
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)],[mMulCanc])])])])])]) ).
cnf(c_0_41,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
fof(c_0_42,plain,
! [X2] :
( ( sdtasdt0(X2,sz10) = X2
| ~ aNaturalNumber0(X2) )
& ( X2 = sdtasdt0(sz10,X2)
| ~ aNaturalNumber0(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_MulUnit])])]) ).
cnf(c_0_43,hypothesis,
( sdtasdt0(xp,X1) = xn
| X1 != xq ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_21]),c_0_22]),c_0_23]),c_0_24])]),c_0_25]) ).
cnf(c_0_44,plain,
( sdtasdt0(X1,sz00) = sz00
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_45,hypothesis,
( sz00 = xq
| X1 = sz00
| sdtasdt0(xm,xm) != sdtasdt0(X1,X1)
| ~ iLess0(X1,xn)
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]) ).
cnf(c_0_46,hypothesis,
iLess0(xm,xn),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_24]),c_0_38])]),c_0_39]) ).
cnf(c_0_47,hypothesis,
xm != sz00,
inference(split_conjunct,[status(thm)],[m__2987]) ).
cnf(c_0_48,plain,
( X1 = sz00
| X3 = X2
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| sdtasdt0(X3,X1) != sdtasdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_49,plain,
aNaturalNumber0(sz10),
inference(split_conjunct,[status(thm)],[mSortsC_01]) ).
cnf(c_0_50,hypothesis,
( sdtasdt0(X1,xp) = sdtasdt0(xp,X1)
| ~ aNaturalNumber0(X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_23]) ).
cnf(c_0_51,plain,
( X1 = sdtasdt0(sz10,X1)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_52,plain,
( ~ aNaturalNumber0(X1)
| ~ isPrime0(X1)
| X1 != sz10 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_53,hypothesis,
sdtasdt0(xp,xq) = xn,
inference(er,[status(thm)],[c_0_43]) ).
cnf(c_0_54,hypothesis,
sdtasdt0(xp,sz00) = sz00,
inference(spm,[status(thm)],[c_0_44,c_0_23]) ).
cnf(c_0_55,hypothesis,
sz00 = xq,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_38])]),c_0_47]) ).
cnf(c_0_56,plain,
( X1 = sz10
| X2 = sz00
| sdtasdt0(X1,X2) != sdtasdt0(sz10,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_57,hypothesis,
sdtasdt0(xp,xn) = sdtasdt0(xn,xp),
inference(spm,[status(thm)],[c_0_50,c_0_24]) ).
cnf(c_0_58,hypothesis,
sdtasdt0(sz10,xn) = xn,
inference(spm,[status(thm)],[c_0_51,c_0_24]) ).
cnf(c_0_59,hypothesis,
xp != sz10,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_28]),c_0_23])]) ).
cnf(c_0_60,hypothesis,
xn != sz00,
inference(split_conjunct,[status(thm)],[m__2987]) ).
cnf(c_0_61,hypothesis,
sdtasdt0(xq,xp) = xn,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_35]),c_0_53]) ).
cnf(c_0_62,hypothesis,
xq = xn,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55]),c_0_53]),c_0_55]) ).
cnf(c_0_63,hypothesis,
sdtasdt0(xn,xp) != xn,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58]),c_0_23]),c_0_24])]),c_0_59]),c_0_60]) ).
cnf(c_0_64,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_62]),c_0_63]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM529+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jul 7 05:12:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.38/23.41 eprover: CPU time limit exceeded, terminating
% 0.38/23.41 eprover: CPU time limit exceeded, terminating
% 0.38/23.42 eprover: CPU time limit exceeded, terminating
% 0.38/23.43 eprover: CPU time limit exceeded, terminating
% 0.54/46.42 eprover: CPU time limit exceeded, terminating
% 0.54/46.43 eprover: CPU time limit exceeded, terminating
% 0.54/46.45 eprover: CPU time limit exceeded, terminating
% 0.54/46.46 eprover: CPU time limit exceeded, terminating
% 0.54/46.73 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.54/46.73
% 0.54/46.73 # Failure: Resource limit exceeded (time)
% 0.54/46.73 # OLD status Res
% 0.54/46.73 # Preprocessing time : 0.019 s
% 0.54/46.73 # Running protocol protocol_eprover_f6eb5f7f05126ea361481ae651a4823314e3d740 for 23 seconds:
% 0.54/46.73
% 0.54/46.73 # Failure: Resource limit exceeded (time)
% 0.54/46.73 # OLD status Res
% 0.54/46.73 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,20000,1.0)
% 0.54/46.73 # Preprocessing time : 0.010 s
% 0.54/46.73 # Running protocol protocol_eprover_a172c605141d0894bf6fdc293a5220c6c2a32117 for 23 seconds:
% 0.54/46.73 # Preprocessing time : 0.010 s
% 0.54/46.73
% 0.54/46.73 # Proof found!
% 0.54/46.73 # SZS status Theorem
% 0.54/46.73 # SZS output start CNFRefutation
% See solution above
% 0.54/46.73 # Proof object total steps : 65
% 0.54/46.73 # Proof object clause steps : 42
% 0.54/46.73 # Proof object formula steps : 23
% 0.54/46.73 # Proof object conjectures : 0
% 0.54/46.73 # Proof object clause conjectures : 0
% 0.54/46.73 # Proof object formula conjectures : 0
% 0.54/46.73 # Proof object initial clauses used : 23
% 0.54/46.73 # Proof object initial formulas used : 15
% 0.54/46.73 # Proof object generating inferences : 15
% 0.54/46.73 # Proof object simplifying inferences : 37
% 0.54/46.73 # Training examples: 0 positive, 0 negative
% 0.54/46.73 # Parsed axioms : 48
% 0.54/46.73 # Removed by relevancy pruning/SinE : 0
% 0.54/46.73 # Initial clauses : 87
% 0.54/46.73 # Removed in clause preprocessing : 4
% 0.54/46.73 # Initial clauses in saturation : 83
% 0.54/46.73 # Processed clauses : 652
% 0.54/46.73 # ...of these trivial : 21
% 0.54/46.73 # ...subsumed : 112
% 0.54/46.73 # ...remaining for further processing : 519
% 0.54/46.73 # Other redundant clauses eliminated : 1
% 0.54/46.73 # Clauses deleted for lack of memory : 0
% 0.54/46.73 # Backward-subsumed : 4
% 0.54/46.73 # Backward-rewritten : 246
% 0.54/46.73 # Generated clauses : 2926
% 0.54/46.73 # ...of the previous two non-trivial : 2773
% 0.54/46.73 # Contextual simplify-reflections : 18
% 0.54/46.73 # Paramodulations : 2876
% 0.54/46.73 # Factorizations : 1
% 0.54/46.73 # Equation resolutions : 47
% 0.54/46.73 # Current number of processed clauses : 266
% 0.54/46.73 # Positive orientable unit clauses : 69
% 0.54/46.73 # Positive unorientable unit clauses: 0
% 0.54/46.73 # Negative unit clauses : 8
% 0.54/46.73 # Non-unit-clauses : 189
% 0.54/46.73 # Current number of unprocessed clauses: 970
% 0.54/46.73 # ...number of literals in the above : 3077
% 0.54/46.73 # Current number of archived formulas : 0
% 0.54/46.73 # Current number of archived clauses : 252
% 0.54/46.73 # Clause-clause subsumption calls (NU) : 5222
% 0.54/46.73 # Rec. Clause-clause subsumption calls : 2383
% 0.54/46.73 # Non-unit clause-clause subsumptions : 51
% 0.54/46.73 # Unit Clause-clause subsumption calls : 2862
% 0.54/46.73 # Rewrite failures with RHS unbound : 0
% 0.54/46.73 # BW rewrite match attempts : 9
% 0.54/46.73 # BW rewrite match successes : 9
% 0.54/46.73 # Condensation attempts : 0
% 0.54/46.73 # Condensation successes : 0
% 0.54/46.73 # Termbank termtop insertions : 57481
% 0.54/46.73
% 0.54/46.73 # -------------------------------------------------
% 0.54/46.73 # User time : 0.040 s
% 0.54/46.73 # System time : 0.001 s
% 0.54/46.73 # Total time : 0.041 s
% 0.54/46.73 # Maximum resident set size: 5696 pages
% 0.57/69.44 eprover: CPU time limit exceeded, terminating
% 0.57/69.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.57/69.45 eprover: No such file or directory
% 0.57/69.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.57/69.46 eprover: No such file or directory
% 0.57/69.46 eprover: CPU time limit exceeded, terminating
% 0.57/69.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.57/69.46 eprover: No such file or directory
% 0.57/69.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.57/69.46 eprover: No such file or directory
% 0.57/69.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.57/69.47 eprover: No such file or directory
% 0.57/69.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.57/69.47 eprover: No such file or directory
% 0.57/69.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.57/69.47 eprover: No such file or directory
% 0.57/69.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.57/69.48 eprover: No such file or directory
% 0.57/69.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.57/69.48 eprover: No such file or directory
% 0.57/69.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.57/69.48 eprover: No such file or directory
% 0.57/69.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.57/69.48 eprover: No such file or directory
% 0.57/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.57/69.49 eprover: No such file or directory
% 0.57/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.57/69.49 eprover: No such file or directory
% 0.57/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.57/69.49 eprover: No such file or directory
% 0.57/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.57/69.49 eprover: No such file or directory
% 0.57/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.57/69.49 eprover: No such file or directory
% 0.57/69.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.57/69.50 eprover: No such file or directory
% 0.57/69.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.57/69.50 eprover: No such file or directory
%------------------------------------------------------------------------------