%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : MGT039+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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 01:27:59 PM UTC 2026
% Result : Theorem 0.30s 0.65s
% Output : CNFRefutation 0.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of formulae : 66 ( 9 unt; 0 def)
% Number of atoms : 252 ( 18 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 316 ( 130 ~; 152 |; 22 &)
% ( 1 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 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 : 93 ( 0 sgn 33 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mp_greater_transitivity,axiom,
! [X4,X5,X6] :
( ( greater(X5,X6)
& greater(X4,X5) )
=> greater(X4,X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_greater_transitivity) ).
fof(mp4_critical_point,axiom,
! [X1] :
( ( slow_change(X1)
& observational_period(X1) )
=> ! [X2] :
( ( in_environment(X1,X2)
& environment(X2) )
=> ? [X3] :
( greater(X3,critical_point(X2))
& in_environment(X2,X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp4_critical_point) ).
fof(mp_greater_or_equal,axiom,
! [X4,X5] :
( greater_or_equal(X4,X5)
<=> ( X4 = X5
| greater(X4,X5) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_greater_or_equal) ).
fof(mp_environment_end_point,axiom,
! [X2,X3] :
( ( in_environment(X2,X3)
& environment(X2) )
=> greater_or_equal(end_time(X2),X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_environment_end_point) ).
fof(mp_time_in_environment,axiom,
! [X2,X3] :
( ( greater_or_equal(end_time(X2),X3)
& greater_or_equal(X3,start_time(X2))
& environment(X2) )
=> in_environment(X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_time_in_environment) ).
fof(mp_time_of_critical_point,axiom,
! [X2] :
( environment(X2)
=> greater_or_equal(critical_point(X2),start_time(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_time_of_critical_point) ).
fof(mp3_favoured_trategy,axiom,
! [X1] :
( ( ! [X2] :
( ( in_environment(X1,X2)
& environment(X2) )
=> selection_favors(efficient_producers,first_movers,end_time(X2)) )
& 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) ).
fof(mp_organizational_sets1,axiom,
propagation_strategy(first_movers),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_organizational_sets1) ).
fof(mp_organizational_sets2,axiom,
propagation_strategy(efficient_producers),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_organizational_sets2) ).
fof(l8,hypothesis,
! [X2,X3] :
( ( greater(X3,critical_point(X2))
& in_environment(X2,X3)
& environment(X2) )
=> selection_favors(efficient_producers,first_movers,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l8) ).
fof(prove_t8,conjecture,
! [X1] :
( ( slow_change(X1)
& observational_period(X1) )
=> selection_favors(efficient_producers,first_movers,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t8) ).
fof(c_0_11,plain,
! [X12,X13,X14] :
( greater(X12,X14)
| ~ greater(X13,X14)
| ~ greater(X12,X13) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_greater_transitivity])])]) ).
fof(c_0_12,plain,
! [X17,X18] :
( ( ~ slow_change(X17)
| ~ observational_period(X17)
| ~ in_environment(X17,X18)
| ~ environment(X18)
| greater(esk3_2(X17,X18),critical_point(X18)) )
& ( ~ slow_change(X17)
| ~ observational_period(X17)
| ~ in_environment(X17,X18)
| ~ environment(X18)
| in_environment(X18,esk3_2(X17,X18)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp4_critical_point])])])])])]) ).
fof(c_0_13,plain,
! [X15,X16] :
( ( greater_or_equal(X15,X16)
| X15 != X16 )
& ( greater_or_equal(X15,X16)
| ~ greater(X15,X16) )
& ( X15 = X16
| greater(X15,X16)
| ~ greater_or_equal(X15,X16) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_greater_or_equal])])])]) ).
fof(c_0_14,plain,
! [X21,X22] :
( greater_or_equal(end_time(X21),X22)
| ~ in_environment(X21,X22)
| ~ environment(X21) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_environment_end_point])])]) ).
cnf(c_0_15,plain,
( ~ greater(X2,X3)
| ~ greater(X1,X2)
| greater(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( ~ slow_change(X1)
| ~ observational_period(X1)
| ~ in_environment(X1,X2)
| ~ environment(X2)
| greater(esk3_2(X1,X2),critical_point(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( ~ greater_or_equal(X1,X2)
| X1 = X2
| greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| greater_or_equal(end_time(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_19,plain,
! [X23,X24] :
( in_environment(X23,X24)
| ~ greater_or_equal(end_time(X23),X24)
| ~ greater_or_equal(X24,start_time(X23))
| ~ environment(X23) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_time_in_environment])])]) ).
fof(c_0_20,plain,
! [X20] :
( greater_or_equal(critical_point(X20),start_time(X20))
| ~ environment(X20) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_time_of_critical_point])])]) ).
cnf(c_0_21,plain,
( ~ observational_period(X3)
| ~ environment(X2)
| ~ in_environment(X3,X2)
| ~ slow_change(X3)
| ~ greater(X1,esk3_2(X3,X2))
| greater(X1,critical_point(X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
( ~ environment(X1)
| ~ in_environment(X1,X2)
| greater(end_time(X1),X2)
| end_time(X1) = X2 ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_23,plain,
! [X10] :
( ( selection_favors(efficient_producers,first_movers,X10)
| ~ propagation_strategy(efficient_producers)
| ~ propagation_strategy(first_movers)
| ~ observational_period(X10)
| ~ selection_favors(efficient_producers,first_movers,end_time(esk2_1(X10))) )
& ( selection_favors(efficient_producers,first_movers,X10)
| ~ propagation_strategy(efficient_producers)
| ~ propagation_strategy(first_movers)
| ~ observational_period(X10)
| in_environment(X10,esk2_1(X10)) )
& ( selection_favors(efficient_producers,first_movers,X10)
| ~ propagation_strategy(efficient_producers)
| ~ propagation_strategy(first_movers)
| ~ observational_period(X10)
| environment(esk2_1(X10)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp3_favoured_trategy])])])])]) ).
cnf(c_0_24,plain,
( ~ greater_or_equal(end_time(X1),X2)
| ~ greater_or_equal(X2,start_time(X1))
| ~ environment(X1)
| in_environment(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
( ~ greater(X1,X2)
| greater_or_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_26,plain,
( X1 != X2
| greater_or_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_27,plain,
( ~ environment(X1)
| greater_or_equal(critical_point(X1),start_time(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,plain,
( ~ observational_period(X2)
| ~ environment(X1)
| ~ environment(X3)
| ~ in_environment(X2,X3)
| ~ in_environment(X1,esk3_2(X2,X3))
| ~ slow_change(X2)
| greater(end_time(X1),critical_point(X3))
| end_time(X1) = esk3_2(X2,X3) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,plain,
( ~ slow_change(X2)
| ~ observational_period(X2)
| ~ in_environment(X2,X1)
| ~ environment(X1)
| in_environment(X1,esk3_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_30,plain,
( ~ propagation_strategy(efficient_producers)
| ~ propagation_strategy(first_movers)
| ~ observational_period(X1)
| selection_favors(efficient_producers,first_movers,X1)
| in_environment(X1,esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_31,plain,
propagation_strategy(first_movers),
inference(split_conjunct,[status(thm)],[mp_organizational_sets1]) ).
cnf(c_0_32,plain,
propagation_strategy(efficient_producers),
inference(split_conjunct,[status(thm)],[mp_organizational_sets2]) ).
cnf(c_0_33,plain,
( ~ propagation_strategy(efficient_producers)
| ~ propagation_strategy(first_movers)
| ~ observational_period(X1)
| selection_favors(efficient_producers,first_movers,X1)
| environment(esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_34,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_24,c_0_25]) ).
cnf(c_0_35,plain,
greater_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_26]) ).
cnf(c_0_36,plain,
( ~ environment(X1)
| greater(critical_point(X1),start_time(X1))
| start_time(X1) = critical_point(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_27]) ).
fof(c_0_37,hypothesis,
! [X7,X8] :
( selection_favors(efficient_producers,first_movers,X8)
| ~ greater(X8,critical_point(X7))
| ~ in_environment(X7,X8)
| ~ environment(X7) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l8])])]) ).
cnf(c_0_38,plain,
( ~ observational_period(X1)
| ~ environment(X2)
| ~ in_environment(X1,X2)
| ~ slow_change(X1)
| greater(end_time(X2),critical_point(X2))
| esk3_2(X1,X2) = end_time(X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_39,plain,
( ~ observational_period(X1)
| in_environment(X1,esk2_1(X1))
| selection_favors(efficient_producers,first_movers,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
cnf(c_0_40,plain,
( ~ observational_period(X1)
| environment(esk2_1(X1))
| selection_favors(efficient_producers,first_movers,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_31]),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,end_time(esk2_1(X1)))
| selection_favors(efficient_producers,first_movers,X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_42,plain,
( ~ environment(X1)
| ~ greater(end_time(X1),start_time(X1))
| in_environment(X1,end_time(X1)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_43,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_15,c_0_36]) ).
cnf(c_0_44,hypothesis,
( ~ greater(X2,critical_point(X1))
| ~ in_environment(X1,X2)
| ~ environment(X1)
| selection_favors(efficient_producers,first_movers,X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_45,plain,
( ~ observational_period(X1)
| ~ slow_change(X1)
| selection_favors(efficient_producers,first_movers,X1)
| greater(end_time(esk2_1(X1)),critical_point(esk2_1(X1)))
| esk3_2(X1,esk2_1(X1)) = end_time(esk2_1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_46,plain,
( ~ observational_period(X1)
| ~ selection_favors(efficient_producers,first_movers,end_time(esk2_1(X1)))
| selection_favors(efficient_producers,first_movers,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_31]),c_0_32])]) ).
cnf(c_0_47,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_42,c_0_43]) ).
cnf(c_0_48,hypothesis,
( ~ observational_period(X1)
| ~ in_environment(esk2_1(X1),end_time(esk2_1(X1)))
| ~ slow_change(X1)
| selection_favors(efficient_producers,first_movers,X1)
| esk3_2(X1,esk2_1(X1)) = end_time(esk2_1(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_40]),c_0_46]) ).
cnf(c_0_49,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_24,c_0_18]) ).
cnf(c_0_50,hypothesis,
( ~ observational_period(X1)
| ~ environment(X2)
| ~ in_environment(X1,X2)
| ~ slow_change(X1)
| selection_favors(efficient_producers,first_movers,esk3_2(X1,X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_16]),c_0_29]) ).
cnf(c_0_51,plain,
( ~ observational_period(X1)
| ~ slow_change(X1)
| selection_favors(efficient_producers,first_movers,X1)
| start_time(esk2_1(X1)) = critical_point(esk2_1(X1))
| esk3_2(X1,esk2_1(X1)) = end_time(esk2_1(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_45]),c_0_40]),c_0_48]) ).
cnf(c_0_52,plain,
( ~ environment(X1)
| ~ greater_or_equal(end_time(X1),critical_point(X1))
| in_environment(X1,critical_point(X1)) ),
inference(spm,[status(thm)],[c_0_24,c_0_27]) ).
cnf(c_0_53,plain,
( ~ environment(X1)
| ~ in_environment(X1,start_time(X1))
| in_environment(X1,end_time(X1)) ),
inference(spm,[status(thm)],[c_0_49,c_0_35]) ).
cnf(c_0_54,hypothesis,
( ~ observational_period(X1)
| ~ slow_change(X1)
| selection_favors(efficient_producers,first_movers,X1)
| start_time(esk2_1(X1)) = critical_point(esk2_1(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_40]),c_0_39]),c_0_46]) ).
cnf(c_0_55,plain,
( ~ environment(X1)
| ~ greater(end_time(X1),critical_point(X1))
| in_environment(X1,critical_point(X1)) ),
inference(spm,[status(thm)],[c_0_52,c_0_25]) ).
cnf(c_0_56,hypothesis,
( ~ observational_period(X1)
| ~ in_environment(esk2_1(X1),critical_point(esk2_1(X1)))
| ~ slow_change(X1)
| in_environment(esk2_1(X1),end_time(esk2_1(X1)))
| selection_favors(efficient_producers,first_movers,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_40]) ).
cnf(c_0_57,plain,
( ~ observational_period(X1)
| ~ slow_change(X1)
| in_environment(esk2_1(X1),critical_point(esk2_1(X1)))
| selection_favors(efficient_producers,first_movers,X1)
| esk3_2(X1,esk2_1(X1)) = end_time(esk2_1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_45]),c_0_40]) ).
fof(c_0_58,negated_conjecture,
~ ! [X1] :
( ( slow_change(X1)
& observational_period(X1) )
=> selection_favors(efficient_producers,first_movers,X1) ),
inference(assume_negation,[status(cth)],[prove_t8]) ).
cnf(c_0_59,hypothesis,
( ~ observational_period(X1)
| ~ slow_change(X1)
| selection_favors(efficient_producers,first_movers,X1)
| esk3_2(X1,esk2_1(X1)) = end_time(esk2_1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_48]) ).
fof(c_0_60,negated_conjecture,
( ~ selection_favors(efficient_producers,first_movers,esk1_0)
& slow_change(esk1_0)
& observational_period(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_58])])])]) ).
cnf(c_0_61,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_50,c_0_59]),c_0_40]),c_0_39]),c_0_46]) ).
cnf(c_0_62,negated_conjecture,
slow_change(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_63,negated_conjecture,
observational_period(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_64,negated_conjecture,
~ selection_favors(efficient_producers,first_movers,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_65,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63])]),c_0_64]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT039+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.47 % Computer : n017.cluster.edu
% 0.19/0.47 % Model : x86_64 x86_64
% 0.19/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.47 % Memory : 8046.5625MB
% 0.19/0.47 % OS : Linux 6.8.0-71-generic
% 0.19/0.47 % CPULimit : 300
% 0.19/0.48 % WCLimit : 300
% 0.19/0.48 % DateTime : Mon Sep 21 01:18:11 UTC 2026
% 0.19/0.48 % CPUTime :
% 0.19/0.48 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.57 Running first-order theorem proving
% 0.24/0.57 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.30/0.65 % Version: 3.5.1
% 0.30/0.65 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.30/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.30/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.30/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.30/0.65 % Starting sh5l with 300s (1) cores
% 0.30/0.65 % new_bool_3 with pid 1115570 completed with status 0
% 0.30/0.65 % Result found by new_bool_3
% 0.30/0.65 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.30/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.30/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.30/0.65 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.30/0.65 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.30/0.65 % Search class: FGUSF-FFSS21-SFFFFFNN
% 0.30/0.65 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.30/0.65 % Starting SubtermCWHack with 31s (1) cores
% 0.30/0.65 % SubtermCWHack with pid 1115580 completed with status 0
% 0.30/0.65 % Result found by SubtermCWHack
% 0.30/0.65 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.30/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.30/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.30/0.65 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.30/0.65 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.30/0.65 % Search class: FGUSF-FFSS21-SFFFFFNN
% 0.30/0.65 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.30/0.65 % Starting SubtermCWHack with 31s (1) cores
% 0.30/0.65 % Preprocessing time : 0.001 s
% 0.30/0.65
% 0.30/0.65 % Proof found!
% 0.30/0.65 % SZS status Theorem
% 0.30/0.65 % SZS output start CNFRefutation
% See solution above
% 0.30/0.65 % Parsed axioms : 12
% 0.30/0.65 % Removed by relevancy pruning/SinE : 0
% 0.30/0.65 % Initial clauses : 19
% 0.30/0.65 % Removed in clause preprocessing : 0
% 0.30/0.65 % Initial clauses in saturation : 19
% 0.30/0.65 % Processed clauses : 107
% 0.30/0.65 % ...of these trivial : 0
% 0.30/0.65 % ...subsumed : 13
% 0.30/0.65 % ...remaining for further processing : 94
% 0.30/0.65 % Other redundant clauses eliminated : 1
% 0.30/0.65 % Clauses deleted for lack of memory : 0
% 0.30/0.65 % Backward-subsumed : 10
% 0.30/0.65 % Backward-rewritten : 0
% 0.30/0.65 % Generated clauses : 210
% 0.30/0.65 % ...of the previous two non-redundant : 194
% 0.30/0.65 % ...aggressively subsumed : 0
% 0.30/0.65 % Contextual simplify-reflections : 16
% 0.30/0.65 % Paramodulations : 209
% 0.30/0.65 % Factorizations : 0
% 0.30/0.65 % NegExts : 0
% 0.30/0.65 % Equation resolutions : 1
% 0.30/0.65 % Disequality decompositions : 0
% 0.30/0.65 % Total rewrite steps : 8
% 0.30/0.65 % ...of those cached : 4
% 0.30/0.65 % Propositional unsat checks : 0
% 0.30/0.65 % Propositional check models : 0
% 0.30/0.65 % Propositional check unsatisfiable : 0
% 0.30/0.65 % Propositional clauses : 0
% 0.30/0.65 % Propositional clauses after purity: 0
% 0.30/0.65 % Propositional unsat core size : 0
% 0.30/0.65 % Propositional preprocessing time : 0.000
% 0.30/0.65 % Propositional encoding time : 0.000
% 0.30/0.65 % Propositional solver time : 0.000
% 0.30/0.65 % Success case prop preproc time : 0.000
% 0.30/0.65 % Success case prop encoding time : 0.000
% 0.30/0.65 % Success case prop solver time : 0.000
% 0.30/0.65 % Current number of processed clauses : 83
% 0.30/0.65 % Positive orientable unit clauses : 5
% 0.30/0.65 % Positive unorientable unit clauses: 0
% 0.30/0.65 % Negative unit clauses : 1
% 0.30/0.65 % Non-unit-clauses : 77
% 0.30/0.65 % Current number of unprocessed clauses: 106
% 0.30/0.65 % ...number of literals in the above : 994
% 0.30/0.65 % Current number of archived formulas : 0
% 0.30/0.65 % Current number of archived clauses : 10
% 0.30/0.65 % Clause-clause subsumption calls (NU) : 3183
% 0.30/0.65 % Rec. Clause-clause subsumption calls : 295
% 0.30/0.65 % Non-unit clause-clause subsumptions : 39
% 0.30/0.65 % Unit Clause-clause subsumption calls : 0
% 0.30/0.65 % Rewrite failures with RHS unbound : 0
% 0.30/0.65 % BW rewrite match attempts : 0
% 0.30/0.65 % BW rewrite match successes : 0
% 0.30/0.65 % Condensation attempts : 0
% 0.30/0.65 % Condensation successes : 0
% 0.30/0.65 % Termbank termtop insertions : 8435
% 0.30/0.65 % Search garbage collected termcells : 310
% 0.30/0.65
% 0.30/0.65 % -------------------------------------------------
% 0.30/0.65 % User time : 0.021 s
% 0.30/0.65 % System time : 0.003 s
% 0.30/0.65 % Total time : 0.024 s
% 0.30/0.65 % Maximum resident set size: 3644 pages
% 0.30/0.65
% 0.30/0.65 % -------------------------------------------------
% 0.30/0.65 % User time : 0.024 s
% 0.30/0.65 % System time : 0.009 s
% 0.30/0.65 % Total time : 0.033 s
% 0.30/0.65 % Maximum resident set size: 4864 pages
% 0.30/0.65 % E exiting
%------------------------------------------------------------------------------