%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG120+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 : n008.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:55 PM UTC 2026
% Result : Theorem 0.24s 5.86s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 46 ( 9 unt; 0 def)
% Number of atoms : 179 ( 37 equ)
% Maximal formula atoms : 33 ( 3 avg)
% Number of connectives : 202 ( 69 ~; 61 |; 60 &)
% ( 3 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 32 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 10 con; 0-2 aty)
% Number of variables : 75 ( 0 sgn 38 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aElement0(X2)
& aElement0(X1) )
=> aElement0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB_02) ).
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__2091,hypothesis,
( aElement0(xb)
& aElement0(xa) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2091) ).
fof(mSortsB,axiom,
! [X1,X2] :
( ( aElement0(X2)
& aElement0(X1) )
=> aElement0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB) ).
fof(m__,conjecture,
( aElementOf0(smndt0(sdtasdt0(xq,xu)),xI)
| ? [X1,X2] :
( sdtpldt0(X1,X2) = smndt0(sdtasdt0(xq,xu))
& aElementOf0(X2,slsdtgt0(xb))
& aElementOf0(X1,slsdtgt0(xa)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mMulMnOne,axiom,
! [X1] :
( aElement0(X1)
=> ( smndt0(X1) = sdtasdt0(X1,smndt0(sz10))
& sdtasdt0(smndt0(sz10),X1) = smndt0(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulMnOne) ).
fof(mSortsU,axiom,
! [X1] :
( aElement0(X1)
=> aElement0(smndt0(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsU) ).
fof(m__2273,hypothesis,
( ! [X1] :
( ( X1 != sz00
& ( aElementOf0(X1,xI)
| ? [X2,X3] :
( sdtpldt0(X2,X3) = X1
& aElementOf0(X3,slsdtgt0(xb))
& aElementOf0(X2,slsdtgt0(xa)) ) ) )
=> ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) )
& xu != sz00
& aElementOf0(xu,xI)
& ? [X1,X2] :
( sdtpldt0(X1,X2) = xu
& aElementOf0(X2,slsdtgt0(xb))
& aElementOf0(X1,slsdtgt0(xa)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2273) ).
fof(mSortsC_01,axiom,
aElement0(sz10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC_01) ).
fof(m__2666,hypothesis,
( ( iLess0(sbrdtbr0(xr),sbrdtbr0(xu))
| xr = sz00 )
& xb = sdtpldt0(sdtasdt0(xq,xu),xr)
& aElement0(xr)
& aElement0(xq) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2666) ).
fof(c_0_10,plain,
! [X71,X72] :
( aElement0(sdtasdt0(X71,X72))
| ~ aElement0(X72)
| ~ aElement0(X71) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])])]) ).
fof(c_0_11,hypothesis,
! [X13,X14,X15,X16,X18,X19,X20,X22,X23,X24,X27,X28,X29] :
( xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))
& ( aElementOf0(X27,xI)
| sdtpldt0(X28,X29) != X27
| ~ aElementOf0(X29,slsdtgt0(xb))
| ~ aElementOf0(X28,slsdtgt0(xa)) )
& ( ~ aElementOf0(X24,xI)
| sdtpldt0(esk6_1(X24),esk7_1(X24)) = X24 )
& ( ~ aElementOf0(X24,xI)
| aElementOf0(esk7_1(X24),slsdtgt0(xb)) )
& ( ~ aElementOf0(X24,xI)
| aElementOf0(esk6_1(X24),slsdtgt0(xa)) )
& ( aElementOf0(X22,slsdtgt0(xb))
| sdtasdt0(xb,X23) != X22
| ~ aElement0(X23) )
& ( ~ aElementOf0(X20,slsdtgt0(xb))
| sdtasdt0(xb,esk5_1(X20)) = X20 )
& ( ~ aElementOf0(X20,slsdtgt0(xb))
| aElement0(esk5_1(X20)) )
& ( aElementOf0(X18,slsdtgt0(xa))
| sdtasdt0(xa,X19) != X18
| ~ aElement0(X19) )
& ( ~ aElementOf0(X16,slsdtgt0(xa))
| sdtasdt0(xa,esk4_1(X16)) = X16 )
& ( ~ aElementOf0(X16,slsdtgt0(xa))
| aElement0(esk4_1(X16)) )
& aIdeal0(xI)
& ( ~ aElementOf0(X13,xI)
| aElementOf0(sdtasdt0(X15,X13),xI)
| ~ aElement0(X15) )
& ( ~ aElementOf0(X13,xI)
| aElementOf0(sdtpldt0(X13,X14),xI)
| ~ aElementOf0(X14,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])])])])])])]) ).
cnf(c_0_12,plain,
( ~ aElement0(X2)
| ~ aElement0(X1)
| aElement0(sdtasdt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,hypothesis,
( ~ aElementOf0(X1,slsdtgt0(xa))
| sdtasdt0(xa,esk4_1(X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,hypothesis,
aElement0(xa),
inference(split_conjunct,[status(thm)],[m__2091]) ).
cnf(c_0_15,hypothesis,
( ~ aElementOf0(X1,slsdtgt0(xa))
| aElement0(esk4_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,hypothesis,
( ~ aElementOf0(X1,slsdtgt0(xb))
| sdtasdt0(xb,esk5_1(X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,hypothesis,
aElement0(xb),
inference(split_conjunct,[status(thm)],[m__2091]) ).
cnf(c_0_18,hypothesis,
( ~ aElementOf0(X1,slsdtgt0(xb))
| aElement0(esk5_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_19,plain,
! [X111,X112] :
( aElement0(sdtpldt0(X111,X112))
| ~ aElement0(X112)
| ~ aElement0(X111) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])])]) ).
cnf(c_0_20,hypothesis,
( ~ aElementOf0(X1,slsdtgt0(xa))
| aElement0(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),c_0_15]) ).
cnf(c_0_21,hypothesis,
( ~ aElementOf0(X1,xI)
| aElementOf0(esk6_1(X1),slsdtgt0(xa)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_22,hypothesis,
( ~ aElementOf0(X1,slsdtgt0(xb))
| aElement0(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_16]),c_0_17])]),c_0_18]) ).
cnf(c_0_23,hypothesis,
( ~ aElementOf0(X1,xI)
| aElementOf0(esk7_1(X1),slsdtgt0(xb)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_24,negated_conjecture,
~ ( aElementOf0(smndt0(sdtasdt0(xq,xu)),xI)
| ? [X1,X2] :
( sdtpldt0(X1,X2) = smndt0(sdtasdt0(xq,xu))
& aElementOf0(X2,slsdtgt0(xb))
& aElementOf0(X1,slsdtgt0(xa)) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_25,plain,
! [X142] :
( ( ~ aElement0(X142)
| smndt0(X142) = sdtasdt0(X142,smndt0(sz10)) )
& ( ~ aElement0(X142)
| sdtasdt0(smndt0(sz10),X142) = smndt0(X142) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulMnOne])])])]) ).
cnf(c_0_26,plain,
( ~ aElement0(X2)
| ~ aElement0(X1)
| aElement0(sdtpldt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,hypothesis,
( ~ aElementOf0(X1,xI)
| sdtpldt0(esk6_1(X1),esk7_1(X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_28,hypothesis,
( ~ aElementOf0(X1,xI)
| aElement0(esk6_1(X1)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_29,hypothesis,
( ~ aElementOf0(X1,xI)
| aElement0(esk7_1(X1)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_30,negated_conjecture,
! [X54,X55] :
( ~ aElementOf0(smndt0(sdtasdt0(xq,xu)),xI)
& ( sdtpldt0(X54,X55) != smndt0(sdtasdt0(xq,xu))
| ~ aElementOf0(X55,slsdtgt0(xb))
| ~ aElementOf0(X54,slsdtgt0(xa)) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])])]) ).
cnf(c_0_31,hypothesis,
( ~ aElementOf0(X2,xI)
| ~ aElement0(X1)
| aElementOf0(sdtasdt0(X1,X2),xI) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_32,plain,
( ~ aElement0(X1)
| sdtasdt0(smndt0(sz10),X1) = smndt0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_33,hypothesis,
( ~ aElementOf0(X1,xI)
| aElement0(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29]) ).
cnf(c_0_34,negated_conjecture,
~ aElementOf0(smndt0(sdtasdt0(xq,xu)),xI),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_35,hypothesis,
( ~ aElement0(smndt0(sz10))
| ~ aElementOf0(X1,xI)
| aElementOf0(smndt0(X1),xI) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
fof(c_0_36,plain,
! [X140] :
( aElement0(smndt0(X140))
| ~ aElement0(X140) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsU])])]) ).
fof(c_0_37,hypothesis,
( ! [X1] :
( ( X1 != sz00
& ( aElementOf0(X1,xI)
| ? [X2,X3] :
( sdtpldt0(X2,X3) = X1
& aElementOf0(X3,slsdtgt0(xb))
& aElementOf0(X2,slsdtgt0(xa)) ) ) )
=> ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) )
& xu != sz00
& aElementOf0(xu,xI)
& ? [X1,X2] :
( sdtpldt0(X1,X2) = xu
& aElementOf0(X2,slsdtgt0(xb))
& aElementOf0(X1,slsdtgt0(xa)) ) ),
inference(fof_simplification,[status(thm)],[m__2273]) ).
cnf(c_0_38,negated_conjecture,
( ~ aElement0(smndt0(sz10))
| ~ aElementOf0(sdtasdt0(xq,xu),xI) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
( ~ aElement0(X1)
| aElement0(smndt0(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_40,plain,
aElement0(sz10),
inference(split_conjunct,[status(thm)],[mSortsC_01]) ).
fof(c_0_41,hypothesis,
! [X45,X46,X47] :
( ( ~ iLess0(sbrdtbr0(X45),sbrdtbr0(xu))
| X45 = sz00
| ~ aElementOf0(X45,xI) )
& ( ~ iLess0(sbrdtbr0(X45),sbrdtbr0(xu))
| X45 = sz00
| sdtpldt0(X46,X47) != X45
| ~ aElementOf0(X47,slsdtgt0(xb))
| ~ aElementOf0(X46,slsdtgt0(xa)) )
& xu != sz00
& aElementOf0(xu,xI)
& sdtpldt0(esk17_0,esk18_0) = xu
& aElementOf0(esk18_0,slsdtgt0(xb))
& aElementOf0(esk17_0,slsdtgt0(xa)) ),
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_37])])])])])]) ).
cnf(c_0_42,negated_conjecture,
~ aElementOf0(sdtasdt0(xq,xu),xI),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
cnf(c_0_43,hypothesis,
aElementOf0(xu,xI),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_44,hypothesis,
aElement0(xq),
inference(split_conjunct,[status(thm)],[m__2666]) ).
cnf(c_0_45,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_31]),c_0_43]),c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : RNG120+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/5.66 % Computer : n008.cluster.edu
% 0.20/5.66 % Model : x86_64 x86_64
% 0.20/5.66 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/5.66 % Memory : 8046.5625MB
% 0.20/5.66 % OS : Linux 6.8.0-71-generic
% 0.20/5.67 % CPULimit : 300
% 0.20/5.67 % WCLimit : 300
% 0.20/5.67 % DateTime : Mon Sep 21 04:22:15 UTC 2026
% 0.20/5.67 % CPUTime :
% 0.20/5.67 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/5.74 Running first-order theorem proving
% 0.24/5.74 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.24/5.86 % Version: 3.5.1
% 0.24/5.86 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/5.86 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/5.86 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/5.86 % Starting new_bool_3 with 300s (1) cores
% 0.24/5.86 % Starting new_bool_1 with 300s (1) cores
% 0.24/5.86 % Starting sh5l with 300s (1) cores
% 0.24/5.86 % new_bool_1 with pid 129056 completed with status 0
% 0.24/5.86 % Result found by new_bool_1
% 0.24/5.86 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/5.86 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/5.86 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/5.86 % Starting new_bool_3 with 300s (1) cores
% 0.24/5.86 % Starting new_bool_1 with 300s (1) cores
% 0.24/5.86 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/5.86 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/5.86 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.24/5.86 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/5.86 % Starting SubtermCWHack with 28s (1) cores
% 0.24/5.86 % SubtermCWHack with pid 129059 completed with status 0
% 0.24/5.86 % Result found by SubtermCWHack
% 0.24/5.86 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/5.86 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/5.86 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/5.86 % Starting new_bool_3 with 300s (1) cores
% 0.24/5.86 % Starting new_bool_1 with 300s (1) cores
% 0.24/5.86 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/5.86 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/5.86 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.24/5.86 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/5.86 % Starting SubtermCWHack with 28s (1) cores
% 0.24/5.86 % Preprocessing time : 0.003 s
% 0.24/5.86
% 0.24/5.86 % Proof found!
% 0.24/5.86 % SZS status Theorem
% 0.24/5.86 % SZS output start CNFRefutation
% See solution above
% 0.24/5.86 % Parsed axioms : 52
% 0.24/5.86 % Removed by relevancy pruning/SinE : 5
% 0.24/5.86 % Initial clauses : 185
% 0.24/5.86 % Removed in clause preprocessing : 4
% 0.24/5.86 % Initial clauses in saturation : 181
% 0.24/5.86 % Processed clauses : 1048
% 0.24/5.86 % ...of these trivial : 36
% 0.24/5.86 % ...subsumed : 463
% 0.24/5.86 % ...remaining for further processing : 549
% 0.24/5.86 % Other redundant clauses eliminated : 127
% 0.24/5.86 % Clauses deleted for lack of memory : 0
% 0.24/5.86 % Backward-subsumed : 39
% 0.24/5.86 % Backward-rewritten : 30
% 0.24/5.86 % Generated clauses : 4191
% 0.24/5.86 % ...of the previous two non-redundant : 2973
% 0.24/5.86 % ...aggressively subsumed : 0
% 0.24/5.86 % Contextual simplify-reflections : 19
% 0.24/5.86 % Paramodulations : 4066
% 0.24/5.86 % Factorizations : 0
% 0.24/5.86 % NegExts : 0
% 0.24/5.86 % Equation resolutions : 127
% 0.24/5.86 % Disequality decompositions : 0
% 0.24/5.86 % Total rewrite steps : 5334
% 0.24/5.86 % ...of those cached : 5224
% 0.24/5.86 % Propositional unsat checks : 0
% 0.24/5.86 % Propositional check models : 0
% 0.24/5.86 % Propositional check unsatisfiable : 0
% 0.24/5.86 % Propositional clauses : 0
% 0.24/5.86 % Propositional clauses after purity: 0
% 0.24/5.86 % Propositional unsat core size : 0
% 0.24/5.86 % Propositional preprocessing time : 0.000
% 0.24/5.86 % Propositional encoding time : 0.000
% 0.24/5.86 % Propositional solver time : 0.000
% 0.24/5.86 % Success case prop preproc time : 0.000
% 0.24/5.86 % Success case prop encoding time : 0.000
% 0.24/5.86 % Success case prop solver time : 0.000
% 0.24/5.86 % Current number of processed clauses : 464
% 0.24/5.86 % Positive orientable unit clauses : 150
% 0.24/5.86 % Positive unorientable unit clauses: 0
% 0.24/5.86 % Negative unit clauses : 23
% 0.24/5.86 % Non-unit-clauses : 291
% 0.24/5.86 % Current number of unprocessed clauses: 1902
% 0.24/5.86 % ...number of literals in the above : 7620
% 0.24/5.86 % Current number of archived formulas : 0
% 0.24/5.86 % Current number of archived clauses : 69
% 0.24/5.86 % Clause-clause subsumption calls (NU) : 9216
% 0.24/5.86 % Rec. Clause-clause subsumption calls : 6402
% 0.24/5.86 % Non-unit clause-clause subsumptions : 342
% 0.24/5.86 % Unit Clause-clause subsumption calls : 2154
% 0.24/5.86 % Rewrite failures with RHS unbound : 0
% 0.24/5.86 % BW rewrite match attempts : 28
% 0.24/5.86 % BW rewrite match successes : 27
% 0.24/5.86 % Condensation attempts : 0
% 0.24/5.86 % Condensation successes : 0
% 0.24/5.86 % Termbank termtop insertions : 69389
% 0.24/5.86 % Search garbage collected termcells : 2382
% 0.24/5.86
% 0.24/5.86 % -------------------------------------------------
% 0.24/5.86 % User time : 0.082 s
% 0.24/5.86 % System time : 0.007 s
% 0.24/5.86 % Total time : 0.089 s
% 0.24/5.86 % Maximum resident set size: 3976 pages
% 0.24/5.86
% 0.24/5.86 % -------------------------------------------------
% 0.24/5.86 % User time : 0.087 s
% 0.24/5.86 % System time : 0.013 s
% 0.24/5.86 % Total time : 0.100 s
% 0.24/5.86 % Maximum resident set size: 4864 pages
% 0.24/5.86 % E exiting
%------------------------------------------------------------------------------