%------------------------------------------------------------------------------
% File : E-SAT---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 : n007.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:06:28 PM UTC 2026
% Result : Theorem 0.15s 5.50s
% Output : CNFRefutation 0.15s
% 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 : 201 ( 68 ~; 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 : 76 ( 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(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(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(mSortsU,axiom,
! [X1] :
( aElement0(X1)
=> aElement0(smndt0(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsU) ).
fof(mSortsC_01,axiom,
aElement0(sz10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC_01) ).
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(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,
! [X11,X12] :
( aElement0(sdtasdt0(X11,X12))
| ~ aElement0(X12)
| ~ aElement0(X11) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])])]) ).
fof(c_0_11,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])])])])])])]) ).
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,esk24_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(esk24_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,hypothesis,
( ~ aElementOf0(X1,slsdtgt0(xb))
| sdtasdt0(xb,esk25_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(esk25_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_19,plain,
! [X9,X10] :
( aElement0(sdtpldt0(X9,X10))
| ~ aElement0(X10)
| ~ aElement0(X9) ),
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(esk26_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(esk27_1(X1),slsdtgt0(xb)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_24,plain,
! [X29] :
( ( ~ aElement0(X29)
| smndt0(X29) = sdtasdt0(X29,smndt0(sz10)) )
& ( ~ aElement0(X29)
| sdtasdt0(smndt0(sz10),X29) = smndt0(X29) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulMnOne])])])]) ).
cnf(c_0_25,plain,
( ~ aElement0(X2)
| ~ aElement0(X1)
| aElement0(sdtpldt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,hypothesis,
( ~ aElementOf0(X1,xI)
| sdtpldt0(esk26_1(X1),esk27_1(X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_27,hypothesis,
( ~ aElementOf0(X1,xI)
| aElement0(esk26_1(X1)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,hypothesis,
( ~ aElementOf0(X1,xI)
| aElement0(esk27_1(X1)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_29,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__]) ).
cnf(c_0_30,hypothesis,
( ~ aElementOf0(X2,xI)
| ~ aElement0(X1)
| aElementOf0(sdtasdt0(X1,X2),xI) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_31,plain,
( ~ aElement0(X1)
| sdtasdt0(smndt0(sz10),X1) = smndt0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_32,hypothesis,
( ~ aElementOf0(X1,xI)
| aElement0(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28]) ).
fof(c_0_33,plain,
! [X8] :
( aElement0(smndt0(X8))
| ~ aElement0(X8) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsU])])]) ).
fof(c_0_34,negated_conjecture,
! [X163,X164] :
( ~ aElementOf0(smndt0(sdtasdt0(xq,xu)),xI)
& ( sdtpldt0(X163,X164) != smndt0(sdtasdt0(xq,xu))
| ~ aElementOf0(X164,slsdtgt0(xb))
| ~ aElementOf0(X163,slsdtgt0(xa)) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_29])])])]) ).
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_30,c_0_31]),c_0_32]) ).
cnf(c_0_36,plain,
( ~ aElement0(X1)
| aElement0(smndt0(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_37,plain,
aElement0(sz10),
inference(split_conjunct,[status(thm)],[mSortsC_01]) ).
fof(c_0_38,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_39,negated_conjecture,
~ aElementOf0(smndt0(sdtasdt0(xq,xu)),xI),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_40,hypothesis,
( ~ aElementOf0(X1,xI)
| aElementOf0(smndt0(X1),xI) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).
fof(c_0_41,hypothesis,
! [X154,X155,X156] :
( ( ~ iLess0(sbrdtbr0(X154),sbrdtbr0(xu))
| X154 = sz00
| ~ aElementOf0(X154,xI) )
& ( ~ iLess0(sbrdtbr0(X154),sbrdtbr0(xu))
| X154 = sz00
| sdtpldt0(X155,X156) != X154
| ~ aElementOf0(X156,slsdtgt0(xb))
| ~ aElementOf0(X155,slsdtgt0(xa)) )
& xu != sz00
& aElementOf0(xu,xI)
& sdtpldt0(esk37_0,esk38_0) = xu
& aElementOf0(esk38_0,slsdtgt0(xb))
& aElementOf0(esk37_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_38])])])])])]) ).
cnf(c_0_42,negated_conjecture,
~ aElementOf0(sdtasdt0(xq,xu),xI),
inference(spm,[status(thm)],[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_30]),c_0_43]),c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG120+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/5.39 % Computer : n007.cluster.edu
% 0.11/5.39 % Model : x86_64 x86_64
% 0.11/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.39 % Memory : 8046.5625MB
% 0.11/5.39 % OS : Linux 6.8.0-71-generic
% 0.11/5.39 % CPULimit : 300
% 0.11/5.39 % WCLimit : 300
% 0.11/5.39 % DateTime : Mon Sep 21 04:19:26 UTC 2026
% 0.11/5.39 % CPUTime :
% 0.11/5.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/5.43 Running first-order theorem proving
% 0.15/5.43 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.15/5.50 % Version: 3.5.1
% 0.15/5.50 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/5.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/5.50 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.50 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.50 % Starting sh5l with 300s (1) cores
% 0.15/5.50 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 158413 completed with status 0
% 0.15/5.50 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.15/5.50 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/5.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/5.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.50 % No SInE strategy applied
% 0.15/5.50 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.15/5.50 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.50 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.15/5.50 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.15/5.50 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.15/5.50 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.15/5.50 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 158421 completed with status 0
% 0.15/5.50 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.15/5.50 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/5.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/5.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.50 % No SInE strategy applied
% 0.15/5.50 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.15/5.50 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.50 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.15/5.50 % Preprocessing time : 0.002 s
% 0.15/5.50 % Presaturation interreduction done
% 0.15/5.50
% 0.15/5.50 % Proof found!
% 0.15/5.50 % SZS status Theorem
% 0.15/5.50 % SZS output start CNFRefutation
% See solution above
% 0.15/5.50 % Parsed axioms : 52
% 0.15/5.50 % Removed by relevancy pruning/SinE : 0
% 0.15/5.50 % Initial clauses : 203
% 0.15/5.50 % Removed in clause preprocessing : 4
% 0.15/5.50 % Initial clauses in saturation : 199
% 0.15/5.50 % Processed clauses : 822
% 0.15/5.50 % ...of these trivial : 28
% 0.15/5.50 % ...subsumed : 186
% 0.15/5.50 % ...remaining for further processing : 608
% 0.15/5.50 % Other redundant clauses eliminated : 153
% 0.15/5.50 % Clauses deleted for lack of memory : 0
% 0.15/5.50 % Backward-subsumed : 19
% 0.15/5.50 % Backward-rewritten : 11
% 0.15/5.50 % Generated clauses : 2110
% 0.15/5.50 % ...of the previous two non-redundant : 1636
% 0.15/5.50 % ...aggressively subsumed : 0
% 0.15/5.50 % Contextual simplify-reflections : 11
% 0.15/5.50 % Paramodulations : 1959
% 0.15/5.50 % Factorizations : 0
% 0.15/5.50 % NegExts : 0
% 0.15/5.50 % Equation resolutions : 153
% 0.15/5.50 % Disequality decompositions : 0
% 0.15/5.50 % Total rewrite steps : 1860
% 0.15/5.50 % ...of those cached : 1799
% 0.15/5.50 % Propositional unsat checks : 0
% 0.15/5.50 % Propositional check models : 0
% 0.15/5.50 % Propositional check unsatisfiable : 0
% 0.15/5.50 % Propositional clauses : 0
% 0.15/5.50 % Propositional clauses after purity: 0
% 0.15/5.50 % Propositional unsat core size : 0
% 0.15/5.50 % Propositional preprocessing time : 0.000
% 0.15/5.50 % Propositional encoding time : 0.000
% 0.15/5.50 % Propositional solver time : 0.000
% 0.15/5.50 % Success case prop preproc time : 0.000
% 0.15/5.50 % Success case prop encoding time : 0.000
% 0.15/5.50 % Success case prop solver time : 0.000
% 0.15/5.50 % Current number of processed clauses : 370
% 0.15/5.50 % Positive orientable unit clauses : 76
% 0.15/5.50 % Positive unorientable unit clauses: 0
% 0.15/5.50 % Negative unit clauses : 34
% 0.15/5.50 % Non-unit-clauses : 260
% 0.15/5.50 % Current number of unprocessed clauses: 1137
% 0.15/5.50 % ...number of literals in the above : 5121
% 0.15/5.50 % Current number of archived formulas : 0
% 0.15/5.50 % Current number of archived clauses : 218
% 0.15/5.50 % Clause-clause subsumption calls (NU) : 9751
% 0.15/5.50 % Rec. Clause-clause subsumption calls : 4037
% 0.15/5.50 % Non-unit clause-clause subsumptions : 150
% 0.15/5.50 % Unit Clause-clause subsumption calls : 892
% 0.15/5.50 % Rewrite failures with RHS unbound : 0
% 0.15/5.50 % BW rewrite match attempts : 14
% 0.15/5.50 % BW rewrite match successes : 14
% 0.15/5.50 % Condensation attempts : 0
% 0.15/5.50 % Condensation successes : 0
% 0.15/5.51 % Termbank termtop insertions : 43624
% 0.15/5.51 % Search garbage collected termcells : 2693
% 0.15/5.51
% 0.15/5.51 % -------------------------------------------------
% 0.15/5.51 % User time : 0.048 s
% 0.15/5.51 % System time : 0.007 s
% 0.15/5.51 % Total time : 0.055 s
% 0.15/5.51 % Maximum resident set size: 3976 pages
% 0.15/5.51
% 0.15/5.51 % -------------------------------------------------
% 0.15/5.51 % User time : 0.207 s
% 0.15/5.51 % System time : 0.030 s
% 0.15/5.51 % Total time : 0.237 s
% 0.15/5.51 % Maximum resident set size: 4608 pages
% 0.15/5.51 % E exiting
%------------------------------------------------------------------------------