TSTP Solution File: LAT385+4 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : LAT385+4 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:17:19 EDT 2024
% Result : Theorem 0.16s 0.45s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 6 unt; 0 def)
% Number of atoms : 277 ( 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] :
( ( aElementOf0(X1,xU)
& ( ( aElementOf0(X1,xU)
& ! [X2] :
( aElementOf0(X2,xP)
=> sdtlseqdt0(X1,X2) ) )
| aLowerBoundOfIn0(X1,xP,xU) )
& ! [X2] :
( ( aElementOf0(X2,xU)
& ! [X3] :
( aElementOf0(X3,xP)
=> sdtlseqdt0(X2,X3) )
& aLowerBoundOfIn0(X2,xP,xU) )
=> sdtlseqdt0(X2,X1) ) )
| aInfimumOfIn0(X1,xP,xU) ),
file('/export/starexec/sandbox2/tmp/tmp.hgugBRnCe8/E---3.1_9320.p',m__) ).
fof(m__1123,hypothesis,
( aSet0(xU)
& ! [X1] :
( ( ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xU) ) )
| aSubsetOf0(X1,xU) )
=> ? [X2] :
( aElementOf0(X2,xU)
& aElementOf0(X2,xU)
& ! [X3] :
( aElementOf0(X3,X1)
=> sdtlseqdt0(X2,X3) )
& aLowerBoundOfIn0(X2,X1,xU)
& ! [X3] :
( ( ( aElementOf0(X3,xU)
& ! [X4] :
( aElementOf0(X4,X1)
=> sdtlseqdt0(X3,X4) ) )
| aLowerBoundOfIn0(X3,X1,xU) )
=> sdtlseqdt0(X3,X2) )
& aInfimumOfIn0(X2,X1,xU)
& ? [X3] :
( aElementOf0(X3,xU)
& aElementOf0(X3,xU)
& ! [X4] :
( aElementOf0(X4,X1)
=> sdtlseqdt0(X4,X3) )
& aUpperBoundOfIn0(X3,X1,xU)
& ! [X4] :
( ( ( aElementOf0(X4,xU)
& ! [X5] :
( aElementOf0(X5,X1)
=> sdtlseqdt0(X5,X4) ) )
| aUpperBoundOfIn0(X4,X1,xU) )
=> sdtlseqdt0(X3,X4) )
& aSupremumOfIn0(X3,X1,xU) ) ) )
& aCompleteLattice0(xU)
& aFunction0(xf)
& ! [X1,X2] :
( ( aElementOf0(X1,szDzozmdt0(xf))
& aElementOf0(X2,szDzozmdt0(xf)) )
=> ( sdtlseqdt0(X1,X2)
=> sdtlseqdt0(sdtlpdtrp0(xf,X1),sdtlpdtrp0(xf,X2)) ) )
& isMonotone0(xf)
& szDzozmdt0(xf) = szRzazndt0(xf)
& szRzazndt0(xf) = xU
& isOn0(xf,xU) ),
file('/export/starexec/sandbox2/tmp/tmp.hgugBRnCe8/E---3.1_9320.p',m__1123) ).
fof(m__1244,hypothesis,
( aSet0(xP)
& ! [X1] :
( ( aElementOf0(X1,xP)
=> ( aElementOf0(X1,xU)
& sdtlseqdt0(sdtlpdtrp0(xf,X1),X1)
& ! [X2] :
( aElementOf0(X2,xT)
=> sdtlseqdt0(X2,X1) )
& aUpperBoundOfIn0(X1,xT,xU) ) )
& ( ( aElementOf0(X1,xU)
& sdtlseqdt0(sdtlpdtrp0(xf,X1),X1)
& ( ! [X2] :
( aElementOf0(X2,xT)
=> sdtlseqdt0(X2,X1) )
| aUpperBoundOfIn0(X1,xT,xU) ) )
=> aElementOf0(X1,xP) ) )
& xP = cS1241(xU,xf,xT) ),
file('/export/starexec/sandbox2/tmp/tmp.hgugBRnCe8/E---3.1_9320.p',m__1244) ).
fof(c_0_3,plain,
! [X1] :
( epred1_1(X1)
<=> ? [X2] :
( aElementOf0(X2,xU)
& ! [X3] :
( aElementOf0(X3,X1)
=> sdtlseqdt0(X2,X3) )
& aLowerBoundOfIn0(X2,X1,xU)
& ! [X3] :
( ( ( aElementOf0(X3,xU)
& ! [X4] :
( aElementOf0(X4,X1)
=> sdtlseqdt0(X3,X4) ) )
| aLowerBoundOfIn0(X3,X1,xU) )
=> sdtlseqdt0(X3,X2) )
& aInfimumOfIn0(X2,X1,xU)
& ? [X3] :
( aElementOf0(X3,xU)
& ! [X4] :
( aElementOf0(X4,X1)
=> sdtlseqdt0(X4,X3) )
& aUpperBoundOfIn0(X3,X1,xU)
& ! [X4] :
( ( ( aElementOf0(X4,xU)
& ! [X5] :
( aElementOf0(X5,X1)
=> sdtlseqdt0(X5,X4) ) )
| aUpperBoundOfIn0(X4,X1,xU) )
=> sdtlseqdt0(X3,X4) )
& aSupremumOfIn0(X3,X1,xU) ) ) ),
introduced(definition) ).
fof(c_0_4,negated_conjecture,
~ ? [X1] :
( ( aElementOf0(X1,xU)
& ( ( aElementOf0(X1,xU)
& ! [X2] :
( aElementOf0(X2,xP)
=> sdtlseqdt0(X1,X2) ) )
| aLowerBoundOfIn0(X1,xP,xU) )
& ! [X2] :
( ( aElementOf0(X2,xU)
& ! [X3] :
( aElementOf0(X3,xP)
=> sdtlseqdt0(X2,X3) )
& aLowerBoundOfIn0(X2,xP,xU) )
=> sdtlseqdt0(X2,X1) ) )
| aInfimumOfIn0(X1,xP,xU) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_5,plain,
! [X1] :
( epred1_1(X1)
=> ? [X2] :
( aElementOf0(X2,xU)
& ! [X3] :
( aElementOf0(X3,X1)
=> sdtlseqdt0(X2,X3) )
& aLowerBoundOfIn0(X2,X1,xU)
& ! [X3] :
( ( ( aElementOf0(X3,xU)
& ! [X4] :
( aElementOf0(X4,X1)
=> sdtlseqdt0(X3,X4) ) )
| aLowerBoundOfIn0(X3,X1,xU) )
=> sdtlseqdt0(X3,X2) )
& aInfimumOfIn0(X2,X1,xU)
& ? [X3] :
( aElementOf0(X3,xU)
& ! [X4] :
( aElementOf0(X4,X1)
=> sdtlseqdt0(X4,X3) )
& aUpperBoundOfIn0(X3,X1,xU)
& ! [X4] :
( ( ( aElementOf0(X4,xU)
& ! [X5] :
( aElementOf0(X5,X1)
=> sdtlseqdt0(X5,X4) ) )
| aUpperBoundOfIn0(X4,X1,xU) )
=> sdtlseqdt0(X3,X4) )
& aSupremumOfIn0(X3,X1,xU) ) ) ),
inference(split_equiv,[status(thm)],[c_0_3]) ).
fof(c_0_6,hypothesis,
( aSet0(xU)
& ! [X1] :
( ( ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,xU) ) )
| aSubsetOf0(X1,xU) )
=> epred1_1(X1) )
& aCompleteLattice0(xU)
& aFunction0(xf)
& ! [X1,X2] :
( ( aElementOf0(X1,szDzozmdt0(xf))
& aElementOf0(X2,szDzozmdt0(xf)) )
=> ( sdtlseqdt0(X1,X2)
=> sdtlseqdt0(sdtlpdtrp0(xf,X1),sdtlpdtrp0(xf,X2)) ) )
& isMonotone0(xf)
& szDzozmdt0(xf) = szRzazndt0(xf)
& szRzazndt0(xf) = xU
& isOn0(xf,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] :
( ( aElementOf0(esk4_1(X16),xU)
| aElementOf0(esk3_1(X16),xP)
| ~ aElementOf0(X16,xU)
| ~ aElementOf0(X16,xU) )
& ( ~ aElementOf0(X19,xP)
| sdtlseqdt0(esk4_1(X16),X19)
| aElementOf0(esk3_1(X16),xP)
| ~ aElementOf0(X16,xU)
| ~ aElementOf0(X16,xU) )
& ( aLowerBoundOfIn0(esk4_1(X16),xP,xU)
| aElementOf0(esk3_1(X16),xP)
| ~ aElementOf0(X16,xU)
| ~ aElementOf0(X16,xU) )
& ( ~ sdtlseqdt0(esk4_1(X16),X16)
| aElementOf0(esk3_1(X16),xP)
| ~ aElementOf0(X16,xU)
| ~ aElementOf0(X16,xU) )
& ( aElementOf0(esk4_1(X16),xU)
| ~ sdtlseqdt0(X16,esk3_1(X16))
| ~ aElementOf0(X16,xU)
| ~ aElementOf0(X16,xU) )
& ( ~ aElementOf0(X19,xP)
| sdtlseqdt0(esk4_1(X16),X19)
| ~ sdtlseqdt0(X16,esk3_1(X16))
| ~ aElementOf0(X16,xU)
| ~ aElementOf0(X16,xU) )
& ( aLowerBoundOfIn0(esk4_1(X16),xP,xU)
| ~ sdtlseqdt0(X16,esk3_1(X16))
| ~ aElementOf0(X16,xU)
| ~ aElementOf0(X16,xU) )
& ( ~ sdtlseqdt0(esk4_1(X16),X16)
| ~ sdtlseqdt0(X16,esk3_1(X16))
| ~ aElementOf0(X16,xU)
| ~ aElementOf0(X16,xU) )
& ( aElementOf0(esk4_1(X16),xU)
| ~ aLowerBoundOfIn0(X16,xP,xU)
| ~ aElementOf0(X16,xU) )
& ( ~ aElementOf0(X19,xP)
| sdtlseqdt0(esk4_1(X16),X19)
| ~ aLowerBoundOfIn0(X16,xP,xU)
| ~ aElementOf0(X16,xU) )
& ( aLowerBoundOfIn0(esk4_1(X16),xP,xU)
| ~ aLowerBoundOfIn0(X16,xP,xU)
| ~ aElementOf0(X16,xU) )
& ( ~ sdtlseqdt0(esk4_1(X16),X16)
| ~ aLowerBoundOfIn0(X16,xP,xU)
| ~ aElementOf0(X16,xU) )
& ~ aInfimumOfIn0(X20,xP,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] :
( ( aElementOf0(esk15_1(X81),xU)
| ~ epred1_1(X81) )
& ( ~ aElementOf0(X83,X81)
| sdtlseqdt0(esk15_1(X81),X83)
| ~ epred1_1(X81) )
& ( aLowerBoundOfIn0(esk15_1(X81),X81,xU)
| ~ epred1_1(X81) )
& ( aElementOf0(esk16_2(X81,X84),X81)
| ~ aElementOf0(X84,xU)
| sdtlseqdt0(X84,esk15_1(X81))
| ~ epred1_1(X81) )
& ( ~ sdtlseqdt0(X84,esk16_2(X81,X84))
| ~ aElementOf0(X84,xU)
| sdtlseqdt0(X84,esk15_1(X81))
| ~ epred1_1(X81) )
& ( ~ aLowerBoundOfIn0(X84,X81,xU)
| sdtlseqdt0(X84,esk15_1(X81))
| ~ epred1_1(X81) )
& ( aInfimumOfIn0(esk15_1(X81),X81,xU)
| ~ epred1_1(X81) )
& ( aElementOf0(esk17_1(X81),xU)
| ~ epred1_1(X81) )
& ( ~ aElementOf0(X87,X81)
| sdtlseqdt0(X87,esk17_1(X81))
| ~ epred1_1(X81) )
& ( aUpperBoundOfIn0(esk17_1(X81),X81,xU)
| ~ epred1_1(X81) )
& ( aElementOf0(esk18_2(X81,X88),X81)
| ~ aElementOf0(X88,xU)
| sdtlseqdt0(esk17_1(X81),X88)
| ~ epred1_1(X81) )
& ( ~ sdtlseqdt0(esk18_2(X81,X88),X88)
| ~ aElementOf0(X88,xU)
| sdtlseqdt0(esk17_1(X81),X88)
| ~ epred1_1(X81) )
& ( ~ aUpperBoundOfIn0(X88,X81,xU)
| sdtlseqdt0(esk17_1(X81),X88)
| ~ epred1_1(X81) )
& ( aSupremumOfIn0(esk17_1(X81),X81,xU)
| ~ epred1_1(X81) ) ),
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,
! [X6,X8,X9] :
( aSet0(xU)
& ( aElementOf0(esk1_1(X6),X6)
| ~ aSet0(X6)
| epred1_1(X6) )
& ( ~ aElementOf0(esk1_1(X6),xU)
| ~ aSet0(X6)
| epred1_1(X6) )
& ( ~ aSubsetOf0(X6,xU)
| epred1_1(X6) )
& aCompleteLattice0(xU)
& aFunction0(xf)
& ( ~ aElementOf0(X8,szDzozmdt0(xf))
| ~ aElementOf0(X9,szDzozmdt0(xf))
| ~ sdtlseqdt0(X8,X9)
| sdtlseqdt0(sdtlpdtrp0(xf,X8),sdtlpdtrp0(xf,X9)) )
& isMonotone0(xf)
& szDzozmdt0(xf) = szRzazndt0(xf)
& szRzazndt0(xf) = xU
& isOn0(xf,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])])])])])]) ).
fof(c_0_10,hypothesis,
! [X12,X13,X14] :
( aSet0(xP)
& ( aElementOf0(X12,xU)
| ~ aElementOf0(X12,xP) )
& ( sdtlseqdt0(sdtlpdtrp0(xf,X12),X12)
| ~ aElementOf0(X12,xP) )
& ( ~ aElementOf0(X13,xT)
| sdtlseqdt0(X13,X12)
| ~ aElementOf0(X12,xP) )
& ( aUpperBoundOfIn0(X12,xT,xU)
| ~ aElementOf0(X12,xP) )
& ( aElementOf0(esk2_1(X14),xT)
| ~ aElementOf0(X14,xU)
| ~ sdtlseqdt0(sdtlpdtrp0(xf,X14),X14)
| aElementOf0(X14,xP) )
& ( ~ sdtlseqdt0(esk2_1(X14),X14)
| ~ aElementOf0(X14,xU)
| ~ sdtlseqdt0(sdtlpdtrp0(xf,X14),X14)
| aElementOf0(X14,xP) )
& ( ~ aUpperBoundOfIn0(X14,xT,xU)
| ~ aElementOf0(X14,xU)
| ~ sdtlseqdt0(sdtlpdtrp0(xf,X14),X14)
| aElementOf0(X14,xP) )
& xP = cS1241(xU,xf,xT) ),
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])])])])])])]) ).
cnf(c_0_11,negated_conjecture,
~ aInfimumOfIn0(X1,xP,xU),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( aInfimumOfIn0(esk15_1(X1),X1,xU)
| ~ epred1_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,hypothesis,
( aElementOf0(esk1_1(X1),X1)
| epred1_1(X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,hypothesis,
aSet0(xP),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
~ epred1_1(xP),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,hypothesis,
( aElementOf0(X1,xU)
| ~ aElementOf0(X1,xP) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,hypothesis,
aElementOf0(esk1_1(xP),xP),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_18,hypothesis,
( epred1_1(X1)
| ~ aElementOf0(esk1_1(X1),xU)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,hypothesis,
aElementOf0(esk1_1(xP),xU),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_14])]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : LAT385+4 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n002.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Fri May 3 08:38:42 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running first-order model finding
% 0.16/0.42 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.hgugBRnCe8/E---3.1_9320.p
% 0.16/0.45 # Version: 3.1.0
% 0.16/0.45 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 # Starting sh5l with 300s (1) cores
% 0.16/0.45 # new_bool_1 with pid 9401 completed with status 0
% 0.16/0.45 # Result found by new_bool_1
% 0.16/0.45 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.45 # Search class: FGHSF-FFMM31-SFFFFFNN
% 0.16/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 0.16/0.45 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with pid 9404 completed with status 0
% 0.16/0.45 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
% 0.16/0.45 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.45 # Search class: FGHSF-FFMM31-SFFFFFNN
% 0.16/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 0.16/0.45 # Preprocessing time : 0.003 s
% 0.16/0.45 # Presaturation interreduction done
% 0.16/0.45
% 0.16/0.45 # Proof found!
% 0.16/0.45 # SZS status Theorem
% 0.16/0.45 # SZS output start CNFRefutation
% See solution above
% 0.16/0.45 # Parsed axioms : 28
% 0.16/0.45 # Removed by relevancy pruning/SinE : 7
% 0.16/0.45 # Initial clauses : 102
% 0.16/0.45 # Removed in clause preprocessing : 2
% 0.16/0.45 # Initial clauses in saturation : 100
% 0.16/0.45 # Processed clauses : 184
% 0.16/0.45 # ...of these trivial : 0
% 0.16/0.45 # ...subsumed : 7
% 0.16/0.45 # ...remaining for further processing : 177
% 0.16/0.45 # Other redundant clauses eliminated : 1
% 0.16/0.45 # Clauses deleted for lack of memory : 0
% 0.16/0.45 # Backward-subsumed : 2
% 0.16/0.45 # Backward-rewritten : 0
% 0.16/0.45 # Generated clauses : 72
% 0.16/0.45 # ...of the previous two non-redundant : 63
% 0.16/0.45 # ...aggressively subsumed : 0
% 0.16/0.45 # Contextual simplify-reflections : 12
% 0.16/0.45 # Paramodulations : 71
% 0.16/0.45 # Factorizations : 0
% 0.16/0.45 # NegExts : 0
% 0.16/0.45 # Equation resolutions : 1
% 0.16/0.45 # Disequality decompositions : 0
% 0.16/0.45 # Total rewrite steps : 33
% 0.16/0.45 # ...of those cached : 25
% 0.16/0.45 # Propositional unsat checks : 0
% 0.16/0.45 # Propositional check models : 0
% 0.16/0.45 # Propositional check unsatisfiable : 0
% 0.16/0.45 # Propositional clauses : 0
% 0.16/0.45 # Propositional clauses after purity: 0
% 0.16/0.45 # Propositional unsat core size : 0
% 0.16/0.45 # Propositional preprocessing time : 0.000
% 0.16/0.45 # Propositional encoding time : 0.000
% 0.16/0.45 # Propositional solver time : 0.000
% 0.16/0.45 # Success case prop preproc time : 0.000
% 0.16/0.45 # Success case prop encoding time : 0.000
% 0.16/0.45 # Success case prop solver time : 0.000
% 0.16/0.45 # Current number of processed clauses : 74
% 0.16/0.45 # Positive orientable unit clauses : 15
% 0.16/0.45 # Positive unorientable unit clauses: 0
% 0.16/0.45 # Negative unit clauses : 3
% 0.16/0.45 # Non-unit-clauses : 56
% 0.16/0.45 # Current number of unprocessed clauses: 77
% 0.16/0.45 # ...number of literals in the above : 289
% 0.16/0.45 # Current number of archived formulas : 0
% 0.16/0.45 # Current number of archived clauses : 102
% 0.16/0.45 # Clause-clause subsumption calls (NU) : 2786
% 0.16/0.45 # Rec. Clause-clause subsumption calls : 1445
% 0.16/0.45 # Non-unit clause-clause subsumptions : 19
% 0.16/0.45 # Unit Clause-clause subsumption calls : 32
% 0.16/0.45 # Rewrite failures with RHS unbound : 0
% 0.16/0.45 # BW rewrite match attempts : 0
% 0.16/0.45 # BW rewrite match successes : 0
% 0.16/0.45 # Condensation attempts : 0
% 0.16/0.45 # Condensation successes : 0
% 0.16/0.45 # Termbank termtop insertions : 9061
% 0.16/0.45 # Search garbage collected termcells : 1923
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.016 s
% 0.16/0.45 # System time : 0.002 s
% 0.16/0.45 # Total time : 0.018 s
% 0.16/0.45 # Maximum resident set size: 2044 pages
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.017 s
% 0.16/0.45 # System time : 0.004 s
% 0.16/0.45 # Total time : 0.021 s
% 0.16/0.45 # Maximum resident set size: 1740 pages
% 0.16/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------