%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM524+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n004.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 01:49:25 PM UTC 2026
% Result : Theorem 1.68s 0.65s
% Output : CNFRefutation 1.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 54 ( 22 unt; 0 def)
% Number of atoms : 209 ( 85 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 247 ( 92 ~; 82 |; 49 &)
% ( 3 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 68 ( 0 sgn 42 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mMulCanc,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( X1 != sz00
=> ! [X2,X3] :
( ( aNaturalNumber0(X3)
& aNaturalNumber0(X2) )
=> ( ( sdtasdt0(X2,X1) = sdtasdt0(X3,X1)
| sdtasdt0(X1,X2) = sdtasdt0(X1,X3) )
=> X2 = X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulCanc) ).
fof(m__2987,hypothesis,
( xp != sz00
& xm != sz00
& xn != sz00
& aNaturalNumber0(xp)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2987) ).
fof(m__,conjecture,
sdtasdt0(xm,xm) = sdtasdt0(xp,sdtasdt0(xq,xq)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__3046,hypothesis,
( doDivides0(xp,xn)
& ? [X1] :
( xn = sdtasdt0(xp,X1)
& aNaturalNumber0(X1) )
& doDivides0(xp,sdtasdt0(xn,xn))
& ? [X1] :
( sdtasdt0(xn,xn) = sdtasdt0(xp,X1)
& aNaturalNumber0(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3046) ).
fof(mDefQuot,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( doDivides0(X1,X2)
& X1 != sz00 )
=> ! [X3] :
( X3 = sdtsldt0(X2,X1)
<=> ( X2 = sdtasdt0(X1,X3)
& aNaturalNumber0(X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefQuot) ).
fof(mDefDiv,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( doDivides0(X1,X2)
<=> ? [X3] :
( X2 = sdtasdt0(X1,X3)
& aNaturalNumber0(X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefDiv) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB_02) ).
fof(mMulAsso,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X3)
& aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulAsso) ).
fof(m__3059,hypothesis,
( xq = sdtsldt0(xn,xp)
& xn = sdtasdt0(xp,xq)
& aNaturalNumber0(xq) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3059) ).
fof(m__3014,hypothesis,
sdtasdt0(xp,sdtasdt0(xm,xm)) = sdtasdt0(xn,xn),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3014) ).
fof(mDivAsso,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( doDivides0(X1,X2)
& X1 != sz00 )
=> ! [X3] :
( aNaturalNumber0(X3)
=> sdtasdt0(X3,sdtsldt0(X2,X1)) = sdtsldt0(sdtasdt0(X3,X2),X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDivAsso) ).
fof(c_0_11,plain,
! [X1] :
( aNaturalNumber0(X1)
=> ( X1 != sz00
=> ! [X2,X3] :
( ( aNaturalNumber0(X3)
& aNaturalNumber0(X2) )
=> ( ( sdtasdt0(X2,X1) = sdtasdt0(X3,X1)
| sdtasdt0(X1,X2) = sdtasdt0(X1,X3) )
=> X2 = X3 ) ) ) ),
inference(fof_simplification,[status(thm)],[mMulCanc]) ).
fof(c_0_12,hypothesis,
( xp != sz00
& xm != sz00
& xn != sz00
& aNaturalNumber0(xp)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
inference(fof_simplification,[status(thm)],[m__2987]) ).
fof(c_0_13,negated_conjecture,
sdtasdt0(xm,xm) != sdtasdt0(xp,sdtasdt0(xq,xq)),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_14,plain,
! [X17,X18,X19] :
( ( ~ aNaturalNumber0(X17)
| X17 = sz00
| ~ aNaturalNumber0(X19)
| ~ aNaturalNumber0(X18)
| X18 = X19
| sdtasdt0(X18,X17) != sdtasdt0(X19,X17) )
& ( ~ aNaturalNumber0(X17)
| X17 = sz00
| ~ aNaturalNumber0(X19)
| ~ aNaturalNumber0(X18)
| X18 = X19
| sdtasdt0(X17,X18) != sdtasdt0(X17,X19) ) ),
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_11])])])])]) ).
fof(c_0_15,hypothesis,
( doDivides0(xp,xn)
& xn = sdtasdt0(xp,esk4_0)
& aNaturalNumber0(esk4_0)
& doDivides0(xp,sdtasdt0(xn,xn))
& sdtasdt0(xn,xn) = sdtasdt0(xp,esk3_0)
& aNaturalNumber0(esk3_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__3046])]) ).
fof(c_0_16,hypothesis,
( xp != sz00
& xm != sz00
& xn != sz00
& aNaturalNumber0(xp)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
inference(fof_nnf,[status(thm)],[c_0_12]) ).
fof(c_0_17,plain,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( doDivides0(X1,X2)
& X1 != sz00 )
=> ! [X3] :
( X3 = sdtsldt0(X2,X1)
<=> ( X2 = sdtasdt0(X1,X3)
& aNaturalNumber0(X3) ) ) ) ),
inference(fof_simplification,[status(thm)],[mDefQuot]) ).
fof(c_0_18,plain,
! [X42,X43,X45] :
( ( ~ aNaturalNumber0(X43)
| ~ aNaturalNumber0(X42)
| doDivides0(X42,X43)
| X43 != sdtasdt0(X42,X45)
| ~ aNaturalNumber0(X45) )
& ( ~ aNaturalNumber0(X43)
| ~ aNaturalNumber0(X42)
| ~ doDivides0(X42,X43)
| X43 = sdtasdt0(X42,esk7_2(X42,X43)) )
& ( ~ aNaturalNumber0(X43)
| ~ aNaturalNumber0(X42)
| ~ doDivides0(X42,X43)
| aNaturalNumber0(esk7_2(X42,X43)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefDiv])])])])])]) ).
fof(c_0_19,plain,
! [X55,X56] :
( aNaturalNumber0(sdtasdt0(X55,X56))
| ~ aNaturalNumber0(X56)
| ~ aNaturalNumber0(X55) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])])]) ).
fof(c_0_20,negated_conjecture,
sdtasdt0(xm,xm) != sdtasdt0(xp,sdtasdt0(xq,xq)),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_21,plain,
! [X59,X60,X61] :
( sdtasdt0(sdtasdt0(X59,X60),X61) = sdtasdt0(X59,sdtasdt0(X60,X61))
| ~ aNaturalNumber0(X61)
| ~ aNaturalNumber0(X60)
| ~ aNaturalNumber0(X59) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulAsso])])]) ).
cnf(c_0_22,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| sdtasdt0(X1,X2) != sdtasdt0(X1,X3)
| X1 = sz00
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,hypothesis,
sdtasdt0(xn,xn) = sdtasdt0(xp,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,hypothesis,
aNaturalNumber0(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_25,hypothesis,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,hypothesis,
xp != sz00,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_27,plain,
! [X66,X67,X68] :
( ( ~ aNaturalNumber0(X67)
| ~ aNaturalNumber0(X66)
| ~ doDivides0(X66,X67)
| X66 = sz00
| X68 = sdtsldt0(X67,X66)
| X67 != sdtasdt0(X66,X68)
| ~ aNaturalNumber0(X68) )
& ( ~ aNaturalNumber0(X67)
| ~ aNaturalNumber0(X66)
| ~ doDivides0(X66,X67)
| X66 = sz00
| X68 != sdtsldt0(X67,X66)
| X67 = sdtasdt0(X66,X68) )
& ( ~ aNaturalNumber0(X67)
| ~ aNaturalNumber0(X66)
| ~ doDivides0(X66,X67)
| X66 = sz00
| X68 != sdtsldt0(X67,X66)
| aNaturalNumber0(X68) ) ),
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_17])])])])]) ).
cnf(c_0_28,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| X2 != sdtasdt0(X3,X1)
| ~ aNaturalNumber0(X1)
| doDivides0(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_29,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| aNaturalNumber0(sdtasdt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_30,negated_conjecture,
sdtasdt0(xm,xm) != sdtasdt0(xp,sdtasdt0(xq,xq)),
inference(fof_nnf,[status(thm)],[c_0_20]) ).
cnf(c_0_31,plain,
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_32,hypothesis,
xn = sdtasdt0(xp,xq),
inference(split_conjunct,[status(thm)],[m__3059]) ).
cnf(c_0_33,hypothesis,
aNaturalNumber0(xq),
inference(split_conjunct,[status(thm)],[m__3059]) ).
cnf(c_0_34,hypothesis,
( ~ aNaturalNumber0(X1)
| sdtasdt0(xp,X1) != sdtasdt0(xn,xn)
| X1 = esk3_0 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25])]),c_0_26]) ).
cnf(c_0_35,hypothesis,
sdtasdt0(xp,sdtasdt0(xm,xm)) = sdtasdt0(xn,xn),
inference(split_conjunct,[status(thm)],[m__3014]) ).
fof(c_0_36,plain,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( doDivides0(X1,X2)
& X1 != sz00 )
=> ! [X3] :
( aNaturalNumber0(X3)
=> sdtasdt0(X3,sdtsldt0(X2,X1)) = sdtsldt0(sdtasdt0(X3,X2),X1) ) ) ),
inference(fof_simplification,[status(thm)],[mDivAsso]) ).
cnf(c_0_37,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ doDivides0(X3,X2)
| X2 != sdtasdt0(X3,X1)
| ~ aNaturalNumber0(X1)
| X3 = sz00
| X1 = sdtsldt0(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_38,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| doDivides0(X1,sdtasdt0(X1,X2)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_28]),c_0_29]) ).
cnf(c_0_39,negated_conjecture,
sdtasdt0(xm,xm) != sdtasdt0(xp,sdtasdt0(xq,xq)),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_40,hypothesis,
( ~ aNaturalNumber0(X1)
| sdtasdt0(xp,sdtasdt0(xq,X1)) = sdtasdt0(xn,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_25])]) ).
cnf(c_0_41,hypothesis,
( ~ aNaturalNumber0(sdtasdt0(xm,xm))
| sdtasdt0(xm,xm) = esk3_0 ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_42,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_43,plain,
! [X69,X70,X71] :
( sdtasdt0(X71,sdtsldt0(X70,X69)) = sdtsldt0(sdtasdt0(X71,X70),X69)
| ~ aNaturalNumber0(X71)
| ~ doDivides0(X69,X70)
| X69 = sz00
| ~ aNaturalNumber0(X70)
| ~ aNaturalNumber0(X69) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_36])])])]) ).
cnf(c_0_44,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| X1 = sz00
| sdtsldt0(sdtasdt0(X1,X2),X1) = X2 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_37]),c_0_29]),c_0_38]) ).
cnf(c_0_45,negated_conjecture,
sdtasdt0(xm,xm) != sdtasdt0(xn,xq),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_33])]) ).
cnf(c_0_46,hypothesis,
sdtasdt0(xm,xm) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_29]),c_0_42])]) ).
cnf(c_0_47,plain,
( ~ aNaturalNumber0(X3)
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtasdt0(X3,sdtsldt0(X2,X1)) = sdtsldt0(sdtasdt0(X3,X2),X1)
| X1 = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_48,hypothesis,
sdtsldt0(sdtasdt0(xn,xn),xp) = esk3_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_23]),c_0_25]),c_0_24])]),c_0_26]) ).
cnf(c_0_49,hypothesis,
xq = sdtsldt0(xn,xp),
inference(split_conjunct,[status(thm)],[m__3059]) ).
cnf(c_0_50,hypothesis,
doDivides0(xp,xn),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_51,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_52,negated_conjecture,
sdtasdt0(xn,xq) != esk3_0,
inference(rw,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_53,hypothesis,
$false,
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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]),c_0_50]),c_0_51]),c_0_25])]),c_0_52]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM524+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n004.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 02:37:35 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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
% 1.68/0.65 % Version: 3.5.1
% 1.68/0.65 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.68/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.68/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.68/0.65 % Starting new_bool_3 with 300s (1) cores
% 1.68/0.65 % Starting new_bool_1 with 300s (1) cores
% 1.68/0.65 % Starting sh5l with 300s (1) cores
% 1.68/0.65 % new_bool_1 with pid 2069950 completed with status 0
% 1.68/0.65 % Result found by new_bool_1
% 1.68/0.65 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.68/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.68/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.68/0.65 % Starting new_bool_3 with 300s (1) cores
% 1.68/0.65 % Starting new_bool_1 with 300s (1) cores
% 1.68/0.65 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.68/0.65 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.68/0.65 % Search class: FGHSF-FFMM32-SFFFFFNN
% 1.68/0.65 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.68/0.65 % Starting SubtermCWHack with 28s (1) cores
% 1.68/0.65 % SubtermCWHack with pid 2069952 completed with status 0
% 1.68/0.65 % Result found by SubtermCWHack
% 1.68/0.65 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.68/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.68/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.68/0.65 % Starting new_bool_3 with 300s (1) cores
% 1.68/0.65 % Starting new_bool_1 with 300s (1) cores
% 1.68/0.65 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.68/0.65 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.68/0.65 % Search class: FGHSF-FFMM32-SFFFFFNN
% 1.68/0.65 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.68/0.65 % Starting SubtermCWHack with 28s (1) cores
% 1.68/0.65 % Preprocessing time : 0.002 s
% 1.68/0.65
% 1.68/0.65 % Proof found!
% 1.68/0.65 % SZS status Theorem
% 1.68/0.65 % SZS output start CNFRefutation
% See solution above
% 1.68/0.65 % Parsed axioms : 46
% 1.68/0.65 % Removed by relevancy pruning/SinE : 1
% 1.68/0.65 % Initial clauses : 96
% 1.68/0.65 % Removed in clause preprocessing : 3
% 1.68/0.65 % Initial clauses in saturation : 93
% 1.68/0.65 % Processed clauses : 2246
% 1.68/0.65 % ...of these trivial : 61
% 1.68/0.65 % ...subsumed : 1271
% 1.68/0.65 % ...remaining for further processing : 914
% 1.68/0.65 % Other redundant clauses eliminated : 76
% 1.68/0.65 % Clauses deleted for lack of memory : 0
% 1.68/0.65 % Backward-subsumed : 79
% 1.68/0.65 % Backward-rewritten : 158
% 1.68/0.65 % Generated clauses : 7963
% 1.68/0.65 % ...of the previous two non-redundant : 6368
% 1.68/0.65 % ...aggressively subsumed : 0
% 1.68/0.65 % Contextual simplify-reflections : 33
% 1.68/0.65 % Paramodulations : 7865
% 1.68/0.65 % Factorizations : 2
% 1.68/0.65 % NegExts : 0
% 1.68/0.65 % Equation resolutions : 87
% 1.68/0.65 % Disequality decompositions : 0
% 1.68/0.65 % Total rewrite steps : 10231
% 1.68/0.65 % ...of those cached : 10106
% 1.68/0.65 % Propositional unsat checks : 0
% 1.68/0.65 % Propositional check models : 0
% 1.68/0.65 % Propositional check unsatisfiable : 0
% 1.68/0.65 % Propositional clauses : 0
% 1.68/0.65 % Propositional clauses after purity: 0
% 1.68/0.65 % Propositional unsat core size : 0
% 1.68/0.65 % Propositional preprocessing time : 0.000
% 1.68/0.65 % Propositional encoding time : 0.000
% 1.68/0.65 % Propositional solver time : 0.000
% 1.68/0.65 % Success case prop preproc time : 0.000
% 1.68/0.65 % Success case prop encoding time : 0.000
% 1.68/0.65 % Success case prop solver time : 0.000
% 1.68/0.65 % Current number of processed clauses : 660
% 1.68/0.65 % Positive orientable unit clauses : 131
% 1.68/0.65 % Positive unorientable unit clauses: 0
% 1.68/0.65 % Negative unit clauses : 33
% 1.68/0.65 % Non-unit-clauses : 496
% 1.68/0.65 % Current number of unprocessed clauses: 4009
% 1.68/0.65 % ...number of literals in the above : 19647
% 1.68/0.65 % Current number of archived formulas : 0
% 1.68/0.65 % Current number of archived clauses : 246
% 1.68/0.65 % Clause-clause subsumption calls (NU) : 30242
% 1.68/0.65 % Rec. Clause-clause subsumption calls : 15785
% 1.68/0.65 % Non-unit clause-clause subsumptions : 1140
% 1.68/0.65 % Unit Clause-clause subsumption calls : 2112
% 1.68/0.65 % Rewrite failures with RHS unbound : 0
% 1.68/0.65 % BW rewrite match attempts : 51
% 1.68/0.65 % BW rewrite match successes : 51
% 1.68/0.65 % Condensation attempts : 0
% 1.68/0.65 % Condensation successes : 0
% 1.68/0.65 % Termbank termtop insertions : 141938
% 1.68/0.65 % Search garbage collected termcells : 1598
% 1.68/0.65
% 1.68/0.65 % -------------------------------------------------
% 1.68/0.65 % User time : 0.202 s
% 1.68/0.65 % System time : 0.008 s
% 1.68/0.65 % Total time : 0.210 s
% 1.68/0.65 % Maximum resident set size: 3948 pages
% 1.68/0.65
% 1.68/0.65 % -------------------------------------------------
% 1.68/0.65 % User time : 0.203 s
% 1.68/0.65 % System time : 0.014 s
% 1.68/0.65 % Total time : 0.217 s
% 1.68/0.65 % Maximum resident set size: 4864 pages
% 1.68/0.65 % E exiting
%------------------------------------------------------------------------------