%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM465+1 : 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 : n016.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:55:07 PM UTC 2026
% Result : Theorem 0.98s 0.72s
% Output : CNFRefutation 0.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of formulae : 63 ( 14 unt; 0 def)
% Number of atoms : 227 ( 74 equ)
% Maximal formula atoms : 28 ( 3 avg)
% Number of connectives : 275 ( 111 ~; 104 |; 41 &)
% ( 1 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 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 : 63 ( 0 sgn 34 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( xm != sz00
=> sdtlseqdt0(xn,sdtasdt0(xn,xm)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mZeroAdd,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( sdtpldt0(X1,X2) = sz00
=> ( X2 = sz00
& X1 = sz00 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mZeroAdd) ).
fof(mDefLE,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( sdtlseqdt0(X1,X2)
<=> ? [X3] :
( sdtpldt0(X1,X3) = X2
& aNaturalNumber0(X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefLE) ).
fof(mMonMul,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X3)
& aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( sdtlseqdt0(X2,X3)
& X2 != X3
& X1 != sz00 )
=> ( sdtlseqdt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1))
& sdtasdt0(X2,X1) != sdtasdt0(X3,X1)
& sdtlseqdt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
& sdtasdt0(X1,X2) != sdtasdt0(X1,X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMonMul) ).
fof(mSortsC_01,axiom,
( sz10 != sz00
& aNaturalNumber0(sz10) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC_01) ).
fof(m__1007,hypothesis,
( xm != sz00
=> sdtlseqdt0(sz10,xm) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1007) ).
fof(mSortsC,axiom,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC) ).
fof(mSortsB,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> aNaturalNumber0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB) ).
fof(m_MulUnit,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( X1 = sdtasdt0(sz10,X1)
& sdtasdt0(X1,sz10) = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m_MulUnit) ).
fof(m_AddZero,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( X1 = sdtpldt0(sz00,X1)
& sdtpldt0(X1,sz00) = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m_AddZero) ).
fof(m__987,hypothesis,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__987) ).
fof(mLETotal,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( sdtlseqdt0(X2,X1)
& X2 != X1 )
| sdtlseqdt0(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mLETotal) ).
fof(m_MulZero,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( sz00 = sdtasdt0(sz00,X1)
& sdtasdt0(X1,sz00) = sz00 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m_MulZero) ).
fof(c_0_13,negated_conjecture,
~ ( xm != sz00
=> sdtlseqdt0(xn,sdtasdt0(xn,xm)) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_14,plain,
! [X31,X32] :
( ( ~ aNaturalNumber0(X32)
| ~ aNaturalNumber0(X31)
| sdtpldt0(X31,X32) != sz00
| X32 = sz00 )
& ( ~ aNaturalNumber0(X32)
| ~ aNaturalNumber0(X31)
| sdtpldt0(X31,X32) != sz00
| X31 = sz00 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mZeroAdd])])])]) ).
fof(c_0_15,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_16,plain,
! [X1,X2,X3] :
( ( aNaturalNumber0(X3)
& aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( sdtlseqdt0(X2,X3)
& X2 != X3
& X1 != sz00 )
=> ( sdtlseqdt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1))
& sdtasdt0(X2,X1) != sdtasdt0(X3,X1)
& sdtlseqdt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
& sdtasdt0(X1,X2) != sdtasdt0(X1,X3) ) ) ),
inference(fof_simplification,[status(thm)],[mMonMul]) ).
fof(c_0_17,plain,
( sz10 != sz00
& aNaturalNumber0(sz10) ),
inference(fof_simplification,[status(thm)],[mSortsC_01]) ).
fof(c_0_18,hypothesis,
( xm != sz00
=> sdtlseqdt0(sz10,xm) ),
inference(fof_simplification,[status(thm)],[m__1007]) ).
fof(c_0_19,negated_conjecture,
~ ( xm != sz00
=> sdtlseqdt0(xn,sdtasdt0(xn,xm)) ),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| sdtpldt0(X2,X1) != sz00
| X1 = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ sdtlseqdt0(X1,X2)
| sdtpldt0(X1,esk1_2(X1,X2)) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
aNaturalNumber0(sz00),
inference(split_conjunct,[status(thm)],[mSortsC]) ).
fof(c_0_23,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_24,plain,
! [X53,X54,X55] :
( ( ~ aNaturalNumber0(X55)
| ~ aNaturalNumber0(X54)
| ~ aNaturalNumber0(X53)
| ~ sdtlseqdt0(X54,X55)
| X54 = X55
| X53 = sz00
| sdtlseqdt0(sdtasdt0(X54,X53),sdtasdt0(X55,X53)) )
& ( ~ aNaturalNumber0(X55)
| ~ aNaturalNumber0(X54)
| ~ aNaturalNumber0(X53)
| ~ sdtlseqdt0(X54,X55)
| X54 = X55
| X53 = sz00
| sdtasdt0(X54,X53) != sdtasdt0(X55,X53) )
& ( ~ aNaturalNumber0(X55)
| ~ aNaturalNumber0(X54)
| ~ aNaturalNumber0(X53)
| ~ sdtlseqdt0(X54,X55)
| X54 = X55
| X53 = sz00
| sdtlseqdt0(sdtasdt0(X53,X54),sdtasdt0(X53,X55)) )
& ( ~ aNaturalNumber0(X55)
| ~ aNaturalNumber0(X54)
| ~ aNaturalNumber0(X53)
| ~ sdtlseqdt0(X54,X55)
| X54 = X55
| X53 = sz00
| sdtasdt0(X53,X54) != sdtasdt0(X53,X55) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])]) ).
fof(c_0_25,plain,
! [X20] :
( ( ~ aNaturalNumber0(X20)
| X20 = sdtasdt0(sz10,X20) )
& ( ~ aNaturalNumber0(X20)
| sdtasdt0(X20,sz10) = X20 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_MulUnit])])])]) ).
fof(c_0_26,plain,
( sz10 != sz00
& aNaturalNumber0(sz10) ),
inference(fof_nnf,[status(thm)],[c_0_17]) ).
fof(c_0_27,hypothesis,
( sdtlseqdt0(sz10,xm)
| xm = sz00 ),
inference(fof_nnf,[status(thm)],[c_0_18]) ).
fof(c_0_28,negated_conjecture,
( ~ sdtlseqdt0(xn,sdtasdt0(xn,xm))
& xm != sz00 ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])]) ).
cnf(c_0_29,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(esk1_2(X1,sz00))
| ~ sdtlseqdt0(X1,sz00)
| esk1_2(X1,sz00) = sz00 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21])]),c_0_22])]) ).
cnf(c_0_30,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ sdtlseqdt0(X1,X2)
| aNaturalNumber0(esk1_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
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_15]) ).
cnf(c_0_32,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| aNaturalNumber0(sdtpldt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_33,plain,
! [X14] :
( ( ~ aNaturalNumber0(X14)
| X14 = sdtpldt0(sz00,X14) )
& ( ~ aNaturalNumber0(X14)
| sdtpldt0(X14,sz00) = X14 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_AddZero])])])]) ).
cnf(c_0_34,plain,
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ sdtlseqdt0(X2,X3)
| X2 = X3
| X1 = sz00
| sdtlseqdt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_35,plain,
( ~ aNaturalNumber0(X1)
| sdtasdt0(X1,sz10) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_36,plain,
aNaturalNumber0(sz10),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_37,hypothesis,
( sdtlseqdt0(sz10,xm)
| xm = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_38,negated_conjecture,
xm != sz00,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_39,plain,
( ~ aNaturalNumber0(X1)
| ~ sdtlseqdt0(X1,sz00)
| esk1_2(X1,sz00) = sz00 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_22])]) ).
cnf(c_0_40,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_41,plain,
( ~ aNaturalNumber0(X1)
| X1 = sdtpldt0(sz00,X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_42,negated_conjecture,
~ sdtlseqdt0(xn,sdtasdt0(xn,xm)),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_43,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ sdtlseqdt0(sz10,X1)
| sdtlseqdt0(X2,sdtasdt0(X2,X1))
| X2 = sz00
| sz10 = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).
cnf(c_0_44,hypothesis,
sdtlseqdt0(sz10,xm),
inference(sr,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_45,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__987]) ).
cnf(c_0_46,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__987]) ).
cnf(c_0_47,plain,
( ~ aNaturalNumber0(X1)
| ~ sdtlseqdt0(X1,sz00)
| sdtpldt0(X1,sz00) = sz00 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_39]),c_0_22])]) ).
cnf(c_0_48,plain,
( ~ aNaturalNumber0(X1)
| sdtlseqdt0(sz00,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_22])]) ).
fof(c_0_49,plain,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( sdtlseqdt0(X2,X1)
& X2 != X1 )
| sdtlseqdt0(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[mLETotal]) ).
cnf(c_0_50,negated_conjecture,
( xm = sz10
| xn = sz00 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_45]),c_0_46])]) ).
fof(c_0_51,plain,
! [X21] :
( ( ~ aNaturalNumber0(X21)
| sz00 = sdtasdt0(sz00,X21) )
& ( ~ aNaturalNumber0(X21)
| sdtasdt0(X21,sz00) = sz00 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_MulZero])])])]) ).
cnf(c_0_52,plain,
sdtpldt0(sz00,sz00) = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_22])]) ).
fof(c_0_53,plain,
! [X48,X49] :
( ( ~ aNaturalNumber0(X49)
| ~ aNaturalNumber0(X48)
| sdtlseqdt0(X48,X49)
| sdtlseqdt0(X49,X48) )
& ( ~ aNaturalNumber0(X49)
| ~ aNaturalNumber0(X48)
| sdtlseqdt0(X48,X49)
| X49 != X48 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_49])])])]) ).
cnf(c_0_54,negated_conjecture,
( ~ sdtlseqdt0(sz00,sdtasdt0(sz00,xm))
| xm = sz10 ),
inference(spm,[status(thm)],[c_0_42,c_0_50]) ).
cnf(c_0_55,plain,
( ~ aNaturalNumber0(X1)
| sz00 = sdtasdt0(sz00,X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_56,plain,
sdtlseqdt0(sz00,sz00),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_52]),c_0_22])]) ).
cnf(c_0_57,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| sdtlseqdt0(X2,X1)
| sdtlseqdt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_58,negated_conjecture,
xm = sz10,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]),c_0_45])]) ).
cnf(c_0_59,hypothesis,
( ~ aNaturalNumber0(X1)
| sdtlseqdt0(xn,X1)
| sdtlseqdt0(X1,xn) ),
inference(spm,[status(thm)],[c_0_57,c_0_46]) ).
cnf(c_0_60,negated_conjecture,
~ sdtlseqdt0(xn,sdtasdt0(xn,sz10)),
inference(spm,[status(thm)],[c_0_42,c_0_58]) ).
cnf(c_0_61,hypothesis,
sdtlseqdt0(xn,xn),
inference(spm,[status(thm)],[c_0_59,c_0_46]) ).
cnf(c_0_62,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_35]),c_0_61]),c_0_46])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM465+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.44 % Computer : n016.cluster.edu
% 0.19/0.44 % Model : x86_64 x86_64
% 0.19/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44 % Memory : 8046.5625MB
% 0.19/0.44 % OS : Linux 6.8.0-71-generic
% 0.19/0.44 % CPULimit : 300
% 0.19/0.44 % WCLimit : 300
% 0.19/0.44 % DateTime : Mon Sep 21 02:37:07 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.52 Running first-order theorem proving
% 0.19/0.52 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
% 0.98/0.72 % Version: 3.5.1
% 0.98/0.72 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.98/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.98/0.72 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.98/0.72 % Starting new_bool_3 with 300s (1) cores
% 0.98/0.72 % Starting new_bool_1 with 300s (1) cores
% 0.98/0.72 % Starting sh5l with 300s (1) cores
% 0.98/0.72 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1371974 completed with status 0
% 0.98/0.72 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.98/0.72 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.98/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.98/0.72 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.98/0.72 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.98/0.72 % No SInE strategy applied
% 0.98/0.72 % Search class: FGUSF-FFMS22-SFFFFFNN
% 0.98/0.72 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.98/0.72 % Starting SubtermCWHack with 136s (1) cores
% 0.98/0.72 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.98/0.72 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.98/0.72 % Starting new_bool_3 with 136s (1) cores
% 0.98/0.72 % Starting new_bool_1 with 136s (1) cores
% 0.98/0.72 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 1371983 completed with status 0
% 0.98/0.72 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.98/0.72 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.98/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.98/0.72 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.98/0.72 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.98/0.72 % No SInE strategy applied
% 0.98/0.72 % Search class: FGUSF-FFMS22-SFFFFFNN
% 0.98/0.72 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.98/0.72 % Starting SubtermCWHack with 136s (1) cores
% 0.98/0.72 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.98/0.72 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.98/0.72 % Preprocessing time : 0.002 s
% 0.98/0.72 % Presaturation interreduction done
% 0.98/0.72
% 0.98/0.72 % Proof found!
% 0.98/0.72 % SZS status Theorem
% 0.98/0.72 % SZS output start CNFRefutation
% See solution above
% 0.98/0.72 % Parsed axioms : 29
% 0.98/0.72 % Removed by relevancy pruning/SinE : 0
% 0.98/0.72 % Initial clauses : 51
% 0.98/0.72 % Removed in clause preprocessing : 2
% 0.98/0.72 % Initial clauses in saturation : 49
% 0.98/0.72 % Processed clauses : 1520
% 0.98/0.72 % ...of these trivial : 6
% 0.98/0.72 % ...subsumed : 1091
% 0.98/0.72 % ...remaining for further processing : 423
% 0.98/0.72 % Other redundant clauses eliminated : 64
% 0.98/0.72 % Clauses deleted for lack of memory : 0
% 0.98/0.72 % Backward-subsumed : 36
% 0.98/0.72 % Backward-rewritten : 95
% 0.98/0.72 % Generated clauses : 6161
% 0.98/0.72 % ...of the previous two non-redundant : 5521
% 0.98/0.72 % ...aggressively subsumed : 0
% 0.98/0.72 % Contextual simplify-reflections : 54
% 0.98/0.72 % Paramodulations : 6091
% 0.98/0.72 % Factorizations : 0
% 0.98/0.72 % NegExts : 0
% 0.98/0.72 % Equation resolutions : 70
% 0.98/0.72 % Disequality decompositions : 0
% 0.98/0.72 % Total rewrite steps : 4779
% 0.98/0.72 % ...of those cached : 4761
% 0.98/0.72 % Propositional unsat checks : 0
% 0.98/0.72 % Propositional check models : 0
% 0.98/0.72 % Propositional check unsatisfiable : 0
% 0.98/0.72 % Propositional clauses : 0
% 0.98/0.72 % Propositional clauses after purity: 0
% 0.98/0.72 % Propositional unsat core size : 0
% 0.98/0.72 % Propositional preprocessing time : 0.000
% 0.98/0.72 % Propositional encoding time : 0.000
% 0.98/0.72 % Propositional solver time : 0.000
% 0.98/0.72 % Success case prop preproc time : 0.000
% 0.98/0.72 % Success case prop encoding time : 0.000
% 0.98/0.72 % Success case prop solver time : 0.000
% 0.98/0.72 % Current number of processed clauses : 243
% 0.98/0.72 % Positive orientable unit clauses : 14
% 0.98/0.72 % Positive unorientable unit clauses: 0
% 0.98/0.72 % Negative unit clauses : 6
% 0.98/0.72 % Non-unit-clauses : 223
% 0.98/0.72 % Current number of unprocessed clauses: 4059
% 0.98/0.72 % ...number of literals in the above : 24309
% 0.98/0.72 % Current number of archived formulas : 0
% 0.98/0.72 % Current number of archived clauses : 175
% 0.98/0.72 % Clause-clause subsumption calls (NU) : 13639
% 0.98/0.72 % Rec. Clause-clause subsumption calls : 6772
% 0.98/0.72 % Non-unit clause-clause subsumptions : 974
% 0.98/0.72 % Unit Clause-clause subsumption calls : 132
% 0.98/0.72 % Rewrite failures with RHS unbound : 0
% 0.98/0.72 % BW rewrite match attempts : 6
% 0.98/0.72 % BW rewrite match successes : 6
% 0.98/0.72 % Condensation attempts : 0
% 0.98/0.72 % Condensation successes : 0
% 0.98/0.72 % Termbank termtop insertions : 117400
% 0.98/0.72 % Search garbage collected termcells : 771
% 0.98/0.72
% 0.98/0.72 % -------------------------------------------------
% 0.98/0.72 % User time : 0.141 s
% 0.98/0.72 % System time : 0.007 s
% 0.98/0.72 % Total time : 0.148 s
% 0.98/0.72 % Maximum resident set size: 3660 pages
% 0.98/0.72
% 0.98/0.72 % -------------------------------------------------
% 0.98/0.72 % User time : 0.467 s
% 0.98/0.72 % System time : 0.035 s
% 0.98/0.72 % Total time : 0.502 s
% 0.98/0.72 % Maximum resident set size: 4864 pages
% 0.98/0.72 % E exiting
%------------------------------------------------------------------------------