%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ANA002-4 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n014.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 164.93s 25.03s
% Output : CNFRefutation 164.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 16
% Syntax : Number of clauses : 75 ( 15 unt; 33 nHn; 55 RR)
% Number of literals : 205 ( 0 equ; 84 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 83 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(transitivity_of_less,axiom,
( ~ less_than_or_equal(X3,X2)
| ~ less_than_or_equal(X1,X3)
| less_than_or_equal(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_less) ).
cnf(crossover1,axiom,
( ~ less_than_or_equal(f(X1),n0)
| ~ less_than_or_equal(X1,upper_bound)
| less_than_or_equal(X1,l) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',crossover1) ).
cnf(crossover4_and_g_function3,axiom,
( ~ less_than_or_equal(g(X1),X1)
| less_than_or_equal(l,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',crossover4_and_g_function3) ).
cnf(totality_of_less,axiom,
( less_than_or_equal(X2,X1)
| less_than_or_equal(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',totality_of_less) ).
cnf(continuity2,axiom,
( ~ less_than_or_equal(X1,upper_bound)
| ~ less_than_or_equal(lower_bound,X1)
| ~ less_than_or_equal(f(X2),n0)
| ~ less_than_or_equal(X2,X1)
| less_than_or_equal(X2,h(X1))
| less_than_or_equal(f(X1),n0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',continuity2) ).
cnf(crossover2_and_g_function1,axiom,
( less_than_or_equal(l,X1)
| less_than_or_equal(g(X1),upper_bound) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',crossover2_and_g_function1) ).
cnf(crossover3_and_g_function2,axiom,
( less_than_or_equal(l,X1)
| less_than_or_equal(f(g(X1)),n0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',crossover3_and_g_function2) ).
cnf(the_interval,hypothesis,
less_than_or_equal(lower_bound,upper_bound),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',the_interval) ).
cnf(lower_mapping,hypothesis,
less_than_or_equal(f(lower_bound),n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lower_mapping) ).
cnf(continuity1,axiom,
( ~ less_than_or_equal(X1,upper_bound)
| ~ less_than_or_equal(lower_bound,X1)
| ~ less_than_or_equal(X1,h(X1))
| less_than_or_equal(f(X1),n0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',continuity1) ).
cnf(continuity4,axiom,
( ~ less_than_or_equal(X1,upper_bound)
| ~ less_than_or_equal(lower_bound,X1)
| ~ less_than_or_equal(n0,f(X2))
| ~ less_than_or_equal(X1,X2)
| less_than_or_equal(k(X1),X2)
| less_than_or_equal(n0,f(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',continuity4) ).
cnf(prove_there_is_x_which_crosses,negated_conjecture,
( ~ less_than_or_equal(n0,f(l))
| ~ less_than_or_equal(f(l),n0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_there_is_x_which_crosses) ).
cnf(interpolation1,axiom,
( ~ less_than_or_equal(X1,q(X2,X1))
| less_than_or_equal(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',interpolation1) ).
cnf(continuity3,axiom,
( ~ less_than_or_equal(X1,upper_bound)
| ~ less_than_or_equal(lower_bound,X1)
| ~ less_than_or_equal(k(X1),X1)
| less_than_or_equal(n0,f(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',continuity3) ).
cnf(interpolation2,axiom,
( ~ less_than_or_equal(q(X1,X2),X1)
| less_than_or_equal(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',interpolation2) ).
cnf(upper_mapping,hypothesis,
less_than_or_equal(n0,f(upper_bound)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',upper_mapping) ).
cnf(c_0_16,plain,
( ~ less_than_or_equal(X3,X2)
| ~ less_than_or_equal(X1,X3)
| less_than_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[transitivity_of_less]) ).
cnf(c_0_17,plain,
( ~ less_than_or_equal(f(X1),n0)
| ~ less_than_or_equal(X1,upper_bound)
| less_than_or_equal(X1,l) ),
inference(fof_simplification,[status(thm)],[crossover1]) ).
cnf(c_0_18,plain,
( ~ less_than_or_equal(g(X1),X1)
| less_than_or_equal(l,X1) ),
inference(fof_simplification,[status(thm)],[crossover4_and_g_function3]) ).
cnf(c_0_19,plain,
( ~ less_than_or_equal(X3,X2)
| ~ less_than_or_equal(X1,X3)
| less_than_or_equal(X1,X2) ),
c_0_16 ).
cnf(c_0_20,axiom,
( less_than_or_equal(X2,X1)
| less_than_or_equal(X1,X2) ),
totality_of_less ).
cnf(c_0_21,plain,
( ~ less_than_or_equal(X1,upper_bound)
| ~ less_than_or_equal(lower_bound,X1)
| ~ less_than_or_equal(f(X2),n0)
| ~ less_than_or_equal(X2,X1)
| less_than_or_equal(X2,h(X1))
| less_than_or_equal(f(X1),n0) ),
inference(fof_simplification,[status(thm)],[continuity2]) ).
cnf(c_0_22,plain,
( ~ less_than_or_equal(f(X1),n0)
| ~ less_than_or_equal(X1,upper_bound)
| less_than_or_equal(X1,l) ),
c_0_17 ).
cnf(c_0_23,axiom,
( less_than_or_equal(l,X1)
| less_than_or_equal(g(X1),upper_bound) ),
crossover2_and_g_function1 ).
cnf(c_0_24,axiom,
( less_than_or_equal(l,X1)
| less_than_or_equal(f(g(X1)),n0) ),
crossover3_and_g_function2 ).
cnf(c_0_25,plain,
( ~ less_than_or_equal(g(X1),X1)
| less_than_or_equal(l,X1) ),
c_0_18 ).
cnf(c_0_26,hypothesis,
less_than_or_equal(lower_bound,upper_bound),
the_interval ).
cnf(c_0_27,hypothesis,
less_than_or_equal(f(lower_bound),n0),
lower_mapping ).
cnf(c_0_28,plain,
( ~ less_than_or_equal(X1,upper_bound)
| ~ less_than_or_equal(lower_bound,X1)
| ~ less_than_or_equal(X1,h(X1))
| less_than_or_equal(f(X1),n0) ),
inference(fof_simplification,[status(thm)],[continuity1]) ).
cnf(c_0_29,plain,
( ~ less_than_or_equal(X1,upper_bound)
| ~ less_than_or_equal(lower_bound,X1)
| ~ less_than_or_equal(n0,f(X2))
| ~ less_than_or_equal(X1,X2)
| less_than_or_equal(k(X1),X2)
| less_than_or_equal(n0,f(X1)) ),
inference(fof_simplification,[status(thm)],[continuity4]) ).
cnf(c_0_30,plain,
( ~ less_than_or_equal(X3,X2)
| less_than_or_equal(X3,X1)
| less_than_or_equal(X1,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_31,plain,
( ~ less_than_or_equal(X1,upper_bound)
| ~ less_than_or_equal(lower_bound,X1)
| ~ less_than_or_equal(f(X2),n0)
| ~ less_than_or_equal(X2,X1)
| less_than_or_equal(X2,h(X1))
| less_than_or_equal(f(X1),n0) ),
c_0_21 ).
cnf(c_0_32,plain,
( less_than_or_equal(l,X1)
| less_than_or_equal(g(X1),l) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_33,plain,
less_than_or_equal(l,upper_bound),
inference(spm,[status(thm)],[c_0_25,c_0_23]) ).
cnf(c_0_34,hypothesis,
less_than_or_equal(lower_bound,l),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_26]),c_0_27])]) ).
cnf(c_0_35,plain,
( ~ less_than_or_equal(X1,upper_bound)
| ~ less_than_or_equal(lower_bound,X1)
| ~ less_than_or_equal(X1,h(X1))
| less_than_or_equal(f(X1),n0) ),
c_0_28 ).
cnf(c_0_36,plain,
( ~ less_than_or_equal(X1,upper_bound)
| ~ less_than_or_equal(lower_bound,X1)
| ~ less_than_or_equal(n0,f(X2))
| ~ less_than_or_equal(X1,X2)
| less_than_or_equal(k(X1),X2)
| less_than_or_equal(n0,f(X1)) ),
c_0_29 ).
cnf(c_0_37,plain,
( less_than_or_equal(X3,X1)
| less_than_or_equal(X2,X3)
| less_than_or_equal(X1,X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_20]) ).
cnf(c_0_38,negated_conjecture,
( ~ less_than_or_equal(n0,f(l))
| ~ less_than_or_equal(f(l),n0) ),
inference(fof_simplification,[status(thm)],[prove_there_is_x_which_crosses]) ).
cnf(c_0_39,plain,
( less_than_or_equal(l,X1)
| less_than_or_equal(f(l),n0)
| less_than_or_equal(g(X1),h(l)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34])]),c_0_24]) ).
cnf(c_0_40,plain,
( ~ less_than_or_equal(l,h(l))
| less_than_or_equal(f(l),n0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_33]),c_0_34])]) ).
cnf(c_0_41,plain,
( ~ less_than_or_equal(lower_bound,X1)
| ~ less_than_or_equal(X1,upper_bound)
| ~ less_than_or_equal(n0,f(X2))
| less_than_or_equal(X2,X1)
| less_than_or_equal(k(X1),X2)
| less_than_or_equal(n0,f(X1)) ),
inference(spm,[status(thm)],[c_0_36,c_0_20]) ).
cnf(c_0_42,plain,
( ~ less_than_or_equal(f(X2),n0)
| less_than_or_equal(X1,X2)
| less_than_or_equal(X2,l)
| less_than_or_equal(upper_bound,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_37]) ).
cnf(c_0_43,negated_conjecture,
( ~ less_than_or_equal(n0,f(l))
| ~ less_than_or_equal(f(l),n0) ),
c_0_38 ).
cnf(c_0_44,plain,
less_than_or_equal(f(l),n0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_39]),c_0_40]) ).
cnf(c_0_45,plain,
( ~ less_than_or_equal(n0,f(X1))
| less_than_or_equal(X1,l)
| less_than_or_equal(k(l),X1)
| less_than_or_equal(n0,f(l)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_33]),c_0_34])]) ).
cnf(c_0_46,plain,
( less_than_or_equal(X2,X1)
| less_than_or_equal(upper_bound,X2)
| less_than_or_equal(X1,l)
| less_than_or_equal(n0,f(X1)) ),
inference(spm,[status(thm)],[c_0_42,c_0_20]) ).
cnf(c_0_47,negated_conjecture,
~ less_than_or_equal(n0,f(l)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]) ).
cnf(c_0_48,plain,
( ~ less_than_or_equal(X1,q(X2,X1))
| less_than_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[interpolation1]) ).
cnf(c_0_49,plain,
( less_than_or_equal(X2,X1)
| less_than_or_equal(X1,l)
| less_than_or_equal(upper_bound,X2)
| less_than_or_equal(k(l),X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]) ).
cnf(c_0_50,plain,
( ~ less_than_or_equal(lower_bound,X1)
| ~ less_than_or_equal(n0,f(X2))
| less_than_or_equal(X2,X1)
| less_than_or_equal(upper_bound,X1)
| less_than_or_equal(k(X1),X2)
| less_than_or_equal(n0,f(X1)) ),
inference(spm,[status(thm)],[c_0_41,c_0_20]) ).
cnf(c_0_51,plain,
( ~ less_than_or_equal(f(X1),n0)
| less_than_or_equal(X1,l)
| less_than_or_equal(upper_bound,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_20]) ).
cnf(c_0_52,plain,
( ~ less_than_or_equal(X1,upper_bound)
| ~ less_than_or_equal(lower_bound,X1)
| ~ less_than_or_equal(k(X1),X1)
| less_than_or_equal(n0,f(X1)) ),
inference(fof_simplification,[status(thm)],[continuity3]) ).
cnf(c_0_53,plain,
( ~ less_than_or_equal(q(X1,X2),X1)
| less_than_or_equal(X2,X1) ),
inference(fof_simplification,[status(thm)],[interpolation2]) ).
cnf(c_0_54,plain,
( ~ less_than_or_equal(X1,q(X2,X1))
| less_than_or_equal(X1,X2) ),
c_0_48 ).
cnf(c_0_55,plain,
( less_than_or_equal(X1,l)
| less_than_or_equal(k(l),X1)
| less_than_or_equal(upper_bound,k(l)) ),
inference(ef,[status(thm)],[c_0_49]) ).
cnf(c_0_56,hypothesis,
( ~ less_than_or_equal(n0,f(X1))
| less_than_or_equal(X1,l)
| less_than_or_equal(upper_bound,l)
| less_than_or_equal(k(l),X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_34]),c_0_47]) ).
cnf(c_0_57,plain,
( less_than_or_equal(upper_bound,X1)
| less_than_or_equal(X1,l)
| less_than_or_equal(n0,f(X1)) ),
inference(spm,[status(thm)],[c_0_51,c_0_20]) ).
cnf(c_0_58,plain,
( ~ less_than_or_equal(X1,upper_bound)
| ~ less_than_or_equal(lower_bound,X1)
| ~ less_than_or_equal(k(X1),X1)
| less_than_or_equal(n0,f(X1)) ),
c_0_52 ).
cnf(c_0_59,plain,
( ~ less_than_or_equal(q(X1,X2),X1)
| less_than_or_equal(X2,X1) ),
c_0_53 ).
cnf(c_0_60,plain,
( less_than_or_equal(k(l),X1)
| less_than_or_equal(upper_bound,k(l))
| less_than_or_equal(q(X1,k(l)),l) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_61,hypothesis,
( less_than_or_equal(X1,l)
| less_than_or_equal(upper_bound,X1)
| less_than_or_equal(k(l),X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_30]) ).
cnf(c_0_62,plain,
( ~ less_than_or_equal(k(l),l)
| less_than_or_equal(n0,f(l)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_33]),c_0_34])]) ).
cnf(c_0_63,plain,
( less_than_or_equal(k(l),l)
| less_than_or_equal(upper_bound,k(l)) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_64,hypothesis,
( ~ less_than_or_equal(X2,k(l))
| less_than_or_equal(X2,X1)
| less_than_or_equal(upper_bound,X1)
| less_than_or_equal(X1,l) ),
inference(spm,[status(thm)],[c_0_19,c_0_61]) ).
cnf(c_0_65,plain,
less_than_or_equal(upper_bound,k(l)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_47]) ).
cnf(c_0_66,hypothesis,
( less_than_or_equal(X1,l)
| less_than_or_equal(upper_bound,X1) ),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_67,hypothesis,
( less_than_or_equal(X1,l)
| less_than_or_equal(upper_bound,q(l,X1)) ),
inference(spm,[status(thm)],[c_0_59,c_0_66]) ).
cnf(c_0_68,hypothesis,
less_than_or_equal(n0,f(upper_bound)),
upper_mapping ).
cnf(c_0_69,hypothesis,
less_than_or_equal(upper_bound,l),
inference(spm,[status(thm)],[c_0_54,c_0_67]) ).
cnf(c_0_70,plain,
( less_than_or_equal(n0,f(l))
| less_than_or_equal(k(l),upper_bound) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_33]),c_0_68]),c_0_33]),c_0_34])]) ).
cnf(c_0_71,hypothesis,
( ~ less_than_or_equal(X1,upper_bound)
| less_than_or_equal(X1,l) ),
inference(spm,[status(thm)],[c_0_19,c_0_69]) ).
cnf(c_0_72,plain,
less_than_or_equal(k(l),upper_bound),
inference(sr,[status(thm)],[c_0_70,c_0_47]) ).
cnf(c_0_73,hypothesis,
less_than_or_equal(k(l),l),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_74,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_73])]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : ANA002-4 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.45 % Computer : n014.cluster.edu
% 0.19/0.45 % Model : x86_64 x86_64
% 0.19/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45 % Memory : 8046.5625MB
% 0.19/0.45 % OS : Linux 6.8.0-71-generic
% 0.19/0.45 % CPULimit : 300
% 0.19/0.45 % WCLimit : 300
% 0.19/0.45 % DateTime : Mon Sep 21 13:21:34 UTC 2026
% 0.19/0.46 % CPUTime :
% 0.19/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.53 Running first-order theorem proving
% 0.24/0.53 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
% 164.93/25.03 % Version: 3.5.1
% 164.93/25.03 % Preprocessing class: FSMSSMSSSSSNFFN.
% 164.93/25.03 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 164.93/25.03 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 164.93/25.03 % Starting new_bool_3 with 300s (1) cores
% 164.93/25.03 % Starting new_bool_1 with 300s (1) cores
% 164.93/25.03 % Starting sh5l with 300s (1) cores
% 164.93/25.03 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4154682 completed with status 0
% 164.93/25.03 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 164.93/25.03 % Preprocessing class: FSMSSMSSSSSNFFN.
% 164.93/25.03 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 164.93/25.03 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 164.93/25.03 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 164.93/25.03 % No SInE strategy applied
% 164.93/25.03 % Search class: FGHNF-FFSS21-SFFFFFNN
% 164.93/25.03 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 164.93/25.03 % Starting SubtermCWHack with 136s (1) cores
% 164.93/25.03 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 164.93/25.03 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 164.93/25.03 % Starting new_bool_3 with 136s (1) cores
% 164.93/25.03 % Starting new_bool_1 with 136s (1) cores
% 164.93/25.03 % new_bool_3 with pid 4154691 completed with status 0
% 164.93/25.03 % Result found by new_bool_3
% 164.93/25.03 % Preprocessing class: FSMSSMSSSSSNFFN.
% 164.93/25.03 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 164.93/25.03 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 164.93/25.03 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 164.93/25.03 % No SInE strategy applied
% 164.93/25.03 % Search class: FGHNF-FFSS21-SFFFFFNN
% 164.93/25.03 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 164.93/25.03 % Starting SubtermCWHack with 136s (1) cores
% 164.93/25.03 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 164.93/25.03 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 164.93/25.03 % Starting new_bool_3 with 136s (1) cores
% 164.93/25.03 % Preprocessing time : 0.002 s
% 164.93/25.03 % Presaturation interreduction done
% 164.93/25.03
% 164.93/25.03 % Proof found!
% 164.93/25.03 % SZS status Unsatisfiable
% 164.93/25.03 % SZS output start CNFRefutation
% See solution above
% 164.93/25.04 % Parsed axioms : 17
% 164.93/25.04 % Removed by relevancy pruning/SinE : 0
% 164.93/25.04 % Initial clauses : 17
% 164.93/25.04 % Removed in clause preprocessing : 0
% 164.93/25.04 % Initial clauses in saturation : 17
% 164.93/25.04 % Processed clauses : 17290
% 164.93/25.04 % ...of these trivial : 105
% 164.93/25.04 % ...subsumed : 14331
% 164.93/25.04 % ...remaining for further processing : 2854
% 164.93/25.04 % Other redundant clauses eliminated : 0
% 164.93/25.04 % Clauses deleted for lack of memory : 0
% 164.93/25.04 % Backward-subsumed : 407
% 164.93/25.04 % Backward-rewritten : 147
% 164.93/25.04 % Generated clauses : 880330
% 164.93/25.04 % ...of the previous two non-redundant : 656420
% 164.93/25.04 % ...aggressively subsumed : 0
% 164.93/25.04 % Contextual simplify-reflections : 101
% 164.93/25.04 % Paramodulations : 879714
% 164.93/25.04 % Factorizations : 584
% 164.93/25.04 % NegExts : 0
% 164.93/25.04 % Equation resolutions : 0
% 164.93/25.04 % Disequality decompositions : 0
% 164.93/25.04 % Total rewrite steps : 244643
% 164.93/25.04 % ...of those cached : 244529
% 164.93/25.04 % Propositional unsat checks : 0
% 164.93/25.04 % Propositional check models : 0
% 164.93/25.04 % Propositional check unsatisfiable : 0
% 164.93/25.04 % Propositional clauses : 0
% 164.93/25.04 % Propositional clauses after purity: 0
% 164.93/25.04 % Propositional unsat core size : 0
% 164.93/25.04 % Propositional preprocessing time : 0.000
% 164.93/25.04 % Propositional encoding time : 0.000
% 164.93/25.04 % Propositional solver time : 0.000
% 164.93/25.04 % Success case prop preproc time : 0.000
% 164.93/25.04 % Success case prop encoding time : 0.000
% 164.93/25.04 % Success case prop solver time : 0.000
% 164.93/25.04 % Current number of processed clauses : 2251
% 164.93/25.04 % Positive orientable unit clauses : 24
% 164.93/25.04 % Positive unorientable unit clauses: 0
% 164.93/25.04 % Negative unit clauses : 1
% 164.93/25.04 % Non-unit-clauses : 2226
% 164.93/25.04 % Current number of unprocessed clauses: 637613
% 164.93/25.04 % ...number of literals in the above : 3823145
% 164.93/25.04 % Current number of archived formulas : 0
% 164.93/25.04 % Current number of archived clauses : 603
% 164.93/25.04 % Clause-clause subsumption calls (NU) : 2067144
% 164.93/25.04 % Rec. Clause-clause subsumption calls : 312809
% 164.93/25.04 % Non-unit clause-clause subsumptions : 14833
% 164.93/25.04 % Unit Clause-clause subsumption calls : 5315
% 164.93/25.04 % Rewrite failures with RHS unbound : 0
% 164.93/25.04 % BW rewrite match attempts : 11
% 164.93/25.04 % BW rewrite match successes : 5
% 164.93/25.04 % Condensation attempts : 0
% 164.93/25.04 % Condensation successes : 0
% 164.93/25.04 % Termbank termtop insertions : 16213799
% 164.93/25.04 % Search garbage collected termcells : 51
% 164.93/25.04
% 164.93/25.04 % -------------------------------------------------
% 164.93/25.04 % User time : 23.242 s
% 164.93/25.04 % System time : 0.644 s
% 164.93/25.04 % Total time : 23.886 s
% 164.93/25.04 % Maximum resident set size: 3592 pages
% 164.93/25.04
% 164.93/25.04 % -------------------------------------------------
% 164.93/25.04 % User time : 114.015 s
% 164.93/25.04 % System time : 3.358 s
% 164.93/25.04 % Total time : 117.372 s
% 164.93/25.04 % Maximum resident set size: 4864 pages
% 164.93/25.04 % E exiting
%------------------------------------------------------------------------------