%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM462+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 : n005.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.17s 5.66s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 51 ( 10 unt; 0 def)
% Number of atoms : 201 ( 67 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 257 ( 107 ~; 98 |; 35 &)
% ( 2 <=>; 15 =>; 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 : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 71 ( 0 sgn 38 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
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(m__897_03,hypothesis,
( sdtlseqdt0(xl,xn)
& xl != xn
& xm != sz00 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__897_03) ).
fof(m__,conjecture,
( sdtlseqdt0(sdtasdt0(xl,xm),sdtasdt0(xn,xm))
& sdtasdt0(xl,xm) != sdtasdt0(xn,xm)
& sdtlseqdt0(sdtasdt0(xm,xl),sdtasdt0(xm,xn))
& sdtasdt0(xm,xl) != sdtasdt0(xm,xn) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mAMDistr,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X3)
& aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( sdtasdt0(sdtpldt0(X2,X3),X1) = sdtpldt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1))
& sdtasdt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mAMDistr) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsB_02) ).
fof(m__897,hypothesis,
( aNaturalNumber0(xn)
& aNaturalNumber0(xl)
& aNaturalNumber0(xm) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__897) ).
fof(mMulComm,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulComm) ).
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/sandbox2/benchmark/theBenchmark.p',mMulCanc) ).
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])])]) ).
fof(c_0_12,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_13,hypothesis,
( sdtlseqdt0(xl,xn)
& xl != xn
& xm != sz00 ),
inference(fof_simplification,[status(thm)],[m__897_03]) ).
fof(c_0_14,negated_conjecture,
~ ( sdtlseqdt0(sdtasdt0(xl,xm),sdtasdt0(xn,xm))
& sdtasdt0(xl,xm) != sdtasdt0(xn,xm)
& sdtlseqdt0(sdtasdt0(xm,xl),sdtasdt0(xm,xn))
& sdtasdt0(xm,xl) != sdtasdt0(xm,xn) ),
inference(assume_negation,[status(cth)],[m__]) ).
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,
! [X22,X23,X24] :
( ( ~ aNaturalNumber0(X24)
| ~ aNaturalNumber0(X23)
| ~ aNaturalNumber0(X22)
| sdtasdt0(sdtpldt0(X23,X24),X22) = sdtpldt0(sdtasdt0(X23,X22),sdtasdt0(X24,X22)) )
& ( ~ aNaturalNumber0(X24)
| ~ aNaturalNumber0(X23)
| ~ aNaturalNumber0(X22)
| sdtasdt0(X22,sdtpldt0(X23,X24)) = sdtpldt0(sdtasdt0(X22,X23),sdtasdt0(X22,X24)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAMDistr])])])]) ).
fof(c_0_18,plain,
! [X7,X8] :
( aNaturalNumber0(sdtasdt0(X7,X8))
| ~ aNaturalNumber0(X8)
| ~ aNaturalNumber0(X7) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])])]) ).
cnf(c_0_19,plain,
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X1)
| ~ sdtlseqdt0(X1,X3)
| X2 != sdtmndt0(X3,X1)
| sdtpldt0(X1,X2) = X3 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_20,hypothesis,
( sdtlseqdt0(xl,xn)
& xl != xn
& xm != sz00 ),
inference(fof_nnf,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ sdtlseqdt0(X3,X2)
| X1 != sdtmndt0(X2,X3)
| aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_22,negated_conjecture,
~ ( sdtlseqdt0(sdtasdt0(xl,xm),sdtasdt0(xn,xm))
& sdtasdt0(xl,xm) != sdtasdt0(xn,xm)
& sdtlseqdt0(sdtasdt0(xm,xl),sdtasdt0(xm,xn))
& sdtasdt0(xm,xl) != sdtasdt0(xm,xn) ),
inference(fof_simplification,[status(thm)],[c_0_14]) ).
cnf(c_0_23,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_24,plain,
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtasdt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| aNaturalNumber0(sdtasdt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ sdtlseqdt0(X1,X2)
| sdtpldt0(X1,sdtmndt0(X2,X1)) = X2 ),
inference(er,[status(thm)],[c_0_19]) ).
cnf(c_0_27,hypothesis,
sdtlseqdt0(xl,xn),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__897]) ).
cnf(c_0_29,hypothesis,
aNaturalNumber0(xl),
inference(split_conjunct,[status(thm)],[m__897]) ).
cnf(c_0_30,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ sdtlseqdt0(X2,X1)
| aNaturalNumber0(sdtmndt0(X1,X2)) ),
inference(er,[status(thm)],[c_0_21]) ).
fof(c_0_31,negated_conjecture,
( ~ sdtlseqdt0(sdtasdt0(xl,xm),sdtasdt0(xn,xm))
| sdtasdt0(xl,xm) = sdtasdt0(xn,xm)
| ~ sdtlseqdt0(sdtasdt0(xm,xl),sdtasdt0(xm,xn))
| sdtasdt0(xm,xl) = sdtasdt0(xm,xn) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])]) ).
cnf(c_0_32,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| sdtlseqdt0(sdtasdt0(X1,X2),sdtasdt0(X1,sdtpldt0(X2,X3))) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_25]) ).
cnf(c_0_33,hypothesis,
sdtpldt0(xl,sdtmndt0(xn,xl)) = xn,
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_29])]) ).
cnf(c_0_34,hypothesis,
aNaturalNumber0(sdtmndt0(xn,xl)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_27]),c_0_29]),c_0_28])]) ).
cnf(c_0_35,negated_conjecture,
( ~ sdtlseqdt0(sdtasdt0(xl,xm),sdtasdt0(xn,xm))
| ~ sdtlseqdt0(sdtasdt0(xm,xl),sdtasdt0(xm,xn))
| sdtasdt0(xl,xm) = sdtasdt0(xn,xm)
| sdtasdt0(xm,xl) = sdtasdt0(xm,xn) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_36,hypothesis,
( ~ aNaturalNumber0(X1)
| sdtlseqdt0(sdtasdt0(X1,xl),sdtasdt0(X1,xn)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_29])]) ).
cnf(c_0_37,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__897]) ).
fof(c_0_38,plain,
! [X15,X16] :
( sdtasdt0(X15,X16) = sdtasdt0(X16,X15)
| ~ aNaturalNumber0(X16)
| ~ aNaturalNumber0(X15) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])])]) ).
cnf(c_0_39,negated_conjecture,
( ~ sdtlseqdt0(sdtasdt0(xl,xm),sdtasdt0(xn,xm))
| sdtasdt0(xm,xn) = sdtasdt0(xm,xl)
| sdtasdt0(xn,xm) = sdtasdt0(xl,xm) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).
cnf(c_0_40,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
fof(c_0_41,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]) ).
cnf(c_0_42,negated_conjecture,
( ~ sdtlseqdt0(sdtasdt0(xl,xm),sdtasdt0(xm,xn))
| sdtasdt0(xl,xm) = sdtasdt0(xm,xn)
| sdtasdt0(xm,xn) = sdtasdt0(xm,xl) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_37]),c_0_28])]) ).
fof(c_0_43,plain,
! [X28,X29,X30] :
( ( ~ aNaturalNumber0(X28)
| X28 = sz00
| ~ aNaturalNumber0(X30)
| ~ aNaturalNumber0(X29)
| X29 = X30
| sdtasdt0(X29,X28) != sdtasdt0(X30,X28) )
& ( ~ aNaturalNumber0(X28)
| X28 = sz00
| ~ aNaturalNumber0(X30)
| ~ aNaturalNumber0(X29)
| X29 = X30
| sdtasdt0(X28,X29) != sdtasdt0(X28,X30) ) ),
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_41])])])])]) ).
cnf(c_0_44,negated_conjecture,
( ~ sdtlseqdt0(sdtasdt0(xm,xl),sdtasdt0(xm,xn))
| sdtasdt0(xm,xn) = sdtasdt0(xm,xl) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_40]),c_0_37]),c_0_29])]) ).
cnf(c_0_45,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| sdtasdt0(X1,X2) != sdtasdt0(X1,X3)
| X1 = sz00
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_46,hypothesis,
sdtasdt0(xm,xn) = sdtasdt0(xm,xl),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_36]),c_0_37])]) ).
cnf(c_0_47,hypothesis,
xm != sz00,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_48,hypothesis,
( ~ aNaturalNumber0(X1)
| sdtasdt0(xm,xl) != sdtasdt0(xm,X1)
| xn = X1 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_28]),c_0_37])]),c_0_47]) ).
cnf(c_0_49,hypothesis,
xl != xn,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_50,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_48]),c_0_29])]),c_0_49]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM462+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/5.40 % Computer : n005.cluster.edu
% 0.11/5.40 % Model : x86_64 x86_64
% 0.11/5.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.40 % Memory : 8046.5625MB
% 0.11/5.40 % OS : Linux 6.8.0-71-generic
% 0.11/5.40 % CPULimit : 300
% 0.11/5.40 % WCLimit : 300
% 0.11/5.40 % DateTime : Mon Sep 21 02:31:54 UTC 2026
% 0.11/5.41 % CPUTime :
% 0.11/5.41 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/5.45 Running first-order theorem proving
% 0.11/5.45 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.17/5.65 % Version: 3.5.1
% 0.17/5.65 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/5.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/5.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/5.65 % Starting new_bool_3 with 300s (1) cores
% 0.17/5.65 % Starting new_bool_1 with 300s (1) cores
% 0.17/5.65 % Starting sh5l with 300s (1) cores
% 0.17/5.65 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2358386 completed with status 0
% 0.17/5.65 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/5.65 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/5.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/5.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/5.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/5.65 % No SInE strategy applied
% 0.17/5.65 % Search class: FGUSF-FFMM22-SFFFFFNN
% 0.17/5.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/5.65 % Starting SubtermCWHack with 136s (1) cores
% 0.17/5.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/5.65 % Starting G-E--_107_B42_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.17/5.66 % Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/5.66 % Starting new_bool_3 with 136s (1) cores
% 0.17/5.66 % new_bool_3 with pid 2358397 completed with status 0
% 0.17/5.66 % Result found by new_bool_3
% 0.17/5.66 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/5.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/5.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/5.66 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/5.66 % No SInE strategy applied
% 0.17/5.66 % Search class: FGUSF-FFMM22-SFFFFFNN
% 0.17/5.66 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/5.66 % Starting SubtermCWHack with 136s (1) cores
% 0.17/5.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/5.66 % Starting G-E--_107_B42_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.17/5.66 % Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/5.66 % Starting new_bool_3 with 136s (1) cores
% 0.17/5.66 % Preprocessing time : 0.002 s
% 0.17/5.66 % Presaturation interreduction done
% 0.17/5.66
% 0.17/5.66 % Proof found!
% 0.17/5.66 % SZS status Theorem
% 0.17/5.66 % SZS output start CNFRefutation
% See solution above
% 0.17/5.66 % Parsed axioms : 27
% 0.17/5.66 % Removed by relevancy pruning/SinE : 0
% 0.17/5.66 % Initial clauses : 47
% 0.17/5.66 % Removed in clause preprocessing : 1
% 0.17/5.66 % Initial clauses in saturation : 46
% 0.17/5.66 % Processed clauses : 1747
% 0.17/5.66 % ...of these trivial : 65
% 0.17/5.66 % ...subsumed : 1053
% 0.17/5.66 % ...remaining for further processing : 629
% 0.17/5.66 % Other redundant clauses eliminated : 105
% 0.17/5.66 % Clauses deleted for lack of memory : 0
% 0.17/5.66 % Backward-subsumed : 26
% 0.17/5.66 % Backward-rewritten : 159
% 0.17/5.66 % Generated clauses : 7992
% 0.17/5.66 % ...of the previous two non-redundant : 6463
% 0.17/5.66 % ...aggressively subsumed : 0
% 0.17/5.66 % Contextual simplify-reflections : 55
% 0.17/5.66 % Paramodulations : 7870
% 0.17/5.66 % Factorizations : 6
% 0.17/5.66 % NegExts : 0
% 0.17/5.66 % Equation resolutions : 116
% 0.17/5.66 % Disequality decompositions : 0
% 0.17/5.66 % Total rewrite steps : 9819
% 0.17/5.66 % ...of those cached : 9697
% 0.17/5.66 % Propositional unsat checks : 0
% 0.17/5.66 % Propositional check models : 0
% 0.17/5.66 % Propositional check unsatisfiable : 0
% 0.17/5.66 % Propositional clauses : 0
% 0.17/5.66 % Propositional clauses after purity: 0
% 0.17/5.66 % Propositional unsat core size : 0
% 0.17/5.66 % Propositional preprocessing time : 0.000
% 0.17/5.66 % Propositional encoding time : 0.000
% 0.17/5.66 % Propositional solver time : 0.000
% 0.17/5.66 % Success case prop preproc time : 0.000
% 0.17/5.66 % Success case prop encoding time : 0.000
% 0.17/5.66 % Success case prop solver time : 0.000
% 0.17/5.66 % Current number of processed clauses : 396
% 0.17/5.66 % Positive orientable unit clauses : 94
% 0.17/5.66 % Positive unorientable unit clauses: 0
% 0.17/5.66 % Negative unit clauses : 4
% 0.17/5.66 % Non-unit-clauses : 298
% 0.17/5.66 % Current number of unprocessed clauses: 4625
% 0.17/5.66 % ...number of literals in the above : 21890
% 0.17/5.66 % Current number of archived formulas : 0
% 0.17/5.66 % Current number of archived clauses : 228
% 0.17/5.66 % Clause-clause subsumption calls (NU) : 21390
% 0.17/5.66 % Rec. Clause-clause subsumption calls : 14029
% 0.17/5.66 % Non-unit clause-clause subsumptions : 1067
% 0.17/5.66 % Unit Clause-clause subsumption calls : 170
% 0.17/5.66 % Rewrite failures with RHS unbound : 0
% 0.17/5.66 % BW rewrite match attempts : 100
% 0.17/5.66 % BW rewrite match successes : 57
% 0.17/5.66 % Condensation attempts : 0
% 0.17/5.66 % Condensation successes : 0
% 0.17/5.66 % Termbank termtop insertions : 133126
% 0.17/5.66 % Search garbage collected termcells : 684
% 0.17/5.66
% 0.17/5.66 % -------------------------------------------------
% 0.17/5.66 % User time : 0.165 s
% 0.17/5.66 % System time : 0.017 s
% 0.17/5.66 % Total time : 0.182 s
% 0.17/5.66 % Maximum resident set size: 3660 pages
% 0.17/5.66
% 0.17/5.66 % -------------------------------------------------
% 0.17/5.66 % User time : 0.840 s
% 0.17/5.66 % System time : 0.060 s
% 0.17/5.66 % Total time : 0.900 s
% 0.17/5.66 % Maximum resident set size: 4864 pages
% 0.17/5.66 % E exiting
%------------------------------------------------------------------------------