%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ANA003-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n012.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:02:42 PM UTC 2026
% Result : Unsatisfiable 156.73s 24.95s
% Output : CNFRefutation 156.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 15
% Syntax : Number of clauses : 68 ( 8 unt; 0 nHn; 64 RR)
% Number of literals : 181 ( 4 equ; 133 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 5 con; 0-2 aty)
% Number of variables : 100 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_16,negated_conjecture,
( ~ less_than(add(absolute(add(f(fp33(X1)),minus(l1))),absolute(add(g(fp33(X1)),minus(l2)))),b)
| ~ less_than(n0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_16) ).
cnf(axiom_3,axiom,
( ~ less_than(X3,half(X2))
| ~ less_than(X1,half(X2))
| less_than(add(X1,X3),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/ANA001-0.ax',axiom_3) ).
cnf(c_13,negated_conjecture,
( ~ less_than(absolute(add(X2,minus(a))),fp32(X1))
| ~ less_than(n0,X1)
| less_than(absolute(add(g(X2),minus(l2))),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_13) ).
cnf(axiom_6_1,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/ANA001-0.ax',axiom_6_1) ).
cnf(axiom_6_2,axiom,
( ~ less_than(n0,X1)
| less_than(n0,half(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/ANA001-0.ax',axiom_6_2) ).
cnf(c_11,negated_conjecture,
( ~ less_than(absolute(add(X2,minus(a))),fp31(X1))
| ~ less_than(n0,X1)
| less_than(absolute(add(f(X2),minus(l1))),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_11) ).
cnf(transitivity_of_less_than,axiom,
( ~ less_than(X2,X3)
| ~ less_than(X1,X2)
| less_than(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/ANA001-0.ax',transitivity_of_less_than) ).
cnf(c_15,negated_conjecture,
( ~ less_than(n0,X1)
| less_than(absolute(add(fp33(X1),minus(a))),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_15) ).
cnf(c_14,negated_conjecture,
less_than(n0,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_14) ).
cnf(left_identity,axiom,
add(n0,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/ANA001-0.ax',left_identity) ).
cnf(c_12,negated_conjecture,
( ~ less_than(n0,X1)
| less_than(n0,fp32(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_12) ).
cnf(axiom_2_2,axiom,
( ~ less_than(n0,X2)
| ~ less_than(n0,X1)
| less_than(minimum(X1,X2),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/ANA001-0.ax',axiom_2_2) ).
cnf(c_10,negated_conjecture,
( ~ less_than(n0,X1)
| less_than(n0,fp31(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_10) ).
cnf(axiom_2_3,axiom,
( ~ less_than(n0,X2)
| ~ less_than(n0,X1)
| less_than(minimum(X1,X2),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/ANA001-0.ax',axiom_2_3) ).
cnf(axiom_2_1,axiom,
( ~ less_than(n0,X2)
| ~ less_than(n0,X1)
| less_than(n0,minimum(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/ANA001-0.ax',axiom_2_1) ).
cnf(c_0_15,negated_conjecture,
( ~ less_than(add(absolute(add(f(fp33(X1)),minus(l1))),absolute(add(g(fp33(X1)),minus(l2)))),b)
| ~ less_than(n0,X1) ),
inference(fof_simplification,[status(thm)],[c_16]) ).
cnf(c_0_16,plain,
( ~ less_than(X3,half(X2))
| ~ less_than(X1,half(X2))
| less_than(add(X1,X3),X2) ),
inference(fof_simplification,[status(thm)],[axiom_3]) ).
cnf(c_0_17,negated_conjecture,
( ~ less_than(absolute(add(X2,minus(a))),fp32(X1))
| ~ less_than(n0,X1)
| less_than(absolute(add(g(X2),minus(l2))),X1) ),
inference(fof_simplification,[status(thm)],[c_13]) ).
cnf(c_0_18,negated_conjecture,
( ~ less_than(add(absolute(add(f(fp33(X1)),minus(l1))),absolute(add(g(fp33(X1)),minus(l2)))),b)
| ~ less_than(n0,X1) ),
c_0_15 ).
cnf(c_0_19,plain,
( ~ less_than(X3,half(X2))
| ~ less_than(X1,half(X2))
| less_than(add(X1,X3),X2) ),
c_0_16 ).
cnf(c_0_20,axiom,
add(X1,X2) = add(X2,X1),
axiom_6_1 ).
cnf(c_0_21,negated_conjecture,
( ~ less_than(absolute(add(X2,minus(a))),fp32(X1))
| ~ less_than(n0,X1)
| less_than(absolute(add(g(X2),minus(l2))),X1) ),
c_0_17 ).
cnf(c_0_22,negated_conjecture,
( ~ less_than(n0,X1)
| ~ less_than(absolute(add(minus(l1),f(fp33(X1)))),half(b))
| ~ less_than(absolute(add(minus(l2),g(fp33(X1)))),half(b)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_20]) ).
cnf(c_0_23,negated_conjecture,
( ~ less_than(n0,X2)
| ~ less_than(absolute(add(X1,minus(a))),fp32(X2))
| less_than(absolute(add(minus(l2),g(X1))),X2) ),
inference(rw,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_24,plain,
( ~ less_than(n0,X1)
| less_than(n0,half(X1)) ),
inference(fof_simplification,[status(thm)],[axiom_6_2]) ).
cnf(c_0_25,negated_conjecture,
( ~ less_than(absolute(add(X2,minus(a))),fp31(X1))
| ~ less_than(n0,X1)
| less_than(absolute(add(f(X2),minus(l1))),X1) ),
inference(fof_simplification,[status(thm)],[c_11]) ).
cnf(c_0_26,plain,
( ~ less_than(X2,X3)
| ~ less_than(X1,X2)
| less_than(X1,X3) ),
inference(fof_simplification,[status(thm)],[transitivity_of_less_than]) ).
cnf(c_0_27,negated_conjecture,
( ~ less_than(n0,X1)
| less_than(absolute(add(fp33(X1),minus(a))),X1) ),
inference(fof_simplification,[status(thm)],[c_15]) ).
cnf(c_0_28,negated_conjecture,
( ~ less_than(n0,X1)
| ~ less_than(n0,half(b))
| ~ less_than(absolute(add(minus(a),fp33(X1))),fp32(half(b)))
| ~ less_than(absolute(add(minus(l1),f(fp33(X1)))),half(b)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_20]) ).
cnf(c_0_29,plain,
( ~ less_than(n0,X1)
| less_than(n0,half(X1)) ),
c_0_24 ).
cnf(c_0_30,negated_conjecture,
less_than(n0,b),
c_14 ).
cnf(c_0_31,negated_conjecture,
( ~ less_than(absolute(add(X2,minus(a))),fp31(X1))
| ~ less_than(n0,X1)
| less_than(absolute(add(f(X2),minus(l1))),X1) ),
c_0_25 ).
cnf(c_0_32,plain,
( ~ less_than(X2,X3)
| ~ less_than(X1,X2)
| less_than(X1,X3) ),
c_0_26 ).
cnf(c_0_33,negated_conjecture,
( ~ less_than(n0,X1)
| less_than(absolute(add(fp33(X1),minus(a))),X1) ),
c_0_27 ).
cnf(c_0_34,negated_conjecture,
( ~ less_than(n0,X1)
| ~ less_than(absolute(add(minus(a),fp33(X1))),fp32(half(b)))
| ~ less_than(absolute(add(minus(l1),f(fp33(X1)))),half(b)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_35,negated_conjecture,
( ~ less_than(n0,X2)
| ~ less_than(absolute(add(X1,minus(a))),fp31(X2))
| less_than(absolute(add(minus(l1),f(X1))),X2) ),
inference(rw,[status(thm)],[c_0_31,c_0_20]) ).
cnf(c_0_36,plain,
( ~ less_than(X3,half(X2))
| ~ less_than(X4,half(X2))
| ~ less_than(X1,add(X3,X4))
| less_than(X1,X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_19]) ).
cnf(c_0_37,negated_conjecture,
( ~ less_than(n0,X1)
| less_than(absolute(add(minus(a),fp33(X1))),X1) ),
inference(rw,[status(thm)],[c_0_33,c_0_20]) ).
cnf(c_0_38,negated_conjecture,
( ~ less_than(n0,X1)
| ~ less_than(n0,half(b))
| ~ less_than(absolute(add(minus(a),fp33(X1))),fp31(half(b)))
| ~ less_than(absolute(add(minus(a),fp33(X1))),fp32(half(b))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_20]) ).
cnf(c_0_39,negated_conjecture,
( ~ less_than(X1,half(X3))
| ~ less_than(X2,half(X3))
| ~ less_than(n0,add(X1,X2))
| less_than(absolute(add(minus(a),fp33(add(X1,X2)))),X3) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,axiom,
add(n0,X1) = X1,
left_identity ).
cnf(c_0_41,negated_conjecture,
( ~ less_than(n0,X1)
| ~ less_than(absolute(add(minus(a),fp33(X1))),fp31(half(b)))
| ~ less_than(absolute(add(minus(a),fp33(X1))),fp32(half(b))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_29]),c_0_30])]) ).
cnf(c_0_42,negated_conjecture,
( ~ less_than(n0,X1)
| ~ less_than(X1,half(X2))
| ~ less_than(n0,half(X2))
| less_than(absolute(add(minus(a),fp33(X1))),X2) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,negated_conjecture,
( ~ less_than(n0,X1)
| ~ less_than(X1,half(fp32(half(b))))
| ~ less_than(n0,half(fp32(half(b))))
| ~ less_than(absolute(add(minus(a),fp33(X1))),fp31(half(b))) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_44,negated_conjecture,
( ~ less_than(n0,X1)
| less_than(n0,fp32(X1)) ),
inference(fof_simplification,[status(thm)],[c_12]) ).
cnf(c_0_45,plain,
( ~ less_than(n0,X2)
| ~ less_than(n0,X1)
| less_than(minimum(X1,X2),X1) ),
inference(fof_simplification,[status(thm)],[axiom_2_2]) ).
cnf(c_0_46,negated_conjecture,
( ~ less_than(n0,X1)
| ~ less_than(n0,fp32(half(b)))
| ~ less_than(X1,half(fp32(half(b))))
| ~ less_than(absolute(add(minus(a),fp33(X1))),fp31(half(b))) ),
inference(spm,[status(thm)],[c_0_43,c_0_29]) ).
cnf(c_0_47,negated_conjecture,
( ~ less_than(n0,X1)
| less_than(n0,fp32(X1)) ),
c_0_44 ).
cnf(c_0_48,plain,
( ~ less_than(n0,X2)
| ~ less_than(n0,X1)
| less_than(minimum(X1,X2),X1) ),
c_0_45 ).
cnf(c_0_49,negated_conjecture,
( ~ less_than(n0,X1)
| ~ less_than(n0,half(b))
| ~ less_than(X1,half(fp32(half(b))))
| ~ less_than(absolute(add(minus(a),fp33(X1))),fp31(half(b))) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_50,plain,
( ~ less_than(n0,X2)
| ~ less_than(n0,X3)
| ~ less_than(X1,minimum(X2,X3))
| less_than(X1,X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_48]) ).
cnf(c_0_51,negated_conjecture,
( ~ less_than(n0,X1)
| ~ less_than(X1,half(fp32(half(b))))
| ~ less_than(absolute(add(minus(a),fp33(X1))),fp31(half(b))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_29]),c_0_30])]) ).
cnf(c_0_52,negated_conjecture,
( ~ less_than(n0,X1)
| ~ less_than(n0,X2)
| ~ less_than(n0,minimum(X1,X2))
| less_than(absolute(add(minus(a),fp33(minimum(X1,X2)))),X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_37]) ).
cnf(c_0_53,negated_conjecture,
( ~ less_than(n0,X1)
| less_than(n0,fp31(X1)) ),
inference(fof_simplification,[status(thm)],[c_10]) ).
cnf(c_0_54,negated_conjecture,
( ~ less_than(n0,X1)
| ~ less_than(n0,fp31(half(b)))
| ~ less_than(n0,minimum(fp31(half(b)),X1))
| ~ less_than(minimum(fp31(half(b)),X1),half(fp32(half(b)))) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_55,negated_conjecture,
( ~ less_than(n0,X1)
| less_than(n0,fp31(X1)) ),
c_0_53 ).
cnf(c_0_56,negated_conjecture,
( ~ less_than(n0,X1)
| ~ less_than(n0,half(b))
| ~ less_than(n0,minimum(fp31(half(b)),X1))
| ~ less_than(minimum(fp31(half(b)),X1),half(fp32(half(b)))) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_57,plain,
( ~ less_than(n0,X2)
| ~ less_than(n0,X1)
| less_than(minimum(X1,X2),X2) ),
inference(fof_simplification,[status(thm)],[axiom_2_3]) ).
cnf(c_0_58,negated_conjecture,
( ~ less_than(n0,X1)
| ~ less_than(n0,minimum(fp31(half(b)),X1))
| ~ less_than(minimum(fp31(half(b)),X1),half(fp32(half(b)))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_29]),c_0_30])]) ).
cnf(c_0_59,plain,
( ~ less_than(n0,X2)
| ~ less_than(n0,X1)
| less_than(minimum(X1,X2),X2) ),
c_0_57 ).
cnf(c_0_60,plain,
( ~ less_than(n0,X2)
| ~ less_than(n0,X1)
| less_than(n0,minimum(X1,X2)) ),
inference(fof_simplification,[status(thm)],[axiom_2_1]) ).
cnf(c_0_61,negated_conjecture,
( ~ less_than(n0,fp31(half(b)))
| ~ less_than(n0,half(fp32(half(b))))
| ~ less_than(n0,minimum(fp31(half(b)),half(fp32(half(b))))) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_62,plain,
( ~ less_than(n0,X2)
| ~ less_than(n0,X1)
| less_than(n0,minimum(X1,X2)) ),
c_0_60 ).
cnf(c_0_63,negated_conjecture,
( ~ less_than(n0,fp31(half(b)))
| ~ less_than(n0,half(fp32(half(b)))) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_64,negated_conjecture,
( ~ less_than(n0,fp32(half(b)))
| ~ less_than(n0,fp31(half(b))) ),
inference(spm,[status(thm)],[c_0_63,c_0_29]) ).
cnf(c_0_65,negated_conjecture,
( ~ less_than(n0,half(b))
| ~ less_than(n0,fp31(half(b))) ),
inference(spm,[status(thm)],[c_0_64,c_0_47]) ).
cnf(c_0_66,negated_conjecture,
~ less_than(n0,half(b)),
inference(spm,[status(thm)],[c_0_65,c_0_55]) ).
cnf(c_0_67,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_29]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ANA003-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.35 % Computer : n012.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 21 13:21:22 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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
% 156.73/24.95 % Version: 3.5.1
% 156.73/24.95 % Preprocessing class: FSMSSMSSSSSNFFN.
% 156.73/24.95 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 156.73/24.95 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 156.73/24.95 % Starting new_bool_3 with 300s (1) cores
% 156.73/24.95 % Starting new_bool_1 with 300s (1) cores
% 156.73/24.95 % Starting sh5l with 300s (1) cores
% 156.73/24.95 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2448868 completed with status 0
% 156.73/24.95 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 156.73/24.95 % Preprocessing class: FSMSSMSSSSSNFFN.
% 156.73/24.95 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 156.73/24.95 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 156.73/24.95 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 156.73/24.95 % No SInE strategy applied
% 156.73/24.95 % Search class: FHHSM-FFMF21-MFFFFFNN
% 156.73/24.95 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 156.73/24.95 % Starting SubtermCWHack with 136s (1) cores
% 156.73/24.95 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 156.73/24.95 % Starting H----_011_C07_F1_PI_SE_SP_S0V with 169s (1) cores
% 156.73/24.95 % Starting new_bool_3 with 169s (1) cores
% 156.73/24.95 % Starting new_bool_1 with 169s (1) cores
% 156.73/24.95 % H----_011_C07_F1_PI_SE_SP_S0V with pid 2448874 completed with status 0
% 156.73/24.95 % Result found by H----_011_C07_F1_PI_SE_SP_S0V
% 156.73/24.95 % Preprocessing class: FSMSSMSSSSSNFFN.
% 156.73/24.95 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 156.73/24.95 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 156.73/24.95 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 156.73/24.95 % No SInE strategy applied
% 156.73/24.95 % Search class: FHHSM-FFMF21-MFFFFFNN
% 156.73/24.95 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 156.73/24.95 % Starting SubtermCWHack with 136s (1) cores
% 156.73/24.95 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 156.73/24.95 % Starting H----_011_C07_F1_PI_SE_SP_S0V with 169s (1) cores
% 156.73/24.95 % Preprocessing time : 0.001 s
% 156.73/24.95
% 156.73/24.95 % Proof found!
% 156.73/24.95 % SZS status Unsatisfiable
% 156.73/24.95 % SZS output start CNFRefutation
% See solution above
% 156.73/24.95 % Parsed axioms : 21
% 156.73/24.95 % Removed by relevancy pruning/SinE : 0
% 156.73/24.95 % Initial clauses : 21
% 156.73/24.95 % Removed in clause preprocessing : 0
% 156.73/24.95 % Initial clauses in saturation : 21
% 156.73/24.95 % Processed clauses : 90956
% 156.73/24.95 % ...of these trivial : 356
% 156.73/24.95 % ...subsumed : 82731
% 156.73/24.95 % ...remaining for further processing : 7869
% 156.73/24.95 % Other redundant clauses eliminated : 0
% 156.73/24.95 % Clauses deleted for lack of memory : 0
% 156.73/24.95 % Backward-subsumed : 288
% 156.73/24.95 % Backward-rewritten : 0
% 156.73/24.95 % Generated clauses : 1547335
% 156.73/24.95 % ...of the previous two non-redundant : 1547259
% 156.73/24.95 % ...aggressively subsumed : 0
% 156.73/24.95 % Contextual simplify-reflections : 0
% 156.73/24.95 % Paramodulations : 1547335
% 156.73/24.95 % Factorizations : 0
% 156.73/24.95 % NegExts : 0
% 156.73/24.95 % Equation resolutions : 0
% 156.73/24.95 % Disequality decompositions : 0
% 156.73/24.95 % Total rewrite steps : 3252136
% 156.73/24.95 % ...of those cached : 3216413
% 156.73/24.95 % Propositional unsat checks : 0
% 156.73/24.95 % Propositional check models : 0
% 156.73/24.95 % Propositional check unsatisfiable : 0
% 156.73/24.95 % Propositional clauses : 0
% 156.73/24.95 % Propositional clauses after purity: 0
% 156.73/24.95 % Propositional unsat core size : 0
% 156.73/24.95 % Propositional preprocessing time : 0.000
% 156.73/24.95 % Propositional encoding time : 0.000
% 156.73/24.95 % Propositional solver time : 0.000
% 156.73/24.95 % Success case prop preproc time : 0.000
% 156.73/24.95 % Success case prop encoding time : 0.000
% 156.73/24.95 % Success case prop solver time : 0.000
% 156.73/24.95 % Current number of processed clauses : 7581
% 156.73/24.95 % Positive orientable unit clauses : 13
% 156.73/24.95 % Positive unorientable unit clauses: 4
% 156.73/24.95 % Negative unit clauses : 4
% 156.73/24.95 % Non-unit-clauses : 7560
% 156.73/24.95 % Current number of unprocessed clauses: 1455742
% 156.73/24.95 % ...number of literals in the above : 5754678
% 156.73/24.95 % Current number of archived formulas : 0
% 156.73/24.95 % Current number of archived clauses : 288
% 156.73/24.95 % Clause-clause subsumption calls (NU) : 10395449
% 156.73/24.95 % Rec. Clause-clause subsumption calls : 6704935
% 156.73/24.95 % Non-unit clause-clause subsumptions : 78574
% 156.73/24.95 % Unit Clause-clause subsumption calls : 5025
% 156.73/24.95 % Rewrite failures with RHS unbound : 0
% 156.73/24.95 % BW rewrite match attempts : 33
% 156.73/24.95 % BW rewrite match successes : 18
% 156.73/24.95 % Condensation attempts : 0
% 156.73/24.95 % Condensation successes : 0
% 156.73/24.95 % Termbank termtop insertions : 51160696
% 156.73/24.95 % Search garbage collected termcells : 42
% 156.73/24.95
% 156.73/24.95 % -------------------------------------------------
% 156.73/24.95 % User time : 23.316 s
% 156.73/24.95 % System time : 0.845 s
% 156.73/24.95 % Total time : 24.161 s
% 156.73/24.95 % Maximum resident set size: 3652 pages
% 156.73/24.95
% 156.73/24.95 % -------------------------------------------------
% 156.73/24.95 % User time : 113.429 s
% 156.73/24.95 % System time : 4.237 s
% 156.73/24.95 % Total time : 117.665 s
% 156.73/24.95 % Maximum resident set size: 4608 pages
% 156.73/24.95 % E exiting
%------------------------------------------------------------------------------