%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM544+2 : 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 : n008.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:30 PM UTC 2026
% Result : Theorem 0.16s 6.31s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 37 ( 10 unt; 0 def)
% Number of atoms : 183 ( 22 equ)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 232 ( 86 ~; 89 |; 36 &)
% ( 5 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 58 ( 0 sgn 30 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefSeg,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ! [X2] :
( X2 = slbdtrb0(X1)
<=> ( ! [X3] :
( aElementOf0(X3,X2)
<=> ( sdtlseqdt0(szszuzczcdt0(X3),X1)
& aElementOf0(X3,szNzAzT0) ) )
& aSet0(X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSeg) ).
fof(m__,conjecture,
( ~ ( xS = slcrc0
| ~ ? [X1] : aElementOf0(X1,xS) )
=> ( ( ! [X1] :
( aElementOf0(X1,xS)
=> sdtlseqdt0(X1,szmzazxdt0(xS)) )
& aElementOf0(szmzazxdt0(xS),xS) )
=> ( ( ! [X1] :
( aElementOf0(X1,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS))))
<=> ( sdtlseqdt0(szszuzczcdt0(X1),szszuzczcdt0(szmzazxdt0(xS)))
& aElementOf0(X1,szNzAzT0) ) )
& aSet0(slbdtrb0(szszuzczcdt0(szmzazxdt0(xS)))) )
=> ( aSubsetOf0(xS,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS))))
| ! [X1] :
( aElementOf0(X1,xS)
=> aElementOf0(X1,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS)))) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mSegSucc,axiom,
! [X1,X2] :
( ( aElementOf0(X2,szNzAzT0)
& aElementOf0(X1,szNzAzT0) )
=> ( aElementOf0(X1,slbdtrb0(szszuzczcdt0(X2)))
<=> ( X1 = X2
| aElementOf0(X1,slbdtrb0(X2)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSegSucc) ).
fof(m__1986,hypothesis,
( isFinite0(xS)
& aSubsetOf0(xS,szNzAzT0)
& ! [X1] :
( aElementOf0(X1,xS)
=> aElementOf0(X1,szNzAzT0) )
& aSet0(xS) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1986) ).
fof(mLessTotal,axiom,
! [X1,X2] :
( ( aElementOf0(X2,szNzAzT0)
& aElementOf0(X1,szNzAzT0) )
=> ( sdtlseqdt0(szszuzczcdt0(X2),X1)
| sdtlseqdt0(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mLessTotal) ).
fof(mLessASymm,axiom,
! [X1,X2] :
( ( aElementOf0(X2,szNzAzT0)
& aElementOf0(X1,szNzAzT0) )
=> ( ( sdtlseqdt0(X2,X1)
& sdtlseqdt0(X1,X2) )
=> X1 = X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mLessASymm) ).
fof(c_0_6,plain,
! [X25,X26,X27,X28,X29] :
( ( ~ aElementOf0(X25,szNzAzT0)
| X29 = slbdtrb0(X25)
| ~ aSet0(X29)
| aElementOf0(esk4_2(X25,X29),X29)
| sdtlseqdt0(szszuzczcdt0(esk4_2(X25,X29)),X25) )
& ( ~ aElementOf0(X25,szNzAzT0)
| X29 = slbdtrb0(X25)
| ~ aSet0(X29)
| aElementOf0(esk4_2(X25,X29),X29)
| aElementOf0(esk4_2(X25,X29),szNzAzT0) )
& ( ~ aElementOf0(X25,szNzAzT0)
| X29 = slbdtrb0(X25)
| ~ aSet0(X29)
| ~ sdtlseqdt0(szszuzczcdt0(esk4_2(X25,X29)),X25)
| ~ aElementOf0(esk4_2(X25,X29),szNzAzT0)
| ~ aElementOf0(esk4_2(X25,X29),X29) )
& ( ~ aElementOf0(X25,szNzAzT0)
| X26 != slbdtrb0(X25)
| aElementOf0(X28,X26)
| ~ sdtlseqdt0(szszuzczcdt0(X28),X25)
| ~ aElementOf0(X28,szNzAzT0) )
& ( ~ aElementOf0(X25,szNzAzT0)
| X26 != slbdtrb0(X25)
| ~ aElementOf0(X27,X26)
| sdtlseqdt0(szszuzczcdt0(X27),X25) )
& ( ~ aElementOf0(X25,szNzAzT0)
| X26 != slbdtrb0(X25)
| ~ aElementOf0(X27,X26)
| aElementOf0(X27,szNzAzT0) )
& ( ~ aElementOf0(X25,szNzAzT0)
| X26 != slbdtrb0(X25)
| aSet0(X26) ) ),
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)],[mDefSeg])])])])])])]) ).
fof(c_0_7,negated_conjecture,
~ ( ~ ( xS = slcrc0
| ~ ? [X1] : aElementOf0(X1,xS) )
=> ( ( ! [X1] :
( aElementOf0(X1,xS)
=> sdtlseqdt0(X1,szmzazxdt0(xS)) )
& aElementOf0(szmzazxdt0(xS),xS) )
=> ( ( ! [X1] :
( aElementOf0(X1,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS))))
<=> ( sdtlseqdt0(szszuzczcdt0(X1),szszuzczcdt0(szmzazxdt0(xS)))
& aElementOf0(X1,szNzAzT0) ) )
& aSet0(slbdtrb0(szszuzczcdt0(szmzazxdt0(xS)))) )
=> ( aSubsetOf0(xS,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS))))
| ! [X1] :
( aElementOf0(X1,xS)
=> aElementOf0(X1,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS)))) ) ) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_8,plain,
! [X32,X33] :
( ( ~ aElementOf0(X33,szNzAzT0)
| ~ aElementOf0(X32,szNzAzT0)
| aElementOf0(X32,slbdtrb0(szszuzczcdt0(X33)))
| X32 != X33 )
& ( ~ aElementOf0(X33,szNzAzT0)
| ~ aElementOf0(X32,szNzAzT0)
| aElementOf0(X32,slbdtrb0(szszuzczcdt0(X33)))
| ~ aElementOf0(X32,slbdtrb0(X33)) )
& ( ~ aElementOf0(X33,szNzAzT0)
| ~ aElementOf0(X32,szNzAzT0)
| X32 = X33
| aElementOf0(X32,slbdtrb0(X33))
| ~ aElementOf0(X32,slbdtrb0(szszuzczcdt0(X33))) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSegSucc])])])]) ).
cnf(c_0_9,plain,
( ~ aElementOf0(X3,szNzAzT0)
| X2 != slbdtrb0(X3)
| ~ aElementOf0(X1,X2)
| aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,hypothesis,
! [X5] :
( isFinite0(xS)
& aSubsetOf0(xS,szNzAzT0)
& ( aElementOf0(X5,szNzAzT0)
| ~ aElementOf0(X5,xS) )
& aSet0(xS) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__1986])])])]) ).
fof(c_0_11,negated_conjecture,
! [X7,X8] :
( ~ aSubsetOf0(xS,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS))))
& ~ aElementOf0(esk2_0,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS))))
& aElementOf0(esk2_0,xS)
& ( aElementOf0(X8,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS))))
| ~ sdtlseqdt0(szszuzczcdt0(X8),szszuzczcdt0(szmzazxdt0(xS)))
| ~ aElementOf0(X8,szNzAzT0) )
& ( ~ aElementOf0(X8,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS))))
| sdtlseqdt0(szszuzczcdt0(X8),szszuzczcdt0(szmzazxdt0(xS))) )
& ( ~ aElementOf0(X8,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS))))
| aElementOf0(X8,szNzAzT0) )
& aSet0(slbdtrb0(szszuzczcdt0(szmzazxdt0(xS))))
& ( sdtlseqdt0(X7,szmzazxdt0(xS))
| ~ aElementOf0(X7,xS) )
& aElementOf0(szmzazxdt0(xS),xS)
& xS != slcrc0
& aElementOf0(esk1_0,xS) ),
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])])])])])]) ).
cnf(c_0_12,plain,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X1,slbdtrb0(X2))
| aElementOf0(X1,slbdtrb0(szszuzczcdt0(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,slbdtrb0(X2))
| aElementOf0(X1,szNzAzT0) ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_14,hypothesis,
( ~ aElementOf0(X1,xS)
| aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
aElementOf0(szmzazxdt0(xS),xS),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( ~ aElementOf0(X2,szNzAzT0)
| X3 != slbdtrb0(X2)
| ~ sdtlseqdt0(szszuzczcdt0(X1),X2)
| ~ aElementOf0(X1,szNzAzT0)
| aElementOf0(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_17,plain,
! [X42,X43] :
( sdtlseqdt0(szszuzczcdt0(X43),X42)
| sdtlseqdt0(X42,X43)
| ~ aElementOf0(X43,szNzAzT0)
| ~ aElementOf0(X42,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLessTotal])])]) ).
fof(c_0_18,plain,
! [X52,X53] :
( X52 = X53
| ~ sdtlseqdt0(X53,X52)
| ~ sdtlseqdt0(X52,X53)
| ~ aElementOf0(X53,szNzAzT0)
| ~ aElementOf0(X52,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLessASymm])])]) ).
cnf(c_0_19,negated_conjecture,
~ aElementOf0(esk2_0,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS)))),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,plain,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,slbdtrb0(X2))
| aElementOf0(X1,slbdtrb0(szszuzczcdt0(X2))) ),
inference(csr,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_21,negated_conjecture,
aElementOf0(szmzazxdt0(xS),szNzAzT0),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_22,plain,
( ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X1),X2)
| aElementOf0(X1,slbdtrb0(X2)) ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| sdtlseqdt0(szszuzczcdt0(X2),X1)
| sdtlseqdt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,negated_conjecture,
aElementOf0(esk2_0,xS),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_25,plain,
( ~ sdtlseqdt0(X2,X1)
| ~ sdtlseqdt0(X1,X2)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,negated_conjecture,
( ~ aElementOf0(X1,xS)
| sdtlseqdt0(X1,szmzazxdt0(xS)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_27,negated_conjecture,
~ aElementOf0(esk2_0,slbdtrb0(szmzazxdt0(xS))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_28,plain,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| aElementOf0(X2,slbdtrb0(X1))
| sdtlseqdt0(X1,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,negated_conjecture,
aElementOf0(esk2_0,szNzAzT0),
inference(spm,[status(thm)],[c_0_14,c_0_24]) ).
cnf(c_0_30,negated_conjecture,
( ~ aElementOf0(X1,xS)
| ~ sdtlseqdt0(szmzazxdt0(xS),X1)
| szmzazxdt0(xS) = X1 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_21])]),c_0_14]) ).
cnf(c_0_31,negated_conjecture,
sdtlseqdt0(szmzazxdt0(xS),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_21]),c_0_29])]) ).
cnf(c_0_32,negated_conjecture,
szmzazxdt0(xS) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_24])]) ).
cnf(c_0_33,plain,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| X1 != X2
| aElementOf0(X1,slbdtrb0(szszuzczcdt0(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_34,negated_conjecture,
~ aElementOf0(esk2_0,slbdtrb0(szszuzczcdt0(esk2_0))),
inference(spm,[status(thm)],[c_0_19,c_0_32]) ).
cnf(c_0_35,plain,
( ~ aElementOf0(X1,szNzAzT0)
| aElementOf0(X1,slbdtrb0(szszuzczcdt0(X1))) ),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM544+2 : 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/6.21 % Computer : n008.cluster.edu
% 0.11/6.21 % Model : x86_64 x86_64
% 0.11/6.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/6.21 % Memory : 8046.5625MB
% 0.11/6.21 % OS : Linux 6.8.0-71-generic
% 0.11/6.21 % CPULimit : 300
% 0.11/6.21 % WCLimit : 300
% 0.11/6.21 % DateTime : Mon Sep 21 02:39:47 UTC 2026
% 0.11/6.21 % CPUTime :
% 0.11/6.21 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/6.26 Running first-order theorem proving
% 0.11/6.26 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.16/6.31 % Version: 3.5.1
% 0.16/6.31 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/6.31 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/6.31 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/6.31 % Starting new_bool_3 with 300s (1) cores
% 0.16/6.31 % Starting new_bool_1 with 300s (1) cores
% 0.16/6.31 % Starting sh5l with 300s (1) cores
% 0.16/6.31 % new_bool_1 with pid 4162463 completed with status 0
% 0.16/6.31 % Result found by new_bool_1
% 0.16/6.31 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/6.31 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/6.31 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/6.31 % Starting new_bool_3 with 300s (1) cores
% 0.16/6.31 % Starting new_bool_1 with 300s (1) cores
% 0.16/6.31 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/6.31 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/6.31 % Search class: FGHSF-FFMM31-MFFFFFNN
% 0.16/6.31 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/6.31 % Starting SubtermCWHack with 31s (1) cores
% 0.16/6.31 % SubtermCWHack with pid 4162469 completed with status 0
% 0.16/6.31 % Result found by SubtermCWHack
% 0.16/6.31 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/6.31 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/6.31 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/6.31 % Starting new_bool_3 with 300s (1) cores
% 0.16/6.31 % Starting new_bool_1 with 300s (1) cores
% 0.16/6.31 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/6.31 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/6.31 % Search class: FGHSF-FFMM31-MFFFFFNN
% 0.16/6.31 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/6.31 % Starting SubtermCWHack with 31s (1) cores
% 0.16/6.31 % Preprocessing time : 0.002 s
% 0.16/6.31
% 0.16/6.31 % Proof found!
% 0.16/6.31 % SZS status Theorem
% 0.16/6.31 % SZS output start CNFRefutation
% See solution above
% 0.16/6.31 % Parsed axioms : 56
% 0.16/6.31 % Removed by relevancy pruning/SinE : 4
% 0.16/6.31 % Initial clauses : 105
% 0.16/6.31 % Removed in clause preprocessing : 5
% 0.16/6.31 % Initial clauses in saturation : 100
% 0.16/6.31 % Processed clauses : 256
% 0.16/6.31 % ...of these trivial : 4
% 0.16/6.31 % ...subsumed : 70
% 0.16/6.31 % ...remaining for further processing : 182
% 0.16/6.31 % Other redundant clauses eliminated : 26
% 0.16/6.31 % Clauses deleted for lack of memory : 0
% 0.16/6.31 % Backward-subsumed : 3
% 0.16/6.31 % Backward-rewritten : 16
% 0.16/6.31 % Generated clauses : 424
% 0.16/6.31 % ...of the previous two non-redundant : 354
% 0.16/6.31 % ...aggressively subsumed : 0
% 0.16/6.31 % Contextual simplify-reflections : 16
% 0.16/6.31 % Paramodulations : 399
% 0.16/6.31 % Factorizations : 0
% 0.16/6.31 % NegExts : 0
% 0.16/6.31 % Equation resolutions : 27
% 0.16/6.31 % Disequality decompositions : 0
% 0.16/6.31 % Total rewrite steps : 269
% 0.16/6.31 % ...of those cached : 247
% 0.16/6.31 % Propositional unsat checks : 0
% 0.16/6.31 % Propositional check models : 0
% 0.16/6.31 % Propositional check unsatisfiable : 0
% 0.16/6.31 % Propositional clauses : 0
% 0.16/6.31 % Propositional clauses after purity: 0
% 0.16/6.31 % Propositional unsat core size : 0
% 0.16/6.31 % Propositional preprocessing time : 0.000
% 0.16/6.31 % Propositional encoding time : 0.000
% 0.16/6.31 % Propositional solver time : 0.000
% 0.16/6.31 % Success case prop preproc time : 0.000
% 0.16/6.31 % Success case prop encoding time : 0.000
% 0.16/6.31 % Success case prop solver time : 0.000
% 0.16/6.31 % Current number of processed clauses : 142
% 0.16/6.31 % Positive orientable unit clauses : 26
% 0.16/6.31 % Positive unorientable unit clauses: 0
% 0.16/6.31 % Negative unit clauses : 11
% 0.16/6.31 % Non-unit-clauses : 105
% 0.16/6.31 % Current number of unprocessed clauses: 195
% 0.16/6.31 % ...number of literals in the above : 1031
% 0.16/6.31 % Current number of archived formulas : 0
% 0.16/6.31 % Current number of archived clauses : 19
% 0.16/6.31 % Clause-clause subsumption calls (NU) : 1833
% 0.16/6.31 % Rec. Clause-clause subsumption calls : 856
% 0.16/6.31 % Non-unit clause-clause subsumptions : 74
% 0.16/6.31 % Unit Clause-clause subsumption calls : 238
% 0.16/6.31 % Rewrite failures with RHS unbound : 0
% 0.16/6.31 % BW rewrite match attempts : 3
% 0.16/6.31 % BW rewrite match successes : 2
% 0.16/6.31 % Condensation attempts : 0
% 0.16/6.31 % Condensation successes : 0
% 0.16/6.31 % Termbank termtop insertions : 14898
% 0.16/6.31 % Search garbage collected termcells : 2019
% 0.16/6.31
% 0.16/6.31 % -------------------------------------------------
% 0.16/6.31 % User time : 0.014 s
% 0.16/6.31 % System time : 0.004 s
% 0.16/6.31 % Total time : 0.017 s
% 0.16/6.31 % Maximum resident set size: 3956 pages
% 0.16/6.31
% 0.16/6.31 % -------------------------------------------------
% 0.16/6.31 % User time : 0.015 s
% 0.16/6.31 % System time : 0.011 s
% 0.16/6.31 % Total time : 0.025 s
% 0.16/6.31 % Maximum resident set size: 4608 pages
% 0.16/6.31 % E exiting
%------------------------------------------------------------------------------