TSTP Solution File: LCL303-3 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : LCL303-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:27:09 EDT 2024
% Result : Unsatisfiable 21.98s 3.26s
% Output : CNFRefutation 21.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 11
% Syntax : Number of clauses : 76 ( 35 unt; 0 nHn; 38 RR)
% Number of literals : 133 ( 7 equ; 66 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 12 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 151 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_2,axiom,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
file('/export/starexec/sandbox/tmp/tmp.czBPXxut0x/E---3.1_7928.p',rule_2) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox/tmp/tmp.czBPXxut0x/E---3.1_7928.p',implies_definition) ).
cnf(rule_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox/tmp/tmp.czBPXxut0x/E---3.1_7928.p',rule_1) ).
cnf(axiom_1_5,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
file('/export/starexec/sandbox/tmp/tmp.czBPXxut0x/E---3.1_7928.p',axiom_1_5) ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X1,X1),X1)),
file('/export/starexec/sandbox/tmp/tmp.czBPXxut0x/E---3.1_7928.p',axiom_1_2) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
file('/export/starexec/sandbox/tmp/tmp.czBPXxut0x/E---3.1_7928.p',axiom_1_6) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
file('/export/starexec/sandbox/tmp/tmp.czBPXxut0x/E---3.1_7928.p',axiom_1_4) ).
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))),
file('/export/starexec/sandbox/tmp/tmp.czBPXxut0x/E---3.1_7928.p',axiom_1_3) ).
cnf(prove_this,negated_conjecture,
~ theorem(equivalent(implies(p,q),equivalent(q,or(p,q)))),
file('/export/starexec/sandbox/tmp/tmp.czBPXxut0x/E---3.1_7928.p',prove_this) ).
cnf(equivalent_defn,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
file('/export/starexec/sandbox/tmp/tmp.czBPXxut0x/E---3.1_7928.p',equivalent_defn) ).
cnf(and_defn,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox/tmp/tmp.czBPXxut0x/E---3.1_7928.p',and_defn) ).
cnf(c_0_11,plain,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
inference(fof_simplification,[status(thm)],[rule_2]) ).
cnf(c_0_12,plain,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
c_0_11 ).
cnf(c_0_13,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_14,plain,
( theorem(X1)
| ~ axiom(X1) ),
inference(fof_simplification,[status(thm)],[rule_1]) ).
cnf(c_0_15,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ theorem(or(not(X2),X1)) ),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( theorem(X1)
| ~ axiom(X1) ),
c_0_14 ).
cnf(c_0_17,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_18,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ axiom(or(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
inference(rw,[status(thm)],[c_0_17,c_0_13]) ).
cnf(c_0_20,axiom,
axiom(implies(or(X1,X1),X1)),
axiom_1_2 ).
cnf(c_0_21,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
axiom(or(not(or(X1,X1)),X1)),
inference(rw,[status(thm)],[c_0_20,c_0_13]) ).
cnf(c_0_23,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_24,plain,
( theorem(or(X1,or(X2,X3)))
| ~ axiom(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_21,c_0_16]) ).
cnf(c_0_25,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_26,plain,
( theorem(X1)
| ~ theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_22]) ).
cnf(c_0_27,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_28,plain,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_13]),c_0_13]),c_0_13]) ).
cnf(c_0_29,plain,
( theorem(or(X1,X2))
| ~ theorem(X3)
| ~ axiom(or(X1,or(not(X3),X2))) ),
inference(spm,[status(thm)],[c_0_15,c_0_24]) ).
cnf(c_0_30,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(rw,[status(thm)],[c_0_25,c_0_13]) ).
cnf(c_0_31,plain,
( theorem(or(X1,X2))
| ~ axiom(or(X1,or(or(X1,X2),X2))) ),
inference(spm,[status(thm)],[c_0_26,c_0_24]) ).
cnf(c_0_32,plain,
axiom(or(not(X1),or(X2,X1))),
inference(rw,[status(thm)],[c_0_27,c_0_13]) ).
cnf(c_0_33,plain,
( theorem(or(not(or(X1,X2)),or(X1,X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_18,c_0_28]) ).
cnf(c_0_34,negated_conjecture,
~ theorem(equivalent(implies(p,q),equivalent(q,or(p,q)))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_35,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
equivalent_defn ).
cnf(c_0_36,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_defn ).
cnf(c_0_37,plain,
( theorem(or(not(or(X1,not(X2))),X1))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_38,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_30]) ).
cnf(c_0_39,plain,
theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_40,plain,
( theorem(or(X1,X2))
| ~ theorem(or(not(X3),X2))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_15,c_0_33]) ).
cnf(c_0_41,negated_conjecture,
~ theorem(equivalent(implies(p,q),equivalent(q,or(p,q)))),
c_0_34 ).
cnf(c_0_42,plain,
equivalent(X1,X2) = not(or(not(or(not(X1),X2)),not(or(not(X2),X1)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_13]),c_0_13]),c_0_36]) ).
cnf(c_0_43,plain,
( theorem(X1)
| ~ theorem(or(X1,not(X2)))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_37]) ).
cnf(c_0_44,plain,
theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X1,X4))
| ~ axiom(or(X2,or(not(X4),X3))) ),
inference(spm,[status(thm)],[c_0_40,c_0_24]) ).
cnf(c_0_46,negated_conjecture,
~ theorem(not(or(not(or(not(or(not(p),q)),not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q)))))),not(or(not(not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q))))),or(not(p),q)))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_13]),c_0_42]),c_0_42]) ).
cnf(c_0_47,plain,
( theorem(not(or(not(X1),not(X2))))
| ~ theorem(X1)
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_43,c_0_37]) ).
cnf(c_0_48,plain,
( theorem(or(X1,not(not(X2))))
| ~ theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_40,c_0_44]) ).
cnf(c_0_49,plain,
( theorem(or(X1,or(not(X2),X2)))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_45,c_0_32]) ).
cnf(c_0_50,negated_conjecture,
( ~ theorem(or(not(or(not(p),q)),not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q))))))
| ~ theorem(or(not(not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q))))),or(not(p),q))) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_51,plain,
( theorem(or(not(not(X1)),X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_38,c_0_48]) ).
cnf(c_0_52,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,or(X2,not(X3))))
| ~ theorem(X3) ),
inference(spm,[status(thm)],[c_0_40,c_0_37]) ).
cnf(c_0_53,plain,
( theorem(or(X1,or(not(or(X2,not(X3))),X2)))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_45,c_0_30]) ).
cnf(c_0_54,plain,
theorem(or(X1,or(not(X2),X2))),
inference(spm,[status(thm)],[c_0_49,c_0_44]) ).
cnf(c_0_55,plain,
( theorem(or(X1,X2))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_32]) ).
cnf(c_0_56,plain,
( theorem(or(X1,or(not(or(X1,X2)),X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_21,c_0_33]) ).
cnf(c_0_57,negated_conjecture,
( ~ theorem(or(not(or(not(p),q)),not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q))))))
| ~ theorem(or(or(not(p),q),or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q))))) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_58,plain,
( theorem(or(X1,not(or(not(X2),not(X3)))))
| ~ theorem(or(X1,X3))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_59,plain,
theorem(or(not(X1),or(X2,X1))),
inference(spm,[status(thm)],[c_0_21,c_0_54]) ).
cnf(c_0_60,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_21,c_0_55]) ).
cnf(c_0_61,plain,
( theorem(or(X1,or(not(or(not(X2),X3)),X4)))
| ~ theorem(or(not(X3),X4))
| ~ theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_40,c_0_56]) ).
cnf(c_0_62,negated_conjecture,
( ~ theorem(or(or(not(p),q),or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q)))))
| ~ theorem(or(not(or(not(p),q)),or(not(or(p,q)),q))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59])]) ).
cnf(c_0_63,plain,
( theorem(or(X1,X2))
| ~ theorem(or(or(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_60]) ).
cnf(c_0_64,plain,
( theorem(or(or(not(or(not(X1),X2)),X3),X4))
| ~ theorem(or(not(X2),X3))
| ~ theorem(or(X4,X1)) ),
inference(spm,[status(thm)],[c_0_38,c_0_61]) ).
cnf(c_0_65,plain,
theorem(or(X1,or(not(or(X1,X2)),X2))),
inference(spm,[status(thm)],[c_0_21,c_0_39]) ).
cnf(c_0_66,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,X3))
| ~ axiom(or(not(X3),X2)) ),
inference(spm,[status(thm)],[c_0_40,c_0_16]) ).
cnf(c_0_67,negated_conjecture,
( ~ theorem(or(not(or(not(p),q)),or(not(or(p,q)),q)))
| ~ theorem(or(or(not(p),q),not(or(not(or(p,q)),q)))) ),
inference(spm,[status(thm)],[c_0_62,c_0_60]) ).
cnf(c_0_68,plain,
( theorem(or(not(or(not(X1),X2)),X3))
| ~ theorem(or(not(X2),X3))
| ~ theorem(or(X3,X1)) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_69,plain,
theorem(or(or(not(or(X1,X2)),X2),X1)),
inference(spm,[status(thm)],[c_0_38,c_0_65]) ).
cnf(c_0_70,plain,
( theorem(or(not(or(not(X1),X2)),or(X3,X2)))
| ~ theorem(or(X3,X1)) ),
inference(spm,[status(thm)],[c_0_29,c_0_28]) ).
cnf(c_0_71,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X1,or(X3,X2))) ),
inference(spm,[status(thm)],[c_0_66,c_0_30]) ).
cnf(c_0_72,negated_conjecture,
~ theorem(or(or(not(p),q),not(or(not(or(p,q)),q)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_59]),c_0_69])]) ).
cnf(c_0_73,plain,
( theorem(or(or(X1,X2),not(or(not(X3),X2))))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_38,c_0_70]) ).
cnf(c_0_74,plain,
theorem(or(not(X1),or(X1,X2))),
inference(spm,[status(thm)],[c_0_71,c_0_59]) ).
cnf(c_0_75,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_74])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL303-3 : TPTP v8.1.2. Released v2.3.0.
% 0.13/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n012.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri May 3 08:42:25 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/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/tmp/tmp.czBPXxut0x/E---3.1_7928.p
% 21.98/3.26 # Version: 3.1.0
% 21.98/3.26 # Preprocessing class: FSSSSMSSSSSNFFN.
% 21.98/3.26 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 21.98/3.26 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 21.98/3.26 # Starting new_bool_3 with 300s (1) cores
% 21.98/3.26 # Starting new_bool_1 with 300s (1) cores
% 21.98/3.26 # Starting sh5l with 300s (1) cores
% 21.98/3.26 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 8005 completed with status 0
% 21.98/3.26 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 21.98/3.26 # Preprocessing class: FSSSSMSSSSSNFFN.
% 21.98/3.26 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 21.98/3.26 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 21.98/3.26 # No SInE strategy applied
% 21.98/3.26 # Search class: FHUNM-FFSF21-DFFFFFNN
% 21.98/3.26 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 21.98/3.26 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 395s (1) cores
% 21.98/3.26 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 334s (1) cores
% 21.98/3.26 # Starting new_bool_3 with 329s (1) cores
% 21.98/3.26 # Starting new_bool_1 with 324s (1) cores
% 21.98/3.26 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 118s (1) cores
% 21.98/3.26 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 8009 completed with status 0
% 21.98/3.26 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 21.98/3.26 # Preprocessing class: FSSSSMSSSSSNFFN.
% 21.98/3.26 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 21.98/3.26 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 21.98/3.26 # No SInE strategy applied
% 21.98/3.26 # Search class: FHUNM-FFSF21-DFFFFFNN
% 21.98/3.26 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 21.98/3.26 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 395s (1) cores
% 21.98/3.26 # Preprocessing time : 0.068 s
% 21.98/3.26
% 21.98/3.26 # Proof found!
% 21.98/3.26 # SZS status Unsatisfiable
% 21.98/3.26 # SZS output start CNFRefutation
% See solution above
% 21.98/3.26 # Parsed axioms : 11
% 21.98/3.26 # Removed by relevancy pruning/SinE : 0
% 21.98/3.26 # Initial clauses : 11
% 21.98/3.26 # Removed in clause preprocessing : 3
% 21.98/3.26 # Initial clauses in saturation : 8
% 21.98/3.26 # Processed clauses : 6392
% 21.98/3.26 # ...of these trivial : 26
% 21.98/3.26 # ...subsumed : 3637
% 21.98/3.26 # ...remaining for further processing : 2729
% 21.98/3.26 # Other redundant clauses eliminated : 0
% 21.98/3.26 # Clauses deleted for lack of memory : 0
% 21.98/3.26 # Backward-subsumed : 1072
% 21.98/3.26 # Backward-rewritten : 69
% 21.98/3.26 # Generated clauses : 99627
% 21.98/3.26 # ...of the previous two non-redundant : 98933
% 21.98/3.26 # ...aggressively subsumed : 0
% 21.98/3.26 # Contextual simplify-reflections : 55
% 21.98/3.26 # Paramodulations : 99627
% 21.98/3.26 # Factorizations : 0
% 21.98/3.26 # NegExts : 0
% 21.98/3.26 # Equation resolutions : 0
% 21.98/3.26 # Disequality decompositions : 0
% 21.98/3.26 # Total rewrite steps : 993
% 21.98/3.26 # ...of those cached : 859
% 21.98/3.26 # Propositional unsat checks : 0
% 21.98/3.26 # Propositional check models : 0
% 21.98/3.26 # Propositional check unsatisfiable : 0
% 21.98/3.26 # Propositional clauses : 0
% 21.98/3.26 # Propositional clauses after purity: 0
% 21.98/3.26 # Propositional unsat core size : 0
% 21.98/3.26 # Propositional preprocessing time : 0.000
% 21.98/3.26 # Propositional encoding time : 0.000
% 21.98/3.26 # Propositional solver time : 0.000
% 21.98/3.26 # Success case prop preproc time : 0.000
% 21.98/3.26 # Success case prop encoding time : 0.000
% 21.98/3.26 # Success case prop solver time : 0.000
% 21.98/3.26 # Current number of processed clauses : 1588
% 21.98/3.26 # Positive orientable unit clauses : 35
% 21.98/3.26 # Positive unorientable unit clauses: 0
% 21.98/3.26 # Negative unit clauses : 74
% 21.98/3.26 # Non-unit-clauses : 1479
% 21.98/3.26 # Current number of unprocessed clauses: 91898
% 21.98/3.26 # ...number of literals in the above : 364496
% 21.98/3.26 # Current number of archived formulas : 0
% 21.98/3.26 # Current number of archived clauses : 1144
% 21.98/3.26 # Clause-clause subsumption calls (NU) : 888895
% 21.98/3.26 # Rec. Clause-clause subsumption calls : 624215
% 21.98/3.26 # Non-unit clause-clause subsumptions : 3219
% 21.98/3.26 # Unit Clause-clause subsumption calls : 22395
% 21.98/3.26 # Rewrite failures with RHS unbound : 0
% 21.98/3.26 # BW rewrite match attempts : 2188
% 21.98/3.26 # BW rewrite match successes : 4
% 21.98/3.26 # Condensation attempts : 0
% 21.98/3.26 # Condensation successes : 0
% 21.98/3.26 # Termbank termtop insertions : 2146776
% 21.98/3.26 # Search garbage collected termcells : 11
% 21.98/3.26
% 21.98/3.26 # -------------------------------------------------
% 21.98/3.26 # User time : 2.649 s
% 21.98/3.26 # System time : 0.072 s
% 21.98/3.26 # Total time : 2.721 s
% 21.98/3.26 # Maximum resident set size: 1652 pages
% 21.98/3.26
% 21.98/3.26 # -------------------------------------------------
% 21.98/3.26 # User time : 13.291 s
% 21.98/3.26 # System time : 0.226 s
% 21.98/3.26 # Total time : 13.517 s
% 21.98/3.26 # Maximum resident set size: 1696 pages
% 21.98/3.26 % E---3.1 exiting
%------------------------------------------------------------------------------