%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : FLD064-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n019.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 12:22:55 PM UTC 2026
% Result : Unsatisfiable 0.19s 0.57s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 16
% Syntax : Number of clauses : 76 ( 15 unt; 5 nHn; 76 RR)
% Number of literals : 183 ( 0 equ; 106 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 117 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(symmetry_of_equality,axiom,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).
cnf(existence_of_identity_addition,axiom,
( ~ defined(X1)
| equalish(add(additive_identity,X1),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',existence_of_identity_addition) ).
cnf(transitivity_of_equality,axiom,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',transitivity_of_equality) ).
cnf(commutativity_addition,axiom,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',commutativity_addition) ).
cnf(existence_of_inverse_addition,axiom,
( ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),additive_identity) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',existence_of_inverse_addition) ).
cnf(well_definedness_of_additive_identity,axiom,
defined(additive_identity),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',well_definedness_of_additive_identity) ).
cnf(transitivity_of_order_relation,axiom,
( ~ less_or_equal(X3,X2)
| ~ less_or_equal(X1,X3)
| less_or_equal(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',transitivity_of_order_relation) ).
cnf(compatibility_of_equality_and_order_relation,axiom,
( ~ equalish(X3,X1)
| ~ less_or_equal(X3,X2)
| less_or_equal(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_order_relation) ).
cnf(well_definedness_of_additive_inverse,axiom,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',well_definedness_of_additive_inverse) ).
cnf(totality_of_order_relation,axiom,
( ~ defined(X2)
| ~ defined(X1)
| less_or_equal(X2,X1)
| less_or_equal(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',totality_of_order_relation) ).
cnf(antisymmetry_of_order_relation,axiom,
( ~ less_or_equal(X2,X1)
| ~ less_or_equal(X1,X2)
| equalish(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',antisymmetry_of_order_relation) ).
cnf(less_or_equal_2,negated_conjecture,
less_or_equal(additive_identity,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_2) ).
cnf(compatibility_of_order_relation_and_addition,axiom,
( ~ less_or_equal(X1,X3)
| ~ defined(X2)
| less_or_equal(add(X1,X2),add(X3,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',compatibility_of_order_relation_and_addition) ).
cnf(compatibility_of_equality_and_addition,axiom,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(add(X1,X2),add(X3,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_addition) ).
cnf(not_less_or_equal_3,negated_conjecture,
~ less_or_equal(additive_inverse(a),additive_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_less_or_equal_3) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined) ).
cnf(c_0_16,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[symmetry_of_equality]) ).
cnf(c_0_17,plain,
( ~ defined(X1)
| equalish(add(additive_identity,X1),X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_addition]) ).
cnf(c_0_18,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[transitivity_of_equality]) ).
cnf(c_0_19,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
c_0_16 ).
cnf(c_0_20,plain,
( ~ defined(X1)
| equalish(add(additive_identity,X1),X1) ),
c_0_17 ).
cnf(c_0_21,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
c_0_18 ).
cnf(c_0_22,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
inference(fof_simplification,[status(thm)],[commutativity_addition]) ).
cnf(c_0_23,plain,
( ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),additive_identity) ),
inference(fof_simplification,[status(thm)],[existence_of_inverse_addition]) ).
cnf(c_0_24,plain,
( ~ defined(X1)
| equalish(X1,add(additive_identity,X1)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
( ~ equalish(X1,add(additive_identity,X2))
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_26,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
c_0_22 ).
cnf(c_0_27,axiom,
defined(additive_identity),
well_definedness_of_additive_identity ).
cnf(c_0_28,plain,
( ~ less_or_equal(X3,X2)
| ~ less_or_equal(X1,X3)
| less_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[transitivity_of_order_relation]) ).
cnf(c_0_29,plain,
( ~ equalish(X3,X1)
| ~ less_or_equal(X3,X2)
| less_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[compatibility_of_equality_and_order_relation]) ).
cnf(c_0_30,plain,
( ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),additive_identity) ),
c_0_23 ).
cnf(c_0_31,plain,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_additive_inverse]) ).
cnf(c_0_32,plain,
( ~ defined(X2)
| ~ defined(X1)
| less_or_equal(X2,X1)
| less_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[totality_of_order_relation]) ).
cnf(c_0_33,plain,
( ~ equalish(X1,X2)
| ~ defined(X2)
| equalish(X1,add(additive_identity,X2)) ),
inference(spm,[status(thm)],[c_0_21,c_0_24]) ).
cnf(c_0_34,plain,
( ~ defined(X1)
| equalish(add(X1,additive_identity),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_35,plain,
( ~ less_or_equal(X2,X1)
| ~ less_or_equal(X1,X2)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[antisymmetry_of_order_relation]) ).
cnf(c_0_36,plain,
( ~ less_or_equal(X3,X2)
| ~ less_or_equal(X1,X3)
| less_or_equal(X1,X2) ),
c_0_28 ).
cnf(c_0_37,negated_conjecture,
less_or_equal(additive_identity,a),
less_or_equal_2 ).
cnf(c_0_38,plain,
( ~ equalish(X3,X1)
| ~ less_or_equal(X3,X2)
| less_or_equal(X1,X2) ),
c_0_29 ).
cnf(c_0_39,plain,
( ~ less_or_equal(X1,X3)
| ~ defined(X2)
| less_or_equal(add(X1,X2),add(X3,X2)) ),
inference(fof_simplification,[status(thm)],[compatibility_of_order_relation_and_addition]) ).
cnf(c_0_40,plain,
( ~ equalish(X1,add(X2,additive_inverse(X2)))
| ~ defined(X2)
| equalish(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_21,c_0_30]) ).
cnf(c_0_41,plain,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
c_0_31 ).
cnf(c_0_42,plain,
( ~ defined(X2)
| ~ defined(X1)
| less_or_equal(X2,X1)
| less_or_equal(X1,X2) ),
c_0_32 ).
cnf(c_0_43,plain,
( ~ equalish(X2,X1)
| ~ defined(X1)
| equalish(add(additive_identity,X1),X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_33]) ).
cnf(c_0_44,plain,
( ~ defined(X1)
| equalish(X1,add(X1,additive_identity)) ),
inference(spm,[status(thm)],[c_0_19,c_0_34]) ).
cnf(c_0_45,plain,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(add(X1,X2),add(X3,X2)) ),
inference(fof_simplification,[status(thm)],[compatibility_of_equality_and_addition]) ).
cnf(c_0_46,plain,
( ~ less_or_equal(X2,X1)
| ~ less_or_equal(X1,X2)
| equalish(X1,X2) ),
c_0_35 ).
cnf(c_0_47,negated_conjecture,
( ~ less_or_equal(X1,additive_identity)
| less_or_equal(X1,a) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_48,plain,
( ~ defined(X1)
| ~ less_or_equal(add(additive_identity,X1),X2)
| less_or_equal(X1,X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_20]) ).
cnf(c_0_49,plain,
( ~ less_or_equal(X1,X3)
| ~ defined(X2)
| less_or_equal(add(X1,X2),add(X3,X2)) ),
c_0_39 ).
cnf(c_0_50,plain,
( ~ defined(X1)
| equalish(add(additive_inverse(X1),X1),additive_identity) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_26]),c_0_41]) ).
cnf(c_0_51,negated_conjecture,
~ less_or_equal(additive_inverse(a),additive_identity),
inference(fof_simplification,[status(thm)],[not_less_or_equal_3]) ).
cnf(c_0_52,plain,
( ~ defined(X1)
| less_or_equal(X1,additive_identity)
| less_or_equal(additive_identity,X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_27]) ).
cnf(c_0_53,plain,
( ~ equalish(X1,X3)
| ~ defined(X3)
| ~ less_or_equal(add(additive_identity,X3),X2)
| less_or_equal(X1,X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_43]) ).
cnf(c_0_54,plain,
( ~ defined(X1)
| ~ less_or_equal(X1,X2)
| less_or_equal(add(X1,additive_identity),X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_44]) ).
cnf(c_0_55,plain,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(add(X1,X2),add(X3,X2)) ),
c_0_45 ).
cnf(c_0_56,negated_conjecture,
( ~ less_or_equal(X1,additive_identity)
| ~ less_or_equal(a,X1)
| equalish(a,X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_57,plain,
( ~ defined(X1)
| ~ less_or_equal(additive_identity,X2)
| less_or_equal(X1,add(X2,X1)) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_58,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_59,plain,
( ~ defined(X1)
| equalish(additive_identity,add(additive_inverse(X1),X1)) ),
inference(spm,[status(thm)],[c_0_19,c_0_50]) ).
cnf(c_0_60,negated_conjecture,
~ less_or_equal(additive_inverse(a),additive_identity),
c_0_51 ).
cnf(c_0_61,plain,
( ~ defined(X1)
| less_or_equal(additive_identity,additive_inverse(X1))
| less_or_equal(additive_inverse(X1),additive_identity) ),
inference(spm,[status(thm)],[c_0_52,c_0_41]) ).
cnf(c_0_62,plain,
( ~ equalish(X1,additive_identity)
| ~ less_or_equal(additive_identity,X2)
| less_or_equal(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_27])]) ).
cnf(c_0_63,plain,
less_or_equal(additive_identity,additive_identity),
inference(spm,[status(thm)],[c_0_52,c_0_27]) ).
cnf(c_0_64,plain,
( ~ equalish(X1,additive_identity)
| ~ defined(X2)
| equalish(add(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_55]) ).
cnf(c_0_65,negated_conjecture,
( ~ less_or_equal(additive_identity,X1)
| ~ less_or_equal(add(X1,a),additive_identity)
| equalish(a,add(X1,a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58])]) ).
cnf(c_0_66,plain,
( ~ defined(X1)
| ~ less_or_equal(additive_identity,X2)
| less_or_equal(add(additive_inverse(X1),X1),X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_59]) ).
cnf(c_0_67,negated_conjecture,
less_or_equal(additive_identity,additive_inverse(a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_58])]) ).
cnf(c_0_68,plain,
( ~ equalish(X1,additive_identity)
| less_or_equal(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_69,plain,
( ~ equalish(X2,additive_identity)
| ~ defined(X1)
| equalish(X1,add(X2,X1)) ),
inference(spm,[status(thm)],[c_0_19,c_0_64]) ).
cnf(c_0_70,plain,
( ~ equalish(X1,add(additive_inverse(X2),X2))
| ~ defined(X2)
| equalish(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_21,c_0_50]) ).
cnf(c_0_71,negated_conjecture,
equalish(a,add(additive_inverse(a),a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67]),c_0_63]),c_0_58])]) ).
cnf(c_0_72,negated_conjecture,
~ equalish(additive_inverse(a),additive_identity),
inference(spm,[status(thm)],[c_0_60,c_0_68]) ).
cnf(c_0_73,plain,
( ~ equalish(X1,additive_identity)
| ~ defined(X1)
| equalish(additive_inverse(X1),additive_identity) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_69]),c_0_41]) ).
cnf(c_0_74,negated_conjecture,
equalish(a,additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_58])]) ).
cnf(c_0_75,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_58]),c_0_74])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : FLD064-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n019.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 15:44:20 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.19/0.57 % Version: 3.5.1
% 0.19/0.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.19/0.57 % Starting sh5l with 300s (1) cores
% 0.19/0.57 % new_bool_1 with pid 2933656 completed with status 0
% 0.19/0.57 % Result found by new_bool_1
% 0.19/0.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.19/0.57 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.19/0.57 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.57 % Search class: FGUNF-FFMS21-SFFFFFNN
% 0.19/0.57 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.57 % Starting SubtermCWHack with 28s (1) cores
% 0.19/0.57 % SubtermCWHack with pid 2933659 completed with status 0
% 0.19/0.57 % Result found by SubtermCWHack
% 0.19/0.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.19/0.57 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.19/0.57 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.57 % Search class: FGUNF-FFMS21-SFFFFFNN
% 0.19/0.57 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.57 % Starting SubtermCWHack with 28s (1) cores
% 0.19/0.57 % Preprocessing time : 0.001 s
% 0.19/0.57
% 0.19/0.57 % Proof found!
% 0.19/0.57 % SZS status Unsatisfiable
% 0.19/0.57 % SZS output start CNFRefutation
% See solution above
% 0.19/0.57 % Parsed axioms : 30
% 0.19/0.57 % Removed by relevancy pruning/SinE : 5
% 0.19/0.57 % Initial clauses : 25
% 0.19/0.57 % Removed in clause preprocessing : 0
% 0.19/0.57 % Initial clauses in saturation : 25
% 0.19/0.57 % Processed clauses : 1353
% 0.19/0.57 % ...of these trivial : 42
% 0.19/0.57 % ...subsumed : 772
% 0.19/0.57 % ...remaining for further processing : 539
% 0.19/0.57 % Other redundant clauses eliminated : 0
% 0.19/0.57 % Clauses deleted for lack of memory : 0
% 0.19/0.57 % Backward-subsumed : 36
% 0.19/0.57 % Backward-rewritten : 58
% 0.19/0.57 % Generated clauses : 9375
% 0.19/0.57 % ...of the previous two non-redundant : 7305
% 0.19/0.57 % ...aggressively subsumed : 0
% 0.19/0.57 % Contextual simplify-reflections : 5
% 0.19/0.57 % Paramodulations : 9375
% 0.19/0.57 % Factorizations : 0
% 0.19/0.57 % NegExts : 0
% 0.19/0.57 % Equation resolutions : 0
% 0.19/0.57 % Disequality decompositions : 0
% 0.19/0.57 % Total rewrite steps : 5708
% 0.19/0.57 % ...of those cached : 5647
% 0.19/0.57 % Propositional unsat checks : 0
% 0.19/0.57 % Propositional check models : 0
% 0.19/0.57 % Propositional check unsatisfiable : 0
% 0.19/0.57 % Propositional clauses : 0
% 0.19/0.57 % Propositional clauses after purity: 0
% 0.19/0.57 % Propositional unsat core size : 0
% 0.19/0.57 % Propositional preprocessing time : 0.000
% 0.19/0.57 % Propositional encoding time : 0.000
% 0.19/0.57 % Propositional solver time : 0.000
% 0.19/0.57 % Success case prop preproc time : 0.000
% 0.19/0.57 % Success case prop encoding time : 0.000
% 0.19/0.57 % Success case prop solver time : 0.000
% 0.19/0.57 % Current number of processed clauses : 445
% 0.19/0.57 % Positive orientable unit clauses : 62
% 0.19/0.57 % Positive unorientable unit clauses: 0
% 0.19/0.57 % Negative unit clauses : 4
% 0.19/0.57 % Non-unit-clauses : 379
% 0.19/0.57 % Current number of unprocessed clauses: 5958
% 0.19/0.57 % ...number of literals in the above : 22553
% 0.19/0.57 % Current number of archived formulas : 0
% 0.19/0.57 % Current number of archived clauses : 94
% 0.19/0.57 % Clause-clause subsumption calls (NU) : 12672
% 0.19/0.57 % Rec. Clause-clause subsumption calls : 11215
% 0.19/0.57 % Non-unit clause-clause subsumptions : 783
% 0.19/0.57 % Unit Clause-clause subsumption calls : 395
% 0.19/0.57 % Rewrite failures with RHS unbound : 0
% 0.19/0.57 % BW rewrite match attempts : 19
% 0.19/0.57 % BW rewrite match successes : 13
% 0.19/0.57 % Condensation attempts : 0
% 0.19/0.57 % Condensation successes : 0
% 0.19/0.57 % Termbank termtop insertions : 128616
% 0.19/0.57 % Search garbage collected termcells : 87
% 0.19/0.57
% 0.19/0.57 % -------------------------------------------------
% 0.19/0.57 % User time : 0.123 s
% 0.19/0.57 % System time : 0.007 s
% 0.19/0.57 % Total time : 0.131 s
% 0.19/0.57 % Maximum resident set size: 3660 pages
% 0.19/0.57
% 0.19/0.57 % -------------------------------------------------
% 0.19/0.57 % User time : 0.126 s
% 0.19/0.57 % System time : 0.011 s
% 0.19/0.57 % Total time : 0.137 s
% 0.19/0.57 % Maximum resident set size: 4864 pages
% 0.19/0.57 % E exiting
%------------------------------------------------------------------------------