%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG056+2 : 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 02:05:39 PM UTC 2026
% Result : Theorem 11.35s 2.73s
% Output : CNFRefutation 11.35s
% 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,
! [X60,X61,X62] :
( ( ~ aScalar0(X62)
| ~ aScalar0(X61)
| ~ aScalar0(X60)
| sdtasdt0(X60,X61) = sdtasdt0(X61,X60) )
& ( ~ aScalar0(X62)
| ~ aScalar0(X61)
| ~ aScalar0(X60)
| sdtasdt0(sdtasdt0(X60,X61),X62) = sdtasdt0(X60,sdtasdt0(X61,X62)) )
& ( ~ aScalar0(X62)
| ~ aScalar0(X61)
| ~ aScalar0(X60)
| sdtpldt0(X60,X61) = sdtpldt0(X61,X60) )
& ( ~ aScalar0(X62)
| ~ aScalar0(X61)
| ~ aScalar0(X60)
| sdtpldt0(sdtpldt0(X60,X61),X62) = sdtpldt0(X60,sdtpldt0(X61,X62)) ) ),
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,
! [X21,X22] :
( aScalar0(sdtasdt0(X21,X22))
| ~ aScalar0(X22)
| ~ aScalar0(X21) ),
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+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n014.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 04:16:19 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.44 Running first-order theorem proving
% 0.15/0.44 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
% 11.35/2.73 % Version: 3.5.1
% 11.35/2.73 % Preprocessing class: FSLSSMSMSSSNFFN.
% 11.35/2.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.35/2.73 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 11.35/2.73 % Starting new_bool_3 with 300s (1) cores
% 11.35/2.73 % Starting new_bool_1 with 300s (1) cores
% 11.35/2.73 % Starting sh5l with 300s (1) cores
% 11.35/2.73 % new_bool_3 with pid 3115509 completed with status 0
% 11.35/2.73 % Result found by new_bool_3
% 11.35/2.73 % Preprocessing class: FSLSSMSMSSSNFFN.
% 11.35/2.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.35/2.73 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 11.35/2.73 % Starting new_bool_3 with 300s (1) cores
% 11.35/2.73 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 11.35/2.73 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 11.35/2.73 % Search class: FGHSF-FFMM21-MFFFFFNN
% 11.35/2.73 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 11.35/2.73 % Starting SubtermCWHack with 31s (1) cores
% 11.35/2.73 % SubtermCWHack with pid 3115517 completed with status 0
% 11.35/2.73 % Result found by SubtermCWHack
% 11.35/2.73 % Preprocessing class: FSLSSMSMSSSNFFN.
% 11.35/2.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.35/2.73 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 11.35/2.73 % Starting new_bool_3 with 300s (1) cores
% 11.35/2.73 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 11.35/2.73 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 11.35/2.73 % Search class: FGHSF-FFMM21-MFFFFFNN
% 11.35/2.73 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 11.35/2.73 % Starting SubtermCWHack with 31s (1) cores
% 11.35/2.73 % Preprocessing time : 0.003 s
% 11.35/2.73
% 11.35/2.73 % Proof found!
% 11.35/2.73 % SZS status Theorem
% 11.35/2.73 % SZS output start CNFRefutation
% See solution above
% 11.35/2.73 % Parsed axioms : 58
% 11.35/2.73 % Removed by relevancy pruning/SinE : 4
% 11.35/2.73 % Initial clauses : 84
% 11.35/2.73 % Removed in clause preprocessing : 5
% 11.35/2.73 % Initial clauses in saturation : 79
% 11.35/2.73 % Processed clauses : 3821
% 11.35/2.73 % ...of these trivial : 218
% 11.35/2.73 % ...subsumed : 1362
% 11.35/2.73 % ...remaining for further processing : 2241
% 11.35/2.73 % Other redundant clauses eliminated : 7
% 11.35/2.73 % Clauses deleted for lack of memory : 0
% 11.35/2.73 % Backward-subsumed : 119
% 11.35/2.73 % Backward-rewritten : 54
% 11.35/2.73 % Generated clauses : 38892
% 11.35/2.73 % ...of the previous two non-redundant : 36548
% 11.35/2.73 % ...aggressively subsumed : 0
% 11.35/2.73 % Contextual simplify-reflections : 58
% 11.35/2.73 % Paramodulations : 38874
% 11.35/2.73 % Factorizations : 0
% 11.35/2.73 % NegExts : 0
% 11.35/2.73 % Equation resolutions : 18
% 11.35/2.73 % Disequality decompositions : 0
% 11.35/2.73 % Total rewrite steps : 36059
% 11.35/2.73 % ...of those cached : 35608
% 11.35/2.73 % Propositional unsat checks : 0
% 11.35/2.73 % Propositional check models : 0
% 11.35/2.73 % Propositional check unsatisfiable : 0
% 11.35/2.73 % Propositional clauses : 0
% 11.35/2.73 % Propositional clauses after purity: 0
% 11.35/2.73 % Propositional unsat core size : 0
% 11.35/2.73 % Propositional preprocessing time : 0.000
% 11.35/2.73 % Propositional encoding time : 0.000
% 11.35/2.73 % Propositional solver time : 0.000
% 11.35/2.73 % Success case prop preproc time : 0.000
% 11.35/2.73 % Success case prop encoding time : 0.000
% 11.35/2.73 % Success case prop solver time : 0.000
% 11.35/2.73 % Current number of processed clauses : 2065
% 11.35/2.73 % Positive orientable unit clauses : 598
% 11.35/2.73 % Positive unorientable unit clauses: 0
% 11.35/2.73 % Negative unit clauses : 5
% 11.35/2.73 % Non-unit-clauses : 1462
% 11.35/2.73 % Current number of unprocessed clauses: 32720
% 11.35/2.73 % ...number of literals in the above : 131413
% 11.35/2.73 % Current number of archived formulas : 0
% 11.35/2.73 % Current number of archived clauses : 173
% 11.35/2.73 % Clause-clause subsumption calls (NU) : 289136
% 11.35/2.73 % Rec. Clause-clause subsumption calls : 150186
% 11.35/2.73 % Non-unit clause-clause subsumptions : 1533
% 11.35/2.73 % Unit Clause-clause subsumption calls : 26438
% 11.35/2.73 % Rewrite failures with RHS unbound : 0
% 11.35/2.73 % BW rewrite match attempts : 7432
% 11.35/2.73 % BW rewrite match successes : 22
% 11.35/2.73 % Condensation attempts : 0
% 11.35/2.73 % Condensation successes : 0
% 11.35/2.73 % Termbank termtop insertions : 741316
% 11.35/2.73 % Search garbage collected termcells : 909
% 11.35/2.73
% 11.35/2.73 % -------------------------------------------------
% 11.35/2.73 % User time : 1.180 s
% 11.35/2.73 % System time : 0.068 s
% 11.35/2.73 % Total time : 1.248 s
% 11.35/2.73 % Maximum resident set size: 3960 pages
% 11.35/2.73
% 11.35/2.73 % -------------------------------------------------
% 11.35/2.73 % User time : 1.187 s
% 11.35/2.73 % System time : 0.073 s
% 11.35/2.73 % Total time : 1.259 s
% 11.35/2.73 % Maximum resident set size: 4608 pages
% 11.35/2.73 % E exiting
%------------------------------------------------------------------------------