%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM474+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 : n014.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:13 PM UTC 2026
% Result : Theorem 0.12s 0.46s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of formulae : 66 ( 33 unt; 0 def)
% Number of atoms : 205 ( 63 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 244 ( 105 ~; 100 |; 25 &)
% ( 4 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-2 aty)
% Number of variables : 66 ( 0 sgn 34 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
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/sandbox2/benchmark/theBenchmark.p',mDefQuot) ).
fof(m__1347,hypothesis,
xl != sz00,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1347) ).
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,
sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr)) = sdtpldt0(sdtasdt0(xl,xp),xn),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__1324_04,hypothesis,
( doDivides0(xl,sdtpldt0(xm,xn))
& doDivides0(xl,xm) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1324_04) ).
fof(m__1379,hypothesis,
xq = sdtsldt0(sdtpldt0(xm,xn),xl),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1379) ).
fof(m__1324,hypothesis,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xl) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1324) ).
fof(mSortsB,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> aNaturalNumber0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsB) ).
fof(m__1395,hypothesis,
sdtlseqdt0(xp,xq),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1395) ).
fof(m__1422,hypothesis,
xr = sdtmndt0(xq,xp),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1422) ).
fof(m__1360,hypothesis,
xp = sdtsldt0(xm,xl),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1360) ).
fof(mDefDiv,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( doDivides0(X1,X2)
<=> ? [X3] :
( X2 = sdtasdt0(X1,X3)
& aNaturalNumber0(X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefDiv) ).
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(c_0_14,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_15,plain,
! [X67,X68,X69] :
( ( ~ aNaturalNumber0(X68)
| ~ aNaturalNumber0(X67)
| ~ doDivides0(X67,X68)
| X67 = sz00
| X69 = sdtsldt0(X68,X67)
| X68 != sdtasdt0(X67,X69)
| ~ aNaturalNumber0(X69) )
& ( ~ aNaturalNumber0(X68)
| ~ aNaturalNumber0(X67)
| ~ doDivides0(X67,X68)
| X67 = sz00
| X69 != sdtsldt0(X68,X67)
| X68 = sdtasdt0(X67,X69) )
& ( ~ aNaturalNumber0(X68)
| ~ aNaturalNumber0(X67)
| ~ doDivides0(X67,X68)
| X67 = sz00
| X69 != sdtsldt0(X68,X67)
| aNaturalNumber0(X69) ) ),
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_14])])])])]) ).
fof(c_0_16,hypothesis,
xl != sz00,
inference(fof_simplification,[status(thm)],[m__1347]) ).
fof(c_0_17,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_18,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ doDivides0(X3,X2)
| X1 != sdtsldt0(X2,X3)
| X3 = sz00
| aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_19,hypothesis,
xl != sz00,
inference(fof_nnf,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ sdtlseqdt0(X3,X2)
| X1 != sdtmndt0(X2,X3)
| aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_21,negated_conjecture,
sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr)) != sdtpldt0(sdtasdt0(xl,xp),xn),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_22,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ doDivides0(X1,X2)
| aNaturalNumber0(sdtsldt0(X2,X1))
| X1 = sz00 ),
inference(er,[status(thm)],[c_0_18]) ).
cnf(c_0_23,hypothesis,
doDivides0(xl,sdtpldt0(xm,xn)),
inference(split_conjunct,[status(thm)],[m__1324_04]) ).
cnf(c_0_24,hypothesis,
xq = sdtsldt0(sdtpldt0(xm,xn),xl),
inference(split_conjunct,[status(thm)],[m__1379]) ).
cnf(c_0_25,hypothesis,
aNaturalNumber0(xl),
inference(split_conjunct,[status(thm)],[m__1324]) ).
cnf(c_0_26,hypothesis,
xl != sz00,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_27,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_28,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ sdtlseqdt0(X2,X1)
| aNaturalNumber0(sdtmndt0(X1,X2)) ),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_29,hypothesis,
sdtlseqdt0(xp,xq),
inference(split_conjunct,[status(thm)],[m__1395]) ).
cnf(c_0_30,hypothesis,
xr = sdtmndt0(xq,xp),
inference(split_conjunct,[status(thm)],[m__1422]) ).
cnf(c_0_31,hypothesis,
doDivides0(xl,xm),
inference(split_conjunct,[status(thm)],[m__1324_04]) ).
cnf(c_0_32,hypothesis,
xp = sdtsldt0(xm,xl),
inference(split_conjunct,[status(thm)],[m__1360]) ).
cnf(c_0_33,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__1324]) ).
fof(c_0_34,plain,
! [X63,X64,X66] :
( ( ~ aNaturalNumber0(X64)
| ~ aNaturalNumber0(X63)
| doDivides0(X63,X64)
| X64 != sdtasdt0(X63,X66)
| ~ aNaturalNumber0(X66) )
& ( ~ aNaturalNumber0(X64)
| ~ aNaturalNumber0(X63)
| ~ doDivides0(X63,X64)
| X64 = sdtasdt0(X63,esk2_2(X63,X64)) )
& ( ~ aNaturalNumber0(X64)
| ~ aNaturalNumber0(X63)
| ~ doDivides0(X63,X64)
| aNaturalNumber0(esk2_2(X63,X64)) ) ),
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_35,negated_conjecture,
sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr)) != sdtpldt0(sdtasdt0(xl,xp),xn),
inference(fof_simplification,[status(thm)],[c_0_21]) ).
cnf(c_0_36,plain,
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X1)
| ~ sdtlseqdt0(X1,X3)
| X2 != sdtmndt0(X3,X1)
| sdtpldt0(X1,X2) = X3 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_37,hypothesis,
( ~ aNaturalNumber0(sdtpldt0(xm,xn))
| aNaturalNumber0(xq) ),
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_38,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| aNaturalNumber0(sdtpldt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_39,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__1324]) ).
cnf(c_0_40,hypothesis,
( ~ aNaturalNumber0(xq)
| ~ aNaturalNumber0(xp)
| aNaturalNumber0(xr) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_41,hypothesis,
aNaturalNumber0(xp),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_31]),c_0_32]),c_0_25]),c_0_33])]),c_0_26]) ).
cnf(c_0_42,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X2,X1)
| X1 = sdtasdt0(X2,esk2_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_43,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ doDivides0(X1,X2)
| aNaturalNumber0(esk2_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
fof(c_0_44,negated_conjecture,
sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr)) != sdtpldt0(sdtasdt0(xl,xp),xn),
inference(fof_nnf,[status(thm)],[c_0_35]) ).
fof(c_0_45,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])])])]) ).
cnf(c_0_46,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ sdtlseqdt0(X1,X2)
| sdtpldt0(X1,sdtmndt0(X2,X1)) = X2 ),
inference(er,[status(thm)],[c_0_36]) ).
cnf(c_0_47,hypothesis,
aNaturalNumber0(xq),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),c_0_33])]) ).
cnf(c_0_48,hypothesis,
( ~ aNaturalNumber0(xq)
| aNaturalNumber0(xr) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]) ).
cnf(c_0_49,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X2,X1)
| X3 != sdtsldt0(X1,X2)
| X2 = sz00
| X1 = sdtasdt0(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_50,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_51,hypothesis,
( ~ aNaturalNumber0(sdtpldt0(xm,xn))
| sdtasdt0(xl,esk2_2(xl,sdtpldt0(xm,xn))) = sdtpldt0(xm,xn) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_23]),c_0_25])]) ).
cnf(c_0_52,hypothesis,
( ~ aNaturalNumber0(sdtpldt0(xm,xn))
| aNaturalNumber0(esk2_2(xl,sdtpldt0(xm,xn))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_23]),c_0_25])]) ).
cnf(c_0_53,negated_conjecture,
sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr)) != sdtpldt0(sdtasdt0(xl,xp),xn),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_54,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_45]) ).
cnf(c_0_55,hypothesis,
sdtpldt0(xp,xr) = xq,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_29]),c_0_30]),c_0_47]),c_0_41])]) ).
cnf(c_0_56,hypothesis,
aNaturalNumber0(xr),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_47])]) ).
cnf(c_0_57,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ doDivides0(X1,X2)
| X1 = sz00
| sdtasdt0(X1,sdtsldt0(X2,X1)) = X2 ),
inference(er,[status(thm)],[c_0_49]) ).
cnf(c_0_58,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| aNaturalNumber0(sdtasdt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_59,hypothesis,
sdtasdt0(xl,esk2_2(xl,sdtpldt0(xm,xn))) = sdtpldt0(xm,xn),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_38]),c_0_39]),c_0_33])]) ).
cnf(c_0_60,hypothesis,
aNaturalNumber0(esk2_2(xl,sdtpldt0(xm,xn))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_38]),c_0_39]),c_0_33])]) ).
cnf(c_0_61,negated_conjecture,
sdtpldt0(sdtasdt0(xl,xp),xn) != sdtasdt0(xl,xq),
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_53,c_0_54]),c_0_55]),c_0_56]),c_0_41]),c_0_25])]) ).
cnf(c_0_62,hypothesis,
sdtasdt0(xl,xp) = xm,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_31]),c_0_32]),c_0_25]),c_0_33])]),c_0_26]) ).
cnf(c_0_63,hypothesis,
aNaturalNumber0(sdtpldt0(xm,xn)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_25])]),c_0_60])]) ).
cnf(c_0_64,negated_conjecture,
sdtpldt0(xm,xn) != sdtasdt0(xl,xq),
inference(rw,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_65,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(spm,[status(thm)],[c_0_57,c_0_23]),c_0_24]),c_0_25]),c_0_63])]),c_0_26]),c_0_64]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM474+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.12/0.37 % Computer : n014.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 02:33:04 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.41 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.12/0.46 % Version: 3.5.1
% 0.12/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.12/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.12/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.46 % Starting sh5l with 300s (1) cores
% 0.12/0.46 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2953307 completed with status 0
% 0.12/0.46 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.12/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.12/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.12/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.46 % No SInE strategy applied
% 0.12/0.46 % Search class: FGUSF-FFMM22-SFFFFFNN
% 0.12/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.12/0.46 % Starting G-E--_107_B42_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.12/0.46 % Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.12/0.46 % Starting new_bool_3 with 136s (1) cores
% 0.12/0.46 % new_bool_3 with pid 2953318 completed with status 0
% 0.12/0.46 % Result found by new_bool_3
% 0.12/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.12/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.12/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.46 % No SInE strategy applied
% 0.12/0.46 % Search class: FGUSF-FFMM22-SFFFFFNN
% 0.12/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.12/0.46 % Starting G-E--_107_B42_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.12/0.46 % Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.12/0.46 % Starting new_bool_3 with 136s (1) cores
% 0.12/0.46 % Preprocessing time : 0.002 s
% 0.12/0.46 % Presaturation interreduction done
% 0.12/0.46
% 0.12/0.46 % Proof found!
% 0.12/0.46 % SZS status Theorem
% 0.12/0.46 % SZS output start CNFRefutation
% See solution above
% 0.12/0.46 % Parsed axioms : 41
% 0.12/0.46 % Removed by relevancy pruning/SinE : 0
% 0.12/0.46 % Initial clauses : 68
% 0.12/0.46 % Removed in clause preprocessing : 3
% 0.12/0.46 % Initial clauses in saturation : 65
% 0.12/0.46 % Processed clauses : 238
% 0.12/0.46 % ...of these trivial : 2
% 0.12/0.46 % ...subsumed : 54
% 0.12/0.46 % ...remaining for further processing : 181
% 0.12/0.46 % Other redundant clauses eliminated : 17
% 0.12/0.46 % Clauses deleted for lack of memory : 0
% 0.12/0.46 % Backward-subsumed : 1
% 0.12/0.46 % Backward-rewritten : 14
% 0.12/0.46 % Generated clauses : 384
% 0.12/0.46 % ...of the previous two non-redundant : 354
% 0.12/0.46 % ...aggressively subsumed : 0
% 0.12/0.46 % Contextual simplify-reflections : 6
% 0.12/0.46 % Paramodulations : 361
% 0.12/0.46 % Factorizations : 2
% 0.12/0.46 % NegExts : 0
% 0.12/0.46 % Equation resolutions : 21
% 0.12/0.46 % Disequality decompositions : 0
% 0.12/0.46 % Total rewrite steps : 348
% 0.12/0.46 % ...of those cached : 327
% 0.12/0.46 % Propositional unsat checks : 0
% 0.12/0.46 % Propositional check models : 0
% 0.12/0.46 % Propositional check unsatisfiable : 0
% 0.12/0.46 % Propositional clauses : 0
% 0.12/0.46 % Propositional clauses after purity: 0
% 0.12/0.46 % Propositional unsat core size : 0
% 0.12/0.46 % Propositional preprocessing time : 0.000
% 0.12/0.46 % Propositional encoding time : 0.000
% 0.12/0.46 % Propositional solver time : 0.000
% 0.12/0.46 % Success case prop preproc time : 0.000
% 0.12/0.46 % Success case prop encoding time : 0.000
% 0.12/0.46 % Success case prop solver time : 0.000
% 0.12/0.46 % Current number of processed clauses : 97
% 0.12/0.46 % Positive orientable unit clauses : 21
% 0.12/0.46 % Positive unorientable unit clauses: 0
% 0.12/0.46 % Negative unit clauses : 5
% 0.12/0.46 % Non-unit-clauses : 71
% 0.12/0.46 % Current number of unprocessed clauses: 241
% 0.12/0.46 % ...number of literals in the above : 1017
% 0.12/0.46 % Current number of archived formulas : 0
% 0.12/0.46 % Current number of archived clauses : 75
% 0.12/0.46 % Clause-clause subsumption calls (NU) : 913
% 0.12/0.46 % Rec. Clause-clause subsumption calls : 382
% 0.12/0.46 % Non-unit clause-clause subsumptions : 59
% 0.12/0.46 % Unit Clause-clause subsumption calls : 78
% 0.12/0.46 % Rewrite failures with RHS unbound : 0
% 0.12/0.46 % BW rewrite match attempts : 6
% 0.12/0.46 % BW rewrite match successes : 6
% 0.12/0.46 % Condensation attempts : 0
% 0.12/0.46 % Condensation successes : 0
% 0.12/0.46 % Termbank termtop insertions : 11399
% 0.12/0.46 % Search garbage collected termcells : 1039
% 0.12/0.46
% 0.12/0.46 % -------------------------------------------------
% 0.12/0.46 % User time : 0.023 s
% 0.12/0.46 % System time : 0.004 s
% 0.12/0.46 % Total time : 0.027 s
% 0.12/0.46 % Maximum resident set size: 3672 pages
% 0.12/0.46
% 0.12/0.46 % -------------------------------------------------
% 0.12/0.46 % User time : 0.106 s
% 0.12/0.46 % System time : 0.010 s
% 0.12/0.46 % Total time : 0.117 s
% 0.12/0.46 % Maximum resident set size: 4608 pages
% 0.12/0.46 % E exiting
%------------------------------------------------------------------------------