%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : RNG062+2 : 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 : n007.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 02:06:14 PM UTC 2026
% Result : Theorem 2.13s 0.70s
% Output : CNFRefutation 2.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of formulae : 55 ( 18 unt; 0 def)
% Number of atoms : 158 ( 60 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 175 ( 72 ~; 63 |; 33 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 46 ( 1 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mMNeg,axiom,
! [X1,X2] :
( ( aScalar0(X2)
& aScalar0(X1) )
=> ( sdtasdt0(smndt0(X1),X2) = smndt0(sdtasdt0(X1,X2))
& sdtasdt0(X1,smndt0(X2)) = smndt0(sdtasdt0(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMNeg) ).
fof(m__2144,hypothesis,
( sdtasdt0(smndt0(xS),smndt0(xS)) = sdtasdt0(xS,xS)
& sdtasdt0(smndt0(xS),xR) = smndt0(xN)
& sdtasdt0(xR,smndt0(xS)) = smndt0(xN) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2144) ).
fof(m__1892,hypothesis,
( xR = sdtasdt0(xC,xG)
& aScalar0(xR) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1892) ).
fof(mMDNeg,axiom,
! [X1,X2] :
( ( aScalar0(X2)
& aScalar0(X1) )
=> sdtasdt0(smndt0(X1),smndt0(X2)) = sdtasdt0(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMDNeg) ).
fof(mScZero,axiom,
! [X1] :
( aScalar0(X1)
=> ( smndt0(sz0z00) = sz0z00
& smndt0(smndt0(X1)) = X1
& sdtpldt0(smndt0(X1),X1) = sz0z00
& sdtpldt0(X1,smndt0(X1)) = sz0z00
& sdtasdt0(sz0z00,X1) = sz0z00
& sdtasdt0(X1,sz0z00) = sz0z00
& sdtpldt0(sz0z00,X1) = X1
& sdtpldt0(X1,sz0z00) = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mScZero) ).
fof(m__1930,hypothesis,
( xS = sdtasdt0(xF,xD)
& aScalar0(xS) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1930) ).
fof(m__,conjecture,
sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS))) = sdtpldt0(sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),sdtasdt0(xS,xS)),smndt0(xN)),smndt0(xN)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mMulSc,axiom,
! [X1,X2] :
( ( aScalar0(X2)
& aScalar0(X1) )
=> aScalar0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulSc) ).
fof(m__1949,hypothesis,
( xN = sdtasdt0(xR,xS)
& aScalar0(xN) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1949) ).
fof(mNegSc,axiom,
! [X1] :
( aScalar0(X1)
=> aScalar0(smndt0(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mNegSc) ).
fof(mArith,axiom,
! [X1,X2,X3] :
( ( aScalar0(X3)
& aScalar0(X2)
& aScalar0(X1) )
=> ( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
& sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
& sdtpldt0(X1,X2) = sdtpldt0(X2,X1)
& sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mArith) ).
fof(m__2221,hypothesis,
sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS))) = sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(sdtasdt0(xS,xS),smndt0(xN))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2221) ).
fof(mSumSc,axiom,
! [X1,X2] :
( ( aScalar0(X2)
& aScalar0(X1) )
=> aScalar0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSumSc) ).
fof(c_0_13,plain,
! [X31,X32] :
( ( ~ aScalar0(X32)
| ~ aScalar0(X31)
| sdtasdt0(smndt0(X31),X32) = smndt0(sdtasdt0(X31,X32)) )
& ( ~ aScalar0(X32)
| ~ aScalar0(X31)
| sdtasdt0(X31,smndt0(X32)) = smndt0(sdtasdt0(X31,X32)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMNeg])])])]) ).
cnf(c_0_14,plain,
( ~ aScalar0(X2)
| ~ aScalar0(X1)
| sdtasdt0(X1,smndt0(X2)) = smndt0(sdtasdt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_15,hypothesis,
sdtasdt0(smndt0(xS),xR) = smndt0(xN),
inference(split_conjunct,[status(thm)],[m__2144]) ).
cnf(c_0_16,hypothesis,
aScalar0(xR),
inference(split_conjunct,[status(thm)],[m__1892]) ).
fof(c_0_17,plain,
! [X33,X34] :
( sdtasdt0(smndt0(X33),smndt0(X34)) = sdtasdt0(X33,X34)
| ~ aScalar0(X34)
| ~ aScalar0(X33) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMDNeg])])]) ).
fof(c_0_18,plain,
! [X20] :
( ( ~ aScalar0(X20)
| smndt0(sz0z00) = sz0z00 )
& ( ~ aScalar0(X20)
| smndt0(smndt0(X20)) = X20 )
& ( ~ aScalar0(X20)
| sdtpldt0(smndt0(X20),X20) = sz0z00 )
& ( ~ aScalar0(X20)
| sdtpldt0(X20,smndt0(X20)) = sz0z00 )
& ( ~ aScalar0(X20)
| sdtasdt0(sz0z00,X20) = sz0z00 )
& ( ~ aScalar0(X20)
| sdtasdt0(X20,sz0z00) = sz0z00 )
& ( ~ aScalar0(X20)
| sdtpldt0(sz0z00,X20) = X20 )
& ( ~ aScalar0(X20)
| sdtpldt0(X20,sz0z00) = X20 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mScZero])])])]) ).
cnf(c_0_19,hypothesis,
( ~ aScalar0(smndt0(xS))
| sdtasdt0(smndt0(xS),smndt0(xR)) = smndt0(smndt0(xN)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_20,plain,
( ~ aScalar0(X2)
| ~ aScalar0(X1)
| sdtasdt0(smndt0(X1),smndt0(X2)) = sdtasdt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,hypothesis,
aScalar0(xS),
inference(split_conjunct,[status(thm)],[m__1930]) ).
fof(c_0_22,negated_conjecture,
sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS))) != sdtpldt0(sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),sdtasdt0(xS,xS)),smndt0(xN)),smndt0(xN)),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_23,plain,
! [X17,X18] :
( aScalar0(sdtasdt0(X17,X18))
| ~ aScalar0(X18)
| ~ aScalar0(X17) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulSc])])]) ).
cnf(c_0_24,plain,
( ~ aScalar0(X1)
| smndt0(smndt0(X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,hypothesis,
( ~ aScalar0(smndt0(xS))
| smndt0(smndt0(xN)) = sdtasdt0(xS,xR) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_16]),c_0_21])]) ).
cnf(c_0_26,hypothesis,
aScalar0(xN),
inference(split_conjunct,[status(thm)],[m__1949]) ).
fof(c_0_27,plain,
! [X19] :
( aScalar0(smndt0(X19))
| ~ aScalar0(X19) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mNegSc])])]) ).
fof(c_0_28,negated_conjecture,
sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS))) != sdtpldt0(sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),sdtasdt0(xS,xS)),smndt0(xN)),smndt0(xN)),
inference(fof_simplification,[status(thm)],[c_0_22]) ).
cnf(c_0_29,plain,
( ~ aScalar0(X2)
| ~ aScalar0(X1)
| aScalar0(sdtasdt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_30,hypothesis,
sdtasdt0(smndt0(xS),smndt0(xS)) = sdtasdt0(xS,xS),
inference(split_conjunct,[status(thm)],[m__2144]) ).
cnf(c_0_31,hypothesis,
( ~ aScalar0(smndt0(xS))
| sdtasdt0(xS,xR) = xN ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_32,plain,
( ~ aScalar0(X1)
| aScalar0(smndt0(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_33,negated_conjecture,
sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS))) != sdtpldt0(sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),sdtasdt0(xS,xS)),smndt0(xN)),smndt0(xN)),
inference(fof_nnf,[status(thm)],[c_0_28]) ).
fof(c_0_34,plain,
! [X21,X22,X23] :
( ( ~ aScalar0(X23)
| ~ aScalar0(X22)
| ~ aScalar0(X21)
| sdtasdt0(X21,X22) = sdtasdt0(X22,X21) )
& ( ~ aScalar0(X23)
| ~ aScalar0(X22)
| ~ aScalar0(X21)
| sdtasdt0(sdtasdt0(X21,X22),X23) = sdtasdt0(X21,sdtasdt0(X22,X23)) )
& ( ~ aScalar0(X23)
| ~ aScalar0(X22)
| ~ aScalar0(X21)
| sdtpldt0(X21,X22) = sdtpldt0(X22,X21) )
& ( ~ aScalar0(X23)
| ~ aScalar0(X22)
| ~ aScalar0(X21)
| sdtpldt0(sdtpldt0(X21,X22),X23) = sdtpldt0(X21,sdtpldt0(X22,X23)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mArith])])])]) ).
cnf(c_0_35,hypothesis,
( ~ aScalar0(smndt0(xS))
| aScalar0(sdtasdt0(xS,xS)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,hypothesis,
sdtasdt0(xS,xR) = xN,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_21])]) ).
cnf(c_0_37,negated_conjecture,
sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS))) != sdtpldt0(sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),sdtasdt0(xS,xS)),smndt0(xN)),smndt0(xN)),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_38,plain,
( ~ aScalar0(X3)
| ~ aScalar0(X2)
| ~ aScalar0(X1)
| sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_39,hypothesis,
aScalar0(sdtasdt0(xS,xS)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_32]),c_0_21])]) ).
cnf(c_0_40,plain,
( ~ aScalar0(X1)
| ~ aScalar0(X2)
| aScalar0(sdtasdt0(X1,smndt0(X2))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_14]),c_0_29]) ).
cnf(c_0_41,hypothesis,
sdtasdt0(xS,smndt0(xR)) = smndt0(xN),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_36]),c_0_16]),c_0_21])]) ).
cnf(c_0_42,negated_conjecture,
( ~ aScalar0(smndt0(xN))
| ~ aScalar0(sdtasdt0(xR,xR))
| sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),sdtpldt0(sdtasdt0(xS,xS),smndt0(xN))),smndt0(xN)) != sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]) ).
cnf(c_0_43,hypothesis,
aScalar0(smndt0(xN)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_16]),c_0_21])]) ).
cnf(c_0_44,negated_conjecture,
( ~ aScalar0(sdtasdt0(xR,xR))
| sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),sdtpldt0(sdtasdt0(xS,xS),smndt0(xN))),smndt0(xN)) != sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]) ).
cnf(c_0_45,plain,
( ~ aScalar0(X3)
| ~ aScalar0(X2)
| ~ aScalar0(X1)
| sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_46,hypothesis,
sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS))) = sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(sdtasdt0(xS,xS),smndt0(xN))),
inference(split_conjunct,[status(thm)],[m__2221]) ).
cnf(c_0_47,negated_conjecture,
( ~ aScalar0(sdtasdt0(xR,xR))
| ~ aScalar0(sdtpldt0(sdtasdt0(xS,xS),smndt0(xN)))
| sdtpldt0(sdtasdt0(xR,xR),sdtpldt0(sdtpldt0(sdtasdt0(xS,xS),smndt0(xN)),smndt0(xN))) != sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_38]),c_0_43])]) ).
cnf(c_0_48,hypothesis,
( ~ aScalar0(X1)
| ~ aScalar0(X2)
| sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_26]) ).
cnf(c_0_49,hypothesis,
( ~ aScalar0(sdtasdt0(xR,xR))
| ~ aScalar0(sdtpldt0(sdtasdt0(xS,xS),smndt0(xN)))
| sdtpldt0(sdtasdt0(xR,xR),sdtpldt0(smndt0(xN),sdtpldt0(sdtasdt0(xS,xS),smndt0(xN)))) = sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_38]),c_0_43])]) ).
fof(c_0_50,plain,
! [X15,X16] :
( aScalar0(sdtpldt0(X15,X16))
| ~ aScalar0(X16)
| ~ aScalar0(X15) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSumSc])])]) ).
cnf(c_0_51,negated_conjecture,
( ~ aScalar0(sdtasdt0(xR,xR))
| ~ aScalar0(sdtpldt0(sdtasdt0(xS,xS),smndt0(xN))) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_43])]),c_0_49]) ).
cnf(c_0_52,plain,
( ~ aScalar0(X2)
| ~ aScalar0(X1)
| aScalar0(sdtpldt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_53,negated_conjecture,
~ aScalar0(sdtasdt0(xR,xR)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_43]),c_0_39])]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_29]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : RNG062+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n007.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 04:14:50 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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
% 2.13/0.70 % Version: 3.5.1
% 2.13/0.70 % Preprocessing class: FSLSSMSMSSSNFFN.
% 2.13/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.13/0.70 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.13/0.70 % Starting new_bool_3 with 300s (1) cores
% 2.13/0.70 % Starting new_bool_1 with 300s (1) cores
% 2.13/0.70 % Starting sh5l with 300s (1) cores
% 2.13/0.70 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 151756 completed with status 0
% 2.13/0.70 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 2.13/0.70 % Preprocessing class: FSLSSMSMSSSNFFN.
% 2.13/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.13/0.70 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.13/0.70 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.13/0.70 % No SInE strategy applied
% 2.13/0.70 % Search class: FGHSF-FFMM21-MFFFFFNN
% 2.13/0.70 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.13/0.70 % Starting SubtermCWHack with 136s (1) cores
% 2.13/0.70 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 2.13/0.70 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 2.13/0.70 % Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 2.13/0.70 % Starting new_bool_3 with 136s (1) cores
% 2.13/0.70 % SAT001_MinMin_p005000_rr_RG with pid 151762 completed with status 0
% 2.13/0.70 % Result found by SAT001_MinMin_p005000_rr_RG
% 2.13/0.70 % Preprocessing class: FSLSSMSMSSSNFFN.
% 2.13/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.13/0.70 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.13/0.70 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.13/0.70 % No SInE strategy applied
% 2.13/0.70 % Search class: FGHSF-FFMM21-MFFFFFNN
% 2.13/0.70 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.13/0.70 % Starting SubtermCWHack with 136s (1) cores
% 2.13/0.70 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 2.13/0.70 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 2.13/0.70 % Preprocessing time : 0.003 s
% 2.13/0.70 % Presaturation interreduction done
% 2.13/0.70
% 2.13/0.70 % Proof found!
% 2.13/0.70 % SZS status Theorem
% 2.13/0.70 % SZS output start CNFRefutation
% See solution above
% 2.13/0.70 % Parsed axioms : 61
% 2.13/0.70 % Removed by relevancy pruning/SinE : 0
% 2.13/0.70 % Initial clauses : 101
% 2.13/0.70 % Removed in clause preprocessing : 5
% 2.13/0.70 % Initial clauses in saturation : 96
% 2.13/0.70 % Processed clauses : 1687
% 2.13/0.70 % ...of these trivial : 210
% 2.13/0.70 % ...subsumed : 584
% 2.13/0.70 % ...remaining for further processing : 893
% 2.13/0.70 % Other redundant clauses eliminated : 13
% 2.13/0.70 % Clauses deleted for lack of memory : 0
% 2.13/0.70 % Backward-subsumed : 34
% 2.13/0.70 % Backward-rewritten : 129
% 2.13/0.70 % Generated clauses : 10339
% 2.13/0.70 % ...of the previous two non-redundant : 8558
% 2.13/0.70 % ...aggressively subsumed : 0
% 2.13/0.70 % Contextual simplify-reflections : 59
% 2.13/0.70 % Paramodulations : 10321
% 2.13/0.70 % Factorizations : 0
% 2.13/0.70 % NegExts : 0
% 2.13/0.70 % Equation resolutions : 18
% 2.13/0.70 % Disequality decompositions : 0
% 2.13/0.70 % Total rewrite steps : 14107
% 2.13/0.70 % ...of those cached : 13870
% 2.13/0.70 % Propositional unsat checks : 0
% 2.13/0.70 % Propositional check models : 0
% 2.13/0.70 % Propositional check unsatisfiable : 0
% 2.13/0.70 % Propositional clauses : 0
% 2.13/0.70 % Propositional clauses after purity: 0
% 2.13/0.70 % Propositional unsat core size : 0
% 2.13/0.70 % Propositional preprocessing time : 0.000
% 2.13/0.70 % Propositional encoding time : 0.000
% 2.13/0.70 % Propositional solver time : 0.000
% 2.13/0.70 % Success case prop preproc time : 0.000
% 2.13/0.70 % Success case prop encoding time : 0.000
% 2.13/0.70 % Success case prop solver time : 0.000
% 2.13/0.70 % Current number of processed clauses : 631
% 2.13/0.70 % Positive orientable unit clauses : 245
% 2.13/0.70 % Positive unorientable unit clauses: 0
% 2.13/0.70 % Negative unit clauses : 3
% 2.13/0.70 % Non-unit-clauses : 383
% 2.13/0.70 % Current number of unprocessed clauses: 6888
% 2.13/0.70 % ...number of literals in the above : 26633
% 2.13/0.70 % Current number of archived formulas : 0
% 2.13/0.70 % Current number of archived clauses : 259
% 2.13/0.70 % Clause-clause subsumption calls (NU) : 37767
% 2.13/0.70 % Rec. Clause-clause subsumption calls : 15281
% 2.13/0.70 % Non-unit clause-clause subsumptions : 655
% 2.13/0.70 % Unit Clause-clause subsumption calls : 2706
% 2.13/0.70 % Rewrite failures with RHS unbound : 0
% 2.13/0.70 % BW rewrite match attempts : 48
% 2.13/0.70 % BW rewrite match successes : 41
% 2.13/0.70 % Condensation attempts : 0
% 2.13/0.70 % Condensation successes : 0
% 2.13/0.70 % Termbank termtop insertions : 213110
% 2.13/0.70 % Search garbage collected termcells : 888
% 2.13/0.70
% 2.13/0.70 % -------------------------------------------------
% 2.13/0.70 % User time : 0.257 s
% 2.13/0.70 % System time : 0.015 s
% 2.13/0.70 % Total time : 0.272 s
% 2.13/0.70 % Maximum resident set size: 3708 pages
% 2.13/0.70
% 2.13/0.70 % -------------------------------------------------
% 2.13/0.70 % User time : 1.065 s
% 2.13/0.70 % System time : 0.065 s
% 2.13/0.70 % Total time : 1.130 s
% 2.13/0.70 % Maximum resident set size: 4864 pages
% 2.13/0.70 % E exiting
%------------------------------------------------------------------------------