%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : FLD068-2 : 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 : n017.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:57 PM UTC 2026
% Result : Unsatisfiable 71.53s 11.18s
% Output : CNFRefutation 71.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 18
% Syntax : Number of clauses : 80 ( 16 unt; 3 nHn; 80 RR)
% Number of literals : 206 ( 0 equ; 126 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 141 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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(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(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(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(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(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(associativity_addition,axiom,
( ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,add(X2,X3)),add(add(X1,X2),X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',associativity_addition) ).
cnf(well_definedness_of_addition,axiom,
( ~ defined(X2)
| ~ defined(X1)
| defined(add(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',well_definedness_of_addition) ).
cnf(symmetry_of_equality,axiom,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).
cnf(add_equals_u_4,negated_conjecture,
equalish(add(b,additive_inverse(a)),u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',add_equals_u_4) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_is_defined) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined) ).
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(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(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(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(less_or_equal_5,negated_conjecture,
less_or_equal(additive_identity,u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_5) ).
cnf(not_less_or_equal_6,negated_conjecture,
~ less_or_equal(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_less_or_equal_6) ).
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,
( ~ defined(X1)
| equalish(add(additive_identity,X1),X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_addition]) ).
cnf(c_0_20,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_21,plain,
( ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),additive_identity) ),
inference(fof_simplification,[status(thm)],[existence_of_inverse_addition]) ).
cnf(c_0_22,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
c_0_18 ).
cnf(c_0_23,plain,
( ~ defined(X1)
| equalish(add(additive_identity,X1),X1) ),
c_0_19 ).
cnf(c_0_24,plain,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(add(X1,X2),add(X3,X2)) ),
c_0_20 ).
cnf(c_0_25,plain,
( ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),additive_identity) ),
c_0_21 ).
cnf(c_0_26,plain,
( ~ equalish(X1,add(additive_identity,X2))
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
( ~ defined(X1)
| ~ defined(X2)
| equalish(add(add(X1,additive_inverse(X1)),X2),add(additive_identity,X2)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
inference(fof_simplification,[status(thm)],[commutativity_addition]) ).
cnf(c_0_29,plain,
( ~ defined(X1)
| ~ defined(X2)
| equalish(add(add(X1,additive_inverse(X1)),X2),X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
c_0_28 ).
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,
( ~ equalish(X1,add(add(X3,additive_inverse(X3)),X2))
| ~ defined(X3)
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_29]) ).
cnf(c_0_33,plain,
( ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3)
| equalish(add(add(X1,X2),X3),add(add(X2,X1),X3)) ),
inference(spm,[status(thm)],[c_0_24,c_0_30]) ).
cnf(c_0_34,plain,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
c_0_31 ).
cnf(c_0_35,plain,
( ~ defined(X1)
| ~ defined(X2)
| equalish(add(add(additive_inverse(X1),X1),X2),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_36,plain,
( ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,add(X2,X3)),add(add(X1,X2),X3)) ),
inference(fof_simplification,[status(thm)],[associativity_addition]) ).
cnf(c_0_37,plain,
( ~ equalish(X1,add(add(additive_inverse(X3),X3),X2))
| ~ defined(X3)
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_35]) ).
cnf(c_0_38,plain,
( ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,add(X2,X3)),add(add(X1,X2),X3)) ),
c_0_36 ).
cnf(c_0_39,plain,
( ~ defined(X2)
| ~ defined(X1)
| defined(add(X1,X2)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_addition]) ).
cnf(c_0_40,plain,
( ~ defined(X1)
| ~ defined(X2)
| equalish(add(additive_inverse(X1),add(X1,X2)),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_34]) ).
cnf(c_0_41,plain,
( ~ equalish(X1,add(X3,X2))
| ~ defined(X3)
| ~ defined(X2)
| equalish(X1,add(X2,X3)) ),
inference(spm,[status(thm)],[c_0_22,c_0_30]) ).
cnf(c_0_42,plain,
( ~ defined(X2)
| ~ defined(X1)
| defined(add(X1,X2)) ),
c_0_39 ).
cnf(c_0_43,plain,
( ~ equalish(X1,add(additive_inverse(X3),add(X3,X2)))
| ~ defined(X3)
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_40]) ).
cnf(c_0_44,plain,
( ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3)
| equalish(add(X1,add(X2,X3)),add(X3,add(X1,X2))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_38]),c_0_42]) ).
cnf(c_0_45,plain,
( ~ defined(X1)
| ~ defined(X2)
| equalish(add(X1,add(X2,additive_inverse(X1))),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_34]) ).
cnf(c_0_46,plain,
( ~ equalish(X1,add(X3,add(X2,additive_inverse(X3))))
| ~ defined(X3)
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_45]) ).
cnf(c_0_47,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[symmetry_of_equality]) ).
cnf(c_0_48,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,add(additive_inverse(X2),X2)),X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_44]),c_0_34]) ).
cnf(c_0_49,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
c_0_47 ).
cnf(c_0_50,plain,
( ~ equalish(X1,add(X2,add(additive_inverse(X3),X3)))
| ~ defined(X3)
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_48]) ).
cnf(c_0_51,plain,
( ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3)
| equalish(add(add(X1,X2),X3),add(X1,add(X2,X3))) ),
inference(spm,[status(thm)],[c_0_49,c_0_38]) ).
cnf(c_0_52,negated_conjecture,
equalish(add(b,additive_inverse(a)),u),
add_equals_u_4 ).
cnf(c_0_53,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(add(X1,additive_inverse(X2)),X2),X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_34]) ).
cnf(c_0_54,negated_conjecture,
equalish(u,add(b,additive_inverse(a))),
inference(spm,[status(thm)],[c_0_49,c_0_52]) ).
cnf(c_0_55,plain,
( ~ equalish(X1,add(add(X2,additive_inverse(X3)),X3))
| ~ defined(X3)
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_53]) ).
cnf(c_0_56,negated_conjecture,
( ~ defined(X1)
| equalish(add(u,X1),add(add(b,additive_inverse(a)),X1)) ),
inference(spm,[status(thm)],[c_0_24,c_0_54]) ).
cnf(c_0_57,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_58,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_59,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_60,negated_conjecture,
equalish(add(u,a),b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]),c_0_58])]) ).
cnf(c_0_61,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_62,plain,
( ~ equalish(X3,X1)
| ~ less_or_equal(X3,X2)
| less_or_equal(X1,X2) ),
c_0_59 ).
cnf(c_0_63,negated_conjecture,
equalish(b,add(u,a)),
inference(spm,[status(thm)],[c_0_49,c_0_60]) ).
cnf(c_0_64,plain,
( ~ defined(X2)
| ~ defined(X1)
| less_or_equal(X2,X1)
| less_or_equal(X1,X2) ),
c_0_61 ).
cnf(c_0_65,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_66,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_67,negated_conjecture,
( ~ less_or_equal(b,X1)
| less_or_equal(add(u,a),X1) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_68,plain,
( ~ defined(X1)
| less_or_equal(X1,X1) ),
inference(ef,[status(thm)],[c_0_64]) ).
cnf(c_0_69,plain,
( ~ less_or_equal(X1,X3)
| ~ defined(X2)
| less_or_equal(add(X1,X2),add(X3,X2)) ),
c_0_65 ).
cnf(c_0_70,negated_conjecture,
less_or_equal(additive_identity,u),
less_or_equal_5 ).
cnf(c_0_71,plain,
( ~ less_or_equal(X3,X2)
| ~ less_or_equal(X1,X3)
| less_or_equal(X1,X2) ),
c_0_66 ).
cnf(c_0_72,negated_conjecture,
less_or_equal(add(u,a),b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_57])]) ).
cnf(c_0_73,plain,
( ~ defined(X1)
| ~ less_or_equal(add(additive_identity,X1),X2)
| less_or_equal(X1,X2) ),
inference(spm,[status(thm)],[c_0_62,c_0_23]) ).
cnf(c_0_74,negated_conjecture,
( ~ defined(X1)
| less_or_equal(add(additive_identity,X1),add(u,X1)) ),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_75,negated_conjecture,
~ less_or_equal(a,b),
inference(fof_simplification,[status(thm)],[not_less_or_equal_6]) ).
cnf(c_0_76,negated_conjecture,
( ~ less_or_equal(X1,add(u,a))
| less_or_equal(X1,b) ),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_77,negated_conjecture,
( ~ defined(X1)
| less_or_equal(X1,add(u,X1)) ),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_78,negated_conjecture,
~ less_or_equal(a,b),
c_0_75 ).
cnf(c_0_79,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_58])]),c_0_78]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD068-2 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.44 % Computer : n017.cluster.edu
% 0.18/0.44 % Model : x86_64 x86_64
% 0.18/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44 % Memory : 8046.5625MB
% 0.18/0.44 % OS : Linux 6.8.0-71-generic
% 0.18/0.45 % CPULimit : 300
% 0.18/0.45 % WCLimit : 300
% 0.18/0.45 % DateTime : Mon Sep 21 15:39:42 UTC 2026
% 0.18/0.45 % CPUTime :
% 0.18/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.27/0.54 Running first-order theorem proving
% 0.27/0.54 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
% 71.53/11.18 % Version: 3.5.1
% 71.53/11.18 % Preprocessing class: FSMSSMSSSSSNFFN.
% 71.53/11.18 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 71.53/11.18 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 71.53/11.18 % Starting new_bool_3 with 300s (1) cores
% 71.53/11.18 % Starting new_bool_1 with 300s (1) cores
% 71.53/11.18 % Starting sh5l with 300s (1) cores
% 71.53/11.18 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2672136 completed with status 0
% 71.53/11.18 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 71.53/11.18 % Preprocessing class: FSMSSMSSSSSNFFN.
% 71.53/11.18 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 71.53/11.18 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 71.53/11.18 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 71.53/11.18 % No SInE strategy applied
% 71.53/11.18 % Search class: FGUNF-FFMM21-SFFFFFNN
% 71.53/11.18 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 71.53/11.18 % Starting SubtermCWHack with 136s (1) cores
% 71.53/11.18 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 71.53/11.18 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 71.53/11.18 % Starting new_bool_3 with 269s (1) cores
% 71.53/11.18 % Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 71.53/11.18 % H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with pid 2672142 completed with status 0
% 71.53/11.18 % Result found by H----_102_C18_F1_PI_AE_CS_SP_PS_S2S
% 71.53/11.18 % Preprocessing class: FSMSSMSSSSSNFFN.
% 71.53/11.18 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 71.53/11.18 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 71.53/11.18 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 71.53/11.18 % No SInE strategy applied
% 71.53/11.18 % Search class: FGUNF-FFMM21-SFFFFFNN
% 71.53/11.18 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 71.53/11.18 % Starting SubtermCWHack with 136s (1) cores
% 71.53/11.18 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 71.53/11.18 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 71.53/11.18 % Preprocessing time : 0.002 s
% 71.53/11.18 % Presaturation interreduction done
% 71.53/11.18
% 71.53/11.18 % Proof found!
% 71.53/11.18 % SZS status Unsatisfiable
% 71.53/11.18 % SZS output start CNFRefutation
% See solution above
% 71.53/11.18 % Parsed axioms : 33
% 71.53/11.18 % Removed by relevancy pruning/SinE : 0
% 71.53/11.18 % Initial clauses : 33
% 71.53/11.18 % Removed in clause preprocessing : 0
% 71.53/11.18 % Initial clauses in saturation : 33
% 71.53/11.18 % Processed clauses : 18145
% 71.53/11.18 % ...of these trivial : 3828
% 71.53/11.18 % ...subsumed : 7711
% 71.53/11.18 % ...remaining for further processing : 6606
% 71.53/11.18 % Other redundant clauses eliminated : 0
% 71.53/11.18 % Clauses deleted for lack of memory : 0
% 71.53/11.18 % Backward-subsumed : 189
% 71.53/11.18 % Backward-rewritten : 259
% 71.53/11.18 % Generated clauses : 626749
% 71.53/11.18 % ...of the previous two non-redundant : 529571
% 71.53/11.18 % ...aggressively subsumed : 0
% 71.53/11.18 % Contextual simplify-reflections : 249
% 71.53/11.18 % Paramodulations : 626733
% 71.53/11.18 % Factorizations : 16
% 71.53/11.18 % NegExts : 0
% 71.53/11.18 % Equation resolutions : 0
% 71.53/11.18 % Disequality decompositions : 0
% 71.53/11.18 % Total rewrite steps : 303090
% 71.53/11.18 % ...of those cached : 301774
% 71.53/11.18 % Propositional unsat checks : 0
% 71.53/11.18 % Propositional check models : 0
% 71.53/11.18 % Propositional check unsatisfiable : 0
% 71.53/11.18 % Propositional clauses : 0
% 71.53/11.18 % Propositional clauses after purity: 0
% 71.53/11.18 % Propositional unsat core size : 0
% 71.53/11.18 % Propositional preprocessing time : 0.000
% 71.53/11.18 % Propositional encoding time : 0.000
% 71.53/11.18 % Propositional solver time : 0.000
% 71.53/11.18 % Success case prop preproc time : 0.000
% 71.53/11.18 % Success case prop encoding time : 0.000
% 71.53/11.18 % Success case prop solver time : 0.000
% 71.53/11.18 % Current number of processed clauses : 6125
% 71.53/11.18 % Positive orientable unit clauses : 1316
% 71.53/11.18 % Positive unorientable unit clauses: 0
% 71.53/11.18 % Negative unit clauses : 2
% 71.53/11.18 % Non-unit-clauses : 4807
% 71.53/11.18 % Current number of unprocessed clauses: 511298
% 71.53/11.18 % ...number of literals in the above : 1226214
% 71.53/11.18 % Current number of archived formulas : 0
% 71.53/11.18 % Current number of archived clauses : 481
% 71.53/11.18 % Clause-clause subsumption calls (NU) : 760628
% 71.53/11.18 % Rec. Clause-clause subsumption calls : 626582
% 71.53/11.18 % Non-unit clause-clause subsumptions : 8135
% 71.53/11.18 % Unit Clause-clause subsumption calls : 22191
% 71.53/11.18 % Rewrite failures with RHS unbound : 0
% 71.53/11.18 % BW rewrite match attempts : 2276
% 71.53/11.18 % BW rewrite match successes : 242
% 71.53/11.18 % Condensation attempts : 0
% 71.53/11.18 % Condensation successes : 0
% 71.53/11.18 % Termbank termtop insertions : 9868826
% 71.53/11.18 % Search garbage collected termcells : 71
% 71.53/11.18
% 71.53/11.18 % -------------------------------------------------
% 71.53/11.18 % User time : 9.486 s
% 71.53/11.18 % System time : 0.390 s
% 71.53/11.18 % Total time : 9.875 s
% 71.53/11.18 % Maximum resident set size: 3660 pages
% 71.53/11.18
% 71.53/11.18 % -------------------------------------------------
% 71.53/11.18 % User time : 48.717 s
% 71.53/11.18 % System time : 1.663 s
% 71.53/11.18 % Total time : 50.380 s
% 71.53/11.18 % Maximum resident set size: 4608 pages
% 71.53/11.18 % E exiting
%------------------------------------------------------------------------------