%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM558+3 : 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 : n011.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 01:55:30 PM UTC 2026
% Result : Theorem 0.15s 0.46s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 35 ( 14 unt; 0 def)
% Number of atoms : 233 ( 37 equ)
% Maximal formula atoms : 67 ( 6 avg)
% Number of connectives : 283 ( 85 ~; 84 |; 90 &)
% ( 5 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 39 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 10 con; 0-2 aty)
% Number of variables : 50 ( 0 sgn 39 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__2227,hypothesis,
( ~ ( ! [X1] :
( ( ( sbrdtbr0(X1) = xk
& ( aSubsetOf0(X1,xS)
| ( ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xS) )
& aSet0(X1) ) ) )
=> aElementOf0(X1,slbdtsldtrb0(xS,xk)) )
& ( aElementOf0(X1,slbdtsldtrb0(xS,xk))
=> ( sbrdtbr0(X1) = xk
& aSubsetOf0(X1,xS)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xS) )
& aSet0(X1) ) ) )
=> ( slbdtsldtrb0(xS,xk) = slcrc0
| ~ ? [X1] : aElementOf0(X1,slbdtsldtrb0(xS,xk)) ) )
& aSubsetOf0(slbdtsldtrb0(xS,xk),slbdtsldtrb0(xT,xk))
& ! [X1] :
( aElementOf0(X1,slbdtsldtrb0(xS,xk))
=> aElementOf0(X1,slbdtsldtrb0(xT,xk)) )
& ! [X1] :
( ( ( sbrdtbr0(X1) = xk
& ( aSubsetOf0(X1,xT)
| ( ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xT) )
& aSet0(X1) ) ) )
=> aElementOf0(X1,slbdtsldtrb0(xT,xk)) )
& ( aElementOf0(X1,slbdtsldtrb0(xT,xk))
=> ( sbrdtbr0(X1) = xk
& aSubsetOf0(X1,xT)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xT) )
& aSet0(X1) ) ) )
& aSet0(slbdtsldtrb0(xT,xk))
& ! [X1] :
( ( ( sbrdtbr0(X1) = xk
& ( aSubsetOf0(X1,xS)
| ( ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xS) )
& aSet0(X1) ) ) )
=> aElementOf0(X1,slbdtsldtrb0(xS,xk)) )
& ( aElementOf0(X1,slbdtsldtrb0(xS,xk))
=> ( sbrdtbr0(X1) = xk
& aSubsetOf0(X1,xS)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xS) )
& aSet0(X1) ) ) )
& aSet0(slbdtsldtrb0(xS,xk)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2227) ).
fof(m__2202_02,hypothesis,
( xk != sz00
& aSet0(xT)
& aSet0(xS) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2202_02) ).
fof(m__2378,hypothesis,
( aElementOf0(xP,slbdtsldtrb0(xS,xk))
& sbrdtbr0(xP) = xk
& aSubsetOf0(xP,xS)
& ! [X1] :
( aElementOf0(X1,xP)
=> aElementOf0(X1,xS) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2378) ).
fof(m__2357,hypothesis,
( xP = sdtpldt0(sdtmndt0(xQ,xy),xx)
& ! [X1] :
( aElementOf0(X1,xP)
<=> ( ( X1 = xx
| aElementOf0(X1,sdtmndt0(xQ,xy)) )
& aElement0(X1) ) )
& aSet0(xP)
& ! [X1] :
( aElementOf0(X1,sdtmndt0(xQ,xy))
<=> ( X1 != xy
& aElementOf0(X1,xQ)
& aElement0(X1) ) )
& aSet0(sdtmndt0(xQ,xy)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2357) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEOfElem) ).
fof(m__,conjecture,
aElementOf0(xx,xT),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mDefSub,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) )
& aSet0(X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSub) ).
fof(m__2256,hypothesis,
aElementOf0(xx,xS),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2256) ).
fof(c_0_8,hypothesis,
! [X36,X37,X38,X40,X41,X42,X44,X45,X46,X47] :
( slbdtsldtrb0(xS,xk) != slcrc0
& aElementOf0(esk7_0,slbdtsldtrb0(xS,xk))
& ( aElementOf0(X47,slbdtsldtrb0(xS,xk))
| sbrdtbr0(X47) != xk
| ~ aSubsetOf0(X47,xS) )
& ( aElementOf0(X47,slbdtsldtrb0(xS,xk))
| sbrdtbr0(X47) != xk
| ~ aSet0(X47)
| ~ aElementOf0(esk6_1(X47),xS) )
& ( aElementOf0(X47,slbdtsldtrb0(xS,xk))
| sbrdtbr0(X47) != xk
| ~ aSet0(X47)
| aElementOf0(esk6_1(X47),X47) )
& ( ~ aElementOf0(X45,slbdtsldtrb0(xS,xk))
| sbrdtbr0(X45) = xk )
& ( ~ aElementOf0(X45,slbdtsldtrb0(xS,xk))
| aSubsetOf0(X45,xS) )
& ( ~ aElementOf0(X45,slbdtsldtrb0(xS,xk))
| aElementOf0(X46,xS)
| ~ aElementOf0(X46,X45) )
& ( ~ aElementOf0(X45,slbdtsldtrb0(xS,xk))
| aSet0(X45) )
& aSubsetOf0(slbdtsldtrb0(xS,xk),slbdtsldtrb0(xT,xk))
& ( aElementOf0(X44,slbdtsldtrb0(xT,xk))
| ~ aElementOf0(X44,slbdtsldtrb0(xS,xk)) )
& ( aElementOf0(X42,slbdtsldtrb0(xT,xk))
| sbrdtbr0(X42) != xk
| ~ aSubsetOf0(X42,xT) )
& ( aElementOf0(X42,slbdtsldtrb0(xT,xk))
| sbrdtbr0(X42) != xk
| ~ aSet0(X42)
| ~ aElementOf0(esk5_1(X42),xT) )
& ( aElementOf0(X42,slbdtsldtrb0(xT,xk))
| sbrdtbr0(X42) != xk
| ~ aSet0(X42)
| aElementOf0(esk5_1(X42),X42) )
& ( ~ aElementOf0(X40,slbdtsldtrb0(xT,xk))
| sbrdtbr0(X40) = xk )
& ( ~ aElementOf0(X40,slbdtsldtrb0(xT,xk))
| aSubsetOf0(X40,xT) )
& ( ~ aElementOf0(X40,slbdtsldtrb0(xT,xk))
| aElementOf0(X41,xT)
| ~ aElementOf0(X41,X40) )
& ( ~ aElementOf0(X40,slbdtsldtrb0(xT,xk))
| aSet0(X40) )
& aSet0(slbdtsldtrb0(xT,xk))
& ( aElementOf0(X38,slbdtsldtrb0(xS,xk))
| sbrdtbr0(X38) != xk
| ~ aSubsetOf0(X38,xS) )
& ( aElementOf0(X38,slbdtsldtrb0(xS,xk))
| sbrdtbr0(X38) != xk
| ~ aSet0(X38)
| ~ aElementOf0(esk4_1(X38),xS) )
& ( aElementOf0(X38,slbdtsldtrb0(xS,xk))
| sbrdtbr0(X38) != xk
| ~ aSet0(X38)
| aElementOf0(esk4_1(X38),X38) )
& ( ~ aElementOf0(X36,slbdtsldtrb0(xS,xk))
| sbrdtbr0(X36) = xk )
& ( ~ aElementOf0(X36,slbdtsldtrb0(xS,xk))
| aSubsetOf0(X36,xS) )
& ( ~ aElementOf0(X36,slbdtsldtrb0(xS,xk))
| aElementOf0(X37,xS)
| ~ aElementOf0(X37,X36) )
& ( ~ aElementOf0(X36,slbdtsldtrb0(xS,xk))
| aSet0(X36) )
& aSet0(slbdtsldtrb0(xS,xk)) ),
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__2227])])])])])])]) ).
fof(c_0_9,hypothesis,
( xk != sz00
& aSet0(xT)
& aSet0(xS) ),
inference(fof_simplification,[status(thm)],[m__2202_02]) ).
cnf(c_0_10,hypothesis,
( ~ aElementOf0(X1,slbdtsldtrb0(xT,xk))
| aSubsetOf0(X1,xT) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,hypothesis,
( ~ aElementOf0(X1,slbdtsldtrb0(xS,xk))
| aElementOf0(X1,slbdtsldtrb0(xT,xk)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,hypothesis,
! [X137] :
( aElementOf0(xP,slbdtsldtrb0(xS,xk))
& sbrdtbr0(xP) = xk
& aSubsetOf0(xP,xS)
& ( aElementOf0(X137,xS)
| ~ aElementOf0(X137,xP) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__2378])])])]) ).
fof(c_0_13,hypothesis,
( xP = sdtpldt0(sdtmndt0(xQ,xy),xx)
& ! [X1] :
( aElementOf0(X1,xP)
<=> ( ( X1 = xx
| aElementOf0(X1,sdtmndt0(xQ,xy)) )
& aElement0(X1) ) )
& aSet0(xP)
& ! [X1] :
( aElementOf0(X1,sdtmndt0(xQ,xy))
<=> ( X1 != xy
& aElementOf0(X1,xQ)
& aElement0(X1) ) )
& aSet0(sdtmndt0(xQ,xy)) ),
inference(fof_simplification,[status(thm)],[m__2357]) ).
fof(c_0_14,plain,
! [X5,X6] :
( aElement0(X6)
| ~ aElementOf0(X6,X5)
| ~ aSet0(X5) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])])]) ).
fof(c_0_15,hypothesis,
( xk != sz00
& aSet0(xT)
& aSet0(xS) ),
inference(fof_nnf,[status(thm)],[c_0_9]) ).
fof(c_0_16,negated_conjecture,
~ aElementOf0(xx,xT),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_17,plain,
! [X11,X12,X13,X14] :
( ( ~ aSet0(X11)
| aSubsetOf0(X14,X11)
| ~ aSet0(X14)
| ~ aElementOf0(esk2_2(X11,X14),X11) )
& ( ~ aSet0(X11)
| aSubsetOf0(X14,X11)
| ~ aSet0(X14)
| aElementOf0(esk2_2(X11,X14),X14) )
& ( ~ aSet0(X11)
| ~ aSubsetOf0(X12,X11)
| aElementOf0(X13,X11)
| ~ aElementOf0(X13,X12) )
& ( ~ aSet0(X11)
| ~ aSubsetOf0(X12,X11)
| aSet0(X12) ) ),
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)],[mDefSub])])])])])])]) ).
cnf(c_0_18,hypothesis,
( ~ aElementOf0(X1,slbdtsldtrb0(xS,xk))
| aSubsetOf0(X1,xT) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_19,hypothesis,
aElementOf0(xP,slbdtsldtrb0(xS,xk)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_20,hypothesis,
! [X50,X51] :
( xP = sdtpldt0(sdtmndt0(xQ,xy),xx)
& ( aElementOf0(X51,xP)
| ~ aElement0(X51)
| X51 != xx )
& ( aElementOf0(X51,xP)
| ~ aElement0(X51)
| ~ aElementOf0(X51,sdtmndt0(xQ,xy)) )
& ( ~ aElementOf0(X51,xP)
| X51 = xx
| aElementOf0(X51,sdtmndt0(xQ,xy)) )
& ( ~ aElementOf0(X51,xP)
| aElement0(X51) )
& aSet0(xP)
& ( aElementOf0(X50,sdtmndt0(xQ,xy))
| X50 = xy
| ~ aElementOf0(X50,xQ)
| ~ aElement0(X50) )
& ( ~ aElementOf0(X50,sdtmndt0(xQ,xy))
| X50 != xy )
& ( ~ aElementOf0(X50,sdtmndt0(xQ,xy))
| aElementOf0(X50,xQ) )
& ( ~ aElementOf0(X50,sdtmndt0(xQ,xy))
| aElement0(X50) )
& aSet0(sdtmndt0(xQ,xy)) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])])]) ).
cnf(c_0_21,plain,
( ~ aElementOf0(X2,X1)
| ~ aSet0(X1)
| aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,hypothesis,
aElementOf0(xx,xS),
inference(split_conjunct,[status(thm)],[m__2256]) ).
cnf(c_0_23,hypothesis,
aSet0(xS),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_24,negated_conjecture,
~ aElementOf0(xx,xT),
inference(fof_simplification,[status(thm)],[c_0_16]) ).
cnf(c_0_25,plain,
( ~ aSet0(X3)
| ~ aSubsetOf0(X2,X3)
| ~ aElementOf0(X1,X2)
| aElementOf0(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,hypothesis,
aSubsetOf0(xP,xT),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_27,hypothesis,
aSet0(xT),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_28,hypothesis,
( ~ aElement0(X1)
| X1 != xx
| aElementOf0(X1,xP) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_29,hypothesis,
aElement0(xx),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
fof(c_0_30,negated_conjecture,
~ aElementOf0(xx,xT),
inference(fof_nnf,[status(thm)],[c_0_24]) ).
cnf(c_0_31,hypothesis,
( ~ aElementOf0(X1,xP)
| aElementOf0(X1,xT) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_32,hypothesis,
aElementOf0(xx,xP),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_28]),c_0_29])]) ).
cnf(c_0_33,negated_conjecture,
~ aElementOf0(xx,xT),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_34,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM558+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.37 % Computer : n011.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8046.5625MB
% 0.13/0.37 % OS : Linux 6.8.0-71-generic
% 0.13/0.37 % CPULimit : 300
% 0.13/0.37 % WCLimit : 300
% 0.13/0.37 % DateTime : Mon Sep 21 02:39:55 UTC 2026
% 0.13/0.37 % CPUTime :
% 0.13/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 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/0.46 % Version: 3.5.1
% 0.15/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.46 % Starting sh5l with 300s (1) cores
% 0.15/0.46 % sh5l with pid 790231 completed with status 0
% 0.15/0.46 % Result found by sh5l
% 0.15/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.46 % Starting sh5l with 300s (1) cores
% 0.15/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/0.46 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.46 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.15/0.46 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.46 % Starting SubtermCWHack with 28s (1) cores
% 0.15/0.46 % SubtermCWHack with pid 790232 completed with status 0
% 0.15/0.46 % Result found by SubtermCWHack
% 0.15/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.46 % Starting sh5l with 300s (1) cores
% 0.15/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/0.46 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.46 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.15/0.46 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.46 % Starting SubtermCWHack with 28s (1) cores
% 0.15/0.46 % Preprocessing time : 0.003 s
% 0.15/0.46
% 0.15/0.46 % Proof found!
% 0.15/0.46 % SZS status Theorem
% 0.15/0.46 % SZS output start CNFRefutation
% See solution above
% 0.15/0.46 % Parsed axioms : 72
% 0.15/0.46 % Removed by relevancy pruning/SinE : 3
% 0.15/0.46 % Initial clauses : 164
% 0.15/0.46 % Removed in clause preprocessing : 5
% 0.15/0.46 % Initial clauses in saturation : 159
% 0.15/0.46 % Processed clauses : 186
% 0.15/0.46 % ...of these trivial : 3
% 0.15/0.46 % ...subsumed : 11
% 0.15/0.46 % ...remaining for further processing : 172
% 0.15/0.46 % Other redundant clauses eliminated : 14
% 0.15/0.46 % Clauses deleted for lack of memory : 0
% 0.15/0.46 % Backward-subsumed : 3
% 0.15/0.46 % Backward-rewritten : 4
% 0.15/0.46 % Generated clauses : 208
% 0.15/0.46 % ...of the previous two non-redundant : 137
% 0.15/0.46 % ...aggressively subsumed : 0
% 0.15/0.46 % Contextual simplify-reflections : 1
% 0.15/0.46 % Paramodulations : 193
% 0.15/0.46 % Factorizations : 0
% 0.15/0.46 % NegExts : 0
% 0.15/0.46 % Equation resolutions : 15
% 0.15/0.46 % Disequality decompositions : 0
% 0.15/0.46 % Total rewrite steps : 188
% 0.15/0.46 % ...of those cached : 157
% 0.15/0.46 % Propositional unsat checks : 0
% 0.15/0.46 % Propositional check models : 0
% 0.15/0.46 % Propositional check unsatisfiable : 0
% 0.15/0.46 % Propositional clauses : 0
% 0.15/0.46 % Propositional clauses after purity: 0
% 0.15/0.46 % Propositional unsat core size : 0
% 0.15/0.46 % Propositional preprocessing time : 0.000
% 0.15/0.46 % Propositional encoding time : 0.000
% 0.15/0.46 % Propositional solver time : 0.000
% 0.15/0.46 % Success case prop preproc time : 0.000
% 0.15/0.46 % Success case prop encoding time : 0.000
% 0.15/0.46 % Success case prop solver time : 0.000
% 0.15/0.46 % Current number of processed clauses : 154
% 0.15/0.46 % Positive orientable unit clauses : 46
% 0.15/0.46 % Positive unorientable unit clauses: 0
% 0.15/0.46 % Negative unit clauses : 14
% 0.15/0.46 % Non-unit-clauses : 94
% 0.15/0.46 % Current number of unprocessed clauses: 109
% 0.15/0.46 % ...number of literals in the above : 465
% 0.15/0.46 % Current number of archived formulas : 0
% 0.15/0.46 % Current number of archived clauses : 7
% 0.15/0.46 % Clause-clause subsumption calls (NU) : 931
% 0.15/0.46 % Rec. Clause-clause subsumption calls : 788
% 0.15/0.46 % Non-unit clause-clause subsumptions : 8
% 0.15/0.46 % Unit Clause-clause subsumption calls : 245
% 0.15/0.46 % Rewrite failures with RHS unbound : 0
% 0.15/0.46 % BW rewrite match attempts : 1
% 0.15/0.46 % BW rewrite match successes : 1
% 0.15/0.46 % Condensation attempts : 0
% 0.15/0.46 % Condensation successes : 0
% 0.15/0.46 % Termbank termtop insertions : 14258
% 0.15/0.46 % Search garbage collected termcells : 2736
% 0.15/0.46
% 0.15/0.46 % -------------------------------------------------
% 0.15/0.46 % User time : 0.018 s
% 0.15/0.46 % System time : 0.003 s
% 0.15/0.46 % Total time : 0.021 s
% 0.15/0.46 % Maximum resident set size: 3976 pages
% 0.15/0.46
% 0.15/0.46 % -------------------------------------------------
% 0.15/0.46 % User time : 0.022 s
% 0.15/0.46 % System time : 0.007 s
% 0.15/0.46 % Total time : 0.029 s
% 0.15/0.46 % Maximum resident set size: 4864 pages
% 0.15/0.46 % E exiting
%------------------------------------------------------------------------------