%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG056+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 02:05:39 PM UTC 2026
% Result : Theorem 3.94s 1.16s
% Output : CNFRefutation 3.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of formulae : 64 ( 35 unt; 0 def)
% Number of atoms : 124 ( 50 equ)
% Maximal formula atoms : 16 ( 1 avg)
% Number of connectives : 106 ( 46 ~; 39 |; 19 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 14 con; 0-2 aty)
% Number of variables : 35 ( 1 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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/sandbox2/benchmark/theBenchmark.p',mArith) ).
fof(mMulSc,axiom,
! [X1,X2] :
( ( aScalar0(X2)
& aScalar0(X1) )
=> aScalar0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulSc) ).
fof(m__1873,hypothesis,
( xH = sdtasdt0(xA,xB)
& aScalar0(xH) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1873) ).
fof(m__1766,hypothesis,
( xB = sdtlbdtrb0(xt,aDimensionOf0(xt))
& aScalar0(xB) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1766) ).
fof(m__1746,hypothesis,
( xA = sdtlbdtrb0(xs,aDimensionOf0(xs))
& aScalar0(xA) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1746) ).
fof(m__1837,hypothesis,
( xF = sdtasdt0(xA,xA)
& aScalar0(xF) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1837) ).
fof(m__1854,hypothesis,
( xG = sdtasdt0(xB,xB)
& aScalar0(xG) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1854) ).
fof(m__1949,hypothesis,
( xN = sdtasdt0(xR,xS)
& aScalar0(xN) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1949) ).
fof(m__,conjecture,
xN = sdtasdt0(sdtasdt0(xH,xH),sdtasdt0(xC,xD)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__1930,hypothesis,
( xS = sdtasdt0(xF,xD)
& aScalar0(xS) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1930) ).
fof(m__1800,hypothesis,
( xD = sdtasasdt0(xq,xq)
& aScalar0(xD) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1800) ).
fof(m__1783,hypothesis,
( xC = sdtasasdt0(xp,xp)
& aScalar0(xC) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1783) ).
fof(m__1892,hypothesis,
( xR = sdtasdt0(xC,xG)
& aScalar0(xR) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1892) ).
fof(c_0_13,plain,
! [X58,X59,X60] :
( ( ~ aScalar0(X60)
| ~ aScalar0(X59)
| ~ aScalar0(X58)
| sdtasdt0(X58,X59) = sdtasdt0(X59,X58) )
& ( ~ aScalar0(X60)
| ~ aScalar0(X59)
| ~ aScalar0(X58)
| sdtasdt0(sdtasdt0(X58,X59),X60) = sdtasdt0(X58,sdtasdt0(X59,X60)) )
& ( ~ aScalar0(X60)
| ~ aScalar0(X59)
| ~ aScalar0(X58)
| sdtpldt0(X58,X59) = sdtpldt0(X59,X58) )
& ( ~ aScalar0(X60)
| ~ aScalar0(X59)
| ~ aScalar0(X58)
| sdtpldt0(sdtpldt0(X58,X59),X60) = sdtpldt0(X58,sdtpldt0(X59,X60)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mArith])])])]) ).
fof(c_0_14,plain,
! [X19,X20] :
( aScalar0(sdtasdt0(X19,X20))
| ~ aScalar0(X20)
| ~ aScalar0(X19) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulSc])])]) ).
cnf(c_0_15,plain,
( ~ aScalar0(X3)
| ~ aScalar0(X2)
| ~ aScalar0(X1)
| sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,hypothesis,
xH = sdtasdt0(xA,xB),
inference(split_conjunct,[status(thm)],[m__1873]) ).
cnf(c_0_17,hypothesis,
aScalar0(xB),
inference(split_conjunct,[status(thm)],[m__1766]) ).
cnf(c_0_18,hypothesis,
aScalar0(xA),
inference(split_conjunct,[status(thm)],[m__1746]) ).
cnf(c_0_19,hypothesis,
xF = sdtasdt0(xA,xA),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_20,plain,
( ~ aScalar0(X2)
| ~ aScalar0(X1)
| aScalar0(sdtasdt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,hypothesis,
( ~ aScalar0(X1)
| sdtasdt0(xA,sdtasdt0(xB,X1)) = sdtasdt0(xH,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18])]) ).
cnf(c_0_22,hypothesis,
xG = sdtasdt0(xB,xB),
inference(split_conjunct,[status(thm)],[m__1854]) ).
cnf(c_0_23,plain,
( ~ aScalar0(X3)
| ~ aScalar0(X2)
| ~ aScalar0(X1)
| sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_24,hypothesis,
aScalar0(xN),
inference(split_conjunct,[status(thm)],[m__1949]) ).
cnf(c_0_25,hypothesis,
( ~ aScalar0(X1)
| sdtasdt0(xA,sdtasdt0(xA,X1)) = sdtasdt0(xF,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_19]),c_0_18])]) ).
cnf(c_0_26,plain,
( ~ aScalar0(X1)
| ~ aScalar0(X2)
| ~ aScalar0(X3)
| aScalar0(sdtasdt0(X1,sdtasdt0(X2,X3))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_15]),c_0_20]) ).
cnf(c_0_27,hypothesis,
sdtasdt0(xA,xG) = sdtasdt0(xH,xB),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_17])]) ).
cnf(c_0_28,hypothesis,
aScalar0(xG),
inference(split_conjunct,[status(thm)],[m__1854]) ).
cnf(c_0_29,hypothesis,
( ~ aScalar0(X1)
| ~ aScalar0(X2)
| sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,hypothesis,
sdtasdt0(xF,xB) = sdtasdt0(xA,xH),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_16]),c_0_17])]) ).
cnf(c_0_31,hypothesis,
aScalar0(xF),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_32,hypothesis,
( ~ aScalar0(X1)
| aScalar0(sdtasdt0(X1,sdtasdt0(xH,xB))) ),
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_18])]) ).
cnf(c_0_33,hypothesis,
aScalar0(sdtasdt0(xH,xB)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_27]),c_0_28]),c_0_18])]) ).
cnf(c_0_34,hypothesis,
( ~ aScalar0(X1)
| sdtasdt0(xB,sdtasdt0(xB,X1)) = sdtasdt0(xG,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_22]),c_0_17])]) ).
cnf(c_0_35,hypothesis,
sdtasdt0(xB,xF) = sdtasdt0(xA,xH),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_17]),c_0_31])]) ).
fof(c_0_36,negated_conjecture,
xN != sdtasdt0(sdtasdt0(xH,xH),sdtasdt0(xC,xD)),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_37,hypothesis,
( ~ aScalar0(X1)
| aScalar0(sdtasdt0(sdtasdt0(xH,xB),X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_29]),c_0_33])]) ).
cnf(c_0_38,hypothesis,
aScalar0(xH),
inference(split_conjunct,[status(thm)],[m__1873]) ).
cnf(c_0_39,hypothesis,
sdtasdt0(xB,sdtasdt0(xA,xH)) = sdtasdt0(xG,xF),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_31])]) ).
fof(c_0_40,negated_conjecture,
xN != sdtasdt0(sdtasdt0(xH,xH),sdtasdt0(xC,xD)),
inference(fof_simplification,[status(thm)],[c_0_36]) ).
cnf(c_0_41,hypothesis,
( ~ aScalar0(X1)
| aScalar0(sdtasdt0(xH,sdtasdt0(xB,X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_15]),c_0_17]),c_0_38])]) ).
cnf(c_0_42,hypothesis,
xS = sdtasdt0(xF,xD),
inference(split_conjunct,[status(thm)],[m__1930]) ).
cnf(c_0_43,hypothesis,
aScalar0(xD),
inference(split_conjunct,[status(thm)],[m__1800]) ).
cnf(c_0_44,hypothesis,
sdtasdt0(xB,sdtasdt0(xH,xA)) = sdtasdt0(xG,xF),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_29]),c_0_38]),c_0_18])]) ).
cnf(c_0_45,hypothesis,
( ~ aScalar0(X2)
| ~ aScalar0(X3)
| ~ aScalar0(X1)
| sdtasdt0(X1,sdtasdt0(X2,X3)) = sdtasdt0(X2,sdtasdt0(X3,X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_29]),c_0_20]) ).
fof(c_0_46,negated_conjecture,
xN != sdtasdt0(sdtasdt0(xH,xH),sdtasdt0(xC,xD)),
inference(fof_nnf,[status(thm)],[c_0_40]) ).
cnf(c_0_47,hypothesis,
( ~ aScalar0(X1)
| aScalar0(sdtasdt0(xH,sdtasdt0(X1,xB))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_29]),c_0_17])]) ).
cnf(c_0_48,hypothesis,
sdtasdt0(xD,xF) = xS,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_29]),c_0_31]),c_0_43])]) ).
cnf(c_0_49,hypothesis,
sdtasdt0(xG,xF) = sdtasdt0(xH,xH),
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_44,c_0_45]),c_0_16]),c_0_17]),c_0_18]),c_0_38])]) ).
cnf(c_0_50,negated_conjecture,
xN != sdtasdt0(sdtasdt0(xH,xH),sdtasdt0(xC,xD)),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_51,hypothesis,
aScalar0(sdtasdt0(xH,xH)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_16]),c_0_18])]) ).
cnf(c_0_52,hypothesis,
aScalar0(xC),
inference(split_conjunct,[status(thm)],[m__1783]) ).
cnf(c_0_53,hypothesis,
( ~ aScalar0(X1)
| sdtasdt0(xD,sdtasdt0(xF,X1)) = sdtasdt0(xS,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_48]),c_0_31]),c_0_43])]) ).
cnf(c_0_54,hypothesis,
sdtasdt0(xF,xG) = sdtasdt0(xH,xH),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_49]),c_0_31]),c_0_28])]) ).
cnf(c_0_55,negated_conjecture,
sdtasdt0(xC,sdtasdt0(xD,sdtasdt0(xH,xH))) != xN,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_45]),c_0_51]),c_0_43]),c_0_52])]) ).
cnf(c_0_56,hypothesis,
sdtasdt0(xD,sdtasdt0(xH,xH)) = sdtasdt0(xS,xG),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_28])]) ).
cnf(c_0_57,negated_conjecture,
sdtasdt0(xC,sdtasdt0(xS,xG)) != xN,
inference(rw,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_58,hypothesis,
aScalar0(xS),
inference(split_conjunct,[status(thm)],[m__1930]) ).
cnf(c_0_59,hypothesis,
xR = sdtasdt0(xC,xG),
inference(split_conjunct,[status(thm)],[m__1892]) ).
cnf(c_0_60,hypothesis,
sdtasdt0(xC,sdtasdt0(xG,xS)) != xN,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_29]),c_0_28]),c_0_58])]) ).
cnf(c_0_61,hypothesis,
( ~ aScalar0(X1)
| sdtasdt0(xC,sdtasdt0(xG,X1)) = sdtasdt0(xR,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_59]),c_0_28]),c_0_52])]) ).
cnf(c_0_62,hypothesis,
xN = sdtasdt0(xR,xS),
inference(split_conjunct,[status(thm)],[m__1949]) ).
cnf(c_0_63,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62]),c_0_58])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG056+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.10/0.38 % Computer : n005.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 21 04:16:03 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.43 Running first-order theorem proving
% 0.15/0.43 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
% 3.94/1.16 % Version: 3.5.1
% 3.94/1.16 % Preprocessing class: FSLSSMSMSSSNFFN.
% 3.94/1.16 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.94/1.16 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.94/1.16 % Starting new_bool_3 with 300s (1) cores
% 3.94/1.16 % Starting new_bool_1 with 300s (1) cores
% 3.94/1.16 % Starting sh5l with 300s (1) cores
% 3.94/1.16 % new_bool_1 with pid 2530101 completed with status 0
% 3.94/1.16 % Result found by new_bool_1
% 3.94/1.16 % Preprocessing class: FSLSSMSMSSSNFFN.
% 3.94/1.16 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.94/1.16 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.94/1.16 % Starting new_bool_3 with 300s (1) cores
% 3.94/1.16 % Starting new_bool_1 with 300s (1) cores
% 3.94/1.16 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 3.94/1.16 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.94/1.16 % Search class: FGHSF-FFMM21-MFFFFFNN
% 3.94/1.16 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 3.94/1.16 % Starting SubtermCWHack with 31s (1) cores
% 3.94/1.16 % SubtermCWHack with pid 2530109 completed with status 0
% 3.94/1.16 % Result found by SubtermCWHack
% 3.94/1.16 % Preprocessing class: FSLSSMSMSSSNFFN.
% 3.94/1.16 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.94/1.16 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.94/1.16 % Starting new_bool_3 with 300s (1) cores
% 3.94/1.16 % Starting new_bool_1 with 300s (1) cores
% 3.94/1.16 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 3.94/1.16 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.94/1.16 % Search class: FGHSF-FFMM21-MFFFFFNN
% 3.94/1.16 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 3.94/1.16 % Starting SubtermCWHack with 31s (1) cores
% 3.94/1.16 % Preprocessing time : 0.002 s
% 3.94/1.16
% 3.94/1.16 % Proof found!
% 3.94/1.16 % SZS status Theorem
% 3.94/1.16 % SZS output start CNFRefutation
% See solution above
% 3.94/1.16 % Parsed axioms : 58
% 3.94/1.16 % Removed by relevancy pruning/SinE : 4
% 3.94/1.16 % Initial clauses : 80
% 3.94/1.16 % Removed in clause preprocessing : 5
% 3.94/1.16 % Initial clauses in saturation : 75
% 3.94/1.16 % Processed clauses : 3651
% 3.94/1.16 % ...of these trivial : 221
% 3.94/1.16 % ...subsumed : 1300
% 3.94/1.16 % ...remaining for further processing : 2130
% 3.94/1.16 % Other redundant clauses eliminated : 5
% 3.94/1.16 % Clauses deleted for lack of memory : 0
% 3.94/1.16 % Backward-subsumed : 114
% 3.94/1.16 % Backward-rewritten : 52
% 3.94/1.16 % Generated clauses : 36707
% 3.94/1.16 % ...of the previous two non-redundant : 34438
% 3.94/1.16 % ...aggressively subsumed : 0
% 3.94/1.16 % Contextual simplify-reflections : 60
% 3.94/1.16 % Paramodulations : 36695
% 3.94/1.16 % Factorizations : 0
% 3.94/1.16 % NegExts : 0
% 3.94/1.16 % Equation resolutions : 12
% 3.94/1.16 % Disequality decompositions : 0
% 3.94/1.16 % Total rewrite steps : 35285
% 3.94/1.16 % ...of those cached : 34834
% 3.94/1.16 % Propositional unsat checks : 0
% 3.94/1.16 % Propositional check models : 0
% 3.94/1.16 % Propositional check unsatisfiable : 0
% 3.94/1.16 % Propositional clauses : 0
% 3.94/1.16 % Propositional clauses after purity: 0
% 3.94/1.16 % Propositional unsat core size : 0
% 3.94/1.16 % Propositional preprocessing time : 0.000
% 3.94/1.16 % Propositional encoding time : 0.000
% 3.94/1.16 % Propositional solver time : 0.000
% 3.94/1.16 % Success case prop preproc time : 0.000
% 3.94/1.16 % Success case prop encoding time : 0.000
% 3.94/1.16 % Success case prop solver time : 0.000
% 3.94/1.16 % Current number of processed clauses : 1961
% 3.94/1.16 % Positive orientable unit clauses : 600
% 3.94/1.16 % Positive unorientable unit clauses: 0
% 3.94/1.16 % Negative unit clauses : 5
% 3.94/1.16 % Non-unit-clauses : 1356
% 3.94/1.16 % Current number of unprocessed clauses: 30760
% 3.94/1.16 % ...number of literals in the above : 124363
% 3.94/1.16 % Current number of archived formulas : 0
% 3.94/1.16 % Current number of archived clauses : 166
% 3.94/1.16 % Clause-clause subsumption calls (NU) : 221259
% 3.94/1.16 % Rec. Clause-clause subsumption calls : 113384
% 3.94/1.16 % Non-unit clause-clause subsumptions : 1468
% 3.94/1.16 % Unit Clause-clause subsumption calls : 16012
% 3.94/1.16 % Rewrite failures with RHS unbound : 0
% 3.94/1.16 % BW rewrite match attempts : 7430
% 3.94/1.16 % BW rewrite match successes : 22
% 3.94/1.16 % Condensation attempts : 0
% 3.94/1.16 % Condensation successes : 0
% 3.94/1.16 % Termbank termtop insertions : 698174
% 3.94/1.16 % Search garbage collected termcells : 883
% 3.94/1.16
% 3.94/1.16 % -------------------------------------------------
% 3.94/1.16 % User time : 0.605 s
% 3.94/1.16 % System time : 0.043 s
% 3.94/1.16 % Total time : 0.648 s
% 3.94/1.16 % Maximum resident set size: 3700 pages
% 3.94/1.16
% 3.94/1.16 % -------------------------------------------------
% 3.94/1.16 % User time : 0.607 s
% 3.94/1.16 % System time : 0.051 s
% 3.94/1.16 % Total time : 0.658 s
% 3.94/1.16 % Maximum resident set size: 4864 pages
% 3.94/1.16 % E exiting
%------------------------------------------------------------------------------