TSTP Solution File: MGT036+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : MGT036+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n025.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 : 600s
% DateTime : Sun Jul 17 22:26:20 EDT 2022
% Result : Theorem 0.20s 0.44s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 27 ( 11 unt; 0 nHn; 27 RR)
% Number of literals : 57 ( 0 equ; 32 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
environment(skc3),
file('MGT036+1.p',unknown),
[] ).
cnf(2,axiom,
outcompetes(first_movers,efficient_producers,skc2),
file('MGT036+1.p',unknown),
[] ).
cnf(3,axiom,
subpopulations(first_movers,efficient_producers,skc3,skc2),
file('MGT036+1.p',unknown),
[] ).
cnf(4,axiom,
greater(resilience(efficient_producers),resilience(first_movers)),
file('MGT036+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ greater(zero,growth_rate(u,v))
| environment(w) ),
file('MGT036+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ environment(u)
| ~ subpopulations(first_movers,efficient_producers,u,v)
| in_environment(u,v) ),
file('MGT036+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ greater(zero,growth_rate(u,v))
| ~ greater_or_equal(growth_rate(u,v),zero) ),
file('MGT036+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ environment(u)
| ~ subpopulations(first_movers,efficient_producers,u,v)
| subpopulations(efficient_producers,first_movers,u,v) ),
file('MGT036+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ environment(u)
| ~ outcompetes(v,w,x)
| ~ subpopulations(w,v,u,x)
| greater_or_equal(growth_rate(v,x),zero) ),
file('MGT036+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ environment(u)
| ~ outcompetes(v,w,x)
| ~ subpopulations(w,v,u,x)
| greater(zero,growth_rate(w,x)) ),
file('MGT036+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ environment(u)
| ~ greater(zero,growth_rate(v,w))
| ~ greater(resilience(v),resilience(x))
| ~ in_environment(u,w)
| greater(zero,growth_rate(x,w)) ),
file('MGT036+1.p',unknown),
[] ).
cnf(15,plain,
( ~ in_environment(u,v)
| ~ greater(zero,growth_rate(w,v))
| ~ greater(resilience(w),resilience(x))
| greater(zero,growth_rate(x,v)) ),
inference(mrr,[status(thm)],[13,5]),
[iquote('0:MRR:13.0,5.1')] ).
cnf(22,plain,
( ~ environment(u)
| ~ subpopulations(efficient_producers,first_movers,u,skc2)
| greater_or_equal(growth_rate(first_movers,skc2),zero) ),
inference(res,[status(thm),theory(equality)],[2,11]),
[iquote('0:Res:2.0,11.1')] ).
cnf(23,plain,
( ~ environment(u)
| ~ subpopulations(efficient_producers,first_movers,u,skc2)
| greater(zero,growth_rate(efficient_producers,skc2)) ),
inference(res,[status(thm),theory(equality)],[2,12]),
[iquote('0:Res:2.0,12.1')] ).
cnf(24,plain,
( ~ environment(skc3)
| subpopulations(efficient_producers,first_movers,skc3,skc2) ),
inference(res,[status(thm),theory(equality)],[3,9]),
[iquote('0:Res:3.0,9.1')] ).
cnf(25,plain,
( ~ environment(skc3)
| in_environment(skc3,skc2) ),
inference(res,[status(thm),theory(equality)],[3,7]),
[iquote('0:Res:3.0,7.1')] ).
cnf(29,plain,
in_environment(skc3,skc2),
inference(mrr,[status(thm)],[25,1]),
[iquote('0:MRR:25.0,1.0')] ).
cnf(30,plain,
subpopulations(efficient_producers,first_movers,skc3,skc2),
inference(mrr,[status(thm)],[24,1]),
[iquote('0:MRR:24.0,1.0')] ).
cnf(34,plain,
( ~ subpopulations(efficient_producers,first_movers,skc3,skc2)
| greater(zero,growth_rate(efficient_producers,skc2)) ),
inference(res,[status(thm),theory(equality)],[1,23]),
[iquote('0:Res:1.0,23.0')] ).
cnf(35,plain,
( ~ subpopulations(efficient_producers,first_movers,skc3,skc2)
| greater_or_equal(growth_rate(first_movers,skc2),zero) ),
inference(res,[status(thm),theory(equality)],[1,22]),
[iquote('0:Res:1.0,22.0')] ).
cnf(36,plain,
greater(zero,growth_rate(efficient_producers,skc2)),
inference(mrr,[status(thm)],[34,30]),
[iquote('0:MRR:34.0,30.0')] ).
cnf(37,plain,
greater_or_equal(growth_rate(first_movers,skc2),zero),
inference(mrr,[status(thm)],[35,30]),
[iquote('0:MRR:35.0,30.0')] ).
cnf(65,plain,
( ~ in_environment(u,skc2)
| ~ greater(resilience(efficient_producers),resilience(v))
| greater(zero,growth_rate(v,skc2)) ),
inference(res,[status(thm),theory(equality)],[36,15]),
[iquote('0:Res:36.0,15.1')] ).
cnf(66,plain,
( ~ in_environment(u,skc2)
| greater(zero,growth_rate(first_movers,skc2)) ),
inference(res,[status(thm),theory(equality)],[4,65]),
[iquote('0:Res:4.0,65.1')] ).
cnf(67,plain,
greater(zero,growth_rate(first_movers,skc2)),
inference(res,[status(thm),theory(equality)],[29,66]),
[iquote('0:Res:29.0,66.0')] ).
cnf(69,plain,
~ greater_or_equal(growth_rate(first_movers,skc2),zero),
inference(res,[status(thm),theory(equality)],[67,8]),
[iquote('0:Res:67.0,8.0')] ).
cnf(72,plain,
$false,
inference(mrr,[status(thm)],[69,37]),
[iquote('0:MRR:69.0,37.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : MGT036+1 : TPTP v8.1.0. Released v2.0.0.
% 0.10/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 9 09:54:35 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.44
% 0.20/0.44 SPASS V 3.9
% 0.20/0.44 SPASS beiseite: Proof found.
% 0.20/0.44 % SZS status Theorem
% 0.20/0.44 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.44 SPASS derived 46 clauses, backtracked 0 clauses, performed 0 splits and kept 49 clauses.
% 0.20/0.44 SPASS allocated 97650 KBytes.
% 0.20/0.44 SPASS spent 0:00:00.09 on the problem.
% 0.20/0.44 0:00:00.04 for the input.
% 0.20/0.44 0:00:00.03 for the FLOTTER CNF translation.
% 0.20/0.44 0:00:00.00 for inferences.
% 0.20/0.44 0:00:00.00 for the backtracking.
% 0.20/0.44 0:00:00.00 for the reduction.
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 Here is a proof with depth 6, length 27 :
% 0.20/0.44 % SZS output start Refutation
% See solution above
% 0.20/0.44 Formulae used in the proof : prove_t5 a2 mp_growth_rate_relationships mp_time_point_occur mp_symmetry_of_FM_and_EP d2 a12
% 0.20/0.44
%------------------------------------------------------------------------------