%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG108+4 : 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 : n001.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:53 PM UTC 2026
% Result : Theorem 0.11s 0.45s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 26 ( 9 unt; 0 def)
% Number of atoms : 217 ( 67 equ)
% Maximal formula atoms : 96 ( 8 avg)
% Number of connectives : 327 ( 136 ~; 124 |; 59 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 32 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-2 aty)
% Number of variables : 49 ( 0 sgn 27 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__2174,hypothesis,
( xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))
& ! [X1] :
( aElementOf0(X1,xI)
<=> ? [X2,X3] :
( sdtpldt0(X2,X3) = X1
& aElementOf0(X3,slsdtgt0(xb))
& aElementOf0(X2,slsdtgt0(xa)) ) )
& ! [X1] :
( aElementOf0(X1,slsdtgt0(xb))
<=> ? [X2] :
( sdtasdt0(xb,X2) = X1
& aElement0(X2) ) )
& ! [X1] :
( aElementOf0(X1,slsdtgt0(xa))
<=> ? [X2] :
( sdtasdt0(xa,X2) = X1
& aElement0(X2) ) )
& aIdeal0(xI)
& ! [X1] :
( aElementOf0(X1,xI)
=> ( ! [X2] :
( aElement0(X2)
=> aElementOf0(sdtasdt0(X2,X1),xI) )
& ! [X2] :
( aElementOf0(X2,xI)
=> aElementOf0(sdtpldt0(X1,X2),xI) ) ) )
& aSet0(xI) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2174) ).
fof(m__,conjecture,
( ( aElementOf0(xb,slsdtgt0(xb))
| ? [X1] :
( sdtasdt0(xb,X1) = xb
& aElement0(X1) ) )
& ( aElementOf0(sz00,slsdtgt0(xb))
| ? [X1] :
( sdtasdt0(xb,X1) = sz00
& aElement0(X1) ) )
& ( aElementOf0(xa,slsdtgt0(xa))
| ? [X1] :
( sdtasdt0(xa,X1) = xa
& aElement0(X1) ) )
& ( aElementOf0(sz00,slsdtgt0(xa))
| ? [X1] :
( sdtasdt0(xa,X1) = sz00
& aElement0(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mMulUnit,axiom,
! [X1] :
( aElement0(X1)
=> ( X1 = sdtasdt0(sz10,X1)
& sdtasdt0(X1,sz10) = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulUnit) ).
fof(mMulZero,axiom,
! [X1] :
( aElement0(X1)
=> ( sz00 = sdtasdt0(sz00,X1)
& sdtasdt0(X1,sz00) = sz00 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulZero) ).
fof(mSortsC_01,axiom,
aElement0(sz10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC_01) ).
fof(m__2091,hypothesis,
( aElement0(xb)
& aElement0(xa) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2091) ).
fof(mSortsC,axiom,
aElement0(sz00),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC) ).
fof(c_0_7,hypothesis,
! [X122,X123,X124,X125,X127,X128,X129,X131,X132,X133,X136,X137,X138] :
( xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))
& ( aElementOf0(X136,xI)
| sdtpldt0(X137,X138) != X136
| ~ aElementOf0(X138,slsdtgt0(xb))
| ~ aElementOf0(X137,slsdtgt0(xa)) )
& ( ~ aElementOf0(X133,xI)
| sdtpldt0(esk26_1(X133),esk27_1(X133)) = X133 )
& ( ~ aElementOf0(X133,xI)
| aElementOf0(esk27_1(X133),slsdtgt0(xb)) )
& ( ~ aElementOf0(X133,xI)
| aElementOf0(esk26_1(X133),slsdtgt0(xa)) )
& ( aElementOf0(X131,slsdtgt0(xb))
| sdtasdt0(xb,X132) != X131
| ~ aElement0(X132) )
& ( ~ aElementOf0(X129,slsdtgt0(xb))
| sdtasdt0(xb,esk25_1(X129)) = X129 )
& ( ~ aElementOf0(X129,slsdtgt0(xb))
| aElement0(esk25_1(X129)) )
& ( aElementOf0(X127,slsdtgt0(xa))
| sdtasdt0(xa,X128) != X127
| ~ aElement0(X128) )
& ( ~ aElementOf0(X125,slsdtgt0(xa))
| sdtasdt0(xa,esk24_1(X125)) = X125 )
& ( ~ aElementOf0(X125,slsdtgt0(xa))
| aElement0(esk24_1(X125)) )
& aIdeal0(xI)
& ( ~ aElementOf0(X122,xI)
| aElementOf0(sdtasdt0(X124,X122),xI)
| ~ aElement0(X124) )
& ( ~ aElementOf0(X122,xI)
| aElementOf0(sdtpldt0(X122,X123),xI)
| ~ aElementOf0(X123,xI) )
& aSet0(xI) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[m__2174])])])])])])]) ).
fof(c_0_8,negated_conjecture,
~ ( ( aElementOf0(xb,slsdtgt0(xb))
| ? [X1] :
( sdtasdt0(xb,X1) = xb
& aElement0(X1) ) )
& ( aElementOf0(sz00,slsdtgt0(xb))
| ? [X1] :
( sdtasdt0(xb,X1) = sz00
& aElement0(X1) ) )
& ( aElementOf0(xa,slsdtgt0(xa))
| ? [X1] :
( sdtasdt0(xa,X1) = xa
& aElement0(X1) ) )
& ( aElementOf0(sz00,slsdtgt0(xa))
| ? [X1] :
( sdtasdt0(xa,X1) = sz00
& aElement0(X1) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_9,hypothesis,
( sdtasdt0(xa,X1) != X2
| ~ aElement0(X1)
| aElementOf0(X2,slsdtgt0(xa)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X25] :
( ( ~ aElement0(X25)
| X25 = sdtasdt0(sz10,X25) )
& ( ~ aElement0(X25)
| sdtasdt0(X25,sz10) = X25 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulUnit])])])]) ).
fof(c_0_11,plain,
! [X30] :
( ( ~ aElement0(X30)
| sz00 = sdtasdt0(sz00,X30) )
& ( ~ aElement0(X30)
| sdtasdt0(X30,sz00) = sz00 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulZero])])])]) ).
fof(c_0_12,negated_conjecture,
! [X139,X140,X141,X142] :
( ( ~ aElementOf0(sz00,slsdtgt0(xa))
| ~ aElementOf0(xa,slsdtgt0(xa))
| ~ aElementOf0(sz00,slsdtgt0(xb))
| ~ aElementOf0(xb,slsdtgt0(xb)) )
& ( ~ aElementOf0(sz00,slsdtgt0(xa))
| ~ aElementOf0(xa,slsdtgt0(xa))
| ~ aElementOf0(sz00,slsdtgt0(xb))
| sdtasdt0(xb,X142) != xb
| ~ aElement0(X142) )
& ( ~ aElementOf0(sz00,slsdtgt0(xa))
| ~ aElementOf0(xa,slsdtgt0(xa))
| sdtasdt0(xb,X141) != sz00
| ~ aElement0(X141)
| ~ aElementOf0(xb,slsdtgt0(xb)) )
& ( ~ aElementOf0(sz00,slsdtgt0(xa))
| ~ aElementOf0(xa,slsdtgt0(xa))
| sdtasdt0(xb,X141) != sz00
| ~ aElement0(X141)
| sdtasdt0(xb,X142) != xb
| ~ aElement0(X142) )
& ( ~ aElementOf0(sz00,slsdtgt0(xa))
| sdtasdt0(xa,X140) != xa
| ~ aElement0(X140)
| ~ aElementOf0(sz00,slsdtgt0(xb))
| ~ aElementOf0(xb,slsdtgt0(xb)) )
& ( ~ aElementOf0(sz00,slsdtgt0(xa))
| sdtasdt0(xa,X140) != xa
| ~ aElement0(X140)
| ~ aElementOf0(sz00,slsdtgt0(xb))
| sdtasdt0(xb,X142) != xb
| ~ aElement0(X142) )
& ( ~ aElementOf0(sz00,slsdtgt0(xa))
| sdtasdt0(xa,X140) != xa
| ~ aElement0(X140)
| sdtasdt0(xb,X141) != sz00
| ~ aElement0(X141)
| ~ aElementOf0(xb,slsdtgt0(xb)) )
& ( ~ aElementOf0(sz00,slsdtgt0(xa))
| sdtasdt0(xa,X140) != xa
| ~ aElement0(X140)
| sdtasdt0(xb,X141) != sz00
| ~ aElement0(X141)
| sdtasdt0(xb,X142) != xb
| ~ aElement0(X142) )
& ( sdtasdt0(xa,X139) != sz00
| ~ aElement0(X139)
| ~ aElementOf0(xa,slsdtgt0(xa))
| ~ aElementOf0(sz00,slsdtgt0(xb))
| ~ aElementOf0(xb,slsdtgt0(xb)) )
& ( sdtasdt0(xa,X139) != sz00
| ~ aElement0(X139)
| ~ aElementOf0(xa,slsdtgt0(xa))
| ~ aElementOf0(sz00,slsdtgt0(xb))
| sdtasdt0(xb,X142) != xb
| ~ aElement0(X142) )
& ( sdtasdt0(xa,X139) != sz00
| ~ aElement0(X139)
| ~ aElementOf0(xa,slsdtgt0(xa))
| sdtasdt0(xb,X141) != sz00
| ~ aElement0(X141)
| ~ aElementOf0(xb,slsdtgt0(xb)) )
& ( sdtasdt0(xa,X139) != sz00
| ~ aElement0(X139)
| ~ aElementOf0(xa,slsdtgt0(xa))
| sdtasdt0(xb,X141) != sz00
| ~ aElement0(X141)
| sdtasdt0(xb,X142) != xb
| ~ aElement0(X142) )
& ( sdtasdt0(xa,X139) != sz00
| ~ aElement0(X139)
| sdtasdt0(xa,X140) != xa
| ~ aElement0(X140)
| ~ aElementOf0(sz00,slsdtgt0(xb))
| ~ aElementOf0(xb,slsdtgt0(xb)) )
& ( sdtasdt0(xa,X139) != sz00
| ~ aElement0(X139)
| sdtasdt0(xa,X140) != xa
| ~ aElement0(X140)
| ~ aElementOf0(sz00,slsdtgt0(xb))
| sdtasdt0(xb,X142) != xb
| ~ aElement0(X142) )
& ( sdtasdt0(xa,X139) != sz00
| ~ aElement0(X139)
| sdtasdt0(xa,X140) != xa
| ~ aElement0(X140)
| sdtasdt0(xb,X141) != sz00
| ~ aElement0(X141)
| ~ aElementOf0(xb,slsdtgt0(xb)) )
& ( sdtasdt0(xa,X139) != sz00
| ~ aElement0(X139)
| sdtasdt0(xa,X140) != xa
| ~ aElement0(X140)
| sdtasdt0(xb,X141) != sz00
| ~ aElement0(X141)
| sdtasdt0(xb,X142) != xb
| ~ aElement0(X142) ) ),
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_8])])])])]) ).
cnf(c_0_13,hypothesis,
( ~ aElement0(X1)
| aElementOf0(sdtasdt0(xa,X1),slsdtgt0(xa)) ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( ~ aElement0(X1)
| sdtasdt0(X1,sz10) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
aElement0(sz10),
inference(split_conjunct,[status(thm)],[mSortsC_01]) ).
cnf(c_0_16,hypothesis,
aElement0(xa),
inference(split_conjunct,[status(thm)],[m__2091]) ).
cnf(c_0_17,plain,
( ~ aElement0(X1)
| sdtasdt0(X1,sz00) = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
aElement0(sz00),
inference(split_conjunct,[status(thm)],[mSortsC]) ).
cnf(c_0_19,negated_conjecture,
( ~ aElementOf0(sz00,slsdtgt0(xa))
| ~ aElementOf0(xa,slsdtgt0(xa))
| sdtasdt0(xb,X2) != sz00
| ~ aElement0(X2)
| sdtasdt0(xb,X1) != xb
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,hypothesis,
aElementOf0(xa,slsdtgt0(xa)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16])]) ).
cnf(c_0_21,hypothesis,
aElementOf0(sz00,slsdtgt0(xa)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_17]),c_0_18]),c_0_16])]) ).
cnf(c_0_22,negated_conjecture,
( ~ aElement0(X2)
| ~ aElement0(X1)
| sdtasdt0(xb,X2) != xb
| sdtasdt0(xb,X1) != sz00 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]),c_0_21])]) ).
cnf(c_0_23,hypothesis,
aElement0(xb),
inference(split_conjunct,[status(thm)],[m__2091]) ).
cnf(c_0_24,negated_conjecture,
( ~ aElement0(X1)
| sdtasdt0(xb,X1) != xb ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_17]),c_0_18]),c_0_23])]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_14]),c_0_15]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG108+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n001.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:25:43 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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
% 0.11/0.45 % Version: 3.5.1
% 0.11/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.45 % Starting sh5l with 300s (1) cores
% 0.11/0.45 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2179893 completed with status 0
% 0.11/0.45 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.11/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.45 % No SInE strategy applied
% 0.11/0.45 % Search class: FGHSF-FSLM32-MFFFFFNN
% 0.11/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.11/0.45 % Starting G-E--_300_C18_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.11/0.45 % Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S0U with 136s (1) cores
% 0.11/0.45 % G-E--_300_C18_F1_SE_CS_SP_S0Y with pid 2179904 completed with status 0
% 0.11/0.45 % Result found by G-E--_300_C18_F1_SE_CS_SP_S0Y
% 0.11/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.45 % No SInE strategy applied
% 0.11/0.45 % Search class: FGHSF-FSLM32-MFFFFFNN
% 0.11/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.11/0.45 % Starting G-E--_300_C18_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.11/0.45 % Preprocessing time : 0.004 s
% 0.11/0.45
% 0.11/0.45 % Proof found!
% 0.11/0.45 % SZS status Theorem
% 0.11/0.45 % SZS output start CNFRefutation
% See solution above
% 0.11/0.45 % Parsed axioms : 43
% 0.11/0.45 % Removed by relevancy pruning/SinE : 0
% 0.11/0.45 % Initial clauses : 165
% 0.11/0.45 % Removed in clause preprocessing : 4
% 0.11/0.45 % Initial clauses in saturation : 161
% 0.11/0.45 % Processed clauses : 86
% 0.11/0.45 % ...of these trivial : 3
% 0.11/0.45 % ...subsumed : 3
% 0.11/0.45 % ...remaining for further processing : 80
% 0.11/0.45 % Other redundant clauses eliminated : 2
% 0.11/0.45 % Clauses deleted for lack of memory : 0
% 0.11/0.45 % Backward-subsumed : 3
% 0.11/0.45 % Backward-rewritten : 11
% 0.11/0.45 % Generated clauses : 61
% 0.11/0.45 % ...of the previous two non-redundant : 42
% 0.11/0.45 % ...aggressively subsumed : 0
% 0.11/0.45 % Contextual simplify-reflections : 0
% 0.11/0.45 % Paramodulations : 59
% 0.11/0.45 % Factorizations : 0
% 0.11/0.45 % NegExts : 0
% 0.11/0.45 % Equation resolutions : 2
% 0.11/0.45 % Disequality decompositions : 0
% 0.11/0.45 % Total rewrite steps : 85
% 0.11/0.45 % ...of those cached : 70
% 0.11/0.45 % Propositional unsat checks : 0
% 0.11/0.45 % Propositional check models : 0
% 0.11/0.45 % Propositional check unsatisfiable : 0
% 0.11/0.45 % Propositional clauses : 0
% 0.11/0.45 % Propositional clauses after purity: 0
% 0.11/0.45 % Propositional unsat core size : 0
% 0.11/0.45 % Propositional preprocessing time : 0.000
% 0.11/0.45 % Propositional encoding time : 0.000
% 0.11/0.45 % Propositional solver time : 0.000
% 0.11/0.45 % Success case prop preproc time : 0.000
% 0.11/0.45 % Success case prop encoding time : 0.000
% 0.11/0.45 % Success case prop solver time : 0.000
% 0.11/0.45 % Current number of processed clauses : 64
% 0.11/0.45 % Positive orientable unit clauses : 21
% 0.11/0.45 % Positive unorientable unit clauses: 0
% 0.11/0.45 % Negative unit clauses : 1
% 0.11/0.45 % Non-unit-clauses : 42
% 0.11/0.45 % Current number of unprocessed clauses: 116
% 0.11/0.45 % ...number of literals in the above : 537
% 0.11/0.45 % Current number of archived formulas : 0
% 0.11/0.45 % Current number of archived clauses : 14
% 0.11/0.45 % Clause-clause subsumption calls (NU) : 671
% 0.11/0.45 % Rec. Clause-clause subsumption calls : 286
% 0.11/0.45 % Non-unit clause-clause subsumptions : 6
% 0.11/0.45 % Unit Clause-clause subsumption calls : 25
% 0.11/0.45 % Rewrite failures with RHS unbound : 0
% 0.11/0.45 % BW rewrite match attempts : 3
% 0.11/0.45 % BW rewrite match successes : 3
% 0.11/0.45 % Condensation attempts : 0
% 0.11/0.45 % Condensation successes : 0
% 0.11/0.45 % Termbank termtop insertions : 11662
% 0.11/0.45 % Search garbage collected termcells : 2466
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.019 s
% 0.11/0.45 % System time : 0.004 s
% 0.11/0.45 % Total time : 0.022 s
% 0.11/0.45 % Maximum resident set size: 3960 pages
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.055 s
% 0.11/0.45 % System time : 0.018 s
% 0.11/0.45 % Total time : 0.073 s
% 0.11/0.45 % Maximum resident set size: 4864 pages
% 0.11/0.45 % E exiting
%------------------------------------------------------------------------------