%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG126+4 : 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 : n010.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:57 PM UTC 2026
% Result : Theorem 0.25s 0.59s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 43 ( 9 unt; 0 def)
% Number of atoms : 196 ( 45 equ)
% Maximal formula atoms : 33 ( 4 avg)
% Number of connectives : 227 ( 74 ~; 66 |; 68 &)
% ( 7 <=>; 12 =>; 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; 9 con; 0-2 aty)
% Number of variables : 91 ( 0 sgn 48 !; 21 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aElement0(X2)
& aElement0(X1) )
=> aElement0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',m__2174) ).
fof(m__2091,hypothesis,
( aElement0(xb)
& aElement0(xa) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2091) ).
fof(mSortsB,axiom,
! [X1,X2] :
( ( aElement0(X2)
& aElement0(X1) )
=> aElement0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsB) ).
fof(m__,conjecture,
( ! [X1] :
( aElementOf0(X1,slsdtgt0(xa))
<=> ? [X2] :
( sdtasdt0(xa,X2) = X1
& aElement0(X2) ) )
=> ( ! [X1] :
( aElementOf0(X1,slsdtgt0(xb))
<=> ? [X2] :
( sdtasdt0(xb,X2) = X1
& aElement0(X2) ) )
=> ( aElementOf0(xc,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)))
| ? [X1,X2] :
( sdtpldt0(X1,X2) = xc
& aElementOf0(X2,slsdtgt0(xb))
& aElementOf0(X1,slsdtgt0(xa)) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mMulComm,axiom,
! [X1,X2] :
( ( aElement0(X2)
& aElement0(X1) )
=> sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulComm) ).
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/sandbox2/benchmark/theBenchmark.p',m__2273) ).
fof(m__2744,hypothesis,
? [X1] :
( sdtasdt0(xu,X1) = xc
& aElement0(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2744) ).
fof(c_0_8,plain,
! [X78,X79] :
( aElement0(sdtasdt0(X78,X79))
| ~ aElement0(X79)
| ~ aElement0(X78) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])])]) ).
fof(c_0_9,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_10,plain,
( ~ aElement0(X2)
| ~ aElement0(X1)
| aElement0(sdtasdt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,hypothesis,
( ~ aElementOf0(X1,slsdtgt0(xa))
| sdtasdt0(xa,esk4_1(X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,hypothesis,
aElement0(xa),
inference(split_conjunct,[status(thm)],[m__2091]) ).
cnf(c_0_13,hypothesis,
( ~ aElementOf0(X1,slsdtgt0(xa))
| aElement0(esk4_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,hypothesis,
( ~ aElementOf0(X1,slsdtgt0(xb))
| sdtasdt0(xb,esk5_1(X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,hypothesis,
aElement0(xb),
inference(split_conjunct,[status(thm)],[m__2091]) ).
cnf(c_0_16,hypothesis,
( ~ aElementOf0(X1,slsdtgt0(xb))
| aElement0(esk5_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_17,plain,
! [X116,X117] :
( aElement0(sdtpldt0(X116,X117))
| ~ aElement0(X117)
| ~ aElement0(X116) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])])]) ).
cnf(c_0_18,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_10,c_0_11]),c_0_12])]),c_0_13]) ).
cnf(c_0_19,hypothesis,
( ~ aElementOf0(X1,xI)
| aElementOf0(esk6_1(X1),slsdtgt0(xa)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,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_10,c_0_14]),c_0_15])]),c_0_16]) ).
cnf(c_0_21,hypothesis,
( ~ aElementOf0(X1,xI)
| aElementOf0(esk7_1(X1),slsdtgt0(xb)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_22,negated_conjecture,
~ ( ! [X1] :
( aElementOf0(X1,slsdtgt0(xa))
<=> ? [X2] :
( sdtasdt0(xa,X2) = X1
& aElement0(X2) ) )
=> ( ! [X1] :
( aElementOf0(X1,slsdtgt0(xb))
<=> ? [X2] :
( sdtasdt0(xb,X2) = X1
& aElement0(X2) ) )
=> ( aElementOf0(xc,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)))
| ? [X1,X2] :
( sdtpldt0(X1,X2) = xc
& aElementOf0(X2,slsdtgt0(xb))
& aElementOf0(X1,slsdtgt0(xa)) ) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_23,plain,
! [X80,X81] :
( sdtasdt0(X80,X81) = sdtasdt0(X81,X80)
| ~ aElement0(X81)
| ~ aElement0(X80) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])])]) ).
cnf(c_0_24,plain,
( ~ aElement0(X2)
| ~ aElement0(X1)
| aElement0(sdtpldt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,hypothesis,
( ~ aElementOf0(X1,xI)
| sdtpldt0(esk6_1(X1),esk7_1(X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_26,hypothesis,
( ~ aElementOf0(X1,xI)
| aElement0(esk6_1(X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_27,hypothesis,
( ~ aElementOf0(X1,xI)
| aElement0(esk7_1(X1)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
fof(c_0_28,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_29,negated_conjecture,
! [X51,X53,X54,X55,X57,X58,X59,X60] :
( ~ aElementOf0(xc,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)))
& ( sdtpldt0(X59,X60) != xc
| ~ aElementOf0(X60,slsdtgt0(xb))
| ~ aElementOf0(X59,slsdtgt0(xa)) )
& ( aElementOf0(X57,slsdtgt0(xb))
| sdtasdt0(xb,X58) != X57
| ~ aElement0(X58) )
& ( ~ aElementOf0(X55,slsdtgt0(xb))
| sdtasdt0(xb,esk23_1(X55)) = X55 )
& ( ~ aElementOf0(X55,slsdtgt0(xb))
| aElement0(esk23_1(X55)) )
& ( aElementOf0(X53,slsdtgt0(xa))
| sdtasdt0(xa,X54) != X53
| ~ aElement0(X54) )
& ( ~ aElementOf0(X51,slsdtgt0(xa))
| sdtasdt0(xa,esk22_1(X51)) = X51 )
& ( ~ aElementOf0(X51,slsdtgt0(xa))
| aElement0(esk22_1(X51)) ) ),
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)],[c_0_22])])])])])])]) ).
cnf(c_0_30,hypothesis,
( ~ aElementOf0(X2,xI)
| ~ aElement0(X1)
| aElementOf0(sdtasdt0(X1,X2),xI) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_31,plain,
( ~ aElement0(X2)
| ~ aElement0(X1)
| sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,hypothesis,
( ~ aElementOf0(X1,xI)
| aElement0(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27]) ).
fof(c_0_33,hypothesis,
( sdtasdt0(xu,esk21_0) = xc
& aElement0(esk21_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__2744])]) ).
fof(c_0_34,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_28])])])])])]) ).
cnf(c_0_35,negated_conjecture,
~ aElementOf0(xc,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_36,hypothesis,
xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_37,hypothesis,
( ~ aElement0(X2)
| ~ aElementOf0(X1,xI)
| aElementOf0(sdtasdt0(X1,X2),xI) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_38,hypothesis,
sdtasdt0(xu,esk21_0) = xc,
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_39,hypothesis,
aElementOf0(xu,xI),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_40,hypothesis,
aElement0(esk21_0),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_41,negated_conjecture,
~ aElementOf0(xc,xI),
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),c_0_40])]),c_0_41]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : RNG126+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.43 % Computer : n010.cluster.edu
% 0.16/0.43 % Model : x86_64 x86_64
% 0.16/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.43 % Memory : 8046.5625MB
% 0.16/0.43 % OS : Linux 6.8.0-71-generic
% 0.16/0.44 % CPULimit : 300
% 0.16/0.44 % WCLimit : 300
% 0.16/0.44 % DateTime : Mon Sep 21 04:21:55 UTC 2026
% 0.16/0.44 % CPUTime :
% 0.16/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.50 Running first-order theorem proving
% 0.16/0.50 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.25/0.59 % Version: 3.5.1
% 0.25/0.59 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.25/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.59 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.25/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.59 % Starting new_bool_1 with 300s (1) cores
% 0.25/0.59 % Starting sh5l with 300s (1) cores
% 0.25/0.59 % new_bool_3 with pid 14264 completed with status 0
% 0.25/0.59 % Result found by new_bool_3
% 0.25/0.59 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.25/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.59 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.25/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.59 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.59 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.59 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.25/0.59 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.59 % Starting SubtermCWHack with 28s (1) cores
% 0.25/0.59 % SubtermCWHack with pid 14267 completed with status 0
% 0.25/0.59 % Result found by SubtermCWHack
% 0.25/0.59 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.25/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.59 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.25/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.59 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.59 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.59 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.25/0.59 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.59 % Starting SubtermCWHack with 28s (1) cores
% 0.25/0.59 % Preprocessing time : 0.005 s
% 0.25/0.59
% 0.25/0.59 % Proof found!
% 0.25/0.59 % SZS status Theorem
% 0.25/0.59 % SZS output start CNFRefutation
% See solution above
% 0.25/0.59 % Parsed axioms : 48
% 0.25/0.59 % Removed by relevancy pruning/SinE : 11
% 0.25/0.59 % Initial clauses : 170
% 0.25/0.59 % Removed in clause preprocessing : 4
% 0.25/0.59 % Initial clauses in saturation : 166
% 0.25/0.59 % Processed clauses : 455
% 0.25/0.59 % ...of these trivial : 24
% 0.25/0.59 % ...subsumed : 139
% 0.25/0.59 % ...remaining for further processing : 292
% 0.25/0.59 % Other redundant clauses eliminated : 77
% 0.25/0.59 % Clauses deleted for lack of memory : 0
% 0.25/0.59 % Backward-subsumed : 19
% 0.25/0.59 % Backward-rewritten : 8
% 0.25/0.59 % Generated clauses : 1017
% 0.25/0.59 % ...of the previous two non-redundant : 560
% 0.25/0.59 % ...aggressively subsumed : 0
% 0.25/0.59 % Contextual simplify-reflections : 11
% 0.25/0.59 % Paramodulations : 941
% 0.25/0.59 % Factorizations : 0
% 0.25/0.59 % NegExts : 0
% 0.25/0.59 % Equation resolutions : 77
% 0.25/0.59 % Disequality decompositions : 0
% 0.25/0.59 % Total rewrite steps : 1264
% 0.25/0.59 % ...of those cached : 1211
% 0.25/0.59 % Propositional unsat checks : 0
% 0.25/0.59 % Propositional check models : 0
% 0.25/0.59 % Propositional check unsatisfiable : 0
% 0.25/0.59 % Propositional clauses : 0
% 0.25/0.59 % Propositional clauses after purity: 0
% 0.25/0.59 % Propositional unsat core size : 0
% 0.25/0.59 % Propositional preprocessing time : 0.000
% 0.25/0.59 % Propositional encoding time : 0.000
% 0.25/0.59 % Propositional solver time : 0.000
% 0.25/0.59 % Success case prop preproc time : 0.000
% 0.25/0.59 % Success case prop encoding time : 0.000
% 0.25/0.59 % Success case prop solver time : 0.000
% 0.25/0.59 % Current number of processed clauses : 255
% 0.25/0.59 % Positive orientable unit clauses : 77
% 0.25/0.59 % Positive unorientable unit clauses: 0
% 0.25/0.59 % Negative unit clauses : 12
% 0.25/0.59 % Non-unit-clauses : 166
% 0.25/0.59 % Current number of unprocessed clauses: 210
% 0.25/0.59 % ...number of literals in the above : 960
% 0.25/0.59 % Current number of archived formulas : 0
% 0.25/0.59 % Current number of archived clauses : 27
% 0.25/0.59 % Clause-clause subsumption calls (NU) : 4818
% 0.25/0.59 % Rec. Clause-clause subsumption calls : 3555
% 0.25/0.59 % Non-unit clause-clause subsumptions : 162
% 0.25/0.59 % Unit Clause-clause subsumption calls : 203
% 0.25/0.59 % Rewrite failures with RHS unbound : 0
% 0.25/0.59 % BW rewrite match attempts : 7
% 0.25/0.59 % BW rewrite match successes : 6
% 0.25/0.59 % Condensation attempts : 0
% 0.25/0.59 % Condensation successes : 0
% 0.25/0.59 % Termbank termtop insertions : 22818
% 0.25/0.59 % Search garbage collected termcells : 2460
% 0.25/0.59
% 0.25/0.59 % -------------------------------------------------
% 0.25/0.59 % User time : 0.052 s
% 0.25/0.59 % System time : 0.004 s
% 0.25/0.59 % Total time : 0.056 s
% 0.25/0.59 % Maximum resident set size: 3972 pages
% 0.25/0.59
% 0.25/0.59 % -------------------------------------------------
% 0.25/0.59 % User time : 0.060 s
% 0.25/0.59 % System time : 0.008 s
% 0.25/0.59 % Total time : 0.068 s
% 0.25/0.59 % Maximum resident set size: 4608 pages
% 0.25/0.59 % E exiting
%------------------------------------------------------------------------------