%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM584+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:49:40 PM UTC 2026
% Result : Theorem 2.19s 21.25s
% Output : CNFRefutation 2.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 16 ( 6 unt; 0 def)
% Number of atoms : 165 ( 31 equ)
% Maximal formula atoms : 33 ( 10 avg)
% Number of connectives : 199 ( 50 ~; 57 |; 71 &)
% ( 5 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 8 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 8 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn 30 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi)) )
=> ( ( ! [X1] :
( aElementOf0(X1,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
<=> ( ( X1 = szmzizndt0(sdtlpdtrp0(xN,xi))
| aElementOf0(X1,xQ) )
& aElement0(X1) ) )
& aSet0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) )
=> ( aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),slbdtsldtrb0(xS,xK))
| ( sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) = xK
& ( aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS)
| ! [X1] :
( aElementOf0(X1,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
=> aElementOf0(X1,xS) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__3453,hypothesis,
( aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT)
& ! [X1] :
( aElementOf0(X1,sdtlcdtrc0(xc,szDzozmdt0(xc)))
=> aElementOf0(X1,xT) )
& ! [X1] :
( aElementOf0(X1,sdtlcdtrc0(xc,szDzozmdt0(xc)))
<=> ? [X2] :
( sdtlpdtrp0(xc,X2) = X1
& aElementOf0(X2,szDzozmdt0(xc)) ) )
& aSet0(sdtlcdtrc0(xc,szDzozmdt0(xc)))
& szDzozmdt0(xc) = slbdtsldtrb0(xS,xK)
& ! [X1] :
( ( ( sbrdtbr0(X1) = xK
& ( aSubsetOf0(X1,xS)
| ( ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xS) )
& aSet0(X1) ) ) )
=> aElementOf0(X1,szDzozmdt0(xc)) )
& ( aElementOf0(X1,szDzozmdt0(xc))
=> ( sbrdtbr0(X1) = xK
& aSubsetOf0(X1,xS)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xS) )
& aSet0(X1) ) ) )
& aFunction0(xc) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3453) ).
fof(m__4024,hypothesis,
( aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS)
& ! [X1] :
( aElementOf0(X1,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
=> aElementOf0(X1,xS) )
& ! [X1] :
( aElementOf0(X1,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
<=> ( ( X1 = szmzizndt0(sdtlpdtrp0(xN,xi))
| aElementOf0(X1,xQ) )
& aElement0(X1) ) )
& aSet0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4024) ).
fof(m__4007,hypothesis,
( sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) = xK
& ! [X1] :
( aElementOf0(X1,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
<=> ( ( X1 = szmzizndt0(sdtlpdtrp0(xN,xi))
| aElementOf0(X1,xQ) )
& aElement0(X1) ) )
& aSet0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4007) ).
fof(c_0_4,negated_conjecture,
~ ( ( ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi)) )
=> ( ( ! [X1] :
( aElementOf0(X1,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
<=> ( ( X1 = szmzizndt0(sdtlpdtrp0(xN,xi))
| aElementOf0(X1,xQ) )
& aElement0(X1) ) )
& aSet0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) )
=> ( aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),slbdtsldtrb0(xS,xK))
| ( sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) = xK
& ( aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS)
| ! [X1] :
( aElementOf0(X1,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
=> aElementOf0(X1,xS) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_5,negated_conjecture,
! [X229,X230] :
( ~ aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),slbdtsldtrb0(xS,xK))
& ( sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) != xK
| ~ aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS) )
& ( sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) != xK
| ~ aElementOf0(esk33_0,xS) )
& ( sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) != xK
| aElementOf0(esk33_0,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& ( aElementOf0(X230,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ aElement0(X230)
| X230 != szmzizndt0(sdtlpdtrp0(xN,xi)) )
& ( aElementOf0(X230,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ aElement0(X230)
| ~ aElementOf0(X230,xQ) )
& ( ~ aElementOf0(X230,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
| X230 = szmzizndt0(sdtlpdtrp0(xN,xi))
| aElementOf0(X230,xQ) )
& ( ~ aElementOf0(X230,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
| aElement0(X230) )
& aSet0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
& ( sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X229)
| ~ aElementOf0(X229,sdtlpdtrp0(xN,xi)) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,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(fof_nnf,[status(thm)],[c_0_4])])])])])]) ).
fof(c_0_6,hypothesis,
! [X179,X180,X181,X183,X185,X186,X187] :
( aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT)
& ( aElementOf0(X187,xT)
| ~ aElementOf0(X187,sdtlcdtrc0(xc,szDzozmdt0(xc))) )
& ( aElementOf0(X185,sdtlcdtrc0(xc,szDzozmdt0(xc)))
| sdtlpdtrp0(xc,X186) != X185
| ~ aElementOf0(X186,szDzozmdt0(xc)) )
& ( ~ aElementOf0(X183,sdtlcdtrc0(xc,szDzozmdt0(xc)))
| sdtlpdtrp0(xc,esk21_1(X183)) = X183 )
& ( ~ aElementOf0(X183,sdtlcdtrc0(xc,szDzozmdt0(xc)))
| aElementOf0(esk21_1(X183),szDzozmdt0(xc)) )
& aSet0(sdtlcdtrc0(xc,szDzozmdt0(xc)))
& szDzozmdt0(xc) = slbdtsldtrb0(xS,xK)
& ( aElementOf0(X181,szDzozmdt0(xc))
| sbrdtbr0(X181) != xK
| ~ aSubsetOf0(X181,xS) )
& ( aElementOf0(X181,szDzozmdt0(xc))
| sbrdtbr0(X181) != xK
| ~ aSet0(X181)
| ~ aElementOf0(esk20_1(X181),xS) )
& ( aElementOf0(X181,szDzozmdt0(xc))
| sbrdtbr0(X181) != xK
| ~ aSet0(X181)
| aElementOf0(esk20_1(X181),X181) )
& ( ~ aElementOf0(X179,szDzozmdt0(xc))
| sbrdtbr0(X179) = xK )
& ( ~ aElementOf0(X179,szDzozmdt0(xc))
| aSubsetOf0(X179,xS) )
& ( ~ aElementOf0(X179,szDzozmdt0(xc))
| aElementOf0(X180,xS)
| ~ aElementOf0(X180,X179) )
& ( ~ aElementOf0(X179,szDzozmdt0(xc))
| aSet0(X179) )
& aFunction0(xc) ),
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__3453])])])])])])]) ).
fof(c_0_7,hypothesis,
! [X226,X227,X228] :
( aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS)
& ( aElementOf0(X228,xS)
| ~ aElementOf0(X228,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& ( aElementOf0(X227,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ aElement0(X227)
| X227 != szmzizndt0(sdtlpdtrp0(xN,xi)) )
& ( aElementOf0(X227,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ aElement0(X227)
| ~ aElementOf0(X227,xQ) )
& ( ~ aElementOf0(X227,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
| X227 = szmzizndt0(sdtlpdtrp0(xN,xi))
| aElementOf0(X227,xQ) )
& ( ~ aElementOf0(X227,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
| aElement0(X227) )
& aSet0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
& ( sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X226)
| ~ aElementOf0(X226,sdtlpdtrp0(xN,xi)) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi)) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4024])])])])]) ).
fof(c_0_8,hypothesis,
! [X224,X225] :
( sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) = xK
& ( aElementOf0(X225,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ aElement0(X225)
| X225 != szmzizndt0(sdtlpdtrp0(xN,xi)) )
& ( aElementOf0(X225,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ aElement0(X225)
| ~ aElementOf0(X225,xQ) )
& ( ~ aElementOf0(X225,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
| X225 = szmzizndt0(sdtlpdtrp0(xN,xi))
| aElementOf0(X225,xQ) )
& ( ~ aElementOf0(X225,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
| aElement0(X225) )
& aSet0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
& ( sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X224)
| ~ aElementOf0(X224,sdtlpdtrp0(xN,xi)) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi)) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4007])])])])]) ).
cnf(c_0_9,negated_conjecture,
~ aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),slbdtsldtrb0(xS,xK)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,hypothesis,
szDzozmdt0(xc) = slbdtsldtrb0(xS,xK),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,hypothesis,
( sbrdtbr0(X1) != xK
| ~ aSubsetOf0(X1,xS)
| aElementOf0(X1,szDzozmdt0(xc)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,hypothesis,
aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,hypothesis,
sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) = xK,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
~ aElementOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),szDzozmdt0(xc)),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM584+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.34 % Computer : n011.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.10/20.62 % CPULimit : 300
% 0.10/20.62 % WCLimit : 300
% 0.10/20.62 % DateTime : Mon Sep 21 02:42:27 UTC 2026
% 0.10/20.62 % CPUTime :
% 0.10/20.62 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/20.69 Running first-order theorem proving
% 0.10/20.69 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
% 2.19/21.25 % Version: 3.5.1
% 2.19/21.25 % Preprocessing class: FSLSSMSMSSSNFFN.
% 2.19/21.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.19/21.25 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.19/21.25 % Starting new_bool_3 with 300s (1) cores
% 2.19/21.25 % Starting new_bool_1 with 300s (1) cores
% 2.19/21.25 % Starting sh5l with 300s (1) cores
% 2.19/21.25 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3972271 completed with status 0
% 2.19/21.25 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 2.19/21.25 % Preprocessing class: FSLSSMSMSSSNFFN.
% 2.19/21.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.19/21.25 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.19/21.25 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.19/21.25 % No SInE strategy applied
% 2.19/21.25 % Search class: FGHSF-SMLM32-MFFFFFNN
% 2.19/21.25 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.19/21.25 % Starting SubtermCWHack with 136s (1) cores
% 2.19/21.25 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 2.19/21.25 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 2.19/21.25 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 2.19/21.25 % Starting new_bool_3 with 136s (1) cores
% 2.19/21.25 % SubtermCWHack with pid 3972275 completed with status 0
% 2.19/21.25 % Result found by SubtermCWHack
% 2.19/21.25 % Preprocessing class: FSLSSMSMSSSNFFN.
% 2.19/21.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.19/21.25 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.19/21.25 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.19/21.25 % No SInE strategy applied
% 2.19/21.25 % Search class: FGHSF-SMLM32-MFFFFFNN
% 2.19/21.25 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.19/21.25 % Starting SubtermCWHack with 136s (1) cores
% 2.19/21.25 % Preprocessing time : 0.146 s
% 2.19/21.25
% 2.19/21.25 % Proof found!
% 2.19/21.25 % SZS status Theorem
% 2.19/21.25 % SZS output start CNFRefutation
% See solution above
% 2.19/21.25 % Parsed axioms : 89
% 2.19/21.25 % Removed by relevancy pruning/SinE : 0
% 2.19/21.25 % Initial clauses : 4227
% 2.19/21.25 % Removed in clause preprocessing : 7
% 2.19/21.25 % Initial clauses in saturation : 4220
% 2.19/21.25 % Processed clauses : 154
% 2.19/21.25 % ...of these trivial : 5
% 2.19/21.25 % ...subsumed : 13
% 2.19/21.25 % ...remaining for further processing : 136
% 2.19/21.25 % Other redundant clauses eliminated : 10
% 2.19/21.25 % Clauses deleted for lack of memory : 0
% 2.19/21.25 % Backward-subsumed : 2
% 2.19/21.25 % Backward-rewritten : 0
% 2.19/21.25 % Generated clauses : 124
% 2.19/21.25 % ...of the previous two non-redundant : 93
% 2.19/21.25 % ...aggressively subsumed : 0
% 2.19/21.25 % Contextual simplify-reflections : 1
% 2.19/21.25 % Paramodulations : 114
% 2.19/21.25 % Factorizations : 0
% 2.19/21.25 % NegExts : 0
% 2.19/21.25 % Equation resolutions : 10
% 2.19/21.25 % Disequality decompositions : 0
% 2.19/21.25 % Total rewrite steps : 111
% 2.19/21.25 % ...of those cached : 85
% 2.19/21.25 % Propositional unsat checks : 0
% 2.19/21.25 % Propositional check models : 0
% 2.19/21.25 % Propositional check unsatisfiable : 0
% 2.19/21.25 % Propositional clauses : 0
% 2.19/21.25 % Propositional clauses after purity: 0
% 2.19/21.25 % Propositional unsat core size : 0
% 2.19/21.25 % Propositional preprocessing time : 0.000
% 2.19/21.25 % Propositional encoding time : 0.000
% 2.19/21.25 % Propositional solver time : 0.000
% 2.19/21.25 % Success case prop preproc time : 0.000
% 2.19/21.25 % Success case prop encoding time : 0.000
% 2.19/21.25 % Success case prop solver time : 0.000
% 2.19/21.25 % Current number of processed clauses : 125
% 2.19/21.25 % Positive orientable unit clauses : 44
% 2.19/21.25 % Positive unorientable unit clauses: 0
% 2.19/21.25 % Negative unit clauses : 11
% 2.19/21.25 % Non-unit-clauses : 70
% 2.19/21.25 % Current number of unprocessed clauses: 4158
% 2.19/21.25 % ...number of literals in the above : 51202
% 2.19/21.25 % Current number of archived formulas : 0
% 2.19/21.25 % Current number of archived clauses : 2
% 2.19/21.25 % Clause-clause subsumption calls (NU) : 530
% 2.19/21.25 % Rec. Clause-clause subsumption calls : 430
% 2.19/21.25 % Non-unit clause-clause subsumptions : 6
% 2.19/21.25 % Unit Clause-clause subsumption calls : 141
% 2.19/21.25 % Rewrite failures with RHS unbound : 0
% 2.19/21.25 % BW rewrite match attempts : 0
% 2.19/21.25 % BW rewrite match successes : 0
% 2.19/21.25 % Condensation attempts : 0
% 2.19/21.25 % Condensation successes : 0
% 2.19/21.25 % Termbank termtop insertions : 337929
% 2.19/21.25 % Search garbage collected termcells : 27267
% 2.19/21.25
% 2.19/21.25 % -------------------------------------------------
% 2.19/21.25 % User time : 0.455 s
% 2.19/21.25 % System time : 0.037 s
% 2.19/21.25 % Total time : 0.492 s
% 2.19/21.25 % Maximum resident set size: 15244 pages
% 2.19/21.25
% 2.19/21.25 % -------------------------------------------------
% 2.19/21.25 % User time : 0.976 s
% 2.19/21.25 % System time : 0.080 s
% 2.19/21.25 % Total time : 1.056 s
% 2.19/21.25 % Maximum resident set size: 4864 pages
% 2.19/21.25 % E exiting
%------------------------------------------------------------------------------