%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM460+1 : 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 : n026.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:09 PM UTC 2026
% Result : Theorem 2.34s 0.74s
% Output : CNFRefutation 2.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 56 ( 21 unt; 0 def)
% Number of atoms : 179 ( 47 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 215 ( 92 ~; 90 |; 21 &)
% ( 2 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 71 ( 0 sgn 31 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
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(m__,conjecture,
( ( sdtlseqdt0(xn,xl)
& sdtlseqdt0(xm,xn) )
=> sdtlseqdt0(xm,xl) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
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(mAddComm,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mAddComm) ).
fof(mAddCanc,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X3)
& aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( sdtpldt0(X2,X1) = sdtpldt0(X3,X1)
| sdtpldt0(X1,X2) = sdtpldt0(X1,X3) )
=> X2 = X3 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mAddCanc) ).
fof(m__773,hypothesis,
( aNaturalNumber0(xl)
& aNaturalNumber0(xn)
& aNaturalNumber0(xm) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__773) ).
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(c_0_8,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])])])])]) ).
fof(c_0_9,negated_conjecture,
~ ( ( sdtlseqdt0(xn,xl)
& sdtlseqdt0(xm,xn) )
=> sdtlseqdt0(xm,xl) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_10,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_11,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_12,plain,
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X1)
| ~ sdtlseqdt0(X1,X3)
| X2 != sdtmndt0(X3,X1)
| sdtpldt0(X1,X2) = X3 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,negated_conjecture,
( ~ sdtlseqdt0(xm,xl)
& sdtlseqdt0(xn,xl)
& sdtlseqdt0(xm,xn) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])]) ).
cnf(c_0_14,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ sdtlseqdt0(X3,X2)
| X1 != sdtmndt0(X2,X3)
| aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| sdtpldt0(X2,X1) != X3
| ~ aNaturalNumber0(X1)
| sdtlseqdt0(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| aNaturalNumber0(sdtpldt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_17,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])])]) ).
fof(c_0_18,plain,
! [X25,X26,X27] :
( ( ~ aNaturalNumber0(X27)
| ~ aNaturalNumber0(X26)
| ~ aNaturalNumber0(X25)
| X26 = X27
| sdtpldt0(X26,X25) != sdtpldt0(X27,X25) )
& ( ~ aNaturalNumber0(X27)
| ~ aNaturalNumber0(X26)
| ~ aNaturalNumber0(X25)
| X26 = X27
| sdtpldt0(X25,X26) != sdtpldt0(X25,X27) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddCanc])])])]) ).
cnf(c_0_19,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ sdtlseqdt0(X1,X2)
| sdtpldt0(X1,sdtmndt0(X2,X1)) = X2 ),
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_20,negated_conjecture,
sdtlseqdt0(xm,xn),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__773]) ).
cnf(c_0_22,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__773]) ).
cnf(c_0_23,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ sdtlseqdt0(X2,X1)
| aNaturalNumber0(sdtmndt0(X1,X2)) ),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_24,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtlseqdt0(X1,sdtpldt0(X1,X2)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_15]),c_0_16]) ).
cnf(c_0_25,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,plain,
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| sdtpldt0(X1,X2) != sdtpldt0(X3,X2)
| X1 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,negated_conjecture,
sdtpldt0(xm,sdtmndt0(xn,xm)) = xn,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_28,negated_conjecture,
aNaturalNumber0(sdtmndt0(xn,xm)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_20]),c_0_22]),c_0_21])]) ).
cnf(c_0_29,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtlseqdt0(X1,sdtpldt0(X2,X1)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
sdtlseqdt0(xn,xl),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_31,hypothesis,
aNaturalNumber0(xl),
inference(split_conjunct,[status(thm)],[m__773]) ).
cnf(c_0_32,negated_conjecture,
( ~ aNaturalNumber0(X1)
| sdtpldt0(X1,sdtmndt0(xn,xm)) != xn
| X1 = xm ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_22]),c_0_28])]) ).
cnf(c_0_33,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ sdtlseqdt0(X1,X2)
| sdtpldt0(X1,esk1_2(X1,X2)) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_34,negated_conjecture,
sdtlseqdt0(sdtmndt0(xn,xm),xn),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_27]),c_0_28]),c_0_22])]) ).
cnf(c_0_35,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ sdtlseqdt0(X1,X2)
| aNaturalNumber0(esk1_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_36,negated_conjecture,
sdtpldt0(xn,sdtmndt0(xl,xn)) = xl,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_30]),c_0_31]),c_0_21])]) ).
cnf(c_0_37,negated_conjecture,
aNaturalNumber0(sdtmndt0(xl,xn)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_30]),c_0_21]),c_0_31])]) ).
fof(c_0_38,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])])]) ).
cnf(c_0_39,negated_conjecture,
( ~ aNaturalNumber0(X1)
| sdtpldt0(sdtmndt0(xn,xm),X1) != xn
| X1 = xm ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_25]),c_0_28])]) ).
cnf(c_0_40,negated_conjecture,
sdtpldt0(sdtmndt0(xn,xm),esk1_2(sdtmndt0(xn,xm),xn)) = xn,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_21]),c_0_28])]) ).
cnf(c_0_41,negated_conjecture,
aNaturalNumber0(esk1_2(sdtmndt0(xn,xm),xn)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_34]),c_0_21]),c_0_28])]) ).
cnf(c_0_42,negated_conjecture,
( ~ aNaturalNumber0(X1)
| sdtpldt0(X1,sdtmndt0(xl,xn)) != xl
| X1 = xn ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_36]),c_0_21]),c_0_37])]) ).
cnf(c_0_43,negated_conjecture,
sdtlseqdt0(sdtmndt0(xl,xn),xl),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_36]),c_0_37]),c_0_21])]) ).
cnf(c_0_44,plain,
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_45,negated_conjecture,
esk1_2(sdtmndt0(xn,xm),xn) = xm,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]) ).
cnf(c_0_46,negated_conjecture,
( ~ aNaturalNumber0(X1)
| sdtpldt0(sdtmndt0(xl,xn),X1) != xl
| X1 = xn ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_25]),c_0_37])]) ).
cnf(c_0_47,negated_conjecture,
sdtpldt0(sdtmndt0(xl,xn),esk1_2(sdtmndt0(xl,xn),xl)) = xl,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_43]),c_0_31]),c_0_37])]) ).
cnf(c_0_48,negated_conjecture,
aNaturalNumber0(esk1_2(sdtmndt0(xl,xn),xl)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_43]),c_0_31]),c_0_37])]) ).
cnf(c_0_49,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X1)
| sdtlseqdt0(X1,sdtpldt0(X2,sdtpldt0(X3,X1))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_44]),c_0_16]) ).
cnf(c_0_50,negated_conjecture,
sdtpldt0(sdtmndt0(xn,xm),xm) = xn,
inference(rw,[status(thm)],[c_0_40,c_0_45]) ).
cnf(c_0_51,negated_conjecture,
esk1_2(sdtmndt0(xl,xn),xl) = xn,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48])]) ).
cnf(c_0_52,negated_conjecture,
( ~ aNaturalNumber0(X1)
| sdtlseqdt0(xm,sdtpldt0(X1,xn)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_22]),c_0_28])]) ).
cnf(c_0_53,negated_conjecture,
sdtpldt0(sdtmndt0(xl,xn),xn) = xl,
inference(rw,[status(thm)],[c_0_47,c_0_51]) ).
cnf(c_0_54,negated_conjecture,
~ sdtlseqdt0(xm,xl),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_37])]),c_0_54]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM460+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.35 % Computer : n026.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 21 02:34:53 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.34/0.74 % Version: 3.5.1
% 2.34/0.74 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.34/0.74 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.34/0.74 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.34/0.74 % Starting new_bool_3 with 300s (1) cores
% 2.34/0.74 % Starting new_bool_1 with 300s (1) cores
% 2.34/0.74 % Starting sh5l with 300s (1) cores
% 2.34/0.74 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1176596 completed with status 0
% 2.34/0.74 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 2.34/0.74 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.34/0.74 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.34/0.74 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.34/0.74 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.34/0.74 % No SInE strategy applied
% 2.34/0.74 % Search class: FGUSF-FFMM22-SFFFFFNN
% 2.34/0.74 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.34/0.74 % Starting SubtermCWHack with 136s (1) cores
% 2.34/0.74 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.34/0.74 % Starting G-E--_107_B42_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 2.34/0.74 % Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 2.34/0.74 % Starting new_bool_3 with 136s (1) cores
% 2.34/0.74 % new_bool_3 with pid 1176606 completed with status 0
% 2.34/0.74 % Result found by new_bool_3
% 2.34/0.74 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.34/0.74 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.34/0.74 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.34/0.74 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.34/0.74 % No SInE strategy applied
% 2.34/0.74 % Search class: FGUSF-FFMM22-SFFFFFNN
% 2.34/0.74 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.34/0.74 % Starting SubtermCWHack with 136s (1) cores
% 2.34/0.74 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.34/0.74 % Starting G-E--_107_B42_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 2.34/0.74 % Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 2.34/0.74 % Starting new_bool_3 with 136s (1) cores
% 2.34/0.74 % Preprocessing time : 0.002 s
% 2.34/0.74 % Presaturation interreduction done
% 2.34/0.74
% 2.34/0.74 % Proof found!
% 2.34/0.74 % SZS status Theorem
% 2.34/0.74 % SZS output start CNFRefutation
% See solution above
% 2.34/0.74 % Parsed axioms : 23
% 2.34/0.74 % Removed by relevancy pruning/SinE : 0
% 2.34/0.74 % Initial clauses : 39
% 2.34/0.74 % Removed in clause preprocessing : 1
% 2.34/0.74 % Initial clauses in saturation : 38
% 2.34/0.74 % Processed clauses : 2029
% 2.34/0.74 % ...of these trivial : 96
% 2.34/0.74 % ...subsumed : 1204
% 2.34/0.74 % ...remaining for further processing : 729
% 2.34/0.74 % Other redundant clauses eliminated : 64
% 2.34/0.74 % Clauses deleted for lack of memory : 0
% 2.34/0.74 % Backward-subsumed : 5
% 2.34/0.74 % Backward-rewritten : 104
% 2.34/0.74 % Generated clauses : 16164
% 2.34/0.74 % ...of the previous two non-redundant : 14304
% 2.34/0.74 % ...aggressively subsumed : 0
% 2.34/0.74 % Contextual simplify-reflections : 113
% 2.34/0.74 % Paramodulations : 16087
% 2.34/0.74 % Factorizations : 0
% 2.34/0.74 % NegExts : 0
% 2.34/0.74 % Equation resolutions : 77
% 2.34/0.74 % Disequality decompositions : 0
% 2.34/0.74 % Total rewrite steps : 17294
% 2.34/0.74 % ...of those cached : 17122
% 2.34/0.74 % Propositional unsat checks : 0
% 2.34/0.74 % Propositional check models : 0
% 2.34/0.74 % Propositional check unsatisfiable : 0
% 2.34/0.74 % Propositional clauses : 0
% 2.34/0.74 % Propositional clauses after purity: 0
% 2.34/0.74 % Propositional unsat core size : 0
% 2.34/0.74 % Propositional preprocessing time : 0.000
% 2.34/0.74 % Propositional encoding time : 0.000
% 2.34/0.74 % Propositional solver time : 0.000
% 2.34/0.74 % Success case prop preproc time : 0.000
% 2.34/0.74 % Success case prop encoding time : 0.000
% 2.34/0.74 % Success case prop solver time : 0.000
% 2.34/0.74 % Current number of processed clauses : 578
% 2.34/0.74 % Positive orientable unit clauses : 148
% 2.34/0.74 % Positive unorientable unit clauses: 0
% 2.34/0.74 % Negative unit clauses : 17
% 2.34/0.74 % Non-unit-clauses : 413
% 2.34/0.74 % Current number of unprocessed clauses: 12143
% 2.34/0.74 % ...number of literals in the above : 59133
% 2.34/0.74 % Current number of archived formulas : 0
% 2.34/0.74 % Current number of archived clauses : 147
% 2.34/0.74 % Clause-clause subsumption calls (NU) : 31844
% 2.34/0.74 % Rec. Clause-clause subsumption calls : 19885
% 2.34/0.74 % Non-unit clause-clause subsumptions : 1250
% 2.34/0.74 % Unit Clause-clause subsumption calls : 1876
% 2.34/0.74 % Rewrite failures with RHS unbound : 0
% 2.34/0.74 % BW rewrite match attempts : 92
% 2.34/0.74 % BW rewrite match successes : 53
% 2.34/0.74 % Condensation attempts : 0
% 2.34/0.74 % Condensation successes : 0
% 2.34/0.74 % Termbank termtop insertions : 277472
% 2.34/0.74 % Search garbage collected termcells : 526
% 2.34/0.74
% 2.34/0.74 % -------------------------------------------------
% 2.34/0.74 % User time : 0.294 s
% 2.34/0.74 % System time : 0.019 s
% 2.34/0.74 % Total time : 0.313 s
% 2.34/0.74 % Maximum resident set size: 3652 pages
% 2.34/0.74
% 2.34/0.74 % -------------------------------------------------
% 2.34/0.74 % User time : 1.459 s
% 2.34/0.74 % System time : 0.084 s
% 2.34/0.74 % Total time : 1.544 s
% 2.34/0.74 % Maximum resident set size: 4864 pages
% 2.34/0.74 % E exiting
%------------------------------------------------------------------------------