TSTP Solution File: MGT036-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : MGT036-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n031.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 : Thu Aug 31 09:08:31 EDT 2023
% Result : Unsatisfiable 0.21s 0.58s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 25
% Syntax : Number of formulae : 51 ( 14 unt; 13 typ; 0 def)
% Number of atoms : 87 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 104 ( 55 ~; 49 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 17 ( 8 >; 9 *; 0 +; 0 <<)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 72 ( 16 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
environment: $i > $o ).
tff(decl_23,type,
first_movers: $i ).
tff(decl_24,type,
efficient_producers: $i ).
tff(decl_25,type,
subpopulations: ( $i * $i * $i * $i ) > $o ).
tff(decl_26,type,
in_environment: ( $i * $i ) > $o ).
tff(decl_27,type,
zero: $i ).
tff(decl_28,type,
growth_rate: ( $i * $i ) > $i ).
tff(decl_29,type,
greater: ( $i * $i ) > $o ).
tff(decl_30,type,
greater_or_equal: ( $i * $i ) > $o ).
tff(decl_31,type,
outcompetes: ( $i * $i * $i ) > $o ).
tff(decl_32,type,
resilience: $i > $i ).
tff(decl_33,type,
sk1: $i ).
tff(decl_34,type,
sk2: $i ).
cnf(d2_9,hypothesis,
( greater(zero,growth_rate(X2,X4))
| ~ environment(X1)
| ~ subpopulations(X2,X3,X1,X4)
| ~ outcompetes(X3,X2,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_9) ).
cnf(mp_symmetry_of_FM_and_EP_1,axiom,
( subpopulations(efficient_producers,first_movers,X1,X2)
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_symmetry_of_FM_and_EP_1) ).
cnf(prove_t5_13,negated_conjecture,
subpopulations(first_movers,efficient_producers,sk1,sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t5_13) ).
cnf(prove_t5_14,negated_conjecture,
outcompetes(first_movers,efficient_producers,sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t5_14) ).
cnf(prove_t5_12,negated_conjecture,
environment(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t5_12) ).
cnf(mp_growth_rate_relationships_3,axiom,
( environment(X1)
| ~ greater(zero,growth_rate(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_growth_rate_relationships_3) ).
cnf(d2_8,hypothesis,
( greater_or_equal(growth_rate(X3,X4),zero)
| ~ environment(X1)
| ~ subpopulations(X2,X3,X1,X4)
| ~ outcompetes(X3,X2,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_8) ).
cnf(mp_growth_rate_relationships_4,axiom,
( subpopulations(X1,X2,X3,X4)
| ~ greater(zero,growth_rate(X1,X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_growth_rate_relationships_4) ).
cnf(a12_10,hypothesis,
( greater(zero,growth_rate(X3,X2))
| ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(resilience(X4),resilience(X3))
| ~ greater(zero,growth_rate(X4,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a12_10) ).
cnf(mp_growth_rate_relationships_5,axiom,
( ~ greater_or_equal(growth_rate(X1,X2),zero)
| ~ greater(zero,growth_rate(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_growth_rate_relationships_5) ).
cnf(a2_11,hypothesis,
greater(resilience(efficient_producers),resilience(first_movers)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a2_11) ).
cnf(mp_time_point_occur_2,axiom,
( in_environment(X1,X2)
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_time_point_occur_2) ).
cnf(c_0_12,hypothesis,
( greater(zero,growth_rate(X2,X4))
| ~ environment(X1)
| ~ subpopulations(X2,X3,X1,X4)
| ~ outcompetes(X3,X2,X4) ),
d2_9 ).
cnf(c_0_13,axiom,
( subpopulations(efficient_producers,first_movers,X1,X2)
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
mp_symmetry_of_FM_and_EP_1 ).
cnf(c_0_14,hypothesis,
( greater(zero,growth_rate(efficient_producers,X1))
| ~ outcompetes(first_movers,efficient_producers,X1)
| ~ subpopulations(first_movers,efficient_producers,X2,X1)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,negated_conjecture,
subpopulations(first_movers,efficient_producers,sk1,sk2),
prove_t5_13 ).
cnf(c_0_16,negated_conjecture,
outcompetes(first_movers,efficient_producers,sk2),
prove_t5_14 ).
cnf(c_0_17,negated_conjecture,
environment(sk1),
prove_t5_12 ).
cnf(c_0_18,axiom,
( environment(X1)
| ~ greater(zero,growth_rate(X2,X3)) ),
mp_growth_rate_relationships_3 ).
cnf(c_0_19,negated_conjecture,
greater(zero,growth_rate(efficient_producers,sk2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]) ).
cnf(c_0_20,hypothesis,
( greater_or_equal(growth_rate(X3,X4),zero)
| ~ environment(X1)
| ~ subpopulations(X2,X3,X1,X4)
| ~ outcompetes(X3,X2,X4) ),
d2_8 ).
cnf(c_0_21,negated_conjecture,
environment(X1),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,hypothesis,
( greater_or_equal(growth_rate(X1,X2),zero)
| ~ outcompetes(X1,X3,X2)
| ~ subpopulations(X3,X1,X4,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).
cnf(c_0_23,axiom,
( subpopulations(X1,X2,X3,X4)
| ~ greater(zero,growth_rate(X1,X4)) ),
mp_growth_rate_relationships_4 ).
cnf(c_0_24,hypothesis,
( greater_or_equal(growth_rate(X1,X2),zero)
| ~ outcompetes(X1,X3,X2)
| ~ greater(zero,growth_rate(X3,X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,hypothesis,
( greater(zero,growth_rate(X3,X2))
| ~ environment(X1)
| ~ in_environment(X1,X2)
| ~ greater(resilience(X4),resilience(X3))
| ~ greater(zero,growth_rate(X4,X2)) ),
a12_10 ).
cnf(c_0_26,axiom,
( ~ greater_or_equal(growth_rate(X1,X2),zero)
| ~ greater(zero,growth_rate(X1,X2)) ),
mp_growth_rate_relationships_5 ).
cnf(c_0_27,negated_conjecture,
( greater_or_equal(growth_rate(X1,sk2),zero)
| ~ outcompetes(X1,efficient_producers,sk2) ),
inference(spm,[status(thm)],[c_0_24,c_0_19]) ).
cnf(c_0_28,hypothesis,
( greater(zero,growth_rate(X1,X2))
| ~ greater(zero,growth_rate(X3,X2))
| ~ greater(resilience(X3),resilience(X1))
| ~ in_environment(X4,X2) ),
inference(csr,[status(thm)],[c_0_25,c_0_18]) ).
cnf(c_0_29,negated_conjecture,
( ~ outcompetes(X1,efficient_producers,sk2)
| ~ greater(zero,growth_rate(X1,sk2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
( greater(zero,growth_rate(X1,sk2))
| ~ greater(resilience(efficient_producers),resilience(X1))
| ~ in_environment(X2,sk2) ),
inference(spm,[status(thm)],[c_0_28,c_0_19]) ).
cnf(c_0_31,hypothesis,
greater(resilience(efficient_producers),resilience(first_movers)),
a2_11 ).
cnf(c_0_32,negated_conjecture,
~ greater(zero,growth_rate(first_movers,sk2)),
inference(spm,[status(thm)],[c_0_29,c_0_16]) ).
cnf(c_0_33,axiom,
( in_environment(X1,X2)
| ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
mp_time_point_occur_2 ).
cnf(c_0_34,hypothesis,
~ in_environment(X1,sk2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_35,plain,
( in_environment(X1,X2)
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_21])]) ).
cnf(c_0_36,hypothesis,
~ subpopulations(first_movers,efficient_producers,X1,sk2),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_15,c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : MGT036-1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.34 % Computer : n031.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Aug 28 06:55:40 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.21/0.56 start to proof: theBenchmark
% 0.21/0.58 % Version : CSE_E---1.5
% 0.21/0.58 % Problem : theBenchmark.p
% 0.21/0.58 % Proof found
% 0.21/0.58 % SZS status Theorem for theBenchmark.p
% 0.21/0.58 % SZS output start Proof
% See solution above
% 0.21/0.58 % Total time : 0.007000 s
% 0.21/0.58 % SZS output end Proof
% 0.21/0.58 % Total time : 0.009000 s
%------------------------------------------------------------------------------