%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COM022+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 : n006.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 12:11:29 PM UTC 2026
% Result : Theorem 0.15s 10.46s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 36 ( 11 unt; 0 def)
% Number of atoms : 193 ( 11 equ)
% Maximal formula atoms : 41 ( 5 avg)
% Number of connectives : 250 ( 93 ~; 91 |; 56 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-3 aty)
% Number of variables : 42 ( 0 sgn 15 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( ( sdtmndtplgtdt0(xa,xR,xc)
& sdtmndtplgtdt0(xa,xR,xb) )
=> ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( sdtmndtasgtdt0(xc,xR,X4)
& sdtmndtasgtdt0(xb,xR,X4)
& aNormalFormOfIn0(X4,X3,xR) )
& sdtmndtasgtdt0(X2,xR,X3)
& sdtmndtasgtdt0(X1,xR,X3)
& aElement0(X3) )
& sdtmndtasgtdt0(X2,xR,xc)
& aReductOfIn0(X2,xa,xR)
& aElement0(X2) )
& sdtmndtasgtdt0(X1,xR,xb)
& aReductOfIn0(X1,xa,xR)
& aElement0(X1) ) )
=> ( ( sdtmndtasgtdt0(xa,xR,xc)
& sdtmndtasgtdt0(xa,xR,xb) )
=> ? [X1] :
( sdtmndtasgtdt0(xc,xR,X1)
& sdtmndtasgtdt0(xb,xR,X1)
& aElement0(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mNFRDef,axiom,
! [X1,X2] :
( ( aRewritingSystem0(X2)
& aElement0(X1) )
=> ! [X3] :
( aNormalFormOfIn0(X3,X1,X2)
<=> ( ~ ? [X4] : aReductOfIn0(X4,X3,X2)
& sdtmndtasgtdt0(X1,X2,X3)
& aElement0(X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mNFRDef) ).
fof(m__656,hypothesis,
aRewritingSystem0(xR),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__656) ).
fof(mTCRDef,axiom,
! [X1,X2,X3] :
( ( aElement0(X3)
& aRewritingSystem0(X2)
& aElement0(X1) )
=> ( sdtmndtasgtdt0(X1,X2,X3)
<=> ( sdtmndtplgtdt0(X1,X2,X3)
| X1 = X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mTCRDef) ).
fof(m__731,hypothesis,
( aElement0(xc)
& aElement0(xb)
& aElement0(xa) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__731) ).
fof(c_0_5,negated_conjecture,
~ ( ( ( sdtmndtplgtdt0(xa,xR,xc)
& sdtmndtplgtdt0(xa,xR,xb) )
=> ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( sdtmndtasgtdt0(xc,xR,X4)
& sdtmndtasgtdt0(xb,xR,X4)
& aNormalFormOfIn0(X4,X3,xR) )
& sdtmndtasgtdt0(X2,xR,X3)
& sdtmndtasgtdt0(X1,xR,X3)
& aElement0(X3) )
& sdtmndtasgtdt0(X2,xR,xc)
& aReductOfIn0(X2,xa,xR)
& aElement0(X2) )
& sdtmndtasgtdt0(X1,xR,xb)
& aReductOfIn0(X1,xa,xR)
& aElement0(X1) ) )
=> ( ( sdtmndtasgtdt0(xa,xR,xc)
& sdtmndtasgtdt0(xa,xR,xb) )
=> ? [X1] :
( sdtmndtasgtdt0(xc,xR,X1)
& sdtmndtasgtdt0(xb,xR,X1)
& aElement0(X1) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,plain,
! [X27,X28,X29,X30,X31] :
( ( ~ aRewritingSystem0(X28)
| ~ aElement0(X27)
| aNormalFormOfIn0(X31,X27,X28)
| aReductOfIn0(esk9_3(X27,X28,X31),X31,X28)
| ~ sdtmndtasgtdt0(X27,X28,X31)
| ~ aElement0(X31) )
& ( ~ aRewritingSystem0(X28)
| ~ aElement0(X27)
| ~ aNormalFormOfIn0(X29,X27,X28)
| ~ aReductOfIn0(X30,X29,X28) )
& ( ~ aRewritingSystem0(X28)
| ~ aElement0(X27)
| ~ aNormalFormOfIn0(X29,X27,X28)
| sdtmndtasgtdt0(X27,X28,X29) )
& ( ~ aRewritingSystem0(X28)
| ~ aElement0(X27)
| ~ aNormalFormOfIn0(X29,X27,X28)
| aElement0(X29) ) ),
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)],[mNFRDef])])])])])])]) ).
fof(c_0_7,negated_conjecture,
! [X10] :
( ( ~ sdtmndtasgtdt0(xc,xR,X10)
| ~ sdtmndtasgtdt0(xb,xR,X10)
| ~ aElement0(X10) )
& sdtmndtasgtdt0(xa,xR,xc)
& sdtmndtasgtdt0(xa,xR,xb)
& ( ~ sdtmndtplgtdt0(xa,xR,xc)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| sdtmndtasgtdt0(xc,xR,esk4_0) )
& ( ~ sdtmndtplgtdt0(xa,xR,xc)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| sdtmndtasgtdt0(xb,xR,esk4_0) )
& ( ~ sdtmndtplgtdt0(xa,xR,xc)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| aNormalFormOfIn0(esk4_0,esk3_0,xR) )
& ( ~ sdtmndtplgtdt0(xa,xR,xc)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| sdtmndtasgtdt0(esk2_0,xR,esk3_0) )
& ( ~ sdtmndtplgtdt0(xa,xR,xc)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| sdtmndtasgtdt0(esk1_0,xR,esk3_0) )
& ( ~ sdtmndtplgtdt0(xa,xR,xc)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| aElement0(esk3_0) )
& ( ~ sdtmndtplgtdt0(xa,xR,xc)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| sdtmndtasgtdt0(esk2_0,xR,xc) )
& ( ~ sdtmndtplgtdt0(xa,xR,xc)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| aReductOfIn0(esk2_0,xa,xR) )
& ( ~ sdtmndtplgtdt0(xa,xR,xc)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| aElement0(esk2_0) )
& ( ~ sdtmndtplgtdt0(xa,xR,xc)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| sdtmndtasgtdt0(esk1_0,xR,xb) )
& ( ~ sdtmndtplgtdt0(xa,xR,xc)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| aReductOfIn0(esk1_0,xa,xR) )
& ( ~ sdtmndtplgtdt0(xa,xR,xc)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| aElement0(esk1_0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])])]) ).
cnf(c_0_8,plain,
( ~ aRewritingSystem0(X3)
| ~ aElement0(X2)
| ~ aNormalFormOfIn0(X1,X2,X3)
| aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
( ~ sdtmndtplgtdt0(xa,xR,xc)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| aNormalFormOfIn0(esk4_0,esk3_0,xR) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,hypothesis,
aRewritingSystem0(xR),
inference(split_conjunct,[status(thm)],[m__656]) ).
cnf(c_0_11,negated_conjecture,
( ~ sdtmndtplgtdt0(xa,xR,xc)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| aElement0(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_12,plain,
! [X11,X12,X13] :
( ( ~ aElement0(X13)
| ~ aRewritingSystem0(X12)
| ~ aElement0(X11)
| sdtmndtasgtdt0(X11,X12,X13)
| ~ sdtmndtplgtdt0(X11,X12,X13) )
& ( ~ aElement0(X13)
| ~ aRewritingSystem0(X12)
| ~ aElement0(X11)
| sdtmndtasgtdt0(X11,X12,X13)
| X11 != X13 )
& ( ~ aElement0(X13)
| ~ aRewritingSystem0(X12)
| ~ aElement0(X11)
| sdtmndtplgtdt0(X11,X12,X13)
| X11 = X13
| ~ sdtmndtasgtdt0(X11,X12,X13) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mTCRDef])])])]) ).
cnf(c_0_13,negated_conjecture,
( ~ sdtmndtasgtdt0(xc,xR,X1)
| ~ sdtmndtasgtdt0(xb,xR,X1)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,negated_conjecture,
( ~ sdtmndtplgtdt0(xa,xR,xc)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| sdtmndtasgtdt0(xc,xR,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,negated_conjecture,
( ~ sdtmndtplgtdt0(xa,xR,xc)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| aElement0(esk4_0) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]),c_0_11]) ).
cnf(c_0_16,negated_conjecture,
( ~ sdtmndtplgtdt0(xa,xR,xc)
| ~ sdtmndtplgtdt0(xa,xR,xb)
| sdtmndtasgtdt0(xb,xR,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,plain,
( ~ aElement0(X3)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X1)
| ~ sdtmndtasgtdt0(X1,X2,X3)
| sdtmndtplgtdt0(X1,X2,X3)
| X1 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
sdtmndtasgtdt0(xa,xR,xc),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_19,hypothesis,
aElement0(xc),
inference(split_conjunct,[status(thm)],[m__731]) ).
cnf(c_0_20,hypothesis,
aElement0(xa),
inference(split_conjunct,[status(thm)],[m__731]) ).
cnf(c_0_21,plain,
( ~ aElement0(X3)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X1)
| ~ sdtmndtplgtdt0(X1,X2,X3)
| sdtmndtasgtdt0(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,plain,
( ~ aElement0(X2)
| ~ aRewritingSystem0(X3)
| ~ aElement0(X1)
| X1 != X2
| sdtmndtasgtdt0(X1,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_23,negated_conjecture,
( ~ sdtmndtplgtdt0(xa,xR,xc)
| ~ sdtmndtplgtdt0(xa,xR,xb) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16]) ).
cnf(c_0_24,negated_conjecture,
( sdtmndtplgtdt0(xa,xR,xc)
| xc = xa ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_10]),c_0_19]),c_0_20])]) ).
cnf(c_0_25,negated_conjecture,
sdtmndtasgtdt0(xa,xR,xb),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_26,hypothesis,
aElement0(xb),
inference(split_conjunct,[status(thm)],[m__731]) ).
cnf(c_0_27,negated_conjecture,
( ~ aElement0(X1)
| ~ sdtmndtplgtdt0(xc,xR,X1)
| ~ sdtmndtasgtdt0(xb,xR,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_21]),c_0_10]),c_0_19])]) ).
cnf(c_0_28,plain,
( ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| sdtmndtasgtdt0(X1,X2,X1) ),
inference(er,[status(thm)],[c_0_22]) ).
cnf(c_0_29,negated_conjecture,
( ~ sdtmndtplgtdt0(xa,xR,xb)
| xc = xa ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,negated_conjecture,
( sdtmndtplgtdt0(xa,xR,xb)
| xb = xa ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_25]),c_0_10]),c_0_26]),c_0_20])]) ).
cnf(c_0_31,negated_conjecture,
~ sdtmndtplgtdt0(xc,xR,xb),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_26]),c_0_10])]) ).
cnf(c_0_32,negated_conjecture,
( xc = xa
| xb = xa ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
~ sdtmndtasgtdt0(xb,xR,xc),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_28]),c_0_19]),c_0_10])]) ).
cnf(c_0_34,negated_conjecture,
xb = xa,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_30]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM022+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/10.39 % Computer : n006.cluster.edu
% 0.12/10.39 % Model : x86_64 x86_64
% 0.12/10.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/10.39 % Memory : 8046.5625MB
% 0.12/10.39 % OS : Linux 6.8.0-71-generic
% 0.12/10.39 % CPULimit : 300
% 0.12/10.39 % WCLimit : 300
% 0.12/10.39 % DateTime : Mon Sep 21 14:14:38 UTC 2026
% 0.12/10.39 % CPUTime :
% 0.12/10.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/10.43 Running first-order theorem proving
% 0.15/10.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
% 0.15/10.46 % Version: 3.5.1
% 0.15/10.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/10.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/10.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/10.46 % Starting new_bool_1 with 300s (1) cores
% 0.15/10.46 % Starting sh5l with 300s (1) cores
% 0.15/10.46 % sh5l with pid 3050048 completed with status 0
% 0.15/10.46 % Result found by sh5l
% 0.15/10.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/10.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/10.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/10.46 % Starting new_bool_1 with 300s (1) cores
% 0.15/10.46 % Starting sh5l with 300s (1) cores
% 0.15/10.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/10.46 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/10.46 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.15/10.46 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.15/10.46 % Starting SubtermCWHack with 28s (1) cores
% 0.15/10.46 % SubtermCWHack with pid 3050049 completed with status 0
% 0.15/10.46 % Result found by SubtermCWHack
% 0.15/10.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/10.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/10.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/10.46 % Starting new_bool_1 with 300s (1) cores
% 0.15/10.46 % Starting sh5l with 300s (1) cores
% 0.15/10.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/10.46 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/10.46 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.15/10.46 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.15/10.46 % Starting SubtermCWHack with 28s (1) cores
% 0.15/10.46 % Preprocessing time : 0.002 s
% 0.15/10.46
% 0.15/10.46 % Proof found!
% 0.15/10.46 % SZS status Theorem
% 0.15/10.46 % SZS output start CNFRefutation
% See solution above
% 0.15/10.46 % Parsed axioms : 19
% 0.15/10.46 % Removed by relevancy pruning/SinE : 1
% 0.15/10.46 % Initial clauses : 58
% 0.15/10.46 % Removed in clause preprocessing : 4
% 0.15/10.46 % Initial clauses in saturation : 54
% 0.15/10.46 % Processed clauses : 76
% 0.15/10.46 % ...of these trivial : 0
% 0.15/10.46 % ...subsumed : 4
% 0.15/10.46 % ...remaining for further processing : 72
% 0.15/10.46 % Other redundant clauses eliminated : 1
% 0.15/10.46 % Clauses deleted for lack of memory : 0
% 0.15/10.46 % Backward-subsumed : 17
% 0.15/10.46 % Backward-rewritten : 18
% 0.15/10.46 % Generated clauses : 55
% 0.15/10.46 % ...of the previous two non-redundant : 59
% 0.15/10.46 % ...aggressively subsumed : 0
% 0.15/10.46 % Contextual simplify-reflections : 10
% 0.15/10.46 % Paramodulations : 54
% 0.15/10.46 % Factorizations : 0
% 0.15/10.46 % NegExts : 0
% 0.15/10.46 % Equation resolutions : 1
% 0.15/10.46 % Disequality decompositions : 0
% 0.15/10.46 % Total rewrite steps : 74
% 0.15/10.46 % ...of those cached : 67
% 0.15/10.46 % Propositional unsat checks : 0
% 0.15/10.46 % Propositional check models : 0
% 0.15/10.46 % Propositional check unsatisfiable : 0
% 0.15/10.46 % Propositional clauses : 0
% 0.15/10.46 % Propositional clauses after purity: 0
% 0.15/10.46 % Propositional unsat core size : 0
% 0.15/10.46 % Propositional preprocessing time : 0.000
% 0.15/10.46 % Propositional encoding time : 0.000
% 0.15/10.46 % Propositional solver time : 0.000
% 0.15/10.46 % Success case prop preproc time : 0.000
% 0.15/10.46 % Success case prop encoding time : 0.000
% 0.15/10.46 % Success case prop solver time : 0.000
% 0.15/10.46 % Current number of processed clauses : 36
% 0.15/10.46 % Positive orientable unit clauses : 7
% 0.15/10.46 % Positive unorientable unit clauses: 0
% 0.15/10.46 % Negative unit clauses : 0
% 0.15/10.46 % Non-unit-clauses : 29
% 0.15/10.46 % Current number of unprocessed clauses: 26
% 0.15/10.46 % ...number of literals in the above : 147
% 0.15/10.46 % Current number of archived formulas : 0
% 0.15/10.46 % Current number of archived clauses : 35
% 0.15/10.46 % Clause-clause subsumption calls (NU) : 350
% 0.15/10.46 % Rec. Clause-clause subsumption calls : 218
% 0.15/10.46 % Non-unit clause-clause subsumptions : 31
% 0.15/10.46 % Unit Clause-clause subsumption calls : 61
% 0.15/10.46 % Rewrite failures with RHS unbound : 0
% 0.15/10.46 % BW rewrite match attempts : 2
% 0.15/10.46 % BW rewrite match successes : 1
% 0.15/10.46 % Condensation attempts : 0
% 0.15/10.46 % Condensation successes : 0
% 0.15/10.46 % Termbank termtop insertions : 5710
% 0.15/10.46 % Search garbage collected termcells : 1174
% 0.15/10.46
% 0.15/10.46 % -------------------------------------------------
% 0.15/10.46 % User time : 0.010 s
% 0.15/10.46 % System time : 0.001 s
% 0.15/10.46 % Total time : 0.011 s
% 0.15/10.46 % Maximum resident set size: 3664 pages
% 0.15/10.46
% 0.15/10.46 % -------------------------------------------------
% 0.15/10.46 % User time : 0.013 s
% 0.15/10.46 % System time : 0.005 s
% 0.15/10.46 % Total time : 0.018 s
% 0.15/10.46 % Maximum resident set size: 4864 pages
% 0.15/10.46 % E exiting
%------------------------------------------------------------------------------