TSTP Solution File: MGT039+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : MGT039+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:35:45 EDT 2023
% Result : Theorem 408.15s 136.50s
% Output : CNFRefutation 408.15s
% 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(X4,X5)
& greater(X5,X6) )
=> greater(X4,X6) ),
file('/export/starexec/sandbox2/tmp/tmp.VfQJFQjmYU/E---3.1_29184.p',mp_greater_transitivity) ).
fof(mp4_critical_point,axiom,
! [X1] :
( ( observational_period(X1)
& slow_change(X1) )
=> ! [X2] :
( ( environment(X2)
& in_environment(X1,X2) )
=> ? [X3] :
( in_environment(X2,X3)
& greater(X3,critical_point(X2)) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.VfQJFQjmYU/E---3.1_29184.p',mp4_critical_point) ).
fof(mp_greater_or_equal,axiom,
! [X4,X5] :
( greater_or_equal(X4,X5)
<=> ( greater(X4,X5)
| X4 = X5 ) ),
file('/export/starexec/sandbox2/tmp/tmp.VfQJFQjmYU/E---3.1_29184.p',mp_greater_or_equal) ).
fof(mp_environment_end_point,axiom,
! [X2,X3] :
( ( environment(X2)
& in_environment(X2,X3) )
=> greater_or_equal(end_time(X2),X3) ),
file('/export/starexec/sandbox2/tmp/tmp.VfQJFQjmYU/E---3.1_29184.p',mp_environment_end_point) ).
fof(mp_time_in_environment,axiom,
! [X2,X3] :
( ( environment(X2)
& greater_or_equal(X3,start_time(X2))
& greater_or_equal(end_time(X2),X3) )
=> in_environment(X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.VfQJFQjmYU/E---3.1_29184.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/sandbox2/tmp/tmp.VfQJFQjmYU/E---3.1_29184.p',mp_time_of_critical_point) ).
fof(mp3_favoured_trategy,axiom,
! [X1] :
( ( observational_period(X1)
& propagation_strategy(first_movers)
& propagation_strategy(efficient_producers)
& ! [X2] :
( ( environment(X2)
& in_environment(X1,X2) )
=> selection_favors(efficient_producers,first_movers,end_time(X2)) ) )
=> selection_favors(efficient_producers,first_movers,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.VfQJFQjmYU/E---3.1_29184.p',mp3_favoured_trategy) ).
fof(mp_organizational_sets1,axiom,
propagation_strategy(first_movers),
file('/export/starexec/sandbox2/tmp/tmp.VfQJFQjmYU/E---3.1_29184.p',mp_organizational_sets1) ).
fof(mp_organizational_sets2,axiom,
propagation_strategy(efficient_producers),
file('/export/starexec/sandbox2/tmp/tmp.VfQJFQjmYU/E---3.1_29184.p',mp_organizational_sets2) ).
fof(l8,hypothesis,
! [X2,X3] :
( ( environment(X2)
& in_environment(X2,X3)
& greater(X3,critical_point(X2)) )
=> selection_favors(efficient_producers,first_movers,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.VfQJFQjmYU/E---3.1_29184.p',l8) ).
fof(prove_t8,conjecture,
! [X1] :
( ( observational_period(X1)
& slow_change(X1) )
=> selection_favors(efficient_producers,first_movers,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.VfQJFQjmYU/E---3.1_29184.p',prove_t8) ).
fof(c_0_11,plain,
! [X12,X13,X14] :
( ~ greater(X12,X13)
| ~ greater(X13,X14)
| greater(X12,X14) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_greater_transitivity])]) ).
fof(c_0_12,plain,
! [X17,X18] :
( ( in_environment(X18,esk3_2(X17,X18))
| ~ environment(X18)
| ~ in_environment(X17,X18)
| ~ observational_period(X17)
| ~ slow_change(X17) )
& ( greater(esk3_2(X17,X18),critical_point(X18))
| ~ environment(X18)
| ~ in_environment(X17,X18)
| ~ observational_period(X17)
| ~ slow_change(X17) ) ),
inference(distribute,[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)
| greater(X15,X16)
| X15 = X16 )
& ( ~ greater(X15,X16)
| greater_or_equal(X15,X16) )
& ( X15 != X16
| greater_or_equal(X15,X16) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_greater_or_equal])])]) ).
fof(c_0_14,plain,
! [X21,X22] :
( ~ environment(X21)
| ~ in_environment(X21,X22)
| greater_or_equal(end_time(X21),X22) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_environment_end_point])]) ).
cnf(c_0_15,plain,
( greater(X1,X3)
| ~ greater(X1,X2)
| ~ greater(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( greater(esk3_2(X1,X2),critical_point(X2))
| ~ environment(X2)
| ~ in_environment(X1,X2)
| ~ observational_period(X1)
| ~ slow_change(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( greater(X1,X2)
| X1 = X2
| ~ greater_or_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( greater_or_equal(end_time(X1),X2)
| ~ environment(X1)
| ~ in_environment(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_19,plain,
! [X23,X24] :
( ~ environment(X23)
| ~ greater_or_equal(X24,start_time(X23))
| ~ greater_or_equal(end_time(X23),X24)
| in_environment(X23,X24) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_time_in_environment])]) ).
fof(c_0_20,plain,
! [X20] :
( ~ environment(X20)
| greater_or_equal(critical_point(X20),start_time(X20)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_time_of_critical_point])]) ).
cnf(c_0_21,plain,
( greater(X1,critical_point(X2))
| ~ greater(X1,esk3_2(X3,X2))
| ~ slow_change(X3)
| ~ in_environment(X3,X2)
| ~ environment(X2)
| ~ observational_period(X3) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
( end_time(X1) = X2
| greater(end_time(X1),X2)
| ~ in_environment(X1,X2)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_23,plain,
! [X10] :
( ( environment(esk2_1(X10))
| ~ observational_period(X10)
| ~ propagation_strategy(first_movers)
| ~ propagation_strategy(efficient_producers)
| selection_favors(efficient_producers,first_movers,X10) )
& ( in_environment(X10,esk2_1(X10))
| ~ observational_period(X10)
| ~ propagation_strategy(first_movers)
| ~ propagation_strategy(efficient_producers)
| selection_favors(efficient_producers,first_movers,X10) )
& ( ~ selection_favors(efficient_producers,first_movers,end_time(esk2_1(X10)))
| ~ observational_period(X10)
| ~ propagation_strategy(first_movers)
| ~ propagation_strategy(efficient_producers)
| selection_favors(efficient_producers,first_movers,X10) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp3_favoured_trategy])])])]) ).
cnf(c_0_24,plain,
( in_environment(X1,X2)
| ~ environment(X1)
| ~ greater_or_equal(X2,start_time(X1))
| ~ greater_or_equal(end_time(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
( greater_or_equal(X1,X2)
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_26,plain,
( greater_or_equal(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_27,plain,
( greater_or_equal(critical_point(X1),start_time(X1))
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,plain,
( end_time(X1) = esk3_2(X2,X3)
| greater(end_time(X1),critical_point(X3))
| ~ slow_change(X2)
| ~ in_environment(X1,esk3_2(X2,X3))
| ~ in_environment(X2,X3)
| ~ environment(X3)
| ~ environment(X1)
| ~ observational_period(X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,plain,
( in_environment(X1,esk3_2(X2,X1))
| ~ environment(X1)
| ~ in_environment(X2,X1)
| ~ observational_period(X2)
| ~ slow_change(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_30,plain,
( in_environment(X1,esk2_1(X1))
| selection_favors(efficient_producers,first_movers,X1)
| ~ observational_period(X1)
| ~ propagation_strategy(first_movers)
| ~ propagation_strategy(efficient_producers) ),
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,
( environment(esk2_1(X1))
| selection_favors(efficient_producers,first_movers,X1)
| ~ observational_period(X1)
| ~ propagation_strategy(first_movers)
| ~ propagation_strategy(efficient_producers) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_34,plain,
( in_environment(X1,X2)
| ~ greater_or_equal(end_time(X1),X2)
| ~ greater(X2,start_time(X1))
| ~ environment(X1) ),
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,
( start_time(X1) = critical_point(X1)
| greater(critical_point(X1),start_time(X1))
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_27]) ).
fof(c_0_37,hypothesis,
! [X7,X8] :
( ~ environment(X7)
| ~ in_environment(X7,X8)
| ~ greater(X8,critical_point(X7))
| selection_favors(efficient_producers,first_movers,X8) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l8])]) ).
cnf(c_0_38,plain,
( esk3_2(X1,X2) = end_time(X2)
| greater(end_time(X2),critical_point(X2))
| ~ slow_change(X1)
| ~ in_environment(X1,X2)
| ~ environment(X2)
| ~ observational_period(X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_39,plain,
( selection_favors(efficient_producers,first_movers,X1)
| in_environment(X1,esk2_1(X1))
| ~ observational_period(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,
( selection_favors(efficient_producers,first_movers,X1)
| environment(esk2_1(X1))
| ~ observational_period(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,
( selection_favors(efficient_producers,first_movers,X1)
| ~ selection_favors(efficient_producers,first_movers,end_time(esk2_1(X1)))
| ~ observational_period(X1)
| ~ propagation_strategy(first_movers)
| ~ propagation_strategy(efficient_producers) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_42,plain,
( in_environment(X1,end_time(X1))
| ~ greater(end_time(X1),start_time(X1))
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_43,plain,
( start_time(X1) = critical_point(X1)
| greater(X2,start_time(X1))
| ~ greater(X2,critical_point(X1))
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_36]) ).
cnf(c_0_44,hypothesis,
( selection_favors(efficient_producers,first_movers,X2)
| ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(X2,critical_point(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_45,plain,
( esk3_2(X1,esk2_1(X1)) = end_time(esk2_1(X1))
| greater(end_time(esk2_1(X1)),critical_point(esk2_1(X1)))
| selection_favors(efficient_producers,first_movers,X1)
| ~ slow_change(X1)
| ~ observational_period(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_46,plain,
( selection_favors(efficient_producers,first_movers,X1)
| ~ selection_favors(efficient_producers,first_movers,end_time(esk2_1(X1)))
| ~ observational_period(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,
( start_time(X1) = critical_point(X1)
| in_environment(X1,end_time(X1))
| ~ greater(end_time(X1),critical_point(X1))
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_48,hypothesis,
( esk3_2(X1,esk2_1(X1)) = end_time(esk2_1(X1))
| selection_favors(efficient_producers,first_movers,X1)
| ~ slow_change(X1)
| ~ in_environment(esk2_1(X1),end_time(esk2_1(X1)))
| ~ observational_period(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,
( in_environment(X1,end_time(X2))
| ~ greater_or_equal(end_time(X1),end_time(X2))
| ~ in_environment(X2,start_time(X1))
| ~ environment(X1)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_18]) ).
cnf(c_0_50,hypothesis,
( selection_favors(efficient_producers,first_movers,esk3_2(X1,X2))
| ~ slow_change(X1)
| ~ in_environment(X1,X2)
| ~ environment(X2)
| ~ observational_period(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_16]),c_0_29]) ).
cnf(c_0_51,plain,
( esk3_2(X1,esk2_1(X1)) = end_time(esk2_1(X1))
| start_time(esk2_1(X1)) = critical_point(esk2_1(X1))
| selection_favors(efficient_producers,first_movers,X1)
| ~ slow_change(X1)
| ~ observational_period(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,
( in_environment(X1,critical_point(X1))
| ~ greater_or_equal(end_time(X1),critical_point(X1))
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_27]) ).
cnf(c_0_53,plain,
( in_environment(X1,end_time(X1))
| ~ in_environment(X1,start_time(X1))
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_49,c_0_35]) ).
cnf(c_0_54,hypothesis,
( start_time(esk2_1(X1)) = critical_point(esk2_1(X1))
| selection_favors(efficient_producers,first_movers,X1)
| ~ slow_change(X1)
| ~ observational_period(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,
( in_environment(X1,critical_point(X1))
| ~ greater(end_time(X1),critical_point(X1))
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_52,c_0_25]) ).
cnf(c_0_56,hypothesis,
( selection_favors(efficient_producers,first_movers,X1)
| in_environment(esk2_1(X1),end_time(esk2_1(X1)))
| ~ slow_change(X1)
| ~ in_environment(esk2_1(X1),critical_point(esk2_1(X1)))
| ~ observational_period(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_40]) ).
cnf(c_0_57,plain,
( esk3_2(X1,esk2_1(X1)) = end_time(esk2_1(X1))
| selection_favors(efficient_producers,first_movers,X1)
| in_environment(esk2_1(X1),critical_point(esk2_1(X1)))
| ~ slow_change(X1)
| ~ observational_period(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] :
( ( observational_period(X1)
& slow_change(X1) )
=> selection_favors(efficient_producers,first_movers,X1) ),
inference(assume_negation,[status(cth)],[prove_t8]) ).
cnf(c_0_59,hypothesis,
( esk3_2(X1,esk2_1(X1)) = end_time(esk2_1(X1))
| selection_favors(efficient_producers,first_movers,X1)
| ~ slow_change(X1)
| ~ observational_period(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_48]) ).
fof(c_0_60,negated_conjecture,
( observational_period(esk1_0)
& slow_change(esk1_0)
& ~ selection_favors(efficient_producers,first_movers,esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_58])])]) ).
cnf(c_0_61,hypothesis,
( selection_favors(efficient_producers,first_movers,X1)
| ~ slow_change(X1)
| ~ observational_period(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.06/0.12 % Problem : MGT039+1 : TPTP v8.1.2. Released v2.0.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n009.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Oct 3 00:20:14 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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/tmp/tmp.VfQJFQjmYU/E---3.1_29184.p
% 408.15/136.50 # Version: 3.1pre001
% 408.15/136.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.15/136.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.15/136.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.15/136.50 # Starting new_bool_3 with 300s (1) cores
% 408.15/136.50 # Starting new_bool_1 with 300s (1) cores
% 408.15/136.50 # Starting sh5l with 300s (1) cores
% 408.15/136.50 # new_bool_1 with pid 29264 completed with status 0
% 408.15/136.50 # Result found by new_bool_1
% 408.15/136.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.15/136.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.15/136.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.15/136.50 # Starting new_bool_3 with 300s (1) cores
% 408.15/136.50 # Starting new_bool_1 with 300s (1) cores
% 408.15/136.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.15/136.50 # Search class: FGUSF-FFSS21-SFFFFFNN
% 408.15/136.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.15/136.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 408.15/136.50 # SAT001_MinMin_p005000_rr_RG with pid 29270 completed with status 0
% 408.15/136.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 408.15/136.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.15/136.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.15/136.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.15/136.50 # Starting new_bool_3 with 300s (1) cores
% 408.15/136.50 # Starting new_bool_1 with 300s (1) cores
% 408.15/136.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.15/136.50 # Search class: FGUSF-FFSS21-SFFFFFNN
% 408.15/136.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.15/136.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 408.15/136.50 # Preprocessing time : 0.001 s
% 408.15/136.50 # Presaturation interreduction done
% 408.15/136.50
% 408.15/136.50 # Proof found!
% 408.15/136.50 # SZS status Theorem
% 408.15/136.50 # SZS output start CNFRefutation
% See solution above
% 408.15/136.50 # Parsed axioms : 12
% 408.15/136.50 # Removed by relevancy pruning/SinE : 0
% 408.15/136.50 # Initial clauses : 19
% 408.15/136.50 # Removed in clause preprocessing : 0
% 408.15/136.50 # Initial clauses in saturation : 19
% 408.15/136.50 # Processed clauses : 118
% 408.15/136.50 # ...of these trivial : 0
% 408.15/136.50 # ...subsumed : 11
% 408.15/136.50 # ...remaining for further processing : 107
% 408.15/136.50 # Other redundant clauses eliminated : 1
% 408.15/136.50 # Clauses deleted for lack of memory : 0
% 408.15/136.50 # Backward-subsumed : 9
% 408.15/136.50 # Backward-rewritten : 0
% 408.15/136.50 # Generated clauses : 190
% 408.15/136.50 # ...of the previous two non-redundant : 175
% 408.15/136.50 # ...aggressively subsumed : 0
% 408.15/136.50 # Contextual simplify-reflections : 16
% 408.15/136.50 # Paramodulations : 189
% 408.15/136.50 # Factorizations : 0
% 408.15/136.50 # NegExts : 0
% 408.15/136.50 # Equation resolutions : 1
% 408.15/136.50 # Total rewrite steps : 8
% 408.15/136.50 # Propositional unsat checks : 0
% 408.15/136.50 # Propositional check models : 0
% 408.15/136.50 # Propositional check unsatisfiable : 0
% 408.15/136.50 # Propositional clauses : 0
% 408.15/136.50 # Propositional clauses after purity: 0
% 408.15/136.50 # Propositional unsat core size : 0
% 408.15/136.50 # Propositional preprocessing time : 0.000
% 408.15/136.50 # Propositional encoding time : 0.000
% 408.15/136.50 # Propositional solver time : 0.000
% 408.15/136.50 # Success case prop preproc time : 0.000
% 408.15/136.50 # Success case prop encoding time : 0.000
% 408.15/136.50 # Success case prop solver time : 0.000
% 408.15/136.50 # Current number of processed clauses : 78
% 408.15/136.50 # Positive orientable unit clauses : 5
% 408.15/136.50 # Positive unorientable unit clauses: 0
% 408.15/136.50 # Negative unit clauses : 1
% 408.15/136.50 # Non-unit-clauses : 72
% 408.15/136.50 # Current number of unprocessed clauses: 95
% 408.15/136.50 # ...number of literals in the above : 853
% 408.15/136.50 # Current number of archived formulas : 0
% 408.15/136.50 # Current number of archived clauses : 28
% 408.15/136.50 # Clause-clause subsumption calls (NU) : 2614
% 408.15/136.50 # Rec. Clause-clause subsumption calls : 252
% 408.15/136.50 # Non-unit clause-clause subsumptions : 36
% 408.15/136.50 # Unit Clause-clause subsumption calls : 0
% 408.15/136.50 # Rewrite failures with RHS unbound : 0
% 408.15/136.50 # BW rewrite match attempts : 0
% 408.15/136.50 # BW rewrite match successes : 0
% 408.15/136.50 # Condensation attempts : 0
% 408.15/136.50 # Condensation successes : 0
% 408.15/136.50 # Termbank termtop insertions : 7411
% 408.15/136.50
% 408.15/136.50 # -------------------------------------------------
% 408.15/136.50 # User time : 0.017 s
% 408.15/136.50 # System time : 0.003 s
% 408.15/136.50 # Total time : 0.020 s
% 408.15/136.50 # Maximum resident set size: 1732 pages
% 408.15/136.50
% 408.15/136.50 # -------------------------------------------------
% 408.15/136.50 # User time : 0.018 s
% 408.15/136.50 # System time : 0.005 s
% 408.15/136.50 # Total time : 0.023 s
% 408.15/136.50 # Maximum resident set size: 1680 pages
% 408.15/136.50 % E---3.1 exiting
% 408.15/136.50 % E---3.1 exiting
%------------------------------------------------------------------------------