TSTP Solution File: MGT024-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : MGT024-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:36:58 EDT 2024
% Result : Unsatisfiable 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 18
% Syntax : Number of clauses : 73 ( 16 unt; 36 nHn; 73 RR)
% Number of literals : 245 ( 41 equ; 122 neg)
% Maximal clause size : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 72 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(mp_positive_number_of_organizations_25,axiom,
( greater(number_of_organizations(X1,X2),zero)
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.IOTbIwJAnI/E---3.1_27072.p',mp_positive_number_of_organizations_25) ).
cnf(mp_time_point_occur_24,axiom,
( in_environment(X1,X2)
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.IOTbIwJAnI/E---3.1_27072.p',mp_time_point_occur_24) ).
cnf(mp_equilibrium_26,axiom,
( ~ environment(X1)
| ~ greater_or_equal(X2,equilibrium(X1))
| ~ greater(equilibrium(X1),X2) ),
file('/export/starexec/sandbox/tmp/tmp.IOTbIwJAnI/E---3.1_27072.p',mp_equilibrium_26) ).
cnf(a3_28,hypothesis,
( greater(equilibrium(X1),X2)
| constant(resources(X1,X2))
| ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(number_of_organizations(X1,X2),zero) ),
file('/export/starexec/sandbox/tmp/tmp.IOTbIwJAnI/E---3.1_27072.p',a3_28) ).
cnf(prove_l6_40,negated_conjecture,
subpopulations(first_movers,efficient_producers,sk1,sk2),
file('/export/starexec/sandbox/tmp/tmp.IOTbIwJAnI/E---3.1_27072.p',prove_l6_40) ).
cnf(prove_l6_39,negated_conjecture,
environment(sk1),
file('/export/starexec/sandbox/tmp/tmp.IOTbIwJAnI/E---3.1_27072.p',prove_l6_39) ).
cnf(prove_l6_41,negated_conjecture,
greater_or_equal(sk2,equilibrium(sk1)),
file('/export/starexec/sandbox/tmp/tmp.IOTbIwJAnI/E---3.1_27072.p',prove_l6_41) ).
cnf(a6_30,hypothesis,
( constant(number_of_organizations(X1,X2))
| ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ constant(resources(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.IOTbIwJAnI/E---3.1_27072.p',a6_30) ).
cnf(l7_32,hypothesis,
( growth_rate(first_movers,X2) = zero
| greater(growth_rate(first_movers,X2),zero)
| greater(zero,growth_rate(first_movers,X2))
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ constant(number_of_organizations(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.IOTbIwJAnI/E---3.1_27072.p',l7_32) ).
cnf(l7_34,hypothesis,
( growth_rate(first_movers,X2) = zero
| greater(zero,growth_rate(efficient_producers,X2))
| greater(zero,growth_rate(first_movers,X2))
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ constant(number_of_organizations(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.IOTbIwJAnI/E---3.1_27072.p',l7_34) ).
cnf(l7_31,hypothesis,
( growth_rate(first_movers,X2) = zero
| greater(growth_rate(first_movers,X2),zero)
| greater(growth_rate(efficient_producers,X2),zero)
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ constant(number_of_organizations(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.IOTbIwJAnI/E---3.1_27072.p',l7_31) ).
cnf(prove_l6_43,negated_conjecture,
( ~ greater(growth_rate(first_movers,sk2),zero)
| ~ greater(zero,growth_rate(efficient_producers,sk2)) ),
file('/export/starexec/sandbox/tmp/tmp.IOTbIwJAnI/E---3.1_27072.p',prove_l6_43) ).
cnf(l7_33,hypothesis,
( growth_rate(first_movers,X2) = zero
| greater(zero,growth_rate(efficient_producers,X2))
| greater(growth_rate(efficient_producers,X2),zero)
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ constant(number_of_organizations(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.IOTbIwJAnI/E---3.1_27072.p',l7_33) ).
cnf(l7_36,hypothesis,
( growth_rate(efficient_producers,X2) = zero
| greater(growth_rate(first_movers,X2),zero)
| greater(zero,growth_rate(first_movers,X2))
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ constant(number_of_organizations(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.IOTbIwJAnI/E---3.1_27072.p',l7_36) ).
cnf(l7_38,hypothesis,
( growth_rate(efficient_producers,X2) = zero
| greater(zero,growth_rate(efficient_producers,X2))
| greater(zero,growth_rate(first_movers,X2))
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ constant(number_of_organizations(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.IOTbIwJAnI/E---3.1_27072.p',l7_38) ).
cnf(prove_l6_44,negated_conjecture,
( ~ greater(growth_rate(efficient_producers,sk2),zero)
| ~ greater(zero,growth_rate(first_movers,sk2)) ),
file('/export/starexec/sandbox/tmp/tmp.IOTbIwJAnI/E---3.1_27072.p',prove_l6_44) ).
cnf(l7_37,hypothesis,
( growth_rate(efficient_producers,X2) = zero
| greater(zero,growth_rate(efficient_producers,X2))
| greater(growth_rate(efficient_producers,X2),zero)
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ constant(number_of_organizations(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.IOTbIwJAnI/E---3.1_27072.p',l7_37) ).
cnf(prove_l6_42,negated_conjecture,
( growth_rate(first_movers,sk2) != zero
| growth_rate(efficient_producers,sk2) != zero ),
file('/export/starexec/sandbox/tmp/tmp.IOTbIwJAnI/E---3.1_27072.p',prove_l6_42) ).
cnf(c_0_18,plain,
( greater(number_of_organizations(X1,X2),zero)
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
inference(fof_simplification,[status(thm)],[mp_positive_number_of_organizations_25]) ).
cnf(c_0_19,plain,
( in_environment(X1,X2)
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
inference(fof_simplification,[status(thm)],[mp_time_point_occur_24]) ).
cnf(c_0_20,plain,
( ~ environment(X1)
| ~ greater_or_equal(X2,equilibrium(X1))
| ~ greater(equilibrium(X1),X2) ),
inference(fof_simplification,[status(thm)],[mp_equilibrium_26]) ).
cnf(c_0_21,hypothesis,
( greater(equilibrium(X1),X2)
| constant(resources(X1,X2))
| ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(number_of_organizations(X1,X2),zero) ),
inference(fof_simplification,[status(thm)],[a3_28]) ).
cnf(c_0_22,plain,
( greater(number_of_organizations(X1,X2),zero)
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
c_0_18 ).
cnf(c_0_23,negated_conjecture,
subpopulations(first_movers,efficient_producers,sk1,sk2),
prove_l6_40 ).
cnf(c_0_24,negated_conjecture,
environment(sk1),
prove_l6_39 ).
cnf(c_0_25,plain,
( in_environment(X1,X2)
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
c_0_19 ).
cnf(c_0_26,plain,
( ~ environment(X1)
| ~ greater_or_equal(X2,equilibrium(X1))
| ~ greater(equilibrium(X1),X2) ),
c_0_20 ).
cnf(c_0_27,negated_conjecture,
greater_or_equal(sk2,equilibrium(sk1)),
prove_l6_41 ).
cnf(c_0_28,hypothesis,
( constant(number_of_organizations(X1,X2))
| ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ constant(resources(X1,X2)) ),
inference(fof_simplification,[status(thm)],[a6_30]) ).
cnf(c_0_29,hypothesis,
( greater(equilibrium(X1),X2)
| constant(resources(X1,X2))
| ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(number_of_organizations(X1,X2),zero) ),
c_0_21 ).
cnf(c_0_30,negated_conjecture,
greater(number_of_organizations(sk1,sk2),zero),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_31,negated_conjecture,
in_environment(sk1,sk2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_23]),c_0_24])]) ).
cnf(c_0_32,negated_conjecture,
~ greater(equilibrium(sk1),sk2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_24])]) ).
cnf(c_0_33,hypothesis,
( growth_rate(first_movers,X2) = zero
| greater(growth_rate(first_movers,X2),zero)
| greater(zero,growth_rate(first_movers,X2))
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ constant(number_of_organizations(X1,X2)) ),
inference(fof_simplification,[status(thm)],[l7_32]) ).
cnf(c_0_34,hypothesis,
( constant(number_of_organizations(X1,X2))
| ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ constant(resources(X1,X2)) ),
c_0_28 ).
cnf(c_0_35,hypothesis,
constant(resources(sk1,sk2)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_24])]),c_0_32]) ).
cnf(c_0_36,hypothesis,
( growth_rate(first_movers,X2) = zero
| greater(zero,growth_rate(efficient_producers,X2))
| greater(zero,growth_rate(first_movers,X2))
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ constant(number_of_organizations(X1,X2)) ),
inference(fof_simplification,[status(thm)],[l7_34]) ).
cnf(c_0_37,hypothesis,
( growth_rate(first_movers,X2) = zero
| greater(growth_rate(first_movers,X2),zero)
| greater(growth_rate(efficient_producers,X2),zero)
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ constant(number_of_organizations(X1,X2)) ),
inference(fof_simplification,[status(thm)],[l7_31]) ).
cnf(c_0_38,negated_conjecture,
( ~ greater(growth_rate(first_movers,sk2),zero)
| ~ greater(zero,growth_rate(efficient_producers,sk2)) ),
inference(fof_simplification,[status(thm)],[prove_l6_43]) ).
cnf(c_0_39,hypothesis,
( growth_rate(first_movers,X2) = zero
| greater(growth_rate(first_movers,X2),zero)
| greater(zero,growth_rate(first_movers,X2))
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ constant(number_of_organizations(X1,X2)) ),
c_0_33 ).
cnf(c_0_40,hypothesis,
constant(number_of_organizations(sk1,sk2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_31]),c_0_24])]) ).
cnf(c_0_41,hypothesis,
( growth_rate(first_movers,X2) = zero
| greater(zero,growth_rate(efficient_producers,X2))
| greater(zero,growth_rate(first_movers,X2))
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ constant(number_of_organizations(X1,X2)) ),
c_0_36 ).
cnf(c_0_42,hypothesis,
( growth_rate(first_movers,X2) = zero
| greater(zero,growth_rate(efficient_producers,X2))
| greater(growth_rate(efficient_producers,X2),zero)
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ constant(number_of_organizations(X1,X2)) ),
inference(fof_simplification,[status(thm)],[l7_33]) ).
cnf(c_0_43,hypothesis,
( growth_rate(efficient_producers,X2) = zero
| greater(growth_rate(first_movers,X2),zero)
| greater(zero,growth_rate(first_movers,X2))
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ constant(number_of_organizations(X1,X2)) ),
inference(fof_simplification,[status(thm)],[l7_36]) ).
cnf(c_0_44,hypothesis,
( growth_rate(efficient_producers,X2) = zero
| greater(zero,growth_rate(efficient_producers,X2))
| greater(zero,growth_rate(first_movers,X2))
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ constant(number_of_organizations(X1,X2)) ),
inference(fof_simplification,[status(thm)],[l7_38]) ).
cnf(c_0_45,negated_conjecture,
( ~ greater(growth_rate(efficient_producers,sk2),zero)
| ~ greater(zero,growth_rate(first_movers,sk2)) ),
inference(fof_simplification,[status(thm)],[prove_l6_44]) ).
cnf(c_0_46,hypothesis,
( growth_rate(first_movers,X2) = zero
| greater(growth_rate(first_movers,X2),zero)
| greater(growth_rate(efficient_producers,X2),zero)
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ constant(number_of_organizations(X1,X2)) ),
c_0_37 ).
cnf(c_0_47,negated_conjecture,
( ~ greater(growth_rate(first_movers,sk2),zero)
| ~ greater(zero,growth_rate(efficient_producers,sk2)) ),
c_0_38 ).
cnf(c_0_48,negated_conjecture,
( growth_rate(first_movers,sk2) = zero
| greater(growth_rate(first_movers,sk2),zero)
| greater(zero,growth_rate(first_movers,sk2)) ),
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_23]),c_0_24])]),c_0_40])]) ).
cnf(c_0_49,negated_conjecture,
( growth_rate(first_movers,sk2) = zero
| greater(zero,growth_rate(efficient_producers,sk2))
| greater(zero,growth_rate(first_movers,sk2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_23]),c_0_24])]),c_0_40])]) ).
cnf(c_0_50,hypothesis,
( growth_rate(first_movers,X2) = zero
| greater(zero,growth_rate(efficient_producers,X2))
| greater(growth_rate(efficient_producers,X2),zero)
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ constant(number_of_organizations(X1,X2)) ),
c_0_42 ).
cnf(c_0_51,hypothesis,
( growth_rate(efficient_producers,X2) = zero
| greater(zero,growth_rate(efficient_producers,X2))
| greater(growth_rate(efficient_producers,X2),zero)
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ constant(number_of_organizations(X1,X2)) ),
inference(fof_simplification,[status(thm)],[l7_37]) ).
cnf(c_0_52,hypothesis,
( growth_rate(efficient_producers,X2) = zero
| greater(growth_rate(first_movers,X2),zero)
| greater(zero,growth_rate(first_movers,X2))
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ constant(number_of_organizations(X1,X2)) ),
c_0_43 ).
cnf(c_0_53,hypothesis,
( growth_rate(efficient_producers,X2) = zero
| greater(zero,growth_rate(efficient_producers,X2))
| greater(zero,growth_rate(first_movers,X2))
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ constant(number_of_organizations(X1,X2)) ),
c_0_44 ).
cnf(c_0_54,negated_conjecture,
( ~ greater(growth_rate(efficient_producers,sk2),zero)
| ~ greater(zero,growth_rate(first_movers,sk2)) ),
c_0_45 ).
cnf(c_0_55,negated_conjecture,
( growth_rate(first_movers,sk2) = zero
| greater(growth_rate(efficient_producers,sk2),zero)
| greater(growth_rate(first_movers,sk2),zero) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_23]),c_0_24])]),c_0_40])]) ).
cnf(c_0_56,negated_conjecture,
( growth_rate(first_movers,sk2) = zero
| greater(zero,growth_rate(first_movers,sk2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).
cnf(c_0_57,negated_conjecture,
( growth_rate(first_movers,sk2) = zero
| greater(growth_rate(efficient_producers,sk2),zero)
| greater(zero,growth_rate(efficient_producers,sk2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_23]),c_0_24])]),c_0_40])]) ).
cnf(c_0_58,hypothesis,
( growth_rate(efficient_producers,X2) = zero
| greater(zero,growth_rate(efficient_producers,X2))
| greater(growth_rate(efficient_producers,X2),zero)
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ constant(number_of_organizations(X1,X2)) ),
c_0_51 ).
cnf(c_0_59,negated_conjecture,
( growth_rate(efficient_producers,sk2) = zero
| greater(growth_rate(first_movers,sk2),zero)
| greater(zero,growth_rate(first_movers,sk2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_23]),c_0_24])]),c_0_40])]) ).
cnf(c_0_60,negated_conjecture,
( growth_rate(efficient_producers,sk2) = zero
| greater(zero,growth_rate(efficient_producers,sk2))
| greater(zero,growth_rate(first_movers,sk2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_23]),c_0_24])]),c_0_40])]) ).
cnf(c_0_61,negated_conjecture,
( growth_rate(first_movers,sk2) != zero
| growth_rate(efficient_producers,sk2) != zero ),
inference(fof_simplification,[status(thm)],[prove_l6_42]) ).
cnf(c_0_62,negated_conjecture,
( growth_rate(first_movers,sk2) = zero
| greater(growth_rate(first_movers,sk2),zero) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]) ).
cnf(c_0_63,negated_conjecture,
( growth_rate(first_movers,sk2) = zero
| greater(zero,growth_rate(efficient_producers,sk2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_57]),c_0_56]) ).
cnf(c_0_64,negated_conjecture,
( growth_rate(efficient_producers,sk2) = zero
| greater(growth_rate(efficient_producers,sk2),zero)
| greater(zero,growth_rate(efficient_producers,sk2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_23]),c_0_24])]),c_0_40])]) ).
cnf(c_0_65,negated_conjecture,
( growth_rate(efficient_producers,sk2) = zero
| greater(zero,growth_rate(first_movers,sk2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_59]),c_0_60]) ).
cnf(c_0_66,negated_conjecture,
( growth_rate(first_movers,sk2) != zero
| growth_rate(efficient_producers,sk2) != zero ),
c_0_61 ).
cnf(c_0_67,negated_conjecture,
growth_rate(first_movers,sk2) = zero,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_62]),c_0_63]) ).
cnf(c_0_68,negated_conjecture,
( growth_rate(efficient_producers,sk2) = zero
| greater(zero,growth_rate(efficient_producers,sk2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_64]),c_0_65]) ).
cnf(c_0_69,negated_conjecture,
growth_rate(efficient_producers,sk2) != zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_67])]) ).
cnf(c_0_70,negated_conjecture,
greater(zero,growth_rate(efficient_producers,sk2)),
inference(sr,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_71,negated_conjecture,
greater(zero,zero),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_67]),c_0_69]) ).
cnf(c_0_72,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_67]),c_0_70]),c_0_71])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : MGT024-1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n021.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 14:12:23 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.IOTbIwJAnI/E---3.1_27072.p
% 0.21/0.51 # Version: 3.1.0
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # new_bool_3 with pid 27150 completed with status 0
% 0.21/0.51 # Result found by new_bool_3
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.51 # Search class: FGHSF-FFMS21-SFFFFFNN
% 0.21/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 181s (1) cores
% 0.21/0.51 # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with pid 27155 completed with status 0
% 0.21/0.51 # Result found by G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.51 # Search class: FGHSF-FFMS21-SFFFFFNN
% 0.21/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 181s (1) cores
% 0.21/0.51 # Preprocessing time : 0.001 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Unsatisfiable
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 21
% 0.21/0.51 # Removed by relevancy pruning/SinE : 0
% 0.21/0.51 # Initial clauses : 21
% 0.21/0.51 # Removed in clause preprocessing : 0
% 0.21/0.51 # Initial clauses in saturation : 21
% 0.21/0.51 # Processed clauses : 65
% 0.21/0.51 # ...of these trivial : 0
% 0.21/0.51 # ...subsumed : 1
% 0.21/0.51 # ...remaining for further processing : 63
% 0.21/0.51 # Other redundant clauses eliminated : 0
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 7
% 0.21/0.51 # Backward-rewritten : 7
% 0.21/0.51 # Generated clauses : 21
% 0.21/0.51 # ...of the previous two non-redundant : 25
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 6
% 0.21/0.51 # Paramodulations : 20
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 0
% 0.21/0.51 # Disequality decompositions : 0
% 0.21/0.51 # Total rewrite steps : 35
% 0.21/0.51 # ...of those cached : 29
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 27
% 0.21/0.51 # Positive orientable unit clauses : 10
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 2
% 0.21/0.51 # Non-unit-clauses : 15
% 0.21/0.51 # Current number of unprocessed clauses: 2
% 0.21/0.51 # ...number of literals in the above : 6
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 36
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 357
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 34
% 0.21/0.51 # Non-unit clause-clause subsumptions : 13
% 0.21/0.51 # Unit Clause-clause subsumption calls : 70
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 1
% 0.21/0.51 # BW rewrite match successes : 1
% 0.21/0.51 # Condensation attempts : 0
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 2044
% 0.21/0.51 # Search garbage collected termcells : 72
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.009 s
% 0.21/0.51 # System time : 0.000 s
% 0.21/0.51 # Total time : 0.009 s
% 0.21/0.51 # Maximum resident set size: 1752 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.009 s
% 0.21/0.51 # System time : 0.004 s
% 0.21/0.51 # Total time : 0.012 s
% 0.21/0.51 # Maximum resident set size: 1756 pages
% 0.21/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------