TSTP Solution File: FLD063-3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : FLD063-3 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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 : Mon May 20 19:52:40 EDT 2024
% Result : Unsatisfiable 6.54s 1.34s
% Output : CNFRefutation 6.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 15
% Syntax : Number of clauses : 70 ( 19 unt; 6 nHn; 70 RR)
% Number of literals : 174 ( 0 equ; 103 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 115 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(totality_of_order_relation,axiom,
( less_or_equal(X1,X2)
| less_or_equal(X2,X1)
| ~ defined(X1)
| ~ defined(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',totality_of_order_relation) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined) ).
cnf(antisymmetry_of_order_relation,axiom,
( sum(additive_identity,X1,X2)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',antisymmetry_of_order_relation) ).
cnf(commutativity_addition,axiom,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',commutativity_addition) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).
cnf(compatibility_of_order_relation_and_addition,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X3,X4)
| ~ sum(X3,X5,X1)
| ~ sum(X4,X5,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',compatibility_of_order_relation_and_addition) ).
cnf(existence_of_inverse_addition,axiom,
( sum(additive_inverse(X1),X1,additive_identity)
| ~ defined(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',existence_of_inverse_addition) ).
cnf(totality_of_addition,axiom,
( sum(X1,X2,add(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',totality_of_addition) ).
cnf(existence_of_identity_addition,axiom,
( sum(additive_identity,X1,X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',existence_of_identity_addition) ).
cnf(less_or_equal_3,negated_conjecture,
less_or_equal(additive_inverse(b),additive_inverse(a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_3) ).
cnf(associativity_addition_2,axiom,
( sum(X1,X2,X3)
| ~ sum(X4,X5,X1)
| ~ sum(X5,X2,X6)
| ~ sum(X4,X6,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',associativity_addition_2) ).
cnf(transitivity_of_order_relation,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X1,X3)
| ~ less_or_equal(X3,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',transitivity_of_order_relation) ).
cnf(well_definedness_of_additive_identity,axiom,
defined(additive_identity),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',well_definedness_of_additive_identity) ).
cnf(well_definedness_of_additive_inverse,axiom,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',well_definedness_of_additive_inverse) ).
cnf(not_less_or_equal_4,negated_conjecture,
~ less_or_equal(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_less_or_equal_4) ).
cnf(c_0_15,plain,
( less_or_equal(X1,X2)
| less_or_equal(X2,X1)
| ~ defined(X1)
| ~ defined(X2) ),
inference(fof_simplification,[status(thm)],[totality_of_order_relation]) ).
cnf(c_0_16,plain,
( less_or_equal(X1,X2)
| less_or_equal(X2,X1)
| ~ defined(X1)
| ~ defined(X2) ),
c_0_15 ).
cnf(c_0_17,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_18,plain,
( sum(additive_identity,X1,X2)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(X2,X1) ),
inference(fof_simplification,[status(thm)],[antisymmetry_of_order_relation]) ).
cnf(c_0_19,hypothesis,
( less_or_equal(X1,b)
| less_or_equal(b,X1)
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
inference(fof_simplification,[status(thm)],[commutativity_addition]) ).
cnf(c_0_21,plain,
( sum(additive_identity,X1,X2)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(X2,X1) ),
c_0_18 ).
cnf(c_0_22,hypothesis,
less_or_equal(b,b),
inference(spm,[status(thm)],[c_0_19,c_0_17]) ).
cnf(c_0_23,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_24,plain,
( less_or_equal(X1,X2)
| ~ less_or_equal(X3,X4)
| ~ sum(X3,X5,X1)
| ~ sum(X4,X5,X2) ),
inference(fof_simplification,[status(thm)],[compatibility_of_order_relation_and_addition]) ).
cnf(c_0_25,plain,
( sum(additive_inverse(X1),X1,additive_identity)
| ~ defined(X1) ),
inference(fof_simplification,[status(thm)],[existence_of_inverse_addition]) ).
cnf(c_0_26,plain,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
c_0_20 ).
cnf(c_0_27,hypothesis,
sum(additive_identity,b,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_22])]) ).
cnf(c_0_28,hypothesis,
( less_or_equal(X1,a)
| less_or_equal(a,X1)
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_23]) ).
cnf(c_0_29,plain,
( less_or_equal(X1,X2)
| ~ less_or_equal(X3,X4)
| ~ sum(X3,X5,X1)
| ~ sum(X4,X5,X2) ),
c_0_24 ).
cnf(c_0_30,plain,
( sum(additive_inverse(X1),X1,additive_identity)
| ~ defined(X1) ),
c_0_25 ).
cnf(c_0_31,plain,
( sum(X1,X2,add(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
inference(fof_simplification,[status(thm)],[totality_of_addition]) ).
cnf(c_0_32,hypothesis,
sum(b,additive_identity,b),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,hypothesis,
less_or_equal(a,a),
inference(spm,[status(thm)],[c_0_28,c_0_23]) ).
cnf(c_0_34,plain,
( sum(additive_identity,X1,X1)
| ~ defined(X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_addition]) ).
cnf(c_0_35,plain,
( less_or_equal(X1,additive_identity)
| ~ less_or_equal(X2,additive_inverse(X3))
| ~ defined(X3)
| ~ sum(X2,X3,X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,negated_conjecture,
less_or_equal(additive_inverse(b),additive_inverse(a)),
less_or_equal_3 ).
cnf(c_0_37,plain,
( sum(X1,X2,add(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
c_0_31 ).
cnf(c_0_38,plain,
( sum(X1,X2,X3)
| ~ sum(X4,X5,X1)
| ~ sum(X5,X2,X6)
| ~ sum(X4,X6,X3) ),
inference(fof_simplification,[status(thm)],[associativity_addition_2]) ).
cnf(c_0_39,plain,
( less_or_equal(X1,X2)
| ~ less_or_equal(X1,X3)
| ~ less_or_equal(X3,X2) ),
inference(fof_simplification,[status(thm)],[transitivity_of_order_relation]) ).
cnf(c_0_40,hypothesis,
( less_or_equal(X1,b)
| ~ less_or_equal(X2,b)
| ~ sum(X2,additive_identity,X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_32]) ).
cnf(c_0_41,axiom,
defined(additive_identity),
well_definedness_of_additive_identity ).
cnf(c_0_42,hypothesis,
sum(additive_identity,a,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_33]),c_0_33])]) ).
cnf(c_0_43,plain,
( sum(additive_identity,X1,X1)
| ~ defined(X1) ),
c_0_34 ).
cnf(c_0_44,negated_conjecture,
( less_or_equal(X1,additive_identity)
| ~ sum(additive_inverse(b),a,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_23])]) ).
cnf(c_0_45,plain,
( sum(X1,X2,add(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_37]) ).
cnf(c_0_46,plain,
( sum(X1,X2,X3)
| ~ sum(X4,X5,X1)
| ~ sum(X5,X2,X6)
| ~ sum(X4,X6,X3) ),
c_0_38 ).
cnf(c_0_47,plain,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_additive_inverse]) ).
cnf(c_0_48,plain,
( less_or_equal(X1,X2)
| ~ less_or_equal(X1,X3)
| ~ less_or_equal(X3,X2) ),
c_0_39 ).
cnf(c_0_49,hypothesis,
( less_or_equal(add(X1,additive_identity),b)
| ~ less_or_equal(X1,b)
| ~ defined(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_37]),c_0_41])]) ).
cnf(c_0_50,plain,
( less_or_equal(X1,add(X2,X3))
| ~ less_or_equal(X4,X2)
| ~ defined(X3)
| ~ defined(X2)
| ~ sum(X4,X3,X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_37]) ).
cnf(c_0_51,hypothesis,
sum(a,additive_identity,a),
inference(spm,[status(thm)],[c_0_26,c_0_42]) ).
cnf(c_0_52,negated_conjecture,
~ less_or_equal(a,b),
inference(fof_simplification,[status(thm)],[not_less_or_equal_4]) ).
cnf(c_0_53,plain,
( less_or_equal(X1,additive_identity)
| less_or_equal(additive_identity,X1)
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_41]) ).
cnf(c_0_54,plain,
( less_or_equal(X1,X2)
| ~ less_or_equal(X3,additive_identity)
| ~ defined(X2)
| ~ sum(X3,X2,X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_43]) ).
cnf(c_0_55,negated_conjecture,
( less_or_equal(add(a,additive_inverse(b)),additive_identity)
| ~ defined(additive_inverse(b)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_23])]) ).
cnf(c_0_56,plain,
( sum(X1,X2,X3)
| ~ defined(X2)
| ~ sum(X4,additive_inverse(X2),X1)
| ~ sum(X4,additive_identity,X3) ),
inference(spm,[status(thm)],[c_0_46,c_0_30]) ).
cnf(c_0_57,plain,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
c_0_47 ).
cnf(c_0_58,hypothesis,
( less_or_equal(X1,b)
| ~ less_or_equal(X1,add(X2,additive_identity))
| ~ less_or_equal(X2,b)
| ~ defined(X2) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_59,hypothesis,
( less_or_equal(a,add(X1,additive_identity))
| ~ less_or_equal(a,X1)
| ~ defined(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_41])]) ).
cnf(c_0_60,negated_conjecture,
~ less_or_equal(a,b),
c_0_52 ).
cnf(c_0_61,plain,
less_or_equal(additive_identity,additive_identity),
inference(spm,[status(thm)],[c_0_53,c_0_41]) ).
cnf(c_0_62,negated_conjecture,
( less_or_equal(X1,X2)
| ~ defined(additive_inverse(b))
| ~ defined(X2)
| ~ sum(add(a,additive_inverse(b)),X2,X1) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_63,plain,
( sum(add(X1,additive_inverse(X2)),X2,X3)
| ~ defined(X2)
| ~ defined(X1)
| ~ sum(X1,additive_identity,X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_37]),c_0_57]) ).
cnf(c_0_64,hypothesis,
( ~ less_or_equal(X1,b)
| ~ less_or_equal(a,X1)
| ~ defined(X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]) ).
cnf(c_0_65,plain,
( less_or_equal(X1,X2)
| ~ defined(X2)
| ~ sum(additive_identity,X2,X1) ),
inference(spm,[status(thm)],[c_0_54,c_0_61]) ).
cnf(c_0_66,negated_conjecture,
( less_or_equal(X1,b)
| ~ defined(additive_inverse(b))
| ~ sum(a,additive_identity,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_17]),c_0_23])]) ).
cnf(c_0_67,hypothesis,
( ~ less_or_equal(a,X1)
| ~ defined(X1)
| ~ sum(additive_identity,b,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_17])]) ).
cnf(c_0_68,negated_conjecture,
( less_or_equal(X1,b)
| ~ sum(a,additive_identity,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_57]),c_0_17])]) ).
cnf(c_0_69,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_17]),c_0_27]),c_0_51])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : FLD063-3 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n022.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat May 18 21:19:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.51 Running first-order theorem proving
% 0.20/0.52 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 6.54/1.34 # Version: 3.1.0
% 6.54/1.34 # Preprocessing class: FSMSSMSSSSSNFFN.
% 6.54/1.34 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.54/1.34 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.54/1.34 # Starting new_bool_3 with 300s (1) cores
% 6.54/1.34 # Starting new_bool_1 with 300s (1) cores
% 6.54/1.34 # Starting sh5l with 300s (1) cores
% 6.54/1.34 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 13975 completed with status 0
% 6.54/1.34 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 6.54/1.34 # Preprocessing class: FSMSSMSSSSSNFFN.
% 6.54/1.34 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.54/1.34 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.54/1.34 # No SInE strategy applied
% 6.54/1.34 # Search class: FGUNF-FFMS21-SFFFFFNN
% 6.54/1.34 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 6.54/1.34 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 675s (1) cores
% 6.54/1.34 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 6.54/1.34 # Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 6.54/1.34 # Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 6.54/1.34 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S0S with 136s (1) cores
% 6.54/1.34 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 13982 completed with status 0
% 6.54/1.34 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 6.54/1.34 # Preprocessing class: FSMSSMSSSSSNFFN.
% 6.54/1.34 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.54/1.34 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.54/1.34 # No SInE strategy applied
% 6.54/1.34 # Search class: FGUNF-FFMS21-SFFFFFNN
% 6.54/1.34 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 6.54/1.34 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 675s (1) cores
% 6.54/1.34 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 6.54/1.34 # Preprocessing time : 0.001 s
% 6.54/1.34 # Presaturation interreduction done
% 6.54/1.34
% 6.54/1.34 # Proof found!
% 6.54/1.34 # SZS status Unsatisfiable
% 6.54/1.34 # SZS output start CNFRefutation
% See solution above
% 6.54/1.34 # Parsed axioms : 30
% 6.54/1.34 # Removed by relevancy pruning/SinE : 0
% 6.54/1.34 # Initial clauses : 30
% 6.54/1.34 # Removed in clause preprocessing : 0
% 6.54/1.34 # Initial clauses in saturation : 30
% 6.54/1.34 # Processed clauses : 5624
% 6.54/1.34 # ...of these trivial : 51
% 6.54/1.34 # ...subsumed : 3255
% 6.54/1.34 # ...remaining for further processing : 2318
% 6.54/1.34 # Other redundant clauses eliminated : 0
% 6.54/1.34 # Clauses deleted for lack of memory : 0
% 6.54/1.34 # Backward-subsumed : 208
% 6.54/1.34 # Backward-rewritten : 2
% 6.54/1.34 # Generated clauses : 26324
% 6.54/1.34 # ...of the previous two non-redundant : 23626
% 6.54/1.34 # ...aggressively subsumed : 0
% 6.54/1.34 # Contextual simplify-reflections : 55
% 6.54/1.34 # Paramodulations : 26285
% 6.54/1.34 # Factorizations : 0
% 6.54/1.34 # NegExts : 0
% 6.54/1.34 # Equation resolutions : 0
% 6.54/1.34 # Disequality decompositions : 0
% 6.54/1.34 # Total rewrite steps : 9885
% 6.54/1.34 # ...of those cached : 9747
% 6.54/1.34 # Propositional unsat checks : 0
% 6.54/1.34 # Propositional check models : 0
% 6.54/1.34 # Propositional check unsatisfiable : 0
% 6.54/1.34 # Propositional clauses : 0
% 6.54/1.34 # Propositional clauses after purity: 0
% 6.54/1.34 # Propositional unsat core size : 0
% 6.54/1.34 # Propositional preprocessing time : 0.000
% 6.54/1.34 # Propositional encoding time : 0.000
% 6.54/1.34 # Propositional solver time : 0.000
% 6.54/1.34 # Success case prop preproc time : 0.000
% 6.54/1.34 # Success case prop encoding time : 0.000
% 6.54/1.34 # Success case prop solver time : 0.000
% 6.54/1.34 # Current number of processed clauses : 2039
% 6.54/1.34 # Positive orientable unit clauses : 148
% 6.54/1.34 # Positive unorientable unit clauses: 0
% 6.54/1.34 # Negative unit clauses : 24
% 6.54/1.34 # Non-unit-clauses : 1867
% 6.54/1.34 # Current number of unprocessed clauses: 17995
% 6.54/1.34 # ...number of literals in the above : 67227
% 6.54/1.34 # Current number of archived formulas : 0
% 6.54/1.34 # Current number of archived clauses : 279
% 6.54/1.34 # Clause-clause subsumption calls (NU) : 347036
% 6.54/1.34 # Rec. Clause-clause subsumption calls : 212508
% 6.54/1.34 # Non-unit clause-clause subsumptions : 3156
% 6.54/1.34 # Unit Clause-clause subsumption calls : 17517
% 6.54/1.34 # Rewrite failures with RHS unbound : 0
% 6.54/1.34 # BW rewrite match attempts : 163
% 6.54/1.34 # BW rewrite match successes : 7
% 6.54/1.34 # Condensation attempts : 0
% 6.54/1.34 # Condensation successes : 0
% 6.54/1.34 # Termbank termtop insertions : 374467
% 6.54/1.34 # Search garbage collected termcells : 116
% 6.54/1.34
% 6.54/1.34 # -------------------------------------------------
% 6.54/1.34 # User time : 0.766 s
% 6.54/1.34 # System time : 0.023 s
% 6.54/1.34 # Total time : 0.789 s
% 6.54/1.34 # Maximum resident set size: 1680 pages
% 6.54/1.34
% 6.54/1.34 # -------------------------------------------------
% 6.54/1.34 # User time : 3.855 s
% 6.54/1.34 # System time : 0.126 s
% 6.54/1.34 # Total time : 3.981 s
% 6.54/1.34 # Maximum resident set size: 1724 pages
% 6.54/1.34 % E---3.1 exiting
% 6.54/1.34 % E exiting
%------------------------------------------------------------------------------