TSTP Solution File: MGT024+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : MGT024+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:34:38 EDT 2023
% Result : Timeout 0.31s 300.12s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of formulae : 58 ( 13 unt; 0 def)
% Number of atoms : 259 ( 39 equ)
% Maximal formula atoms : 48 ( 4 avg)
% Number of connectives : 301 ( 100 ~; 139 |; 43 &)
% ( 0 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 58 ( 0 sgn; 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_l6,conjecture,
! [X1,X2] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2)
& greater_or_equal(X2,equilibrium(X1)) )
=> ( ( growth_rate(first_movers,X2) = zero
& growth_rate(efficient_producers,X2) = zero )
| ( greater(growth_rate(first_movers,X2),zero)
& greater(zero,growth_rate(efficient_producers,X2)) )
| ( greater(growth_rate(efficient_producers,X2),zero)
& greater(zero,growth_rate(first_movers,X2)) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.OEhjH3eKLz/E---3.1_32459.p',prove_l6) ).
fof(mp_equilibrium,axiom,
! [X1,X2] :
( ( environment(X1)
& greater_or_equal(X2,equilibrium(X1)) )
=> ~ greater(equilibrium(X1),X2) ),
file('/export/starexec/sandbox2/tmp/tmp.OEhjH3eKLz/E---3.1_32459.p',mp_equilibrium) ).
fof(a3,hypothesis,
! [X1,X2] :
( ( environment(X1)
& in_environment(X1,X2)
& greater(number_of_organizations(X1,X2),zero) )
=> ( ( greater(equilibrium(X1),X2)
=> decreases(resources(X1,X2)) )
& ( ~ greater(equilibrium(X1),X2)
=> constant(resources(X1,X2)) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.OEhjH3eKLz/E---3.1_32459.p',a3) ).
fof(mp_positive_number_of_organizations,axiom,
! [X1,X2] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2) )
=> greater(number_of_organizations(X1,X2),zero) ),
file('/export/starexec/sandbox2/tmp/tmp.OEhjH3eKLz/E---3.1_32459.p',mp_positive_number_of_organizations) ).
fof(mp_time_point_occur,axiom,
! [X1,X2] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2) )
=> in_environment(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.OEhjH3eKLz/E---3.1_32459.p',mp_time_point_occur) ).
fof(a6,hypothesis,
! [X1,X2] :
( ( environment(X1)
& in_environment(X1,X2) )
=> ( ( decreases(resources(X1,X2))
=> ~ decreases(number_of_organizations(X1,X2)) )
& ( constant(resources(X1,X2))
=> constant(number_of_organizations(X1,X2)) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.OEhjH3eKLz/E---3.1_32459.p',a6) ).
fof(l7,hypothesis,
! [X1,X2] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2)
& constant(number_of_organizations(X1,X2)) )
=> ( ( growth_rate(first_movers,X2) = zero
& growth_rate(efficient_producers,X2) = zero )
| ( greater(growth_rate(first_movers,X2),zero)
& greater(zero,growth_rate(efficient_producers,X2)) )
| ( greater(growth_rate(efficient_producers,X2),zero)
& greater(zero,growth_rate(first_movers,X2)) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.OEhjH3eKLz/E---3.1_32459.p',l7) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2] :
( ( environment(X1)
& subpopulations(first_movers,efficient_producers,X1,X2)
& greater_or_equal(X2,equilibrium(X1)) )
=> ( ( growth_rate(first_movers,X2) = zero
& growth_rate(efficient_producers,X2) = zero )
| ( greater(growth_rate(first_movers,X2),zero)
& greater(zero,growth_rate(efficient_producers,X2)) )
| ( greater(growth_rate(efficient_producers,X2),zero)
& greater(zero,growth_rate(first_movers,X2)) ) ) ),
inference(assume_negation,[status(cth)],[prove_l6]) ).
fof(c_0_8,plain,
! [X1,X2] :
( ( environment(X1)
& greater_or_equal(X2,equilibrium(X1)) )
=> ~ greater(equilibrium(X1),X2) ),
inference(fof_simplification,[status(thm)],[mp_equilibrium]) ).
fof(c_0_9,hypothesis,
! [X1,X2] :
( ( environment(X1)
& in_environment(X1,X2)
& greater(number_of_organizations(X1,X2),zero) )
=> ( ( greater(equilibrium(X1),X2)
=> decreases(resources(X1,X2)) )
& ( ~ greater(equilibrium(X1),X2)
=> constant(resources(X1,X2)) ) ) ),
inference(fof_simplification,[status(thm)],[a3]) ).
fof(c_0_10,plain,
! [X11,X12] :
( ~ environment(X11)
| ~ subpopulations(first_movers,efficient_producers,X11,X12)
| greater(number_of_organizations(X11,X12),zero) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_positive_number_of_organizations])]) ).
fof(c_0_11,negated_conjecture,
( environment(esk1_0)
& subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)
& greater_or_equal(esk2_0,equilibrium(esk1_0))
& ( growth_rate(first_movers,esk2_0) != zero
| growth_rate(efficient_producers,esk2_0) != zero )
& ( ~ greater(growth_rate(first_movers,esk2_0),zero)
| ~ greater(zero,growth_rate(efficient_producers,esk2_0)) )
& ( ~ greater(growth_rate(efficient_producers,esk2_0),zero)
| ~ greater(zero,growth_rate(first_movers,esk2_0)) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_12,plain,
! [X15,X16] :
( ~ environment(X15)
| ~ subpopulations(first_movers,efficient_producers,X15,X16)
| in_environment(X15,X16) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_time_point_occur])]) ).
fof(c_0_13,plain,
! [X13,X14] :
( ~ environment(X13)
| ~ greater_or_equal(X14,equilibrium(X13))
| ~ greater(equilibrium(X13),X14) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])]) ).
fof(c_0_14,hypothesis,
! [X1,X2] :
( ( environment(X1)
& in_environment(X1,X2) )
=> ( ( decreases(resources(X1,X2))
=> ~ decreases(number_of_organizations(X1,X2)) )
& ( constant(resources(X1,X2))
=> constant(number_of_organizations(X1,X2)) ) ) ),
inference(fof_simplification,[status(thm)],[a6]) ).
fof(c_0_15,hypothesis,
! [X3,X4] :
( ( ~ greater(equilibrium(X3),X4)
| decreases(resources(X3,X4))
| ~ environment(X3)
| ~ in_environment(X3,X4)
| ~ greater(number_of_organizations(X3,X4),zero) )
& ( greater(equilibrium(X3),X4)
| constant(resources(X3,X4))
| ~ environment(X3)
| ~ in_environment(X3,X4)
| ~ greater(number_of_organizations(X3,X4),zero) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
cnf(c_0_16,plain,
( greater(number_of_organizations(X1,X2),zero)
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
subpopulations(first_movers,efficient_producers,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
environment(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
( in_environment(X1,X2)
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( ~ environment(X1)
| ~ greater_or_equal(X2,equilibrium(X1))
| ~ greater(equilibrium(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,negated_conjecture,
greater_or_equal(esk2_0,equilibrium(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_22,hypothesis,
! [X5,X6] :
( ( ~ decreases(resources(X5,X6))
| ~ decreases(number_of_organizations(X5,X6))
| ~ environment(X5)
| ~ in_environment(X5,X6) )
& ( ~ constant(resources(X5,X6))
| constant(number_of_organizations(X5,X6))
| ~ environment(X5)
| ~ in_environment(X5,X6) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
cnf(c_0_23,hypothesis,
( greater(equilibrium(X1),X2)
| constant(resources(X1,X2))
| ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(number_of_organizations(X1,X2),zero) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,negated_conjecture,
greater(number_of_organizations(esk1_0,esk2_0),zero),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_25,negated_conjecture,
in_environment(esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_17]),c_0_18])]) ).
cnf(c_0_26,negated_conjecture,
~ greater(equilibrium(esk1_0),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_18])]) ).
fof(c_0_27,hypothesis,
! [X7,X8] :
( ( greater(growth_rate(efficient_producers,X8),zero)
| greater(growth_rate(first_movers,X8),zero)
| growth_rate(first_movers,X8) = zero
| ~ environment(X7)
| ~ subpopulations(first_movers,efficient_producers,X7,X8)
| ~ constant(number_of_organizations(X7,X8)) )
& ( greater(zero,growth_rate(first_movers,X8))
| greater(growth_rate(first_movers,X8),zero)
| growth_rate(first_movers,X8) = zero
| ~ environment(X7)
| ~ subpopulations(first_movers,efficient_producers,X7,X8)
| ~ constant(number_of_organizations(X7,X8)) )
& ( greater(growth_rate(efficient_producers,X8),zero)
| greater(zero,growth_rate(efficient_producers,X8))
| growth_rate(first_movers,X8) = zero
| ~ environment(X7)
| ~ subpopulations(first_movers,efficient_producers,X7,X8)
| ~ constant(number_of_organizations(X7,X8)) )
& ( greater(zero,growth_rate(first_movers,X8))
| greater(zero,growth_rate(efficient_producers,X8))
| growth_rate(first_movers,X8) = zero
| ~ environment(X7)
| ~ subpopulations(first_movers,efficient_producers,X7,X8)
| ~ constant(number_of_organizations(X7,X8)) )
& ( greater(growth_rate(efficient_producers,X8),zero)
| greater(growth_rate(first_movers,X8),zero)
| growth_rate(efficient_producers,X8) = zero
| ~ environment(X7)
| ~ subpopulations(first_movers,efficient_producers,X7,X8)
| ~ constant(number_of_organizations(X7,X8)) )
& ( greater(zero,growth_rate(first_movers,X8))
| greater(growth_rate(first_movers,X8),zero)
| growth_rate(efficient_producers,X8) = zero
| ~ environment(X7)
| ~ subpopulations(first_movers,efficient_producers,X7,X8)
| ~ constant(number_of_organizations(X7,X8)) )
& ( greater(growth_rate(efficient_producers,X8),zero)
| greater(zero,growth_rate(efficient_producers,X8))
| growth_rate(efficient_producers,X8) = zero
| ~ environment(X7)
| ~ subpopulations(first_movers,efficient_producers,X7,X8)
| ~ constant(number_of_organizations(X7,X8)) )
& ( greater(zero,growth_rate(first_movers,X8))
| greater(zero,growth_rate(efficient_producers,X8))
| growth_rate(efficient_producers,X8) = zero
| ~ environment(X7)
| ~ subpopulations(first_movers,efficient_producers,X7,X8)
| ~ constant(number_of_organizations(X7,X8)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l7])])]) ).
cnf(c_0_28,hypothesis,
( constant(number_of_organizations(X1,X2))
| ~ constant(resources(X1,X2))
| ~ environment(X1)
| ~ in_environment(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,hypothesis,
constant(resources(esk1_0,esk2_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_18])]),c_0_26]) ).
cnf(c_0_30,hypothesis,
( greater(zero,growth_rate(first_movers,X1))
| greater(growth_rate(first_movers,X1),zero)
| growth_rate(first_movers,X1) = zero
| ~ environment(X2)
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ constant(number_of_organizations(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_31,hypothesis,
constant(number_of_organizations(esk1_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_25]),c_0_18])]) ).
cnf(c_0_32,hypothesis,
( greater(zero,growth_rate(first_movers,X1))
| greater(zero,growth_rate(efficient_producers,X1))
| growth_rate(first_movers,X1) = zero
| ~ environment(X2)
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ constant(number_of_organizations(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_33,hypothesis,
( greater(growth_rate(efficient_producers,X1),zero)
| greater(growth_rate(first_movers,X1),zero)
| growth_rate(first_movers,X1) = zero
| ~ environment(X2)
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ constant(number_of_organizations(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,negated_conjecture,
( ~ greater(growth_rate(first_movers,esk2_0),zero)
| ~ greater(zero,growth_rate(efficient_producers,esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_35,negated_conjecture,
( growth_rate(first_movers,esk2_0) = zero
| greater(growth_rate(first_movers,esk2_0),zero)
| greater(zero,growth_rate(first_movers,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_17]),c_0_18])]),c_0_31])]) ).
cnf(c_0_36,negated_conjecture,
( growth_rate(first_movers,esk2_0) = zero
| greater(zero,growth_rate(efficient_producers,esk2_0))
| greater(zero,growth_rate(first_movers,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_17]),c_0_18])]),c_0_31])]) ).
cnf(c_0_37,hypothesis,
( greater(growth_rate(efficient_producers,X1),zero)
| greater(zero,growth_rate(efficient_producers,X1))
| growth_rate(first_movers,X1) = zero
| ~ environment(X2)
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ constant(number_of_organizations(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_38,hypothesis,
( greater(zero,growth_rate(first_movers,X1))
| greater(growth_rate(first_movers,X1),zero)
| growth_rate(efficient_producers,X1) = zero
| ~ environment(X2)
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ constant(number_of_organizations(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_39,hypothesis,
( greater(zero,growth_rate(first_movers,X1))
| greater(zero,growth_rate(efficient_producers,X1))
| growth_rate(efficient_producers,X1) = zero
| ~ environment(X2)
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ constant(number_of_organizations(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_40,negated_conjecture,
( ~ greater(growth_rate(efficient_producers,esk2_0),zero)
| ~ greater(zero,growth_rate(first_movers,esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_41,negated_conjecture,
( growth_rate(first_movers,esk2_0) = zero
| greater(growth_rate(efficient_producers,esk2_0),zero)
| greater(growth_rate(first_movers,esk2_0),zero) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_17]),c_0_18])]),c_0_31])]) ).
cnf(c_0_42,negated_conjecture,
( growth_rate(first_movers,esk2_0) = zero
| greater(zero,growth_rate(first_movers,esk2_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_43,negated_conjecture,
( growth_rate(first_movers,esk2_0) = zero
| greater(growth_rate(efficient_producers,esk2_0),zero)
| greater(zero,growth_rate(efficient_producers,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_17]),c_0_18])]),c_0_31])]) ).
cnf(c_0_44,hypothesis,
( greater(growth_rate(efficient_producers,X1),zero)
| greater(zero,growth_rate(efficient_producers,X1))
| growth_rate(efficient_producers,X1) = zero
| ~ environment(X2)
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ constant(number_of_organizations(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_45,negated_conjecture,
( growth_rate(efficient_producers,esk2_0) = zero
| greater(growth_rate(first_movers,esk2_0),zero)
| greater(zero,growth_rate(first_movers,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_17]),c_0_18])]),c_0_31])]) ).
cnf(c_0_46,negated_conjecture,
( growth_rate(efficient_producers,esk2_0) = zero
| greater(zero,growth_rate(efficient_producers,esk2_0))
| greater(zero,growth_rate(first_movers,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_17]),c_0_18])]),c_0_31])]) ).
cnf(c_0_47,negated_conjecture,
( growth_rate(first_movers,esk2_0) = zero
| greater(growth_rate(first_movers,esk2_0),zero) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
cnf(c_0_48,negated_conjecture,
( growth_rate(first_movers,esk2_0) = zero
| greater(zero,growth_rate(efficient_producers,esk2_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_43]),c_0_42]) ).
cnf(c_0_49,negated_conjecture,
( growth_rate(efficient_producers,esk2_0) = zero
| greater(growth_rate(efficient_producers,esk2_0),zero)
| greater(zero,growth_rate(efficient_producers,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_17]),c_0_18])]),c_0_31])]) ).
cnf(c_0_50,negated_conjecture,
( growth_rate(efficient_producers,esk2_0) = zero
| greater(zero,growth_rate(first_movers,esk2_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_45]),c_0_46]) ).
cnf(c_0_51,negated_conjecture,
( growth_rate(first_movers,esk2_0) != zero
| growth_rate(efficient_producers,esk2_0) != zero ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_52,negated_conjecture,
growth_rate(first_movers,esk2_0) = zero,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_47]),c_0_48]) ).
cnf(c_0_53,negated_conjecture,
( growth_rate(efficient_producers,esk2_0) = zero
| greater(zero,growth_rate(efficient_producers,esk2_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_49]),c_0_50]) ).
cnf(c_0_54,negated_conjecture,
growth_rate(efficient_producers,esk2_0) != zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52])]) ).
cnf(c_0_55,negated_conjecture,
greater(zero,growth_rate(efficient_producers,esk2_0)),
inference(sr,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_56,negated_conjecture,
greater(zero,zero),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_52]),c_0_54]) ).
cnf(c_0_57,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_52]),c_0_55]),c_0_56])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : MGT024+1 : TPTP v8.1.2. Released v2.0.0.
% 0.11/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n015.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 00:42:16 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 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.OEhjH3eKLz/E---3.1_32459.p
% 0.31/300.12 # Version: 3.1pre001
% 0.31/300.12 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.31/300.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/300.12 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.31/300.12 # Starting new_bool_3 with 300s (1) cores
% 0.31/300.12 # Starting new_bool_1 with 300s (1) cores
% 0.31/300.12 # Starting sh5l with 300s (1) cores
% 0.31/300.12 # new_bool_3 with pid 32539 completed with status 0
% 0.31/300.12 # Result found by new_bool_3
% 0.31/300.12 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.31/300.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/300.12 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.31/300.12 # Starting new_bool_3 with 300s (1) cores
% 0.31/300.12 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.31/300.12 # Search class: FGHSF-FFMS21-SFFFFFNN
% 0.31/300.12 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.31/300.12 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 181s (1) cores
% 0.31/300.12 # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with pid 32547 completed with status 0
% 0.31/300.12 # Result found by G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y
% 0.31/300.12 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.31/300.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/300.12 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.31/300.12 # Starting new_bool_3 with 300s (1) cores
% 0.31/300.12 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.31/300.12 # Search class: FGHSF-FFMS21-SFFFFFNN
% 0.31/300.12 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.31/300.12 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 181s (1) cores
% 0.31/300.12 # Preprocessing time : 0.001 s
% 0.31/300.12 # Presaturation interreduction done
% 0.31/300.12
% 0.31/300.12 # Proof found!
% 0.31/300.12 # SZS status Theorem
% 0.31/300.12 # SZS output start CNFRefutation
% See solution above
% 0.31/300.12 # Parsed axioms : 7
% 0.31/300.12 # Removed by relevancy pruning/SinE : 0
% 0.31/300.12 # Initial clauses : 21
% 0.31/300.12 # Removed in clause preprocessing : 0
% 0.31/300.12 # Initial clauses in saturation : 21
% 0.31/300.12 # Processed clauses : 65
% 0.31/300.12 # ...of these trivial : 0
% 0.31/300.12 # ...subsumed : 1
% 0.31/300.12 # ...remaining for further processing : 63
% 0.31/300.12 # Other redundant clauses eliminated : 0
% 0.31/300.12 # Clauses deleted for lack of memory : 0
% 0.31/300.12 # Backward-subsumed : 7
% 0.31/300.12 # Backward-rewritten : 7
% 0.31/300.12 # Generated clauses : 21
% 0.31/300.12 # ...of the previous two non-redundant : 25
% 0.31/300.12 # ...aggressively subsumed : 0
% 0.31/300.12 # Contextual simplify-reflections : 6
% 0.31/300.12 # Paramodulations : 20
% 0.31/300.12 # Factorizations : 0
% 0.31/300.12 # NegExts : 0
% 0.31/300.12 # Equation resolutions : 0
% 0.31/300.12 # Total rewrite steps : 35
% 0.31/300.12 # Propositional unsat checks : 0
% 0.31/300.12 # Propositional check models : 0
% 0.31/300.12 # Propositional check unsatisfiable : 0
% 0.31/300.12 # Propositional clauses : 0
% 0.31/300.12 # Propositional clauses after purity: 0
% 0.31/300.12 # Propositional unsat core size : 0
% 0.31/300.12 # Propositional preprocessing time : 0.000
% 0.31/300.12 # Propositional encoding time : 0.000
% 0.31/300.12 # Propositional solver time : 0.000
% 0.31/300.12 # Success case prop preproc time : 0.000
% 0.31/300.12 # Success case prop encoding time : 0.000
% 0.31/300.12 # Success case prop solver time : 0.000
% 0.31/300.12 # Current number of processed clauses : 27
% 0.31/300.12 # Positive orientable unit clauses : 10
% 0.31/300.12 # Positive unorientable unit clauses: 0
% 0.31/300.12 # Negative unit clauses : 2
% 0.31/300.12 # Non-unit-clauses : 15
% 0.31/300.12 # Current number of unprocessed clauses: 2
% 0.31/300.12 # ...number of literals in the above : 6
% 0.31/300.12 # Current number of archived formulas : 0
% 0.31/300.12 # Current number of archived clauses : 36
% 0.31/300.12 # Clause-clause subsumption calls (NU) : 357
% 0.31/300.12 # Rec. Clause-clause subsumption calls : 34
% 0.31/300.12 # Non-unit clause-clause subsumptions : 13
% 0.31/300.12 # Unit Clause-clause subsumption calls : 70
% 0.31/300.12 # Rewrite failures with RHS unbound : 0
% 0.31/300.12 # BW rewrite match attempts : 1
% 0.31/300.12 # BW rewrite match successes : 1
% 0.31/300.12 # Condensation attempts : 0
% 0.31/300.12 # Condensation successes : 0
% 0.31/300.12 # Termbank termtop insertions : 2578
% 0.31/300.12
% 0.31/300.12 # -------------------------------------------------
% 0.31/300.12 # User time : 0.007 s
% 0.31/300.12 # System time : 0.002 s
% 0.31/300.12 # Total time : 0.009 s
% 0.31/300.12 # Maximum resident set size: 1712 pages
% 0.31/300.12
% 0.31/300.12 # -------------------------------------------------
% 0.31/300.12 # User time : 0.007 s
% 0.31/300.12 # System time : 0.006 s
% 0.31/300.12 # Total time : 0.013 s
% 0.31/300.12 # Maximum resident set size: 1676 pages
% 0.31/300.12 % E---3.1 exiting
% 0.31/300.12 % E---3.1 exiting
%------------------------------------------------------------------------------