TSTP Solution File: NUM543+2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NUM543+2 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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 : Tue May 21 01:26:48 EDT 2024
% Result : Theorem 8.11s 1.51s
% Output : CNFRefutation 8.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 42 ( 8 unt; 0 def)
% Number of atoms : 179 ( 32 equ)
% Maximal formula atoms : 23 ( 4 avg)
% Number of connectives : 228 ( 91 ~; 84 |; 35 &)
% ( 6 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 63 ( 2 sgn 30 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefMax,axiom,
! [X1] :
( ( aSubsetOf0(X1,szNzAzT0)
& isFinite0(X1)
& X1 != slcrc0 )
=> ! [X2] :
( X2 = szmzazxdt0(X1)
<=> ( aElementOf0(X2,X1)
& ! [X3] :
( aElementOf0(X3,X1)
=> sdtlseqdt0(X3,X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefMax) ).
fof(m__,conjecture,
? [X1] :
( aElementOf0(X1,szNzAzT0)
& ( ( aSet0(slbdtrb0(X1))
& ! [X2] :
( aElementOf0(X2,slbdtrb0(X1))
<=> ( aElementOf0(X2,szNzAzT0)
& sdtlseqdt0(szszuzczcdt0(X2),X1) ) ) )
=> ( ! [X2] :
( aElementOf0(X2,xS)
=> aElementOf0(X2,slbdtrb0(X1)) )
| aSubsetOf0(xS,slbdtrb0(X1)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mSuccNum,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( aElementOf0(szszuzczcdt0(X1),szNzAzT0)
& szszuzczcdt0(X1) != sz00 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSuccNum) ).
fof(mDefEmp,axiom,
! [X1] :
( X1 = slcrc0
<=> ( aSet0(X1)
& ~ ? [X2] : aElementOf0(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefEmp) ).
fof(mSuccLess,axiom,
! [X1,X2] :
( ( aElementOf0(X1,szNzAzT0)
& aElementOf0(X2,szNzAzT0) )
=> ( sdtlseqdt0(X1,X2)
<=> sdtlseqdt0(szszuzczcdt0(X1),szszuzczcdt0(X2)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSuccLess) ).
fof(m__1986,hypothesis,
( aSet0(xS)
& ! [X1] :
( aElementOf0(X1,xS)
=> aElementOf0(X1,szNzAzT0) )
& aSubsetOf0(xS,szNzAzT0)
& isFinite0(xS) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1986) ).
fof(mZeroNum,axiom,
aElementOf0(sz00,szNzAzT0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mZeroNum) ).
fof(c_0_7,plain,
! [X1] :
( ( aSubsetOf0(X1,szNzAzT0)
& isFinite0(X1)
& X1 != slcrc0 )
=> ! [X2] :
( X2 = szmzazxdt0(X1)
<=> ( aElementOf0(X2,X1)
& ! [X3] :
( aElementOf0(X3,X1)
=> sdtlseqdt0(X3,X2) ) ) ) ),
inference(fof_simplification,[status(thm)],[mDefMax]) ).
fof(c_0_8,negated_conjecture,
~ ? [X1] :
( aElementOf0(X1,szNzAzT0)
& ( ( aSet0(slbdtrb0(X1))
& ! [X2] :
( aElementOf0(X2,slbdtrb0(X1))
<=> ( aElementOf0(X2,szNzAzT0)
& sdtlseqdt0(szszuzczcdt0(X2),X1) ) ) )
=> ( ! [X2] :
( aElementOf0(X2,xS)
=> aElementOf0(X2,slbdtrb0(X1)) )
| aSubsetOf0(xS,slbdtrb0(X1)) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_9,plain,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( aElementOf0(szszuzczcdt0(X1),szNzAzT0)
& szszuzczcdt0(X1) != sz00 ) ),
inference(fof_simplification,[status(thm)],[mSuccNum]) ).
fof(c_0_10,plain,
! [X97,X98,X99,X100] :
( ( aElementOf0(X98,X97)
| X98 != szmzazxdt0(X97)
| ~ aSubsetOf0(X97,szNzAzT0)
| ~ isFinite0(X97)
| X97 = slcrc0 )
& ( ~ aElementOf0(X99,X97)
| sdtlseqdt0(X99,X98)
| X98 != szmzazxdt0(X97)
| ~ aSubsetOf0(X97,szNzAzT0)
| ~ isFinite0(X97)
| X97 = slcrc0 )
& ( aElementOf0(esk8_2(X97,X100),X97)
| ~ aElementOf0(X100,X97)
| X100 = szmzazxdt0(X97)
| ~ aSubsetOf0(X97,szNzAzT0)
| ~ isFinite0(X97)
| X97 = slcrc0 )
& ( ~ sdtlseqdt0(esk8_2(X97,X100),X100)
| ~ aElementOf0(X100,X97)
| X100 = szmzazxdt0(X97)
| ~ aSubsetOf0(X97,szNzAzT0)
| ~ isFinite0(X97)
| X97 = slcrc0 ) ),
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_7])])])])])])]) ).
fof(c_0_11,plain,
! [X10,X11,X12] :
( ( aSet0(X10)
| X10 != slcrc0 )
& ( ~ aElementOf0(X11,X10)
| X10 != slcrc0 )
& ( ~ aSet0(X12)
| aElementOf0(esk1_1(X12),X12)
| X12 = slcrc0 ) ),
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)],[mDefEmp])])])])])])]) ).
fof(c_0_12,negated_conjecture,
! [X116,X117,X118] :
( ( aSet0(slbdtrb0(X116))
| ~ aElementOf0(X116,szNzAzT0) )
& ( aElementOf0(X117,szNzAzT0)
| ~ aElementOf0(X117,slbdtrb0(X116))
| ~ aElementOf0(X116,szNzAzT0) )
& ( sdtlseqdt0(szszuzczcdt0(X117),X116)
| ~ aElementOf0(X117,slbdtrb0(X116))
| ~ aElementOf0(X116,szNzAzT0) )
& ( ~ aElementOf0(X118,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X118),X116)
| aElementOf0(X118,slbdtrb0(X116))
| ~ aElementOf0(X116,szNzAzT0) )
& ( aElementOf0(esk10_1(X116),xS)
| ~ aElementOf0(X116,szNzAzT0) )
& ( ~ aElementOf0(esk10_1(X116),slbdtrb0(X116))
| ~ aElementOf0(X116,szNzAzT0) )
& ( ~ aSubsetOf0(xS,slbdtrb0(X116))
| ~ aElementOf0(X116,szNzAzT0) ) ),
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_8])])])])])])]) ).
fof(c_0_13,plain,
! [X66,X67] :
( ( ~ sdtlseqdt0(X66,X67)
| sdtlseqdt0(szszuzczcdt0(X66),szszuzczcdt0(X67))
| ~ aElementOf0(X66,szNzAzT0)
| ~ aElementOf0(X67,szNzAzT0) )
& ( ~ sdtlseqdt0(szszuzczcdt0(X66),szszuzczcdt0(X67))
| sdtlseqdt0(X66,X67)
| ~ aElementOf0(X66,szNzAzT0)
| ~ aElementOf0(X67,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSuccLess])])])]) ).
fof(c_0_14,plain,
! [X56] :
( ( aElementOf0(szszuzczcdt0(X56),szNzAzT0)
| ~ aElementOf0(X56,szNzAzT0) )
& ( szszuzczcdt0(X56) != sz00
| ~ aElementOf0(X56,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
cnf(c_0_15,plain,
( sdtlseqdt0(X1,X3)
| X2 = slcrc0
| ~ aElementOf0(X1,X2)
| X3 != szmzazxdt0(X2)
| ~ aSubsetOf0(X2,szNzAzT0)
| ~ isFinite0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( ~ aElementOf0(X1,X2)
| X2 != slcrc0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_17,hypothesis,
! [X115] :
( aSet0(xS)
& ( ~ aElementOf0(X115,xS)
| aElementOf0(X115,szNzAzT0) )
& aSubsetOf0(xS,szNzAzT0)
& isFinite0(xS) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__1986])])])]) ).
cnf(c_0_18,negated_conjecture,
( aElementOf0(esk10_1(X1),xS)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,negated_conjecture,
( aElementOf0(X1,slbdtrb0(X2))
| ~ aElementOf0(X1,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X1),X2)
| ~ aElementOf0(X2,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( sdtlseqdt0(szszuzczcdt0(X1),szszuzczcdt0(X2))
| ~ sdtlseqdt0(X1,X2)
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
( aElementOf0(szszuzczcdt0(X1),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
( sdtlseqdt0(X1,X2)
| X2 != szmzazxdt0(X3)
| ~ aSubsetOf0(X3,szNzAzT0)
| ~ isFinite0(X3)
| ~ aElementOf0(X1,X3) ),
inference(csr,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,hypothesis,
aSubsetOf0(xS,szNzAzT0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,hypothesis,
isFinite0(xS),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,negated_conjecture,
( xS != slcrc0
| ~ aElementOf0(X1,szNzAzT0) ),
inference(spm,[status(thm)],[c_0_16,c_0_18]) ).
cnf(c_0_26,plain,
aElementOf0(sz00,szNzAzT0),
inference(split_conjunct,[status(thm)],[mZeroNum]) ).
cnf(c_0_27,negated_conjecture,
( ~ aElementOf0(esk10_1(X1),slbdtrb0(X1))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_28,negated_conjecture,
( aElementOf0(X1,slbdtrb0(szszuzczcdt0(X2)))
| ~ sdtlseqdt0(X1,X2)
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_29,hypothesis,
( sdtlseqdt0(X1,X2)
| X2 != szmzazxdt0(xS)
| ~ aElementOf0(X1,xS) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_30,plain,
( aElementOf0(X1,X2)
| X2 = slcrc0
| X1 != szmzazxdt0(X2)
| ~ aSubsetOf0(X2,szNzAzT0)
| ~ isFinite0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_31,negated_conjecture,
xS != slcrc0,
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,negated_conjecture,
( ~ sdtlseqdt0(esk10_1(szszuzczcdt0(X1)),X1)
| ~ aElementOf0(esk10_1(szszuzczcdt0(X1)),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_21]) ).
cnf(c_0_33,negated_conjecture,
( sdtlseqdt0(esk10_1(X1),X2)
| X2 != szmzazxdt0(xS)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(spm,[status(thm)],[c_0_29,c_0_18]) ).
cnf(c_0_34,hypothesis,
( aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X1,xS) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_35,hypothesis,
( aElementOf0(X1,xS)
| X1 != szmzazxdt0(xS) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_23]),c_0_24])]),c_0_31]) ).
cnf(c_0_36,negated_conjecture,
( X1 != szmzazxdt0(xS)
| ~ aElementOf0(esk10_1(szszuzczcdt0(X1)),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_21]) ).
cnf(c_0_37,hypothesis,
( aElementOf0(esk10_1(X1),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(spm,[status(thm)],[c_0_34,c_0_18]) ).
cnf(c_0_38,hypothesis,
aElementOf0(szmzazxdt0(xS),xS),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_39,hypothesis,
( X1 != szmzazxdt0(xS)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_21]) ).
cnf(c_0_40,hypothesis,
aElementOf0(szmzazxdt0(xS),szNzAzT0),
inference(spm,[status(thm)],[c_0_34,c_0_38]) ).
cnf(c_0_41,hypothesis,
$false,
inference(spm,[status(thm)],[c_0_39,c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM543+2 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n003.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 06:35:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 8.11/1.51 # Version: 3.1.0
% 8.11/1.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 8.11/1.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.11/1.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 8.11/1.51 # Starting new_bool_3 with 300s (1) cores
% 8.11/1.51 # Starting new_bool_1 with 300s (1) cores
% 8.11/1.51 # Starting sh5l with 300s (1) cores
% 8.11/1.51 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 26943 completed with status 0
% 8.11/1.51 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 8.11/1.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 8.11/1.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.11/1.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 8.11/1.51 # No SInE strategy applied
% 8.11/1.51 # Search class: FGHSF-FFMM31-MFFFFFNN
% 8.11/1.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 8.11/1.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 811s (1) cores
% 8.11/1.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 8.11/1.51 # Starting new_bool_3 with 136s (1) cores
% 8.11/1.51 # Starting new_bool_1 with 136s (1) cores
% 8.11/1.51 # Starting sh5l with 136s (1) cores
% 8.11/1.51 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 26950 completed with status 0
% 8.11/1.51 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 8.11/1.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 8.11/1.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.11/1.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 8.11/1.51 # No SInE strategy applied
% 8.11/1.51 # Search class: FGHSF-FFMM31-MFFFFFNN
% 8.11/1.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 8.11/1.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 811s (1) cores
% 8.11/1.51 # Preprocessing time : 0.004 s
% 8.11/1.51
% 8.11/1.51 # Proof found!
% 8.11/1.51 # SZS status Theorem
% 8.11/1.51 # SZS output start CNFRefutation
% See solution above
% 8.11/1.51 # Parsed axioms : 56
% 8.11/1.51 # Removed by relevancy pruning/SinE : 0
% 8.11/1.51 # Initial clauses : 108
% 8.11/1.51 # Removed in clause preprocessing : 6
% 8.11/1.51 # Initial clauses in saturation : 102
% 8.11/1.51 # Processed clauses : 3589
% 8.11/1.51 # ...of these trivial : 30
% 8.11/1.51 # ...subsumed : 1696
% 8.11/1.51 # ...remaining for further processing : 1863
% 8.11/1.51 # Other redundant clauses eliminated : 13
% 8.11/1.51 # Clauses deleted for lack of memory : 0
% 8.11/1.51 # Backward-subsumed : 125
% 8.11/1.51 # Backward-rewritten : 33
% 8.11/1.51 # Generated clauses : 45688
% 8.11/1.51 # ...of the previous two non-redundant : 44615
% 8.11/1.51 # ...aggressively subsumed : 0
% 8.11/1.51 # Contextual simplify-reflections : 659
% 8.11/1.51 # Paramodulations : 45500
% 8.11/1.51 # Factorizations : 71
% 8.11/1.51 # NegExts : 0
% 8.11/1.51 # Equation resolutions : 103
% 8.11/1.51 # Disequality decompositions : 0
% 8.11/1.51 # Total rewrite steps : 10655
% 8.11/1.51 # ...of those cached : 10574
% 8.11/1.51 # Propositional unsat checks : 0
% 8.11/1.51 # Propositional check models : 0
% 8.11/1.51 # Propositional check unsatisfiable : 0
% 8.11/1.51 # Propositional clauses : 0
% 8.11/1.51 # Propositional clauses after purity: 0
% 8.11/1.51 # Propositional unsat core size : 0
% 8.11/1.51 # Propositional preprocessing time : 0.000
% 8.11/1.51 # Propositional encoding time : 0.000
% 8.11/1.51 # Propositional solver time : 0.000
% 8.11/1.51 # Success case prop preproc time : 0.000
% 8.11/1.51 # Success case prop encoding time : 0.000
% 8.11/1.51 # Success case prop solver time : 0.000
% 8.11/1.51 # Current number of processed clauses : 1688
% 8.11/1.51 # Positive orientable unit clauses : 88
% 8.11/1.51 # Positive unorientable unit clauses: 0
% 8.11/1.51 # Negative unit clauses : 54
% 8.11/1.51 # Non-unit-clauses : 1546
% 8.11/1.51 # Current number of unprocessed clauses: 40864
% 8.11/1.51 # ...number of literals in the above : 216721
% 8.11/1.51 # Current number of archived formulas : 0
% 8.11/1.51 # Current number of archived clauses : 172
% 8.11/1.51 # Clause-clause subsumption calls (NU) : 489390
% 8.11/1.51 # Rec. Clause-clause subsumption calls : 79764
% 8.11/1.51 # Non-unit clause-clause subsumptions : 1718
% 8.11/1.51 # Unit Clause-clause subsumption calls : 12187
% 8.11/1.51 # Rewrite failures with RHS unbound : 0
% 8.11/1.51 # BW rewrite match attempts : 42
% 8.11/1.51 # BW rewrite match successes : 18
% 8.11/1.51 # Condensation attempts : 0
% 8.11/1.51 # Condensation successes : 0
% 8.11/1.51 # Termbank termtop insertions : 1267012
% 8.11/1.51 # Search garbage collected termcells : 2152
% 8.11/1.51
% 8.11/1.51 # -------------------------------------------------
% 8.11/1.51 # User time : 0.946 s
% 8.11/1.51 # System time : 0.033 s
% 8.11/1.51 # Total time : 0.979 s
% 8.11/1.51 # Maximum resident set size: 2076 pages
% 8.11/1.51
% 8.11/1.51 # -------------------------------------------------
% 8.11/1.51 # User time : 4.866 s
% 8.11/1.51 # System time : 0.077 s
% 8.11/1.51 # Total time : 4.943 s
% 8.11/1.51 # Maximum resident set size: 1752 pages
% 8.11/1.51 % E---3.1 exiting
%------------------------------------------------------------------------------