%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM461+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:10 PM UTC 2026
% Result : Theorem 0.24s 5.91s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 43 ( 10 unt; 0 def)
% Number of atoms : 183 ( 74 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 228 ( 88 ~; 92 |; 40 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 61 ( 0 sgn 27 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( sdtlseqdt0(sdtpldt0(xl,xm),sdtpldt0(xn,xm))
| ? [X1] :
( sdtpldt0(sdtpldt0(xl,xm),X1) = sdtpldt0(xn,xm)
& aNaturalNumber0(X1) ) )
& sdtpldt0(xl,xm) != sdtpldt0(xn,xm)
& ( sdtlseqdt0(sdtpldt0(xm,xl),sdtpldt0(xm,xn))
| ? [X1] :
( sdtpldt0(sdtpldt0(xm,xl),X1) = sdtpldt0(xm,xn)
& aNaturalNumber0(X1) ) )
& sdtpldt0(xm,xl) != sdtpldt0(xm,xn) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__840_03,hypothesis,
( sdtlseqdt0(xl,xn)
& ? [X1] :
( sdtpldt0(xl,X1) = xn
& aNaturalNumber0(X1) )
& xl != xn ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__840_03) ).
fof(mAddAsso,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X3)
& aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mAddAsso) ).
fof(m__840,hypothesis,
( aNaturalNumber0(xn)
& aNaturalNumber0(xl) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__840) ).
fof(mAddComm,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mAddComm) ).
fof(m__873,hypothesis,
aNaturalNumber0(xm),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__873) ).
fof(mDefLE,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( sdtlseqdt0(X1,X2)
<=> ? [X3] :
( sdtpldt0(X1,X3) = X2
& aNaturalNumber0(X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefLE) ).
fof(mSortsB,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> aNaturalNumber0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsB) ).
fof(mDefDiff,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( sdtlseqdt0(X1,X2)
=> ! [X3] :
( X3 = sdtmndt0(X2,X1)
<=> ( sdtpldt0(X1,X3) = X2
& aNaturalNumber0(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefDiff) ).
fof(c_0_9,negated_conjecture,
~ ( ( sdtlseqdt0(sdtpldt0(xl,xm),sdtpldt0(xn,xm))
| ? [X1] :
( sdtpldt0(sdtpldt0(xl,xm),X1) = sdtpldt0(xn,xm)
& aNaturalNumber0(X1) ) )
& sdtpldt0(xl,xm) != sdtpldt0(xn,xm)
& ( sdtlseqdt0(sdtpldt0(xm,xl),sdtpldt0(xm,xn))
| ? [X1] :
( sdtpldt0(sdtpldt0(xm,xl),X1) = sdtpldt0(xm,xn)
& aNaturalNumber0(X1) ) )
& sdtpldt0(xm,xl) != sdtpldt0(xm,xn) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_10,hypothesis,
( sdtlseqdt0(xl,xn)
& ? [X1] :
( sdtpldt0(xl,X1) = xn
& aNaturalNumber0(X1) )
& xl != xn ),
inference(fof_simplification,[status(thm)],[m__840_03]) ).
fof(c_0_11,negated_conjecture,
~ ( ( sdtlseqdt0(sdtpldt0(xl,xm),sdtpldt0(xn,xm))
| ? [X1] :
( sdtpldt0(sdtpldt0(xl,xm),X1) = sdtpldt0(xn,xm)
& aNaturalNumber0(X1) ) )
& sdtpldt0(xl,xm) != sdtpldt0(xn,xm)
& ( sdtlseqdt0(sdtpldt0(xm,xl),sdtpldt0(xm,xn))
| ? [X1] :
( sdtpldt0(sdtpldt0(xm,xl),X1) = sdtpldt0(xm,xn)
& aNaturalNumber0(X1) ) )
& sdtpldt0(xm,xl) != sdtpldt0(xm,xn) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X11,X12,X13] :
( sdtpldt0(sdtpldt0(X11,X12),X13) = sdtpldt0(X11,sdtpldt0(X12,X13))
| ~ aNaturalNumber0(X13)
| ~ aNaturalNumber0(X12)
| ~ aNaturalNumber0(X11) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddAsso])])]) ).
fof(c_0_13,hypothesis,
( sdtlseqdt0(xl,xn)
& sdtpldt0(xl,esk2_0) = xn
& aNaturalNumber0(esk2_0)
& xl != xn ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_10])])]) ).
fof(c_0_14,negated_conjecture,
! [X51,X52] :
( ( sdtpldt0(xl,xm) = sdtpldt0(xn,xm)
| sdtpldt0(xm,xl) = sdtpldt0(xm,xn)
| ~ sdtlseqdt0(sdtpldt0(xm,xl),sdtpldt0(xm,xn))
| ~ sdtlseqdt0(sdtpldt0(xl,xm),sdtpldt0(xn,xm)) )
& ( sdtpldt0(xl,xm) = sdtpldt0(xn,xm)
| sdtpldt0(xm,xl) = sdtpldt0(xm,xn)
| ~ sdtlseqdt0(sdtpldt0(xm,xl),sdtpldt0(xm,xn))
| sdtpldt0(sdtpldt0(xl,xm),X52) != sdtpldt0(xn,xm)
| ~ aNaturalNumber0(X52) )
& ( sdtpldt0(xl,xm) = sdtpldt0(xn,xm)
| sdtpldt0(xm,xl) = sdtpldt0(xm,xn)
| sdtpldt0(sdtpldt0(xm,xl),X51) != sdtpldt0(xm,xn)
| ~ aNaturalNumber0(X51)
| ~ sdtlseqdt0(sdtpldt0(xl,xm),sdtpldt0(xn,xm)) )
& ( sdtpldt0(xl,xm) = sdtpldt0(xn,xm)
| sdtpldt0(xm,xl) = sdtpldt0(xm,xn)
| sdtpldt0(sdtpldt0(xm,xl),X51) != sdtpldt0(xm,xn)
| ~ aNaturalNumber0(X51)
| sdtpldt0(sdtpldt0(xl,xm),X52) != sdtpldt0(xn,xm)
| ~ aNaturalNumber0(X52) ) ),
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])])])])]) ).
cnf(c_0_15,plain,
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,hypothesis,
sdtpldt0(xl,esk2_0) = xn,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,hypothesis,
aNaturalNumber0(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,hypothesis,
aNaturalNumber0(xl),
inference(split_conjunct,[status(thm)],[m__840]) ).
fof(c_0_19,plain,
! [X9,X10] :
( sdtpldt0(X9,X10) = sdtpldt0(X10,X9)
| ~ aNaturalNumber0(X10)
| ~ aNaturalNumber0(X9) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddComm])])]) ).
cnf(c_0_20,negated_conjecture,
( sdtpldt0(sdtpldt0(xm,xl),X2) != sdtpldt0(xm,xn)
| ~ aNaturalNumber0(X2)
| sdtpldt0(sdtpldt0(xl,xm),X1) != sdtpldt0(xn,xm)
| ~ aNaturalNumber0(X1)
| sdtpldt0(xl,xm) = sdtpldt0(xn,xm)
| sdtpldt0(xm,xl) = sdtpldt0(xm,xn) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__873]) ).
cnf(c_0_22,hypothesis,
( ~ aNaturalNumber0(X1)
| sdtpldt0(xl,sdtpldt0(esk2_0,X1)) = sdtpldt0(xn,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18])]) ).
cnf(c_0_23,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| sdtpldt0(sdtpldt0(xm,xl),X2) != sdtpldt0(xm,xn)
| sdtpldt0(xl,sdtpldt0(xm,X1)) != sdtpldt0(xn,xm)
| sdtpldt0(xn,xm) = sdtpldt0(xl,xm)
| sdtpldt0(xm,xn) = sdtpldt0(xm,xl) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_15]),c_0_21]),c_0_18])]) ).
cnf(c_0_25,hypothesis,
( ~ aNaturalNumber0(X1)
| sdtpldt0(xl,sdtpldt0(X1,esk2_0)) = sdtpldt0(xn,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_17])]) ).
cnf(c_0_26,hypothesis,
( ~ aNaturalNumber0(X1)
| sdtpldt0(sdtpldt0(xm,xl),X1) != sdtpldt0(xm,xn)
| sdtpldt0(xm,xn) = sdtpldt0(xm,xl)
| sdtpldt0(xn,xm) = sdtpldt0(xl,xm) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_17]),c_0_21])]) ).
fof(c_0_27,plain,
! [X35,X36,X38] :
( ( ~ aNaturalNumber0(X36)
| ~ aNaturalNumber0(X35)
| sdtlseqdt0(X35,X36)
| sdtpldt0(X35,X38) != X36
| ~ aNaturalNumber0(X38) )
& ( ~ aNaturalNumber0(X36)
| ~ aNaturalNumber0(X35)
| ~ sdtlseqdt0(X35,X36)
| sdtpldt0(X35,esk1_2(X35,X36)) = X36 )
& ( ~ aNaturalNumber0(X36)
| ~ aNaturalNumber0(X35)
| ~ sdtlseqdt0(X35,X36)
| aNaturalNumber0(esk1_2(X35,X36)) ) ),
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)],[mDefLE])])])])])]) ).
fof(c_0_28,plain,
! [X5,X6] :
( aNaturalNumber0(sdtpldt0(X5,X6))
| ~ aNaturalNumber0(X6)
| ~ aNaturalNumber0(X5) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])])]) ).
cnf(c_0_29,hypothesis,
( ~ aNaturalNumber0(X1)
| sdtpldt0(xm,sdtpldt0(xl,X1)) != sdtpldt0(xm,xn)
| sdtpldt0(xn,xm) = sdtpldt0(xl,xm)
| sdtpldt0(xm,xn) = sdtpldt0(xm,xl) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_15]),c_0_18]),c_0_21])]) ).
fof(c_0_30,plain,
! [X39,X40,X41] :
( ( ~ aNaturalNumber0(X40)
| ~ aNaturalNumber0(X39)
| ~ sdtlseqdt0(X39,X40)
| X41 = sdtmndt0(X40,X39)
| sdtpldt0(X39,X41) != X40
| ~ aNaturalNumber0(X41) )
& ( ~ aNaturalNumber0(X40)
| ~ aNaturalNumber0(X39)
| ~ sdtlseqdt0(X39,X40)
| X41 != sdtmndt0(X40,X39)
| sdtpldt0(X39,X41) = X40 )
& ( ~ aNaturalNumber0(X40)
| ~ aNaturalNumber0(X39)
| ~ sdtlseqdt0(X39,X40)
| X41 != sdtmndt0(X40,X39)
| aNaturalNumber0(X41) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefDiff])])])])]) ).
cnf(c_0_31,plain,
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| sdtpldt0(X2,X1) != X3
| ~ aNaturalNumber0(X1)
| sdtlseqdt0(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_32,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| aNaturalNumber0(sdtpldt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_33,hypothesis,
( sdtpldt0(xm,xn) = sdtpldt0(xm,xl)
| sdtpldt0(xn,xm) = sdtpldt0(xl,xm) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_16]),c_0_17])]) ).
cnf(c_0_34,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__840]) ).
cnf(c_0_35,plain,
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ sdtlseqdt0(X2,X3)
| sdtpldt0(X2,X1) != X3
| ~ aNaturalNumber0(X1)
| X1 = sdtmndt0(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_36,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtlseqdt0(X1,sdtpldt0(X1,X2)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_31]),c_0_32]) ).
cnf(c_0_37,hypothesis,
( sdtpldt0(xl,xm) = sdtpldt0(xm,xn)
| sdtpldt0(xm,xn) = sdtpldt0(xm,xl) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_33]),c_0_21]),c_0_34])]) ).
cnf(c_0_38,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtmndt0(sdtpldt0(X1,X2),X1) = X2 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_35]),c_0_32]),c_0_36]) ).
cnf(c_0_39,hypothesis,
sdtpldt0(xm,xn) = sdtpldt0(xm,xl),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_37]),c_0_21]),c_0_18])]) ).
cnf(c_0_40,hypothesis,
sdtmndt0(sdtpldt0(xm,xl),xm) = xn,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_21]),c_0_34])]) ).
cnf(c_0_41,hypothesis,
xl != xn,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_42,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_40]),c_0_21]),c_0_18])]),c_0_41]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM461+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/5.67 % Computer : n018.cluster.edu
% 0.20/5.67 % Model : x86_64 x86_64
% 0.20/5.67 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/5.67 % Memory : 8046.5625MB
% 0.20/5.67 % OS : Linux 6.8.0-71-generic
% 0.20/5.67 % CPULimit : 300
% 0.20/5.67 % WCLimit : 300
% 0.20/5.67 % DateTime : Mon Sep 21 02:34:19 UTC 2026
% 0.20/5.67 % CPUTime :
% 0.20/5.67 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/5.73 Running first-order theorem proving
% 0.24/5.74 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
% 0.24/5.91 % Version: 3.5.1
% 0.24/5.91 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/5.91 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/5.91 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/5.91 % Starting new_bool_3 with 300s (1) cores
% 0.24/5.91 % Starting new_bool_1 with 300s (1) cores
% 0.24/5.91 % Starting sh5l with 300s (1) cores
% 0.24/5.91 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 777093 completed with status 0
% 0.24/5.91 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.24/5.91 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/5.91 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/5.91 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/5.91 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/5.91 % No SInE strategy applied
% 0.24/5.91 % Search class: FGUSF-FFMM22-SFFFFFNN
% 0.24/5.91 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/5.91 % Starting SubtermCWHack with 136s (1) cores
% 0.24/5.91 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.24/5.91 % Starting G-E--_107_B42_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.24/5.91 % Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.24/5.91 % Starting new_bool_3 with 136s (1) cores
% 0.24/5.91 % new_bool_3 with pid 777103 completed with status 0
% 0.24/5.91 % Result found by new_bool_3
% 0.24/5.91 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/5.91 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/5.91 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/5.91 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/5.91 % No SInE strategy applied
% 0.24/5.91 % Search class: FGUSF-FFMM22-SFFFFFNN
% 0.24/5.91 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/5.91 % Starting SubtermCWHack with 136s (1) cores
% 0.24/5.91 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.24/5.91 % Starting G-E--_107_B42_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.24/5.91 % Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.24/5.91 % Starting new_bool_3 with 136s (1) cores
% 0.24/5.91 % Preprocessing time : 0.003 s
% 0.24/5.91 % Presaturation interreduction done
% 0.24/5.91
% 0.24/5.91 % Proof found!
% 0.24/5.91 % SZS status Theorem
% 0.24/5.91 % SZS output start CNFRefutation
% See solution above
% 0.24/5.91 % Parsed axioms : 27
% 0.24/5.91 % Removed by relevancy pruning/SinE : 0
% 0.24/5.91 % Initial clauses : 47
% 0.24/5.91 % Removed in clause preprocessing : 1
% 0.24/5.91 % Initial clauses in saturation : 46
% 0.24/5.91 % Processed clauses : 749
% 0.24/5.91 % ...of these trivial : 22
% 0.24/5.91 % ...subsumed : 351
% 0.24/5.91 % ...remaining for further processing : 376
% 0.24/5.91 % Other redundant clauses eliminated : 74
% 0.24/5.91 % Clauses deleted for lack of memory : 0
% 0.24/5.91 % Backward-subsumed : 46
% 0.24/5.91 % Backward-rewritten : 61
% 0.24/5.91 % Generated clauses : 3084
% 0.24/5.91 % ...of the previous two non-redundant : 2446
% 0.24/5.91 % ...aggressively subsumed : 0
% 0.24/5.91 % Contextual simplify-reflections : 17
% 0.24/5.91 % Paramodulations : 2999
% 0.24/5.91 % Factorizations : 4
% 0.24/5.91 % NegExts : 0
% 0.24/5.91 % Equation resolutions : 81
% 0.24/5.91 % Disequality decompositions : 0
% 0.24/5.91 % Total rewrite steps : 4049
% 0.24/5.91 % ...of those cached : 3973
% 0.24/5.91 % Propositional unsat checks : 0
% 0.24/5.91 % Propositional check models : 0
% 0.24/5.91 % Propositional check unsatisfiable : 0
% 0.24/5.91 % Propositional clauses : 0
% 0.24/5.91 % Propositional clauses after purity: 0
% 0.24/5.91 % Propositional unsat core size : 0
% 0.24/5.91 % Propositional preprocessing time : 0.000
% 0.24/5.91 % Propositional encoding time : 0.000
% 0.24/5.91 % Propositional solver time : 0.000
% 0.24/5.91 % Success case prop preproc time : 0.000
% 0.24/5.91 % Success case prop encoding time : 0.000
% 0.24/5.91 % Success case prop solver time : 0.000
% 0.24/5.91 % Current number of processed clauses : 219
% 0.24/5.91 % Positive orientable unit clauses : 65
% 0.24/5.91 % Positive unorientable unit clauses: 0
% 0.24/5.91 % Negative unit clauses : 3
% 0.24/5.91 % Non-unit-clauses : 151
% 0.24/5.91 % Current number of unprocessed clauses: 1691
% 0.24/5.91 % ...number of literals in the above : 7833
% 0.24/5.91 % Current number of archived formulas : 0
% 0.24/5.91 % Current number of archived clauses : 152
% 0.24/5.91 % Clause-clause subsumption calls (NU) : 6311
% 0.24/5.91 % Rec. Clause-clause subsumption calls : 3730
% 0.24/5.91 % Non-unit clause-clause subsumptions : 397
% 0.24/5.91 % Unit Clause-clause subsumption calls : 316
% 0.24/5.91 % Rewrite failures with RHS unbound : 0
% 0.24/5.91 % BW rewrite match attempts : 33
% 0.24/5.91 % BW rewrite match successes : 27
% 0.24/5.91 % Condensation attempts : 0
% 0.24/5.91 % Condensation successes : 0
% 0.24/5.91 % Termbank termtop insertions : 54291
% 0.24/5.91 % Search garbage collected termcells : 663
% 0.24/5.91
% 0.24/5.91 % -------------------------------------------------
% 0.24/5.91 % User time : 0.117 s
% 0.24/5.91 % System time : 0.010 s
% 0.24/5.91 % Total time : 0.127 s
% 0.24/5.91 % Maximum resident set size: 3660 pages
% 0.24/5.91
% 0.24/5.91 % -------------------------------------------------
% 0.24/5.91 % User time : 0.634 s
% 0.24/5.91 % System time : 0.041 s
% 0.24/5.91 % Total time : 0.675 s
% 0.24/5.91 % Maximum resident set size: 4608 pages
% 0.24/5.91 % E exiting
%------------------------------------------------------------------------------