TSTP Solution File: MGT036-3 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : MGT036-3 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n024.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:32 EDT 2023
% Result : Unsatisfiable 0.19s 0.56s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 18
% Syntax : Number of formulae : 30 ( 11 unt; 11 typ; 0 def)
% Number of atoms : 39 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 44 ( 24 ~; 20 |; 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 : 14 ( 6 >; 8 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
environment: $i > $o ).
tff(decl_23,type,
subpopulations: ( $i * $i * $i * $i ) > $o ).
tff(decl_24,type,
growth_rate: ( $i * $i ) > $i ).
tff(decl_25,type,
zero: $i ).
tff(decl_26,type,
greater_or_equal: ( $i * $i ) > $o ).
tff(decl_27,type,
greater: ( $i * $i ) > $o ).
tff(decl_28,type,
outcompetes: ( $i * $i * $i ) > $o ).
tff(decl_29,type,
sk1: $i ).
tff(decl_30,type,
first_movers: $i ).
tff(decl_31,type,
efficient_producers: $i ).
tff(decl_32,type,
sk2: $i ).
cnf(d2_2,hypothesis,
( outcompetes(X3,X2,X4)
| ~ environment(X1)
| ~ subpopulations(X2,X3,X1,X4)
| ~ greater_or_equal(growth_rate(X3,X4),zero)
| ~ greater(zero,growth_rate(X2,X4)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_2) ).
cnf(a13_star_8,hypothesis,
greater(zero,growth_rate(efficient_producers,sk2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a13_star_8) ).
cnf(prove_t5_star_9,negated_conjecture,
( ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ outcompetes(first_movers,efficient_producers,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t5_star_9) ).
cnf(a13_star_6,hypothesis,
subpopulations(first_movers,efficient_producers,sk1,sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a13_star_6) ).
cnf(a13_star_5,hypothesis,
environment(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a13_star_5) ).
cnf(a13_star_7,hypothesis,
greater_or_equal(growth_rate(first_movers,sk2),zero),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a13_star_7) ).
cnf(mp_symmetry_of_subpopulations_1,axiom,
( subpopulations(X3,X2,X1,X4)
| ~ environment(X1)
| ~ subpopulations(X2,X3,X1,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_symmetry_of_subpopulations_1) ).
cnf(c_0_7,hypothesis,
( outcompetes(X3,X2,X4)
| ~ environment(X1)
| ~ subpopulations(X2,X3,X1,X4)
| ~ greater_or_equal(growth_rate(X3,X4),zero)
| ~ greater(zero,growth_rate(X2,X4)) ),
d2_2 ).
cnf(c_0_8,hypothesis,
greater(zero,growth_rate(efficient_producers,sk2)),
a13_star_8 ).
cnf(c_0_9,negated_conjecture,
( ~ environment(X1)
| ~ subpopulations(first_movers,efficient_producers,X1,X2)
| ~ outcompetes(first_movers,efficient_producers,X2) ),
prove_t5_star_9 ).
cnf(c_0_10,hypothesis,
subpopulations(first_movers,efficient_producers,sk1,sk2),
a13_star_6 ).
cnf(c_0_11,hypothesis,
environment(sk1),
a13_star_5 ).
cnf(c_0_12,hypothesis,
( outcompetes(X1,efficient_producers,sk2)
| ~ greater_or_equal(growth_rate(X1,sk2),zero)
| ~ subpopulations(efficient_producers,X1,X2,sk2)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_13,hypothesis,
greater_or_equal(growth_rate(first_movers,sk2),zero),
a13_star_7 ).
cnf(c_0_14,negated_conjecture,
~ outcompetes(first_movers,efficient_producers,sk2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).
cnf(c_0_15,axiom,
( subpopulations(X3,X2,X1,X4)
| ~ environment(X1)
| ~ subpopulations(X2,X3,X1,X4) ),
mp_symmetry_of_subpopulations_1 ).
cnf(c_0_16,hypothesis,
( ~ subpopulations(efficient_producers,first_movers,X1,sk2)
| ~ environment(X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_17,hypothesis,
subpopulations(efficient_producers,first_movers,sk1,sk2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_10]),c_0_11])]) ).
cnf(c_0_18,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : MGT036-3 : TPTP v8.1.2. Released v2.4.0.
% 0.10/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.33 % Computer : n024.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Mon Aug 28 06:24:08 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.19/0.55 start to proof: theBenchmark
% 0.19/0.56 % Version : CSE_E---1.5
% 0.19/0.56 % Problem : theBenchmark.p
% 0.19/0.56 % Proof found
% 0.19/0.56 % SZS status Theorem for theBenchmark.p
% 0.19/0.56 % SZS output start Proof
% See solution above
% 0.19/0.57 % Total time : 0.004000 s
% 0.19/0.57 % SZS output end Proof
% 0.19/0.57 % Total time : 0.007000 s
%------------------------------------------------------------------------------