%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG118+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 : n020.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.11s 0.49s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 36 ( 12 unt; 0 def)
% Number of atoms : 192 ( 56 equ)
% Maximal formula atoms : 33 ( 5 avg)
% Number of connectives : 238 ( 82 ~; 74 |; 68 &)
% ( 3 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 32 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 7 con; 0-2 aty)
% Number of variables : 71 ( 0 sgn 36 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
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__,conjecture,
? [X1,X2] :
( ( iLess0(sbrdtbr0(X2),sbrdtbr0(xu))
| X2 = sz00 )
& xb = sdtpldt0(sdtasdt0(X1,xu),X2)
& aElement0(X2)
& aElement0(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mDivision,axiom,
! [X1,X2] :
( ( X2 != sz00
& aElement0(X2)
& aElement0(X1) )
=> ? [X3,X4] :
( ( X4 != sz00
=> iLess0(sbrdtbr0(X4),sbrdtbr0(X2)) )
& X1 = sdtpldt0(sdtasdt0(X3,X2),X4)
& aElement0(X4)
& aElement0(X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDivision) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEOfElem) ).
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(mSortsC,axiom,
aElement0(sz00),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC) ).
fof(c_0_7,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]) ).
fof(c_0_8,negated_conjecture,
~ ? [X1,X2] :
( ( iLess0(sbrdtbr0(X2),sbrdtbr0(xu))
| X2 = sz00 )
& xb = sdtpldt0(sdtasdt0(X1,xu),X2)
& aElement0(X2)
& aElement0(X1) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_9,plain,
! [X1,X2] :
( ( X2 != sz00
& aElement0(X2)
& aElement0(X1) )
=> ? [X3,X4] :
( ( X4 != sz00
=> iLess0(sbrdtbr0(X4),sbrdtbr0(X2)) )
& X1 = sdtpldt0(sdtasdt0(X3,X2),X4)
& aElement0(X4)
& aElement0(X3) ) ),
inference(fof_simplification,[status(thm)],[mDivision]) ).
fof(c_0_10,plain,
! [X34,X35] :
( aElement0(X35)
| ~ aElementOf0(X35,X34)
| ~ aSet0(X34) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])])]) ).
fof(c_0_11,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_7])])])])])]) ).
fof(c_0_12,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_13,negated_conjecture,
! [X163,X164] :
( ( xb != sdtpldt0(sdtasdt0(X163,xu),X164)
| ~ aElement0(X164)
| ~ aElement0(X163)
| ~ iLess0(sbrdtbr0(X164),sbrdtbr0(xu)) )
& ( xb != sdtpldt0(sdtasdt0(X163,xu),X164)
| ~ aElement0(X164)
| ~ aElement0(X163)
| X164 != sz00 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
fof(c_0_14,plain,
! [X87,X88] :
( ( X88 = sz00
| ~ aElement0(X88)
| ~ aElement0(X87)
| iLess0(sbrdtbr0(esk15_2(X87,X88)),sbrdtbr0(X88))
| esk15_2(X87,X88) = sz00 )
& ( X88 = sz00
| ~ aElement0(X88)
| ~ aElement0(X87)
| X87 = sdtpldt0(sdtasdt0(esk14_2(X87,X88),X88),esk15_2(X87,X88)) )
& ( X88 = sz00
| ~ aElement0(X88)
| ~ aElement0(X87)
| aElement0(esk15_2(X87,X88)) )
& ( X88 = sz00
| ~ aElement0(X88)
| ~ aElement0(X87)
| aElement0(esk14_2(X87,X88)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])]) ).
cnf(c_0_15,plain,
( ~ aElementOf0(X2,X1)
| ~ aSet0(X1)
| aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,hypothesis,
aElementOf0(xu,xI),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,hypothesis,
aSet0(xI),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
( xb != sdtpldt0(sdtasdt0(X2,xu),X1)
| ~ aElement0(X1)
| ~ aElement0(X2)
| ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( ~ aElement0(X2)
| ~ aElement0(X1)
| X2 = sz00
| X1 = sdtpldt0(sdtasdt0(esk14_2(X1,X2),X2),esk15_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,hypothesis,
xu != sz00,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,hypothesis,
aElement0(xb),
inference(split_conjunct,[status(thm)],[m__2091]) ).
cnf(c_0_22,hypothesis,
aElement0(xu),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_23,negated_conjecture,
( ~ aElement0(esk15_2(xb,xu))
| ~ aElement0(esk14_2(xb,xu))
| ~ iLess0(sbrdtbr0(esk15_2(xb,xu)),sbrdtbr0(xu)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),c_0_21])]),c_0_22])]) ).
cnf(c_0_24,plain,
( ~ aElement0(X2)
| ~ aElement0(X1)
| X2 = sz00
| aElement0(esk14_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_25,negated_conjecture,
( ~ aElement0(esk15_2(xb,xu))
| ~ iLess0(sbrdtbr0(esk15_2(xb,xu)),sbrdtbr0(xu)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_22]),c_0_21])]),c_0_20]) ).
cnf(c_0_26,plain,
( ~ aElement0(X2)
| ~ aElement0(X1)
| X2 = sz00
| aElement0(esk15_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_27,negated_conjecture,
~ iLess0(sbrdtbr0(esk15_2(xb,xu)),sbrdtbr0(xu)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_22]),c_0_21])]),c_0_20]) ).
cnf(c_0_28,plain,
( ~ aElement0(X2)
| ~ aElement0(X1)
| X2 = sz00
| iLess0(sbrdtbr0(esk15_2(X1,X2)),sbrdtbr0(X2))
| esk15_2(X1,X2) = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_29,negated_conjecture,
( xb != sdtpldt0(sdtasdt0(X2,xu),X1)
| ~ aElement0(X1)
| ~ aElement0(X2)
| X1 != sz00 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_30,plain,
aElement0(sz00),
inference(split_conjunct,[status(thm)],[mSortsC]) ).
cnf(c_0_31,negated_conjecture,
esk15_2(xb,xu) = sz00,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_22]),c_0_21])]),c_0_20]) ).
cnf(c_0_32,negated_conjecture,
( ~ aElement0(X1)
| sdtpldt0(sdtasdt0(X1,xu),sz00) != xb ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_29]),c_0_30])]) ).
cnf(c_0_33,negated_conjecture,
sdtpldt0(sdtasdt0(esk14_2(xb,xu),xu),sz00) = xb,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_31]),c_0_22]),c_0_21])]),c_0_20]) ).
cnf(c_0_34,negated_conjecture,
~ aElement0(esk14_2(xb,xu)),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_24]),c_0_22]),c_0_21])]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG118+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.37 % Computer : n020.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 04:21:47 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 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.49 % Version: 3.5.1
% 0.11/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.49 % Starting sh5l with 300s (1) cores
% 0.11/0.49 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1990626 completed with status 0
% 0.11/0.49 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.11/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.49 % No SInE strategy applied
% 0.11/0.49 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.11/0.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.11/0.49 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.11/0.49 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.11/0.49 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.11/0.49 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1990633 completed with status 0
% 0.11/0.49 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.11/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.49 % No SInE strategy applied
% 0.11/0.49 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.11/0.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.11/0.49 % Preprocessing time : 0.002 s
% 0.11/0.49 % Presaturation interreduction done
% 0.11/0.49
% 0.11/0.49 % Proof found!
% 0.11/0.49 % SZS status Theorem
% 0.11/0.49 % SZS output start CNFRefutation
% See solution above
% 0.11/0.49 % Parsed axioms : 50
% 0.11/0.49 % Removed by relevancy pruning/SinE : 0
% 0.11/0.49 % Initial clauses : 198
% 0.11/0.49 % Removed in clause preprocessing : 4
% 0.11/0.49 % Initial clauses in saturation : 194
% 0.11/0.49 % Processed clauses : 882
% 0.11/0.49 % ...of these trivial : 21
% 0.11/0.49 % ...subsumed : 273
% 0.11/0.49 % ...remaining for further processing : 588
% 0.11/0.49 % Other redundant clauses eliminated : 56
% 0.11/0.49 % Clauses deleted for lack of memory : 0
% 0.11/0.49 % Backward-subsumed : 20
% 0.11/0.49 % Backward-rewritten : 24
% 0.11/0.49 % Generated clauses : 2490
% 0.11/0.49 % ...of the previous two non-redundant : 2146
% 0.11/0.49 % ...aggressively subsumed : 0
% 0.11/0.49 % Contextual simplify-reflections : 2
% 0.11/0.49 % Paramodulations : 2432
% 0.11/0.49 % Factorizations : 4
% 0.11/0.49 % NegExts : 0
% 0.11/0.49 % Equation resolutions : 56
% 0.11/0.49 % Disequality decompositions : 0
% 0.11/0.49 % Total rewrite steps : 2720
% 0.11/0.49 % ...of those cached : 2646
% 0.11/0.49 % Propositional unsat checks : 0
% 0.11/0.49 % Propositional check models : 0
% 0.11/0.49 % Propositional check unsatisfiable : 0
% 0.11/0.49 % Propositional clauses : 0
% 0.11/0.49 % Propositional clauses after purity: 0
% 0.11/0.49 % Propositional unsat core size : 0
% 0.11/0.49 % Propositional preprocessing time : 0.000
% 0.11/0.49 % Propositional encoding time : 0.000
% 0.11/0.49 % Propositional solver time : 0.000
% 0.11/0.49 % Success case prop preproc time : 0.000
% 0.11/0.49 % Success case prop encoding time : 0.000
% 0.11/0.49 % Success case prop solver time : 0.000
% 0.11/0.49 % Current number of processed clauses : 340
% 0.11/0.49 % Positive orientable unit clauses : 106
% 0.11/0.49 % Positive unorientable unit clauses: 0
% 0.11/0.49 % Negative unit clauses : 34
% 0.11/0.49 % Non-unit-clauses : 200
% 0.11/0.49 % Current number of unprocessed clauses: 1565
% 0.11/0.49 % ...number of literals in the above : 6405
% 0.11/0.49 % Current number of archived formulas : 0
% 0.11/0.49 % Current number of archived clauses : 227
% 0.11/0.49 % Clause-clause subsumption calls (NU) : 9455
% 0.11/0.49 % Rec. Clause-clause subsumption calls : 3932
% 0.11/0.49 % Non-unit clause-clause subsumptions : 119
% 0.11/0.49 % Unit Clause-clause subsumption calls : 1841
% 0.11/0.49 % Rewrite failures with RHS unbound : 0
% 0.11/0.49 % BW rewrite match attempts : 18
% 0.11/0.49 % BW rewrite match successes : 17
% 0.11/0.49 % Condensation attempts : 0
% 0.11/0.49 % Condensation successes : 0
% 0.11/0.49 % Termbank termtop insertions : 51216
% 0.11/0.49 % Search garbage collected termcells : 2700
% 0.11/0.49
% 0.11/0.49 % -------------------------------------------------
% 0.11/0.49 % User time : 0.053 s
% 0.11/0.49 % System time : 0.002 s
% 0.11/0.49 % Total time : 0.054 s
% 0.11/0.49 % Maximum resident set size: 3972 pages
% 0.11/0.49
% 0.11/0.49 % -------------------------------------------------
% 0.11/0.49 % User time : 0.255 s
% 0.11/0.49 % System time : 0.021 s
% 0.11/0.49 % Total time : 0.276 s
% 0.11/0.49 % Maximum resident set size: 4864 pages
% 0.11/0.49 % E exiting
%------------------------------------------------------------------------------