%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT385+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 : n009.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:05:13 PM UTC 2026
% Result : Theorem 0.16s 0.60s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 5 unt; 0 def)
% Number of atoms : 276 ( 8 equ)
% Maximal formula atoms : 48 ( 13 avg)
% Number of connectives : 343 ( 87 ~; 102 |; 116 &)
% ( 1 <=>; 37 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 10 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 1 prp; 0-3 aty)
% Number of functors : 16 ( 16 usr; 4 con; 0-3 aty)
% Number of variables : 64 ( 1 sgn 51 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] :
( aInfimumOfIn0(X1,xP,xU)
| ( ! [X2] :
( ( aLowerBoundOfIn0(X2,xP,xU)
& ! [X3] :
( aElementOf0(X3,xP)
=> sdtlseqdt0(X2,X3) )
& aElementOf0(X2,xU) )
=> sdtlseqdt0(X2,X1) )
& ( aLowerBoundOfIn0(X1,xP,xU)
| ( ! [X2] :
( aElementOf0(X2,xP)
=> sdtlseqdt0(X1,X2) )
& aElementOf0(X1,xU) ) )
& aElementOf0(X1,xU) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__1123,hypothesis,
( isOn0(xf,xU)
& szRzazndt0(xf) = xU
& szDzozmdt0(xf) = szRzazndt0(xf)
& isMonotone0(xf)
& ! [X1,X2] :
( ( aElementOf0(X2,szDzozmdt0(xf))
& aElementOf0(X1,szDzozmdt0(xf)) )
=> ( sdtlseqdt0(X1,X2)
=> sdtlseqdt0(sdtlpdtrp0(xf,X1),sdtlpdtrp0(xf,X2)) ) )
& aFunction0(xf)
& aCompleteLattice0(xU)
& ! [X1] :
( ( aSubsetOf0(X1,xU)
| ( ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xU) )
& aSet0(X1) ) )
=> ? [X2] :
( ? [X3] :
( aSupremumOfIn0(X3,X1,xU)
& ! [X4] :
( ( aUpperBoundOfIn0(X4,X1,xU)
| ( ! [X5] :
( aElementOf0(X5,X1)
=> sdtlseqdt0(X5,X4) )
& aElementOf0(X4,xU) ) )
=> sdtlseqdt0(X3,X4) )
& aUpperBoundOfIn0(X3,X1,xU)
& ! [X4] :
( aElementOf0(X4,X1)
=> sdtlseqdt0(X4,X3) )
& aElementOf0(X3,xU)
& aElementOf0(X3,xU) )
& aInfimumOfIn0(X2,X1,xU)
& ! [X3] :
( ( aLowerBoundOfIn0(X3,X1,xU)
| ( ! [X4] :
( aElementOf0(X4,X1)
=> sdtlseqdt0(X3,X4) )
& aElementOf0(X3,xU) ) )
=> sdtlseqdt0(X3,X2) )
& aLowerBoundOfIn0(X2,X1,xU)
& ! [X3] :
( aElementOf0(X3,X1)
=> sdtlseqdt0(X2,X3) )
& aElementOf0(X2,xU)
& aElementOf0(X2,xU) ) )
& aSet0(xU) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1123) ).
fof(m__1244,hypothesis,
( xP = cS1241(xU,xf,xT)
& ! [X1] :
( ( ( ( aUpperBoundOfIn0(X1,xT,xU)
| ! [X2] :
( aElementOf0(X2,xT)
=> sdtlseqdt0(X2,X1) ) )
& sdtlseqdt0(sdtlpdtrp0(xf,X1),X1)
& aElementOf0(X1,xU) )
=> aElementOf0(X1,xP) )
& ( aElementOf0(X1,xP)
=> ( aUpperBoundOfIn0(X1,xT,xU)
& ! [X2] :
( aElementOf0(X2,xT)
=> sdtlseqdt0(X2,X1) )
& sdtlseqdt0(sdtlpdtrp0(xf,X1),X1)
& aElementOf0(X1,xU) ) ) )
& aSet0(xP) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1244) ).
fof(c_0_3,plain,
! [X1] :
( epred1_1(X1)
<=> ? [X2] :
( ? [X3] :
( aSupremumOfIn0(X3,X1,xU)
& ! [X4] :
( ( aUpperBoundOfIn0(X4,X1,xU)
| ( ! [X5] :
( aElementOf0(X5,X1)
=> sdtlseqdt0(X5,X4) )
& aElementOf0(X4,xU) ) )
=> sdtlseqdt0(X3,X4) )
& aUpperBoundOfIn0(X3,X1,xU)
& ! [X4] :
( aElementOf0(X4,X1)
=> sdtlseqdt0(X4,X3) )
& aElementOf0(X3,xU) )
& aInfimumOfIn0(X2,X1,xU)
& ! [X3] :
( ( aLowerBoundOfIn0(X3,X1,xU)
| ( ! [X4] :
( aElementOf0(X4,X1)
=> sdtlseqdt0(X3,X4) )
& aElementOf0(X3,xU) ) )
=> sdtlseqdt0(X3,X2) )
& aLowerBoundOfIn0(X2,X1,xU)
& ! [X3] :
( aElementOf0(X3,X1)
=> sdtlseqdt0(X2,X3) )
& aElementOf0(X2,xU) ) ),
introduced(definition) ).
fof(c_0_4,negated_conjecture,
~ ? [X1] :
( aInfimumOfIn0(X1,xP,xU)
| ( ! [X2] :
( ( aLowerBoundOfIn0(X2,xP,xU)
& ! [X3] :
( aElementOf0(X3,xP)
=> sdtlseqdt0(X2,X3) )
& aElementOf0(X2,xU) )
=> sdtlseqdt0(X2,X1) )
& ( aLowerBoundOfIn0(X1,xP,xU)
| ( ! [X2] :
( aElementOf0(X2,xP)
=> sdtlseqdt0(X1,X2) )
& aElementOf0(X1,xU) ) )
& aElementOf0(X1,xU) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_5,plain,
! [X1] :
( epred1_1(X1)
=> ? [X2] :
( ? [X3] :
( aSupremumOfIn0(X3,X1,xU)
& ! [X4] :
( ( aUpperBoundOfIn0(X4,X1,xU)
| ( ! [X5] :
( aElementOf0(X5,X1)
=> sdtlseqdt0(X5,X4) )
& aElementOf0(X4,xU) ) )
=> sdtlseqdt0(X3,X4) )
& aUpperBoundOfIn0(X3,X1,xU)
& ! [X4] :
( aElementOf0(X4,X1)
=> sdtlseqdt0(X4,X3) )
& aElementOf0(X3,xU) )
& aInfimumOfIn0(X2,X1,xU)
& ! [X3] :
( ( aLowerBoundOfIn0(X3,X1,xU)
| ( ! [X4] :
( aElementOf0(X4,X1)
=> sdtlseqdt0(X3,X4) )
& aElementOf0(X3,xU) ) )
=> sdtlseqdt0(X3,X2) )
& aLowerBoundOfIn0(X2,X1,xU)
& ! [X3] :
( aElementOf0(X3,X1)
=> sdtlseqdt0(X2,X3) )
& aElementOf0(X2,xU) ) ),
inference(split_equiv,[status(thm)],[c_0_3]) ).
fof(c_0_6,hypothesis,
( isOn0(xf,xU)
& szRzazndt0(xf) = xU
& szDzozmdt0(xf) = szRzazndt0(xf)
& isMonotone0(xf)
& ! [X1,X2] :
( ( aElementOf0(X2,szDzozmdt0(xf))
& aElementOf0(X1,szDzozmdt0(xf)) )
=> ( sdtlseqdt0(X1,X2)
=> sdtlseqdt0(sdtlpdtrp0(xf,X1),sdtlpdtrp0(xf,X2)) ) )
& aFunction0(xf)
& aCompleteLattice0(xU)
& ! [X1] :
( ( aSubsetOf0(X1,xU)
| ( ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xU) )
& aSet0(X1) ) )
=> epred1_1(X1) )
& aSet0(xU) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[m__1123]),c_0_3]) ).
fof(c_0_7,negated_conjecture,
! [X16,X19,X20] :
( ~ aInfimumOfIn0(X20,xP,xU)
& ( ~ aElementOf0(X16,xU)
| ~ aLowerBoundOfIn0(X16,xP,xU)
| ~ sdtlseqdt0(esk4_1(X16),X16) )
& ( ~ aElementOf0(X16,xU)
| ~ aLowerBoundOfIn0(X16,xP,xU)
| aLowerBoundOfIn0(esk4_1(X16),xP,xU) )
& ( ~ aElementOf0(X16,xU)
| ~ aLowerBoundOfIn0(X16,xP,xU)
| sdtlseqdt0(esk4_1(X16),X19)
| ~ aElementOf0(X19,xP) )
& ( ~ aElementOf0(X16,xU)
| ~ aLowerBoundOfIn0(X16,xP,xU)
| aElementOf0(esk4_1(X16),xU) )
& ( ~ aElementOf0(X16,xU)
| ~ aElementOf0(X16,xU)
| ~ sdtlseqdt0(X16,esk3_1(X16))
| ~ sdtlseqdt0(esk4_1(X16),X16) )
& ( ~ aElementOf0(X16,xU)
| ~ aElementOf0(X16,xU)
| ~ sdtlseqdt0(X16,esk3_1(X16))
| aLowerBoundOfIn0(esk4_1(X16),xP,xU) )
& ( ~ aElementOf0(X16,xU)
| ~ aElementOf0(X16,xU)
| ~ sdtlseqdt0(X16,esk3_1(X16))
| sdtlseqdt0(esk4_1(X16),X19)
| ~ aElementOf0(X19,xP) )
& ( ~ aElementOf0(X16,xU)
| ~ aElementOf0(X16,xU)
| ~ sdtlseqdt0(X16,esk3_1(X16))
| aElementOf0(esk4_1(X16),xU) )
& ( ~ aElementOf0(X16,xU)
| ~ aElementOf0(X16,xU)
| aElementOf0(esk3_1(X16),xP)
| ~ sdtlseqdt0(esk4_1(X16),X16) )
& ( ~ aElementOf0(X16,xU)
| ~ aElementOf0(X16,xU)
| aElementOf0(esk3_1(X16),xP)
| aLowerBoundOfIn0(esk4_1(X16),xP,xU) )
& ( ~ aElementOf0(X16,xU)
| ~ aElementOf0(X16,xU)
| aElementOf0(esk3_1(X16),xP)
| sdtlseqdt0(esk4_1(X16),X19)
| ~ aElementOf0(X19,xP) )
& ( ~ aElementOf0(X16,xU)
| ~ aElementOf0(X16,xU)
| aElementOf0(esk3_1(X16),xP)
| aElementOf0(esk4_1(X16),xU) ) ),
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_4])])])])])])]) ).
fof(c_0_8,plain,
! [X81,X83,X84,X87,X88] :
( ( ~ epred1_1(X81)
| aSupremumOfIn0(esk17_1(X81),X81,xU) )
& ( ~ epred1_1(X81)
| sdtlseqdt0(esk17_1(X81),X88)
| ~ aUpperBoundOfIn0(X88,X81,xU) )
& ( ~ epred1_1(X81)
| sdtlseqdt0(esk17_1(X81),X88)
| ~ aElementOf0(X88,xU)
| ~ sdtlseqdt0(esk18_2(X81,X88),X88) )
& ( ~ epred1_1(X81)
| sdtlseqdt0(esk17_1(X81),X88)
| ~ aElementOf0(X88,xU)
| aElementOf0(esk18_2(X81,X88),X81) )
& ( ~ epred1_1(X81)
| aUpperBoundOfIn0(esk17_1(X81),X81,xU) )
& ( ~ epred1_1(X81)
| sdtlseqdt0(X87,esk17_1(X81))
| ~ aElementOf0(X87,X81) )
& ( ~ epred1_1(X81)
| aElementOf0(esk17_1(X81),xU) )
& ( ~ epred1_1(X81)
| aInfimumOfIn0(esk15_1(X81),X81,xU) )
& ( ~ epred1_1(X81)
| sdtlseqdt0(X84,esk15_1(X81))
| ~ aLowerBoundOfIn0(X84,X81,xU) )
& ( ~ epred1_1(X81)
| sdtlseqdt0(X84,esk15_1(X81))
| ~ aElementOf0(X84,xU)
| ~ sdtlseqdt0(X84,esk16_2(X81,X84)) )
& ( ~ epred1_1(X81)
| sdtlseqdt0(X84,esk15_1(X81))
| ~ aElementOf0(X84,xU)
| aElementOf0(esk16_2(X81,X84),X81) )
& ( ~ epred1_1(X81)
| aLowerBoundOfIn0(esk15_1(X81),X81,xU) )
& ( ~ epred1_1(X81)
| sdtlseqdt0(esk15_1(X81),X83)
| ~ aElementOf0(X83,X81) )
& ( ~ epred1_1(X81)
| aElementOf0(esk15_1(X81),xU) ) ),
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_5])])])])])])]) ).
fof(c_0_9,hypothesis,
! [X12,X13,X14] :
( xP = cS1241(xU,xf,xT)
& ( aElementOf0(X14,xP)
| ~ sdtlseqdt0(sdtlpdtrp0(xf,X14),X14)
| ~ aElementOf0(X14,xU)
| ~ aUpperBoundOfIn0(X14,xT,xU) )
& ( aElementOf0(X14,xP)
| ~ sdtlseqdt0(sdtlpdtrp0(xf,X14),X14)
| ~ aElementOf0(X14,xU)
| ~ sdtlseqdt0(esk2_1(X14),X14) )
& ( aElementOf0(X14,xP)
| ~ sdtlseqdt0(sdtlpdtrp0(xf,X14),X14)
| ~ aElementOf0(X14,xU)
| aElementOf0(esk2_1(X14),xT) )
& ( ~ aElementOf0(X12,xP)
| aUpperBoundOfIn0(X12,xT,xU) )
& ( ~ aElementOf0(X12,xP)
| sdtlseqdt0(X13,X12)
| ~ aElementOf0(X13,xT) )
& ( ~ aElementOf0(X12,xP)
| sdtlseqdt0(sdtlpdtrp0(xf,X12),X12) )
& ( ~ aElementOf0(X12,xP)
| aElementOf0(X12,xU) )
& aSet0(xP) ),
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__1244])])])])])])]) ).
fof(c_0_10,hypothesis,
! [X6,X8,X9] :
( isOn0(xf,xU)
& szRzazndt0(xf) = xU
& szDzozmdt0(xf) = szRzazndt0(xf)
& isMonotone0(xf)
& ( sdtlseqdt0(sdtlpdtrp0(xf,X8),sdtlpdtrp0(xf,X9))
| ~ sdtlseqdt0(X8,X9)
| ~ aElementOf0(X9,szDzozmdt0(xf))
| ~ aElementOf0(X8,szDzozmdt0(xf)) )
& aFunction0(xf)
& aCompleteLattice0(xU)
& ( epred1_1(X6)
| ~ aSubsetOf0(X6,xU) )
& ( epred1_1(X6)
| ~ aSet0(X6)
| ~ aElementOf0(esk1_1(X6),xU) )
& ( epred1_1(X6)
| ~ aSet0(X6)
| aElementOf0(esk1_1(X6),X6) )
& aSet0(xU) ),
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_6])])])])])]) ).
cnf(c_0_11,negated_conjecture,
~ aInfimumOfIn0(X1,xP,xU),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( ~ epred1_1(X1)
| aInfimumOfIn0(esk15_1(X1),X1,xU) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,hypothesis,
( ~ aElementOf0(X1,xP)
| aElementOf0(X1,xU) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,hypothesis,
( ~ aSet0(X1)
| epred1_1(X1)
| aElementOf0(esk1_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,hypothesis,
aSet0(xP),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
~ epred1_1(xP),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,hypothesis,
( ~ aSet0(X1)
| ~ aElementOf0(esk1_1(X1),xU)
| epred1_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,hypothesis,
aElementOf0(esk1_1(xP),xU),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),c_0_16]) ).
cnf(c_0_19,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_15])]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT385+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.52 % Computer : n009.cluster.edu
% 0.10/0.52 % Model : x86_64 x86_64
% 0.10/0.52 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.52 % Memory : 8046.5625MB
% 0.10/0.52 % OS : Linux 6.8.0-71-generic
% 0.10/0.52 % CPULimit : 300
% 0.10/0.52 % WCLimit : 300
% 0.10/0.52 % DateTime : Sun Sep 20 23:57:44 UTC 2026
% 0.10/0.52 % CPUTime :
% 0.10/0.52 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.57 Running first-order theorem proving
% 0.16/0.57 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.16/0.60 % Version: 3.5.1
% 0.16/0.60 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.60 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.60 % Starting sh5l with 300s (1) cores
% 0.16/0.60 % new_bool_3 with pid 401447 completed with status 0
% 0.16/0.60 % Result found by new_bool_3
% 0.16/0.60 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.60 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.60 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.60 % Search class: FGHSF-FFMM31-SFFFFFNN
% 0.16/0.60 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.60 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.60 % SubtermCWHack with pid 401450 completed with status 0
% 0.16/0.60 % Result found by SubtermCWHack
% 0.16/0.60 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.60 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.60 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.60 % Search class: FGHSF-FFMM31-SFFFFFNN
% 0.16/0.60 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.60 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.60 % Preprocessing time : 0.002 s
% 0.16/0.60
% 0.16/0.60 % Proof found!
% 0.16/0.60 % SZS status Theorem
% 0.16/0.60 % SZS output start CNFRefutation
% See solution above
% 0.16/0.60 % Parsed axioms : 28
% 0.16/0.60 % Removed by relevancy pruning/SinE : 7
% 0.16/0.60 % Initial clauses : 102
% 0.16/0.60 % Removed in clause preprocessing : 2
% 0.16/0.60 % Initial clauses in saturation : 100
% 0.16/0.60 % Processed clauses : 42
% 0.16/0.60 % ...of these trivial : 0
% 0.16/0.60 % ...subsumed : 0
% 0.16/0.60 % ...remaining for further processing : 42
% 0.16/0.60 % Other redundant clauses eliminated : 0
% 0.16/0.60 % Clauses deleted for lack of memory : 0
% 0.16/0.60 % Backward-subsumed : 0
% 0.16/0.60 % Backward-rewritten : 0
% 0.16/0.60 % Generated clauses : 16
% 0.16/0.60 % ...of the previous two non-redundant : 8
% 0.16/0.60 % ...aggressively subsumed : 0
% 0.16/0.60 % Contextual simplify-reflections : 0
% 0.16/0.60 % Paramodulations : 16
% 0.16/0.60 % Factorizations : 0
% 0.16/0.60 % NegExts : 0
% 0.16/0.60 % Equation resolutions : 0
% 0.16/0.60 % Disequality decompositions : 0
% 0.16/0.60 % Total rewrite steps : 14
% 0.16/0.60 % ...of those cached : 7
% 0.16/0.60 % Propositional unsat checks : 0
% 0.16/0.60 % Propositional check models : 0
% 0.16/0.60 % Propositional check unsatisfiable : 0
% 0.16/0.60 % Propositional clauses : 0
% 0.16/0.60 % Propositional clauses after purity: 0
% 0.16/0.60 % Propositional unsat core size : 0
% 0.16/0.60 % Propositional preprocessing time : 0.000
% 0.16/0.60 % Propositional encoding time : 0.000
% 0.16/0.60 % Propositional solver time : 0.000
% 0.16/0.60 % Success case prop preproc time : 0.000
% 0.16/0.60 % Success case prop encoding time : 0.000
% 0.16/0.60 % Success case prop solver time : 0.000
% 0.16/0.60 % Current number of processed clauses : 42
% 0.16/0.60 % Positive orientable unit clauses : 14
% 0.16/0.60 % Positive unorientable unit clauses: 0
% 0.16/0.60 % Negative unit clauses : 3
% 0.16/0.60 % Non-unit-clauses : 25
% 0.16/0.60 % Current number of unprocessed clauses: 65
% 0.16/0.60 % ...number of literals in the above : 255
% 0.16/0.60 % Current number of archived formulas : 0
% 0.16/0.60 % Current number of archived clauses : 0
% 0.16/0.60 % Clause-clause subsumption calls (NU) : 137
% 0.16/0.60 % Rec. Clause-clause subsumption calls : 128
% 0.16/0.60 % Non-unit clause-clause subsumptions : 0
% 0.16/0.60 % Unit Clause-clause subsumption calls : 3
% 0.16/0.60 % Rewrite failures with RHS unbound : 0
% 0.16/0.60 % BW rewrite match attempts : 0
% 0.16/0.60 % BW rewrite match successes : 0
% 0.16/0.60 % Condensation attempts : 0
% 0.16/0.60 % Condensation successes : 0
% 0.16/0.60 % Termbank termtop insertions : 7117
% 0.16/0.60 % Search garbage collected termcells : 1923
% 0.16/0.60
% 0.16/0.60 % -------------------------------------------------
% 0.16/0.60 % User time : 0.010 s
% 0.16/0.60 % System time : 0.001 s
% 0.16/0.60 % Total time : 0.011 s
% 0.16/0.60 % Maximum resident set size: 3944 pages
% 0.16/0.60
% 0.16/0.60 % -------------------------------------------------
% 0.16/0.60 % User time : 0.012 s
% 0.16/0.60 % System time : 0.006 s
% 0.16/0.60 % Total time : 0.018 s
% 0.16/0.60 % Maximum resident set size: 4608 pages
% 0.16/0.60 % E exiting
%------------------------------------------------------------------------------