%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT039-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n016.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 01:26:51 PM UTC 2026
% Result : Unsatisfiable 0.29s 0.53s
% Output : CNFRefutation 0.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 18
% Syntax : Number of clauses : 77 ( 13 unt; 24 nHn; 76 RR)
% Number of literals : 263 ( 19 equ; 162 neg)
% Maximal clause size : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 105 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(mp_greater_transitivity_30,axiom,
( ~ greater(X2,X3)
| ~ greater(X1,X2)
| greater(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_greater_transitivity_30) ).
cnf(mp4_critical_point_24,axiom,
( ~ in_environment(X1,X2)
| ~ environment(X2)
| ~ slow_change(X1)
| ~ observational_period(X1)
| greater(sk2(X2,X1),critical_point(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp4_critical_point_24) ).
cnf(mp_greater_or_equal_31,axiom,
( ~ greater_or_equal(X1,X2)
| X1 = X2
| greater(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_greater_or_equal_31) ).
cnf(mp_environment_end_point_28,axiom,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| greater_or_equal(end_time(X1),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_environment_end_point_28) ).
cnf(mp_time_in_environment_27,axiom,
( ~ greater_or_equal(end_time(X1),X2)
| ~ greater_or_equal(X2,start_time(X1))
| ~ environment(X1)
| in_environment(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_time_in_environment_27) ).
cnf(mp_greater_or_equal_32,axiom,
( ~ greater(X1,X2)
| greater_or_equal(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_greater_or_equal_32) ).
cnf(mp_greater_or_equal_33,axiom,
( X1 != X2
| greater_or_equal(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_greater_or_equal_33) ).
cnf(mp_time_of_critical_point_29,axiom,
( ~ environment(X1)
| greater_or_equal(critical_point(X1),start_time(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_time_of_critical_point_29) ).
cnf(mp4_critical_point_23,axiom,
( ~ in_environment(X1,X2)
| ~ environment(X2)
| ~ slow_change(X1)
| ~ observational_period(X1)
| in_environment(X2,sk2(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp4_critical_point_23) ).
cnf(mp3_favoured_trategy_21,axiom,
( ~ propagation_strategy(efficient_producers)
| ~ propagation_strategy(first_movers)
| ~ observational_period(X1)
| selection_favors(efficient_producers,first_movers,X1)
| in_environment(X1,sk1(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp3_favoured_trategy_21) ).
cnf(mp3_favoured_trategy_20,axiom,
( ~ propagation_strategy(efficient_producers)
| ~ propagation_strategy(first_movers)
| ~ observational_period(X1)
| selection_favors(efficient_producers,first_movers,X1)
| environment(sk1(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp3_favoured_trategy_20) ).
cnf(mp_organizational_sets1_25,axiom,
propagation_strategy(first_movers),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_organizational_sets1_25) ).
cnf(mp_organizational_sets2_26,axiom,
propagation_strategy(efficient_producers),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_organizational_sets2_26) ).
cnf(mp3_favoured_trategy_22,axiom,
( ~ selection_favors(efficient_producers,first_movers,end_time(sk1(X1)))
| ~ propagation_strategy(efficient_producers)
| ~ propagation_strategy(first_movers)
| ~ observational_period(X1)
| selection_favors(efficient_producers,first_movers,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp3_favoured_trategy_22) ).
cnf(l8_35,hypothesis,
( ~ greater(X2,critical_point(X1))
| ~ in_environment(X1,X2)
| ~ environment(X1)
| selection_favors(efficient_producers,first_movers,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l8_35) ).
cnf(prove_t8_38,negated_conjecture,
~ selection_favors(efficient_producers,first_movers,sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t8_38) ).
cnf(prove_t8_37,negated_conjecture,
slow_change(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t8_37) ).
cnf(prove_t8_36,negated_conjecture,
observational_period(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t8_36) ).
cnf(c_0_18,plain,
( ~ greater(X2,X3)
| ~ greater(X1,X2)
| greater(X1,X3) ),
inference(fof_simplification,[status(thm)],[mp_greater_transitivity_30]) ).
cnf(c_0_19,plain,
( ~ in_environment(X1,X2)
| ~ environment(X2)
| ~ slow_change(X1)
| ~ observational_period(X1)
| greater(sk2(X2,X1),critical_point(X2)) ),
inference(fof_simplification,[status(thm)],[mp4_critical_point_24]) ).
cnf(c_0_20,plain,
( ~ greater_or_equal(X1,X2)
| X1 = X2
| greater(X1,X2) ),
inference(fof_simplification,[status(thm)],[mp_greater_or_equal_31]) ).
cnf(c_0_21,plain,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| greater_or_equal(end_time(X1),X2) ),
inference(fof_simplification,[status(thm)],[mp_environment_end_point_28]) ).
cnf(c_0_22,plain,
( ~ greater(X2,X3)
| ~ greater(X1,X2)
| greater(X1,X3) ),
c_0_18 ).
cnf(c_0_23,plain,
( ~ in_environment(X1,X2)
| ~ environment(X2)
| ~ slow_change(X1)
| ~ observational_period(X1)
| greater(sk2(X2,X1),critical_point(X2)) ),
c_0_19 ).
cnf(c_0_24,plain,
( ~ greater_or_equal(X1,X2)
| X1 = X2
| greater(X1,X2) ),
c_0_20 ).
cnf(c_0_25,plain,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| greater_or_equal(end_time(X1),X2) ),
c_0_21 ).
cnf(c_0_26,plain,
( ~ greater_or_equal(end_time(X1),X2)
| ~ greater_or_equal(X2,start_time(X1))
| ~ environment(X1)
| in_environment(X1,X2) ),
inference(fof_simplification,[status(thm)],[mp_time_in_environment_27]) ).
cnf(c_0_27,plain,
( ~ greater(X1,X2)
| greater_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[mp_greater_or_equal_32]) ).
cnf(c_0_28,plain,
( X1 != X2
| greater_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[mp_greater_or_equal_33]) ).
cnf(c_0_29,plain,
( ~ environment(X1)
| greater_or_equal(critical_point(X1),start_time(X1)) ),
inference(fof_simplification,[status(thm)],[mp_time_of_critical_point_29]) ).
cnf(c_0_30,plain,
( ~ observational_period(X3)
| ~ environment(X2)
| ~ in_environment(X3,X2)
| ~ slow_change(X3)
| ~ greater(X1,sk2(X2,X3))
| greater(X1,critical_point(X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_31,plain,
( ~ environment(X1)
| ~ in_environment(X1,X2)
| greater(end_time(X1),X2)
| end_time(X1) = X2 ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,plain,
( ~ in_environment(X1,X2)
| ~ environment(X2)
| ~ slow_change(X1)
| ~ observational_period(X1)
| in_environment(X2,sk2(X2,X1)) ),
inference(fof_simplification,[status(thm)],[mp4_critical_point_23]) ).
cnf(c_0_33,plain,
( ~ propagation_strategy(efficient_producers)
| ~ propagation_strategy(first_movers)
| ~ observational_period(X1)
| selection_favors(efficient_producers,first_movers,X1)
| in_environment(X1,sk1(X1)) ),
inference(fof_simplification,[status(thm)],[mp3_favoured_trategy_21]) ).
cnf(c_0_34,plain,
( ~ propagation_strategy(efficient_producers)
| ~ propagation_strategy(first_movers)
| ~ observational_period(X1)
| selection_favors(efficient_producers,first_movers,X1)
| environment(sk1(X1)) ),
inference(fof_simplification,[status(thm)],[mp3_favoured_trategy_20]) ).
cnf(c_0_35,plain,
( ~ greater_or_equal(end_time(X1),X2)
| ~ greater_or_equal(X2,start_time(X1))
| ~ environment(X1)
| in_environment(X1,X2) ),
c_0_26 ).
cnf(c_0_36,plain,
( ~ greater(X1,X2)
| greater_or_equal(X1,X2) ),
c_0_27 ).
cnf(c_0_37,plain,
( X1 != X2
| greater_or_equal(X1,X2) ),
c_0_28 ).
cnf(c_0_38,plain,
( ~ environment(X1)
| greater_or_equal(critical_point(X1),start_time(X1)) ),
c_0_29 ).
cnf(c_0_39,plain,
( ~ observational_period(X3)
| ~ environment(X1)
| ~ environment(X2)
| ~ in_environment(X3,X2)
| ~ in_environment(X1,sk2(X2,X3))
| ~ slow_change(X3)
| greater(end_time(X1),critical_point(X2))
| end_time(X1) = sk2(X2,X3) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_40,plain,
( ~ in_environment(X1,X2)
| ~ environment(X2)
| ~ slow_change(X1)
| ~ observational_period(X1)
| in_environment(X2,sk2(X2,X1)) ),
c_0_32 ).
cnf(c_0_41,plain,
( ~ propagation_strategy(efficient_producers)
| ~ propagation_strategy(first_movers)
| ~ observational_period(X1)
| selection_favors(efficient_producers,first_movers,X1)
| in_environment(X1,sk1(X1)) ),
c_0_33 ).
cnf(c_0_42,axiom,
propagation_strategy(first_movers),
mp_organizational_sets1_25 ).
cnf(c_0_43,axiom,
propagation_strategy(efficient_producers),
mp_organizational_sets2_26 ).
cnf(c_0_44,plain,
( ~ propagation_strategy(efficient_producers)
| ~ propagation_strategy(first_movers)
| ~ observational_period(X1)
| selection_favors(efficient_producers,first_movers,X1)
| environment(sk1(X1)) ),
c_0_34 ).
cnf(c_0_45,plain,
( ~ selection_favors(efficient_producers,first_movers,end_time(sk1(X1)))
| ~ propagation_strategy(efficient_producers)
| ~ propagation_strategy(first_movers)
| ~ observational_period(X1)
| selection_favors(efficient_producers,first_movers,X1) ),
inference(fof_simplification,[status(thm)],[mp3_favoured_trategy_22]) ).
cnf(c_0_46,plain,
( ~ environment(X1)
| ~ greater(X2,start_time(X1))
| ~ greater_or_equal(end_time(X1),X2)
| in_environment(X1,X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_47,plain,
greater_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_37]) ).
cnf(c_0_48,plain,
( ~ environment(X1)
| greater(critical_point(X1),start_time(X1))
| start_time(X1) = critical_point(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_38]) ).
cnf(c_0_49,hypothesis,
( ~ greater(X2,critical_point(X1))
| ~ in_environment(X1,X2)
| ~ environment(X1)
| selection_favors(efficient_producers,first_movers,X2) ),
inference(fof_simplification,[status(thm)],[l8_35]) ).
cnf(c_0_50,plain,
( ~ observational_period(X2)
| ~ environment(X1)
| ~ in_environment(X2,X1)
| ~ slow_change(X2)
| greater(end_time(X1),critical_point(X1))
| sk2(X1,X2) = end_time(X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_51,plain,
( ~ observational_period(X1)
| selection_favors(efficient_producers,first_movers,X1)
| in_environment(X1,sk1(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42]),c_0_43])]) ).
cnf(c_0_52,plain,
( ~ observational_period(X1)
| environment(sk1(X1))
| selection_favors(efficient_producers,first_movers,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_42]),c_0_43])]) ).
cnf(c_0_53,plain,
( ~ selection_favors(efficient_producers,first_movers,end_time(sk1(X1)))
| ~ propagation_strategy(efficient_producers)
| ~ propagation_strategy(first_movers)
| ~ observational_period(X1)
| selection_favors(efficient_producers,first_movers,X1) ),
c_0_45 ).
cnf(c_0_54,plain,
( ~ environment(X1)
| ~ greater(end_time(X1),start_time(X1))
| in_environment(X1,end_time(X1)) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_55,plain,
( ~ environment(X1)
| ~ greater(X2,critical_point(X1))
| greater(X2,start_time(X1))
| start_time(X1) = critical_point(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_48]) ).
cnf(c_0_56,hypothesis,
( ~ greater(X2,critical_point(X1))
| ~ in_environment(X1,X2)
| ~ environment(X1)
| selection_favors(efficient_producers,first_movers,X2) ),
c_0_49 ).
cnf(c_0_57,plain,
( ~ observational_period(X1)
| ~ slow_change(X1)
| selection_favors(efficient_producers,first_movers,X1)
| greater(end_time(sk1(X1)),critical_point(sk1(X1)))
| sk2(sk1(X1),X1) = end_time(sk1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]) ).
cnf(c_0_58,plain,
( ~ observational_period(X1)
| ~ selection_favors(efficient_producers,first_movers,end_time(sk1(X1)))
| selection_favors(efficient_producers,first_movers,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_42]),c_0_43])]) ).
cnf(c_0_59,plain,
( ~ environment(X1)
| ~ greater(end_time(X1),critical_point(X1))
| in_environment(X1,end_time(X1))
| start_time(X1) = critical_point(X1) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_60,hypothesis,
( ~ observational_period(X1)
| ~ in_environment(sk1(X1),end_time(sk1(X1)))
| ~ slow_change(X1)
| selection_favors(efficient_producers,first_movers,X1)
| sk2(sk1(X1),X1) = end_time(sk1(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_52]),c_0_58]) ).
cnf(c_0_61,plain,
( ~ environment(X2)
| ~ environment(X1)
| ~ in_environment(X2,start_time(X1))
| ~ greater_or_equal(end_time(X1),end_time(X2))
| in_environment(X1,end_time(X2)) ),
inference(spm,[status(thm)],[c_0_35,c_0_25]) ).
cnf(c_0_62,hypothesis,
( ~ observational_period(X2)
| ~ environment(X1)
| ~ in_environment(X2,X1)
| ~ slow_change(X2)
| selection_favors(efficient_producers,first_movers,sk2(X1,X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_23]),c_0_40]) ).
cnf(c_0_63,plain,
( ~ observational_period(X1)
| ~ slow_change(X1)
| selection_favors(efficient_producers,first_movers,X1)
| start_time(sk1(X1)) = critical_point(sk1(X1))
| sk2(sk1(X1),X1) = end_time(sk1(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_57]),c_0_52]),c_0_60]) ).
cnf(c_0_64,plain,
( ~ environment(X1)
| ~ greater_or_equal(end_time(X1),critical_point(X1))
| in_environment(X1,critical_point(X1)) ),
inference(spm,[status(thm)],[c_0_35,c_0_38]) ).
cnf(c_0_65,plain,
( ~ environment(X1)
| ~ in_environment(X1,start_time(X1))
| in_environment(X1,end_time(X1)) ),
inference(spm,[status(thm)],[c_0_61,c_0_47]) ).
cnf(c_0_66,hypothesis,
( ~ observational_period(X1)
| ~ slow_change(X1)
| selection_favors(efficient_producers,first_movers,X1)
| start_time(sk1(X1)) = critical_point(sk1(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_52]),c_0_51]),c_0_58]) ).
cnf(c_0_67,plain,
( ~ environment(X1)
| ~ greater(end_time(X1),critical_point(X1))
| in_environment(X1,critical_point(X1)) ),
inference(spm,[status(thm)],[c_0_64,c_0_36]) ).
cnf(c_0_68,hypothesis,
( ~ observational_period(X1)
| ~ in_environment(sk1(X1),critical_point(sk1(X1)))
| ~ slow_change(X1)
| selection_favors(efficient_producers,first_movers,X1)
| in_environment(sk1(X1),end_time(sk1(X1))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_52]) ).
cnf(c_0_69,plain,
( ~ observational_period(X1)
| ~ slow_change(X1)
| selection_favors(efficient_producers,first_movers,X1)
| in_environment(sk1(X1),critical_point(sk1(X1)))
| sk2(sk1(X1),X1) = end_time(sk1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_57]),c_0_52]) ).
cnf(c_0_70,hypothesis,
( ~ observational_period(X1)
| ~ slow_change(X1)
| selection_favors(efficient_producers,first_movers,X1)
| sk2(sk1(X1),X1) = end_time(sk1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_60]) ).
cnf(c_0_71,negated_conjecture,
~ selection_favors(efficient_producers,first_movers,sk3),
inference(fof_simplification,[status(thm)],[prove_t8_38]) ).
cnf(c_0_72,hypothesis,
( ~ observational_period(X1)
| ~ slow_change(X1)
| selection_favors(efficient_producers,first_movers,X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_70]),c_0_52]),c_0_51]),c_0_58]) ).
cnf(c_0_73,negated_conjecture,
slow_change(sk3),
prove_t8_37 ).
cnf(c_0_74,negated_conjecture,
observational_period(sk3),
prove_t8_36 ).
cnf(c_0_75,negated_conjecture,
~ selection_favors(efficient_producers,first_movers,sk3),
c_0_71 ).
cnf(c_0_76,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_74])]),c_0_75]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT039-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n016.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 01:27:39 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.45 Running first-order theorem proving
% 0.15/0.45 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
% 0.29/0.53 % Version: 3.5.1
% 0.29/0.53 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.29/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/0.53 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.29/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.29/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.29/0.53 % Starting sh5l with 300s (1) cores
% 0.29/0.53 % new_bool_1 with pid 1274174 completed with status 0
% 0.29/0.53 % Result found by new_bool_1
% 0.29/0.53 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.29/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/0.53 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.29/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.29/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.29/0.53 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.29/0.53 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.29/0.53 % Search class: FGUSF-FFSS21-SFFFFFNN
% 0.29/0.53 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.29/0.53 % Starting SubtermCWHack with 31s (1) cores
% 0.29/0.53 % SubtermCWHack with pid 1274177 completed with status 0
% 0.29/0.53 % Result found by SubtermCWHack
% 0.29/0.53 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.29/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/0.53 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.29/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.29/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.29/0.53 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.29/0.53 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.29/0.53 % Search class: FGUSF-FFSS21-SFFFFFNN
% 0.29/0.53 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.29/0.53 % Starting SubtermCWHack with 31s (1) cores
% 0.29/0.53 % Preprocessing time : 0.002 s
% 0.29/0.53
% 0.29/0.53 % Proof found!
% 0.29/0.53 % SZS status Unsatisfiable
% 0.29/0.53 % SZS output start CNFRefutation
% See solution above
% 0.29/0.53 % Parsed axioms : 19
% 0.29/0.53 % Removed by relevancy pruning/SinE : 0
% 0.29/0.53 % Initial clauses : 19
% 0.29/0.53 % Removed in clause preprocessing : 0
% 0.29/0.53 % Initial clauses in saturation : 19
% 0.29/0.53 % Processed clauses : 111
% 0.29/0.53 % ...of these trivial : 0
% 0.29/0.53 % ...subsumed : 14
% 0.29/0.53 % ...remaining for further processing : 97
% 0.29/0.53 % Other redundant clauses eliminated : 1
% 0.29/0.53 % Clauses deleted for lack of memory : 0
% 0.29/0.53 % Backward-subsumed : 12
% 0.29/0.53 % Backward-rewritten : 0
% 0.29/0.53 % Generated clauses : 219
% 0.29/0.53 % ...of the previous two non-redundant : 203
% 0.29/0.53 % ...aggressively subsumed : 0
% 0.29/0.53 % Contextual simplify-reflections : 20
% 0.29/0.53 % Paramodulations : 218
% 0.29/0.53 % Factorizations : 0
% 0.29/0.53 % NegExts : 0
% 0.29/0.53 % Equation resolutions : 1
% 0.29/0.53 % Disequality decompositions : 0
% 0.29/0.53 % Total rewrite steps : 8
% 0.29/0.53 % ...of those cached : 4
% 0.29/0.53 % Propositional unsat checks : 0
% 0.29/0.53 % Propositional check models : 0
% 0.29/0.53 % Propositional check unsatisfiable : 0
% 0.29/0.53 % Propositional clauses : 0
% 0.29/0.53 % Propositional clauses after purity: 0
% 0.29/0.53 % Propositional unsat core size : 0
% 0.29/0.53 % Propositional preprocessing time : 0.000
% 0.29/0.53 % Propositional encoding time : 0.000
% 0.29/0.53 % Propositional solver time : 0.000
% 0.29/0.53 % Success case prop preproc time : 0.000
% 0.29/0.53 % Success case prop encoding time : 0.000
% 0.29/0.53 % Success case prop solver time : 0.000
% 0.29/0.53 % Current number of processed clauses : 84
% 0.29/0.53 % Positive orientable unit clauses : 5
% 0.29/0.53 % Positive unorientable unit clauses: 0
% 0.29/0.53 % Negative unit clauses : 1
% 0.29/0.53 % Non-unit-clauses : 78
% 0.29/0.53 % Current number of unprocessed clauses: 111
% 0.29/0.53 % ...number of literals in the above : 1049
% 0.29/0.53 % Current number of archived formulas : 0
% 0.29/0.53 % Current number of archived clauses : 12
% 0.29/0.53 % Clause-clause subsumption calls (NU) : 3780
% 0.29/0.53 % Rec. Clause-clause subsumption calls : 374
% 0.29/0.53 % Non-unit clause-clause subsumptions : 46
% 0.29/0.53 % Unit Clause-clause subsumption calls : 0
% 0.29/0.53 % Rewrite failures with RHS unbound : 0
% 0.29/0.53 % BW rewrite match attempts : 0
% 0.29/0.53 % BW rewrite match successes : 0
% 0.29/0.53 % Condensation attempts : 0
% 0.29/0.53 % Condensation successes : 0
% 0.29/0.53 % Termbank termtop insertions : 8319
% 0.29/0.53 % Search garbage collected termcells : 61
% 0.29/0.53
% 0.29/0.53 % -------------------------------------------------
% 0.29/0.53 % User time : 0.027 s
% 0.29/0.53 % System time : 0.006 s
% 0.29/0.53 % Total time : 0.033 s
% 0.29/0.53 % Maximum resident set size: 3648 pages
% 0.29/0.53
% 0.29/0.53 % -------------------------------------------------
% 0.29/0.53 % User time : 0.029 s
% 0.29/0.53 % System time : 0.013 s
% 0.29/0.53 % Total time : 0.042 s
% 0.29/0.53 % Maximum resident set size: 4608 pages
% 0.29/0.53 % E exiting
%------------------------------------------------------------------------------