%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM465+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n021.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 : 600s
% DateTime : Mon Jul 18 09:32:43 EDT 2022
% Result : Theorem 0.22s 1.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 15
% Syntax : Number of formulae : 62 ( 14 unt; 0 def)
% Number of atoms : 231 ( 70 equ)
% Maximal formula atoms : 28 ( 3 avg)
% Number of connectives : 292 ( 123 ~; 121 |; 31 &)
% ( 2 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 79 ( 1 sgn 40 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefDiff,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( sdtlseqdt0(X1,X2)
=> ! [X3] :
( X3 = sdtmndt0(X2,X1)
<=> ( aNaturalNumber0(X3)
& sdtpldt0(X1,X3) = X2 ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefDiff) ).
fof(mDefLE,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( sdtlseqdt0(X1,X2)
<=> ? [X3] :
( aNaturalNumber0(X3)
& sdtpldt0(X1,X3) = X2 ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefLE) ).
fof(m_AddZero,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( sdtpldt0(X1,sz00) = X1
& X1 = sdtpldt0(sz00,X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m_AddZero) ).
fof(mAddComm,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mAddComm) ).
fof(mSortsC,axiom,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSortsC) ).
fof(mLERefl,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> sdtlseqdt0(X1,X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mLERefl) ).
fof(m__,conjecture,
( xm != sz00
=> sdtlseqdt0(xn,sdtasdt0(xn,xm)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(mMonMul,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> ( ( X1 != sz00
& X2 != X3
& sdtlseqdt0(X2,X3) )
=> ( sdtasdt0(X1,X2) != sdtasdt0(X1,X3)
& sdtlseqdt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
& sdtasdt0(X2,X1) != sdtasdt0(X3,X1)
& sdtlseqdt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1)) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mMonMul) ).
fof(m_MulUnit,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( sdtasdt0(X1,sz10) = X1
& X1 = sdtasdt0(sz10,X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m_MulUnit) ).
fof(m__1007,hypothesis,
( xm != sz00
=> sdtlseqdt0(sz10,xm) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1007) ).
fof(m__987,hypothesis,
( aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__987) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSortsB_02) ).
fof(mMulComm,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mMulComm) ).
fof(mSortsC_01,axiom,
( aNaturalNumber0(sz10)
& sz10 != sz00 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSortsC_01) ).
fof(mLETotal,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( sdtlseqdt0(X1,X2)
| ( X2 != X1
& sdtlseqdt0(X2,X1) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mLETotal) ).
fof(c_0_15,plain,
! [X4,X5,X6,X6] :
( ( aNaturalNumber0(X6)
| X6 != sdtmndt0(X5,X4)
| ~ sdtlseqdt0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( sdtpldt0(X4,X6) = X5
| X6 != sdtmndt0(X5,X4)
| ~ sdtlseqdt0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( ~ aNaturalNumber0(X6)
| sdtpldt0(X4,X6) != X5
| X6 = sdtmndt0(X5,X4)
| ~ sdtlseqdt0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefDiff])])])])])]) ).
fof(c_0_16,plain,
! [X4,X5,X7] :
( ( aNaturalNumber0(esk1_2(X4,X5))
| ~ sdtlseqdt0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( sdtpldt0(X4,esk1_2(X4,X5)) = X5
| ~ sdtlseqdt0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( ~ aNaturalNumber0(X7)
| sdtpldt0(X4,X7) != X5
| sdtlseqdt0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefLE])])])])])])]) ).
cnf(c_0_17,plain,
( X3 = sdtmndt0(X1,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ sdtlseqdt0(X2,X1)
| sdtpldt0(X2,X3) != X1
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,plain,
( sdtlseqdt0(X2,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| sdtpldt0(X2,X3) != X1
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_19,plain,
! [X2] :
( ( sdtpldt0(X2,sz00) = X2
| ~ aNaturalNumber0(X2) )
& ( X2 = sdtpldt0(sz00,X2)
| ~ aNaturalNumber0(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_AddZero])])]) ).
fof(c_0_20,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| sdtpldt0(X3,X4) = sdtpldt0(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddComm])]) ).
cnf(c_0_21,plain,
( X1 = sdtmndt0(X2,X3)
| sdtpldt0(X3,X1) != X2
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2) ),
inference(csr,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
( sdtpldt0(X1,sz00) = X1
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
aNaturalNumber0(sz00),
inference(split_conjunct,[status(thm)],[mSortsC]) ).
fof(c_0_24,plain,
! [X2] :
( ~ aNaturalNumber0(X2)
| sdtlseqdt0(X2,X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLERefl])]) ).
fof(c_0_25,negated_conjecture,
~ ( xm != sz00
=> sdtlseqdt0(xn,sdtasdt0(xn,xm)) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_26,plain,
( sdtpldt0(X1,X2) = sdtpldt0(X2,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
( sdtpldt0(X2,X3) = X1
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ sdtlseqdt0(X2,X1)
| X3 != sdtmndt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_28,plain,
( sdtmndt0(X1,X1) = sz00
| ~ aNaturalNumber0(X1) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])])]) ).
cnf(c_0_29,plain,
( sdtlseqdt0(X1,X1)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_30,negated_conjecture,
( xm != sz00
& ~ sdtlseqdt0(xn,sdtasdt0(xn,xm)) ),
inference(fof_nnf,[status(thm)],[c_0_25]) ).
cnf(c_0_31,plain,
( sdtlseqdt0(X1,X2)
| sdtpldt0(X3,X1) != X2
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_26]) ).
cnf(c_0_32,plain,
( sdtpldt0(X1,X2) = X1
| X2 != sz00
| ~ aNaturalNumber0(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
fof(c_0_33,plain,
! [X4,X5,X6] :
( ( sdtasdt0(X4,X5) != sdtasdt0(X4,X6)
| X4 = sz00
| X5 = X6
| ~ sdtlseqdt0(X5,X6)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6) )
& ( sdtlseqdt0(sdtasdt0(X4,X5),sdtasdt0(X4,X6))
| X4 = sz00
| X5 = X6
| ~ sdtlseqdt0(X5,X6)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6) )
& ( sdtasdt0(X5,X4) != sdtasdt0(X6,X4)
| X4 = sz00
| X5 = X6
| ~ sdtlseqdt0(X5,X6)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6) )
& ( sdtlseqdt0(sdtasdt0(X5,X4),sdtasdt0(X6,X4))
| X4 = sz00
| X5 = X6
| ~ sdtlseqdt0(X5,X6)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMonMul])])]) ).
fof(c_0_34,plain,
! [X2] :
( ( sdtasdt0(X2,sz10) = X2
| ~ aNaturalNumber0(X2) )
& ( X2 = sdtasdt0(sz10,X2)
| ~ aNaturalNumber0(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_MulUnit])])]) ).
fof(c_0_35,hypothesis,
( xm = sz00
| sdtlseqdt0(sz10,xm) ),
inference(fof_nnf,[status(thm)],[m__1007]) ).
cnf(c_0_36,negated_conjecture,
~ sdtlseqdt0(xn,sdtasdt0(xn,xm)),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_37,plain,
( sdtlseqdt0(X1,X2)
| X1 != sz00
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32])]) ).
cnf(c_0_38,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__987]) ).
fof(c_0_39,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| aNaturalNumber0(sdtasdt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])]) ).
fof(c_0_40,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| sdtasdt0(X3,X4) = sdtasdt0(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])]) ).
cnf(c_0_41,plain,
( X2 = X1
| X3 = sz00
| sdtlseqdt0(sdtasdt0(X3,X2),sdtasdt0(X3,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ sdtlseqdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_42,plain,
( sdtasdt0(X1,sz10) = X1
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_43,plain,
aNaturalNumber0(sz10),
inference(split_conjunct,[status(thm)],[mSortsC_01]) ).
cnf(c_0_44,hypothesis,
( sdtlseqdt0(sz10,xm)
| xm = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_45,negated_conjecture,
xm != sz00,
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_46,negated_conjecture,
( sz00 != xn
| ~ aNaturalNumber0(sdtasdt0(xn,xm)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]) ).
cnf(c_0_47,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_48,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__987]) ).
fof(c_0_49,plain,
! [X3,X4] :
( ( X4 != X3
| sdtlseqdt0(X3,X4)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4) )
& ( sdtlseqdt0(X4,X3)
| sdtlseqdt0(X3,X4)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLETotal])])]) ).
cnf(c_0_50,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_51,plain,
( X1 = sz10
| X2 = sz00
| sdtlseqdt0(X2,sdtasdt0(X2,X1))
| ~ sdtlseqdt0(sz10,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]) ).
cnf(c_0_52,hypothesis,
sdtlseqdt0(sz10,xm),
inference(sr,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_53,negated_conjecture,
sz00 != xn,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]),c_0_38])]) ).
cnf(c_0_54,plain,
( sdtlseqdt0(X2,X1)
| sdtlseqdt0(X1,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_55,negated_conjecture,
~ sdtlseqdt0(xn,sdtasdt0(xm,xn)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_50]),c_0_38]),c_0_48])]) ).
cnf(c_0_56,negated_conjecture,
xm = sz10,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_51]),c_0_52]),c_0_38]),c_0_48])]),c_0_53]) ).
cnf(c_0_57,hypothesis,
( sdtlseqdt0(xn,X1)
| sdtlseqdt0(X1,xn)
| ~ aNaturalNumber0(X1) ),
inference(spm,[status(thm)],[c_0_54,c_0_38]) ).
cnf(c_0_58,negated_conjecture,
~ sdtlseqdt0(xn,sdtasdt0(sz10,xn)),
inference(rw,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_59,plain,
( X1 = sdtasdt0(sz10,X1)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_60,hypothesis,
sdtlseqdt0(xn,xn),
inference(spm,[status(thm)],[c_0_57,c_0_38]) ).
cnf(c_0_61,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]),c_0_38])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NUM465+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jul 5 17:34:18 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.22/1.40 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.22/1.40 # Preprocessing time : 0.016 s
% 0.22/1.40
% 0.22/1.40 # Proof found!
% 0.22/1.40 # SZS status Theorem
% 0.22/1.40 # SZS output start CNFRefutation
% See solution above
% 0.22/1.40 # Proof object total steps : 62
% 0.22/1.40 # Proof object clause steps : 34
% 0.22/1.40 # Proof object formula steps : 28
% 0.22/1.40 # Proof object conjectures : 11
% 0.22/1.40 # Proof object clause conjectures : 8
% 0.22/1.40 # Proof object formula conjectures : 3
% 0.22/1.40 # Proof object initial clauses used : 19
% 0.22/1.40 # Proof object initial formulas used : 15
% 0.22/1.40 # Proof object generating inferences : 12
% 0.22/1.40 # Proof object simplifying inferences : 26
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 29
% 0.22/1.40 # Removed by relevancy pruning/SinE : 0
% 0.22/1.40 # Initial clauses : 51
% 0.22/1.40 # Removed in clause preprocessing : 2
% 0.22/1.40 # Initial clauses in saturation : 49
% 0.22/1.40 # Processed clauses : 538
% 0.22/1.40 # ...of these trivial : 6
% 0.22/1.40 # ...subsumed : 295
% 0.22/1.40 # ...remaining for further processing : 237
% 0.22/1.40 # Other redundant clauses eliminated : 41
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 14
% 0.22/1.40 # Backward-rewritten : 59
% 0.22/1.40 # Generated clauses : 3264
% 0.22/1.40 # ...of the previous two non-trivial : 2897
% 0.22/1.40 # Contextual simplify-reflections : 139
% 0.22/1.40 # Paramodulations : 3185
% 0.22/1.40 # Factorizations : 1
% 0.22/1.40 # Equation resolutions : 68
% 0.22/1.40 # Current number of processed clauses : 158
% 0.22/1.40 # Positive orientable unit clauses : 13
% 0.22/1.40 # Positive unorientable unit clauses: 0
% 0.22/1.40 # Negative unit clauses : 5
% 0.22/1.40 # Non-unit-clauses : 140
% 0.22/1.40 # Current number of unprocessed clauses: 2132
% 0.22/1.40 # ...number of literals in the above : 13093
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 75
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 9396
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 3113
% 0.22/1.40 # Non-unit clause-clause subsumptions : 414
% 0.22/1.40 # Unit Clause-clause subsumption calls : 523
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 8
% 0.22/1.40 # BW rewrite match successes : 8
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 60222
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.087 s
% 0.22/1.40 # System time : 0.002 s
% 0.22/1.40 # Total time : 0.089 s
% 0.22/1.40 # Maximum resident set size: 5180 pages
%------------------------------------------------------------------------------