%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG065+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 : n002.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:05:42 PM UTC 2026
% Result : Theorem 6.47s 1.54s
% Output : CNFRefutation 6.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of formulae : 53 ( 21 unt; 0 def)
% Number of atoms : 144 ( 16 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 164 ( 73 ~; 64 |; 19 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 56 ( 0 sgn 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDistr,axiom,
! [X1,X2,X3] :
( ( aScalar0(X3)
& aScalar0(X2)
& aScalar0(X1) )
=> ( sdtasdt0(sdtpldt0(X1,X2),X3) = sdtpldt0(sdtasdt0(X1,X3),sdtasdt0(X2,X3))
& sdtasdt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDistr) ).
fof(m__,conjecture,
sdtlseqdt0(sdtpldt0(sdtasdt0(xP,xP),sdtasdt0(xP,xP)),sdtpldt0(sdtasdt0(xR,xR),sdtasdt0(xS,xS))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mSumSc,axiom,
! [X1,X2] :
( ( aScalar0(X2)
& aScalar0(X1) )
=> aScalar0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSumSc) ).
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(m__1930,hypothesis,
( xS = sdtasdt0(xF,xD)
& aScalar0(xS) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1930) ).
fof(m__1892,hypothesis,
( xR = sdtasdt0(xC,xG)
& aScalar0(xR) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1892) ).
fof(mLETrn,axiom,
! [X1,X2,X3] :
( ( aScalar0(X3)
& aScalar0(X2)
& aScalar0(X1) )
=> ( ( sdtlseqdt0(X2,X3)
& sdtlseqdt0(X1,X2) )
=> sdtlseqdt0(X1,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mLETrn) ).
fof(m__2348,hypothesis,
sdtlseqdt0(sdtpldt0(xN,xN),sdtpldt0(sdtasdt0(xR,xR),sdtasdt0(xS,xS))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2348) ).
fof(m__1911,hypothesis,
( xP = sdtasdt0(xE,xH)
& aScalar0(xP) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1911) ).
fof(mLEMon,axiom,
! [X1,X2,X3,X4] :
( ( aScalar0(X4)
& aScalar0(X3)
& aScalar0(X2)
& aScalar0(X1) )
=> ( ( sdtlseqdt0(X3,X4)
& sdtlseqdt0(X1,X2) )
=> sdtlseqdt0(sdtpldt0(X1,X3),sdtpldt0(X2,X4)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mLEMon) ).
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(mNegSc,axiom,
! [X1] :
( aScalar0(X1)
=> aScalar0(smndt0(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mNegSc) ).
fof(m__2004,hypothesis,
sdtlseqdt0(sdtasdt0(xP,xP),xN),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2004) ).
fof(c_0_14,plain,
! [X24,X25,X26] :
( ( ~ aScalar0(X26)
| ~ aScalar0(X25)
| ~ aScalar0(X24)
| sdtasdt0(sdtpldt0(X24,X25),X26) = sdtpldt0(sdtasdt0(X24,X26),sdtasdt0(X25,X26)) )
& ( ~ aScalar0(X26)
| ~ aScalar0(X25)
| ~ aScalar0(X24)
| sdtasdt0(X24,sdtpldt0(X25,X26)) = sdtpldt0(sdtasdt0(X24,X25),sdtasdt0(X24,X26)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDistr])])])]) ).
fof(c_0_15,negated_conjecture,
~ sdtlseqdt0(sdtpldt0(sdtasdt0(xP,xP),sdtasdt0(xP,xP)),sdtpldt0(sdtasdt0(xR,xR),sdtasdt0(xS,xS))),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_16,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])])]) ).
fof(c_0_17,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_18,plain,
( ~ aScalar0(X3)
| ~ aScalar0(X2)
| ~ aScalar0(X1)
| sdtasdt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,hypothesis,
xN = sdtasdt0(xR,xS),
inference(split_conjunct,[status(thm)],[m__1949]) ).
cnf(c_0_20,hypothesis,
aScalar0(xS),
inference(split_conjunct,[status(thm)],[m__1930]) ).
cnf(c_0_21,hypothesis,
aScalar0(xR),
inference(split_conjunct,[status(thm)],[m__1892]) ).
fof(c_0_22,negated_conjecture,
~ sdtlseqdt0(sdtpldt0(sdtasdt0(xP,xP),sdtasdt0(xP,xP)),sdtpldt0(sdtasdt0(xR,xR),sdtasdt0(xS,xS))),
inference(fof_simplification,[status(thm)],[c_0_15]) ).
fof(c_0_23,plain,
! [X40,X41,X42] :
( sdtlseqdt0(X40,X42)
| ~ sdtlseqdt0(X41,X42)
| ~ sdtlseqdt0(X40,X41)
| ~ aScalar0(X42)
| ~ aScalar0(X41)
| ~ aScalar0(X40) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLETrn])])]) ).
cnf(c_0_24,plain,
( ~ aScalar0(X2)
| ~ aScalar0(X1)
| aScalar0(sdtpldt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,plain,
( ~ aScalar0(X2)
| ~ aScalar0(X1)
| aScalar0(sdtasdt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,hypothesis,
( ~ aScalar0(X1)
| sdtpldt0(sdtasdt0(xR,X1),xN) = sdtasdt0(xR,sdtpldt0(X1,xS)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21])]) ).
fof(c_0_27,negated_conjecture,
~ sdtlseqdt0(sdtpldt0(sdtasdt0(xP,xP),sdtasdt0(xP,xP)),sdtpldt0(sdtasdt0(xR,xR),sdtasdt0(xS,xS))),
inference(fof_nnf,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
( ~ sdtlseqdt0(X2,X3)
| ~ sdtlseqdt0(X1,X2)
| ~ aScalar0(X3)
| ~ aScalar0(X2)
| ~ aScalar0(X1)
| sdtlseqdt0(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,hypothesis,
sdtlseqdt0(sdtpldt0(xN,xN),sdtpldt0(sdtasdt0(xR,xR),sdtasdt0(xS,xS))),
inference(split_conjunct,[status(thm)],[m__2348]) ).
cnf(c_0_30,plain,
( ~ aScalar0(X1)
| ~ aScalar0(X2)
| ~ aScalar0(X3)
| aScalar0(sdtasdt0(X1,sdtpldt0(X2,X3))) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_18]),c_0_25]),c_0_25]) ).
cnf(c_0_31,hypothesis,
sdtasdt0(xR,sdtpldt0(xS,xS)) = sdtpldt0(xN,xN),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_19]),c_0_20])]) ).
cnf(c_0_32,negated_conjecture,
~ sdtlseqdt0(sdtpldt0(sdtasdt0(xP,xP),sdtasdt0(xP,xP)),sdtpldt0(sdtasdt0(xR,xR),sdtasdt0(xS,xS))),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_33,hypothesis,
aScalar0(xP),
inference(split_conjunct,[status(thm)],[m__1911]) ).
cnf(c_0_34,hypothesis,
( ~ aScalar0(X1)
| ~ aScalar0(sdtpldt0(xN,xN))
| ~ aScalar0(sdtpldt0(sdtasdt0(xR,xR),sdtasdt0(xS,xS)))
| ~ sdtlseqdt0(X1,sdtpldt0(xN,xN))
| sdtlseqdt0(X1,sdtpldt0(sdtasdt0(xR,xR),sdtasdt0(xS,xS))) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,hypothesis,
aScalar0(sdtpldt0(xN,xN)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_20]),c_0_21])]) ).
fof(c_0_36,plain,
! [X43,X44,X45,X46] :
( sdtlseqdt0(sdtpldt0(X43,X45),sdtpldt0(X44,X46))
| ~ sdtlseqdt0(X45,X46)
| ~ sdtlseqdt0(X43,X44)
| ~ aScalar0(X46)
| ~ aScalar0(X45)
| ~ aScalar0(X44)
| ~ aScalar0(X43) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLEMon])])]) ).
cnf(c_0_37,negated_conjecture,
~ sdtlseqdt0(sdtasdt0(xP,sdtpldt0(xP,xP)),sdtpldt0(sdtasdt0(xR,xR),sdtasdt0(xS,xS))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_18]),c_0_33])]) ).
cnf(c_0_38,hypothesis,
( ~ aScalar0(X1)
| ~ aScalar0(sdtpldt0(sdtasdt0(xR,xR),sdtasdt0(xS,xS)))
| ~ sdtlseqdt0(X1,sdtpldt0(xN,xN))
| sdtlseqdt0(X1,sdtpldt0(sdtasdt0(xR,xR),sdtasdt0(xS,xS))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]) ).
cnf(c_0_39,plain,
( ~ sdtlseqdt0(X3,X4)
| ~ sdtlseqdt0(X1,X2)
| ~ aScalar0(X4)
| ~ aScalar0(X3)
| ~ aScalar0(X2)
| ~ aScalar0(X1)
| sdtlseqdt0(sdtpldt0(X1,X3),sdtpldt0(X2,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_40,hypothesis,
sdtasdt0(smndt0(xS),smndt0(xS)) = sdtasdt0(xS,xS),
inference(split_conjunct,[status(thm)],[m__2144]) ).
fof(c_0_41,plain,
! [X19] :
( aScalar0(smndt0(X19))
| ~ aScalar0(X19) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mNegSc])])]) ).
cnf(c_0_42,negated_conjecture,
( ~ aScalar0(sdtasdt0(xP,sdtpldt0(xP,xP)))
| ~ aScalar0(sdtpldt0(sdtasdt0(xR,xR),sdtasdt0(xS,xS)))
| ~ sdtlseqdt0(sdtasdt0(xP,sdtpldt0(xP,xP)),sdtpldt0(xN,xN)) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,plain,
( ~ aScalar0(X1)
| ~ aScalar0(X2)
| ~ aScalar0(X3)
| ~ aScalar0(X4)
| ~ aScalar0(X5)
| ~ sdtlseqdt0(sdtasdt0(X1,X2),X4)
| ~ sdtlseqdt0(sdtasdt0(X1,X3),X5)
| sdtlseqdt0(sdtasdt0(X1,sdtpldt0(X2,X3)),sdtpldt0(X4,X5)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_18]),c_0_25]),c_0_25]) ).
cnf(c_0_44,hypothesis,
sdtlseqdt0(sdtasdt0(xP,xP),xN),
inference(split_conjunct,[status(thm)],[m__2004]) ).
cnf(c_0_45,hypothesis,
aScalar0(xN),
inference(split_conjunct,[status(thm)],[m__1949]) ).
cnf(c_0_46,hypothesis,
( ~ aScalar0(smndt0(xS))
| aScalar0(sdtasdt0(xS,xS)) ),
inference(spm,[status(thm)],[c_0_25,c_0_40]) ).
cnf(c_0_47,plain,
( ~ aScalar0(X1)
| aScalar0(smndt0(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_48,negated_conjecture,
( ~ aScalar0(sdtasdt0(xP,sdtpldt0(xP,xP)))
| ~ aScalar0(sdtpldt0(sdtasdt0(xR,xR),sdtasdt0(xS,xS))) ),
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_33])]) ).
cnf(c_0_49,hypothesis,
aScalar0(sdtasdt0(xS,xS)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_20])]) ).
cnf(c_0_50,negated_conjecture,
( ~ aScalar0(sdtasdt0(xR,xR))
| ~ aScalar0(sdtasdt0(xP,sdtpldt0(xP,xP))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_24]),c_0_49])]) ).
cnf(c_0_51,negated_conjecture,
~ aScalar0(sdtasdt0(xR,xR)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_30]),c_0_33])]) ).
cnf(c_0_52,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_25]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : RNG065+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.46 % Computer : n002.cluster.edu
% 0.20/0.46 % Model : x86_64 x86_64
% 0.20/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.46 % Memory : 8046.5625MB
% 0.20/0.46 % OS : Linux 6.8.0-71-generic
% 0.20/0.46 % CPULimit : 300
% 0.20/0.46 % WCLimit : 300
% 0.20/0.46 % DateTime : Mon Sep 21 04:19:47 UTC 2026
% 0.20/0.47 % CPUTime :
% 0.20/0.47 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.25/0.52 Running first-order theorem proving
% 0.25/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
% 6.47/1.54 % Version: 3.5.1
% 6.47/1.54 % Preprocessing class: FSLSSMSMSSSNFFN.
% 6.47/1.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.47/1.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 6.47/1.54 % Starting new_bool_3 with 300s (1) cores
% 6.47/1.54 % Starting new_bool_1 with 300s (1) cores
% 6.47/1.54 % Starting sh5l with 300s (1) cores
% 6.47/1.54 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2411310 completed with status 0
% 6.47/1.54 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 6.47/1.54 % Preprocessing class: FSLSSMSMSSSNFFN.
% 6.47/1.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.47/1.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 6.47/1.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 6.47/1.54 % No SInE strategy applied
% 6.47/1.54 % Search class: FGHSF-FFMM21-MFFFFFNN
% 6.47/1.54 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 6.47/1.54 % Starting SubtermCWHack with 136s (1) cores
% 6.47/1.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 6.47/1.54 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 6.47/1.54 % Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 6.47/1.54 % Starting new_bool_3 with 136s (1) cores
% 6.47/1.54 % SAT001_MinMin_p005000_rr_RG with pid 2411316 completed with status 0
% 6.47/1.54 % Result found by SAT001_MinMin_p005000_rr_RG
% 6.47/1.54 % Preprocessing class: FSLSSMSMSSSNFFN.
% 6.47/1.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.47/1.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 6.47/1.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 6.47/1.54 % No SInE strategy applied
% 6.47/1.54 % Search class: FGHSF-FFMM21-MFFFFFNN
% 6.47/1.54 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 6.47/1.54 % Starting SubtermCWHack with 136s (1) cores
% 6.47/1.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 6.47/1.54 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 6.47/1.54 % Preprocessing time : 0.004 s
% 6.47/1.54 % Presaturation interreduction done
% 6.47/1.54
% 6.47/1.54 % Proof found!
% 6.47/1.54 % SZS status Theorem
% 6.47/1.54 % SZS output start CNFRefutation
% See solution above
% 6.47/1.54 % Parsed axioms : 65
% 6.47/1.54 % Removed by relevancy pruning/SinE : 0
% 6.47/1.54 % Initial clauses : 105
% 6.47/1.54 % Removed in clause preprocessing : 5
% 6.47/1.54 % Initial clauses in saturation : 100
% 6.47/1.54 % Processed clauses : 2676
% 6.47/1.54 % ...of these trivial : 127
% 6.47/1.54 % ...subsumed : 1119
% 6.47/1.54 % ...remaining for further processing : 1430
% 6.47/1.54 % Other redundant clauses eliminated : 11
% 6.47/1.54 % Clauses deleted for lack of memory : 0
% 6.47/1.54 % Backward-subsumed : 152
% 6.47/1.54 % Backward-rewritten : 60
% 6.47/1.54 % Generated clauses : 15952
% 6.47/1.54 % ...of the previous two non-redundant : 14111
% 6.47/1.54 % ...aggressively subsumed : 0
% 6.47/1.54 % Contextual simplify-reflections : 85
% 6.47/1.54 % Paramodulations : 15931
% 6.47/1.54 % Factorizations : 0
% 6.47/1.54 % NegExts : 0
% 6.47/1.54 % Equation resolutions : 21
% 6.47/1.54 % Disequality decompositions : 0
% 6.47/1.54 % Total rewrite steps : 20707
% 6.47/1.54 % ...of those cached : 20526
% 6.47/1.54 % Propositional unsat checks : 0
% 6.47/1.54 % Propositional check models : 0
% 6.47/1.54 % Propositional check unsatisfiable : 0
% 6.47/1.54 % Propositional clauses : 0
% 6.47/1.54 % Propositional clauses after purity: 0
% 6.47/1.54 % Propositional unsat core size : 0
% 6.47/1.54 % Propositional preprocessing time : 0.000
% 6.47/1.54 % Propositional encoding time : 0.000
% 6.47/1.54 % Propositional solver time : 0.000
% 6.47/1.54 % Success case prop preproc time : 0.000
% 6.47/1.54 % Success case prop encoding time : 0.000
% 6.47/1.54 % Success case prop solver time : 0.000
% 6.47/1.54 % Current number of processed clauses : 1115
% 6.47/1.54 % Positive orientable unit clauses : 196
% 6.47/1.54 % Positive unorientable unit clauses: 0
% 6.47/1.54 % Negative unit clauses : 5
% 6.47/1.54 % Non-unit-clauses : 914
% 6.47/1.54 % Current number of unprocessed clauses: 11508
% 6.47/1.54 % ...number of literals in the above : 57298
% 6.47/1.54 % Current number of archived formulas : 0
% 6.47/1.54 % Current number of archived clauses : 312
% 6.47/1.54 % Clause-clause subsumption calls (NU) : 132440
% 6.47/1.54 % Rec. Clause-clause subsumption calls : 30149
% 6.47/1.54 % Non-unit clause-clause subsumptions : 1298
% 6.47/1.54 % Unit Clause-clause subsumption calls : 5020
% 6.47/1.54 % Rewrite failures with RHS unbound : 0
% 6.47/1.54 % BW rewrite match attempts : 17
% 6.47/1.54 % BW rewrite match successes : 17
% 6.47/1.54 % Condensation attempts : 0
% 6.47/1.54 % Condensation successes : 0
% 6.47/1.54 % Termbank termtop insertions : 359079
% 6.47/1.54 % Search garbage collected termcells : 888
% 6.47/1.54
% 6.47/1.54 % -------------------------------------------------
% 6.47/1.54 % User time : 0.806 s
% 6.47/1.54 % System time : 0.025 s
% 6.47/1.54 % Total time : 0.831 s
% 6.47/1.54 % Maximum resident set size: 3424 pages
% 6.47/1.54
% 6.47/1.54 % -------------------------------------------------
% 6.47/1.54 % User time : 4.286 s
% 6.47/1.54 % System time : 0.182 s
% 6.47/1.54 % Total time : 4.468 s
% 6.47/1.54 % Maximum resident set size: 4864 pages
% 6.47/1.54 % E exiting
%------------------------------------------------------------------------------