TSTP Solution File: MGT032+2 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : MGT032+2 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n022.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 : Wed Aug 31 17:51:28 EDT 2022
% Result : Theorem 0.19s 0.48s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 55 ( 6 unt; 0 def)
% Number of atoms : 194 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 225 ( 86 ~; 72 |; 48 &)
% ( 4 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 5 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 76 ( 60 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f61,plain,
$false,
inference(avatar_sat_refutation,[],[f42,f45,f54,f57,f60]) ).
fof(f60,plain,
~ spl3_3,
inference(avatar_contradiction_clause,[],[f59]) ).
fof(f59,plain,
( $false
| ~ spl3_3 ),
inference(subsumption_resolution,[],[f58,f29]) ).
fof(f29,plain,
in_environment(sK1,sK0(sK1)),
inference(subsumption_resolution,[],[f28,f26]) ).
fof(f26,plain,
environment(sK1),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
( stable(sK1)
& environment(sK1)
& ! [X1] :
( ~ in_environment(sK1,X1)
| ( ~ selection_favors(efficient_producers,first_movers,sK2(X1))
& subpopulations(first_movers,efficient_producers,sK1,sK2(X1))
& greater_or_equal(sK2(X1),X1) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f13,f18,f17]) ).
fof(f17,plain,
( ? [X0] :
( stable(X0)
& environment(X0)
& ! [X1] :
( ~ in_environment(X0,X1)
| ? [X2] :
( ~ selection_favors(efficient_producers,first_movers,X2)
& subpopulations(first_movers,efficient_producers,X0,X2)
& greater_or_equal(X2,X1) ) ) )
=> ( stable(sK1)
& environment(sK1)
& ! [X1] :
( ~ in_environment(sK1,X1)
| ? [X2] :
( ~ selection_favors(efficient_producers,first_movers,X2)
& subpopulations(first_movers,efficient_producers,sK1,X2)
& greater_or_equal(X2,X1) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
! [X1] :
( ? [X2] :
( ~ selection_favors(efficient_producers,first_movers,X2)
& subpopulations(first_movers,efficient_producers,sK1,X2)
& greater_or_equal(X2,X1) )
=> ( ~ selection_favors(efficient_producers,first_movers,sK2(X1))
& subpopulations(first_movers,efficient_producers,sK1,sK2(X1))
& greater_or_equal(sK2(X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
? [X0] :
( stable(X0)
& environment(X0)
& ! [X1] :
( ~ in_environment(X0,X1)
| ? [X2] :
( ~ selection_favors(efficient_producers,first_movers,X2)
& subpopulations(first_movers,efficient_producers,X0,X2)
& greater_or_equal(X2,X1) ) ) ),
inference(flattening,[],[f12]) ).
fof(f12,plain,
? [X0] :
( ! [X1] :
( ~ in_environment(X0,X1)
| ? [X2] :
( ~ selection_favors(efficient_producers,first_movers,X2)
& subpopulations(first_movers,efficient_producers,X0,X2)
& greater_or_equal(X2,X1) ) )
& environment(X0)
& stable(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,plain,
~ ! [X0] :
( ( environment(X0)
& stable(X0) )
=> ? [X1] :
( in_environment(X0,X1)
& ! [X2] :
( ( subpopulations(first_movers,efficient_producers,X0,X2)
& greater_or_equal(X2,X1) )
=> selection_favors(efficient_producers,first_movers,X2) ) ) ),
inference(rectify,[],[f4]) ).
fof(f4,negated_conjecture,
~ ! [X0] :
( ( environment(X0)
& stable(X0) )
=> ? [X4] :
( ! [X3] :
( ( subpopulations(first_movers,efficient_producers,X0,X3)
& greater_or_equal(X3,X4) )
=> selection_favors(efficient_producers,first_movers,X3) )
& in_environment(X0,X4) ) ),
inference(negated_conjecture,[],[f3]) ).
fof(f3,conjecture,
! [X0] :
( ( environment(X0)
& stable(X0) )
=> ? [X4] :
( ! [X3] :
( ( subpopulations(first_movers,efficient_producers,X0,X3)
& greater_or_equal(X3,X4) )
=> selection_favors(efficient_producers,first_movers,X3) )
& in_environment(X0,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t1) ).
fof(f28,plain,
( ~ environment(sK1)
| in_environment(sK1,sK0(sK1)) ),
inference(resolution,[],[f22,f27]) ).
fof(f27,plain,
stable(sK1),
inference(cnf_transformation,[],[f19]) ).
fof(f22,plain,
! [X0] :
( ~ stable(X0)
| in_environment(X0,sK0(X0))
| ~ environment(X0) ),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
! [X0] :
( ( in_environment(X0,sK0(X0))
& ! [X2] :
( greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
| ~ subpopulations(first_movers,efficient_producers,X0,X2)
| ~ greater_or_equal(X2,sK0(X0)) ) )
| ~ stable(X0)
| ~ environment(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f9,f15]) ).
fof(f15,plain,
! [X0] :
( ? [X1] :
( in_environment(X0,X1)
& ! [X2] :
( greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
| ~ subpopulations(first_movers,efficient_producers,X0,X2)
| ~ greater_or_equal(X2,X1) ) )
=> ( in_environment(X0,sK0(X0))
& ! [X2] :
( greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
| ~ subpopulations(first_movers,efficient_producers,X0,X2)
| ~ greater_or_equal(X2,sK0(X0)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
! [X0] :
( ? [X1] :
( in_environment(X0,X1)
& ! [X2] :
( greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
| ~ subpopulations(first_movers,efficient_producers,X0,X2)
| ~ greater_or_equal(X2,X1) ) )
| ~ stable(X0)
| ~ environment(X0) ),
inference(flattening,[],[f8]) ).
fof(f8,plain,
! [X0] :
( ? [X1] :
( ! [X2] :
( greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
| ~ subpopulations(first_movers,efficient_producers,X0,X2)
| ~ greater_or_equal(X2,X1) )
& in_environment(X0,X1) )
| ~ environment(X0)
| ~ stable(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,plain,
! [X0] :
( ( environment(X0)
& stable(X0) )
=> ? [X1] :
( ! [X2] :
( ( subpopulations(first_movers,efficient_producers,X0,X2)
& greater_or_equal(X2,X1) )
=> greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2)) )
& in_environment(X0,X1) ) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X0] :
( ( environment(X0)
& stable(X0) )
=> ? [X4] :
( in_environment(X0,X4)
& ! [X3] :
( ( greater_or_equal(X3,X4)
& subpopulations(first_movers,efficient_producers,X0,X3) )
=> greater(growth_rate(efficient_producers,X3),growth_rate(first_movers,X3)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l1) ).
fof(f58,plain,
( ~ in_environment(sK1,sK0(sK1))
| ~ spl3_3 ),
inference(resolution,[],[f50,f25]) ).
fof(f25,plain,
! [X1] :
( ~ selection_favors(efficient_producers,first_movers,sK2(X1))
| ~ in_environment(sK1,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f50,plain,
( selection_favors(efficient_producers,first_movers,sK2(sK0(sK1)))
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f48]) ).
fof(f48,plain,
( spl3_3
<=> selection_favors(efficient_producers,first_movers,sK2(sK0(sK1))) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
fof(f57,plain,
( ~ spl3_1
| ~ spl3_4 ),
inference(avatar_contradiction_clause,[],[f56]) ).
fof(f56,plain,
( $false
| ~ spl3_1
| ~ spl3_4 ),
inference(subsumption_resolution,[],[f55,f36]) ).
fof(f36,plain,
( subpopulations(first_movers,efficient_producers,sK1,sK2(sK0(sK1)))
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f35]) ).
fof(f35,plain,
( spl3_1
<=> subpopulations(first_movers,efficient_producers,sK1,sK2(sK0(sK1))) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
fof(f55,plain,
( ~ subpopulations(first_movers,efficient_producers,sK1,sK2(sK0(sK1)))
| ~ spl3_4 ),
inference(resolution,[],[f53,f26]) ).
fof(f53,plain,
( ! [X0] :
( ~ environment(X0)
| ~ subpopulations(first_movers,efficient_producers,X0,sK2(sK0(sK1))) )
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f52]) ).
fof(f52,plain,
( spl3_4
<=> ! [X0] :
( ~ subpopulations(first_movers,efficient_producers,X0,sK2(sK0(sK1)))
| ~ environment(X0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
fof(f54,plain,
( spl3_3
| spl3_4
| ~ spl3_2 ),
inference(avatar_split_clause,[],[f46,f39,f52,f48]) ).
fof(f39,plain,
( spl3_2
<=> greater(growth_rate(efficient_producers,sK2(sK0(sK1))),growth_rate(first_movers,sK2(sK0(sK1)))) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
fof(f46,plain,
( ! [X0] :
( ~ subpopulations(first_movers,efficient_producers,X0,sK2(sK0(sK1)))
| selection_favors(efficient_producers,first_movers,sK2(sK0(sK1)))
| ~ environment(X0) )
| ~ spl3_2 ),
inference(resolution,[],[f41,f20]) ).
fof(f20,plain,
! [X2,X3,X0,X1] :
( ~ greater(growth_rate(X0,X1),growth_rate(X2,X1))
| ~ environment(X3)
| ~ subpopulations(X2,X0,X3,X1)
| selection_favors(X0,X2,X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0,X1,X2,X3] :
( ~ greater(growth_rate(X0,X1),growth_rate(X2,X1))
| ~ subpopulations(X2,X0,X3,X1)
| selection_favors(X0,X2,X1)
| ~ environment(X3) ),
inference(rectify,[],[f11]) ).
fof(f11,plain,
! [X1,X2,X0,X3] :
( ~ greater(growth_rate(X1,X2),growth_rate(X0,X2))
| ~ subpopulations(X0,X1,X3,X2)
| selection_favors(X1,X0,X2)
| ~ environment(X3) ),
inference(flattening,[],[f10]) ).
fof(f10,plain,
! [X3,X0,X2,X1] :
( selection_favors(X1,X0,X2)
| ~ environment(X3)
| ~ subpopulations(X0,X1,X3,X2)
| ~ greater(growth_rate(X1,X2),growth_rate(X0,X2)) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,plain,
! [X3,X0,X2,X1] :
( ( environment(X3)
& subpopulations(X0,X1,X3,X2)
& greater(growth_rate(X1,X2),growth_rate(X0,X2)) )
=> selection_favors(X1,X0,X2) ),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
! [X1,X2,X3,X0] :
( ( environment(X0)
& greater(growth_rate(X2,X3),growth_rate(X1,X3))
& subpopulations(X1,X2,X0,X3) )
=> selection_favors(X2,X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp1_high_growth_rates) ).
fof(f41,plain,
( greater(growth_rate(efficient_producers,sK2(sK0(sK1))),growth_rate(first_movers,sK2(sK0(sK1))))
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f39]) ).
fof(f45,plain,
spl3_1,
inference(avatar_contradiction_clause,[],[f44]) ).
fof(f44,plain,
( $false
| spl3_1 ),
inference(subsumption_resolution,[],[f43,f29]) ).
fof(f43,plain,
( ~ in_environment(sK1,sK0(sK1))
| spl3_1 ),
inference(resolution,[],[f37,f24]) ).
fof(f24,plain,
! [X1] :
( subpopulations(first_movers,efficient_producers,sK1,sK2(X1))
| ~ in_environment(sK1,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f37,plain,
( ~ subpopulations(first_movers,efficient_producers,sK1,sK2(sK0(sK1)))
| spl3_1 ),
inference(avatar_component_clause,[],[f35]) ).
fof(f42,plain,
( ~ spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f33,f39,f35]) ).
fof(f33,plain,
( greater(growth_rate(efficient_producers,sK2(sK0(sK1))),growth_rate(first_movers,sK2(sK0(sK1))))
| ~ subpopulations(first_movers,efficient_producers,sK1,sK2(sK0(sK1))) ),
inference(subsumption_resolution,[],[f32,f29]) ).
fof(f32,plain,
( ~ in_environment(sK1,sK0(sK1))
| greater(growth_rate(efficient_producers,sK2(sK0(sK1))),growth_rate(first_movers,sK2(sK0(sK1))))
| ~ subpopulations(first_movers,efficient_producers,sK1,sK2(sK0(sK1))) ),
inference(resolution,[],[f31,f23]) ).
fof(f23,plain,
! [X1] :
( greater_or_equal(sK2(X1),X1)
| ~ in_environment(sK1,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f31,plain,
! [X0] :
( ~ greater_or_equal(X0,sK0(sK1))
| greater(growth_rate(efficient_producers,X0),growth_rate(first_movers,X0))
| ~ subpopulations(first_movers,efficient_producers,sK1,X0) ),
inference(subsumption_resolution,[],[f30,f26]) ).
fof(f30,plain,
! [X0] :
( ~ subpopulations(first_movers,efficient_producers,sK1,X0)
| ~ environment(sK1)
| ~ greater_or_equal(X0,sK0(sK1))
| greater(growth_rate(efficient_producers,X0),growth_rate(first_movers,X0)) ),
inference(resolution,[],[f21,f27]) ).
fof(f21,plain,
! [X2,X0] :
( ~ stable(X0)
| ~ greater_or_equal(X2,sK0(X0))
| ~ environment(X0)
| greater(growth_rate(efficient_producers,X2),growth_rate(first_movers,X2))
| ~ subpopulations(first_movers,efficient_producers,X0,X2) ),
inference(cnf_transformation,[],[f16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : MGT032+2 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.33 % Computer : n022.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Aug 30 03:16:41 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.47 % (18967)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.19/0.48 % (18959)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.19/0.48 % (18967)First to succeed.
% 0.19/0.48 % (18955)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.19/0.48 % (18959)Also succeeded, but the first one will report.
% 0.19/0.48 % (18967)Refutation found. Thanks to Tanya!
% 0.19/0.48 % SZS status Theorem for theBenchmark
% 0.19/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.48 % (18967)------------------------------
% 0.19/0.48 % (18967)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.48 % (18967)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.48 % (18967)Termination reason: Refutation
% 0.19/0.48
% 0.19/0.48 % (18967)Memory used [KB]: 5373
% 0.19/0.48 % (18967)Time elapsed: 0.053 s
% 0.19/0.48 % (18967)Instructions burned: 2 (million)
% 0.19/0.48 % (18967)------------------------------
% 0.19/0.48 % (18967)------------------------------
% 0.19/0.48 % (18938)Success in time 0.141 s
%------------------------------------------------------------------------------