TSTP Solution File: MGT036+3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : MGT036+3 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n005.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 May 1 03:21:58 EDT 2024
% Result : Theorem 0.55s 0.71s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 7 unt; 0 def)
% Number of atoms : 62 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 63 ( 23 ~; 18 |; 17 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% 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 : 46 ( 36 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f47,plain,
$false,
inference(unit_resulting_resolution,[],[f16,f22,f26,f18,f19,f13]) ).
fof(f13,plain,
! [X2,X3,X0,X1] :
( ~ greater(zero,growth_rate(X1,X3))
| ~ subpopulations(X1,X2,X0,X3)
| outcompetes(X2,X1,X3)
| ~ greater_or_equal(growth_rate(X2,X3),zero)
| ~ environment(X0) ),
inference(cnf_transformation,[],[f9]) ).
fof(f9,plain,
! [X0,X1,X2,X3] :
( ( ( greater(zero,growth_rate(X1,X3))
& greater_or_equal(growth_rate(X2,X3),zero) )
<=> outcompetes(X2,X1,X3) )
| ~ subpopulations(X1,X2,X0,X3)
| ~ environment(X0) ),
inference(flattening,[],[f8]) ).
fof(f8,plain,
! [X0,X1,X2,X3] :
( ( ( greater(zero,growth_rate(X1,X3))
& greater_or_equal(growth_rate(X2,X3),zero) )
<=> outcompetes(X2,X1,X3) )
| ~ subpopulations(X1,X2,X0,X3)
| ~ environment(X0) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1,X2,X3] :
( ( subpopulations(X1,X2,X0,X3)
& environment(X0) )
=> ( ( greater(zero,growth_rate(X1,X3))
& greater_or_equal(growth_rate(X2,X3),zero) )
<=> outcompetes(X2,X1,X3) ) ),
file('/export/starexec/sandbox/tmp/tmp.LfQxTKFNC7/Vampire---4.8_12658',d2) ).
fof(f19,plain,
greater(zero,growth_rate(efficient_producers,sK1)),
inference(cnf_transformation,[],[f6]) ).
fof(f6,plain,
? [X0,X1] :
( greater(zero,growth_rate(efficient_producers,X1))
& greater_or_equal(growth_rate(first_movers,X1),zero)
& subpopulations(first_movers,efficient_producers,X0,X1)
& environment(X0) ),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
? [X0,X3] :
( greater(zero,growth_rate(efficient_producers,X3))
& greater_or_equal(growth_rate(first_movers,X3),zero)
& subpopulations(first_movers,efficient_producers,X0,X3)
& environment(X0) ),
file('/export/starexec/sandbox/tmp/tmp.LfQxTKFNC7/Vampire---4.8_12658',a13_star) ).
fof(f18,plain,
greater_or_equal(growth_rate(first_movers,sK1),zero),
inference(cnf_transformation,[],[f6]) ).
fof(f26,plain,
~ outcompetes(first_movers,efficient_producers,sK1),
inference(unit_resulting_resolution,[],[f16,f17,f20]) ).
fof(f20,plain,
! [X0,X1] :
( ~ subpopulations(first_movers,efficient_producers,X0,X1)
| ~ environment(X0)
| ~ outcompetes(first_movers,efficient_producers,X1) ),
inference(cnf_transformation,[],[f10]) ).
fof(f10,plain,
! [X0,X1] :
( ~ outcompetes(first_movers,efficient_producers,X1)
| ~ subpopulations(first_movers,efficient_producers,X0,X1)
| ~ environment(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,plain,
~ ? [X0,X1] :
( outcompetes(first_movers,efficient_producers,X1)
& subpopulations(first_movers,efficient_producers,X0,X1)
& environment(X0) ),
inference(rectify,[],[f5]) ).
fof(f5,negated_conjecture,
~ ? [X0,X3] :
( outcompetes(first_movers,efficient_producers,X3)
& subpopulations(first_movers,efficient_producers,X0,X3)
& environment(X0) ),
inference(negated_conjecture,[],[f4]) ).
fof(f4,conjecture,
? [X0,X3] :
( outcompetes(first_movers,efficient_producers,X3)
& subpopulations(first_movers,efficient_producers,X0,X3)
& environment(X0) ),
file('/export/starexec/sandbox/tmp/tmp.LfQxTKFNC7/Vampire---4.8_12658',prove_t5_star) ).
fof(f17,plain,
subpopulations(first_movers,efficient_producers,sK0,sK1),
inference(cnf_transformation,[],[f6]) ).
fof(f22,plain,
subpopulations(efficient_producers,first_movers,sK0,sK1),
inference(unit_resulting_resolution,[],[f16,f17,f21]) ).
fof(f21,plain,
! [X2,X3,X0,X1] :
( ~ subpopulations(X1,X2,X0,X3)
| ~ environment(X0)
| subpopulations(X2,X1,X0,X3) ),
inference(cnf_transformation,[],[f12]) ).
fof(f12,plain,
! [X0,X1,X2,X3] :
( subpopulations(X2,X1,X0,X3)
| ~ subpopulations(X1,X2,X0,X3)
| ~ environment(X0) ),
inference(flattening,[],[f11]) ).
fof(f11,plain,
! [X0,X1,X2,X3] :
( subpopulations(X2,X1,X0,X3)
| ~ subpopulations(X1,X2,X0,X3)
| ~ environment(X0) ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1,X2,X3] :
( ( subpopulations(X1,X2,X0,X3)
& environment(X0) )
=> subpopulations(X2,X1,X0,X3) ),
file('/export/starexec/sandbox/tmp/tmp.LfQxTKFNC7/Vampire---4.8_12658',mp_symmetry_of_subpopulations) ).
fof(f16,plain,
environment(sK0),
inference(cnf_transformation,[],[f6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT036+3 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.35 % Computer : n005.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Apr 30 18:06:26 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a FOF_THM_RFO_NEQ problem
% 0.15/0.35 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.LfQxTKFNC7/Vampire---4.8_12658
% 0.55/0.71 % (12917)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2996ds/83Mi)
% 0.55/0.71 % (12911)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2996ds/34Mi)
% 0.55/0.71 % (12913)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.55/0.71 % (12912)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2996ds/51Mi)
% 0.55/0.71 % (12915)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2996ds/34Mi)
% 0.55/0.71 % (12914)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.55/0.71 % (12916)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.55/0.71 % (12917)First to succeed.
% 0.55/0.71 % (12913)Also succeeded, but the first one will report.
% 0.55/0.71 % (12917)Refutation found. Thanks to Tanya!
% 0.55/0.71 % SZS status Theorem for Vampire---4
% 0.55/0.71 % SZS output start Proof for Vampire---4
% See solution above
% 0.55/0.71 % (12917)------------------------------
% 0.55/0.71 % (12917)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.55/0.71 % (12917)Termination reason: Refutation
% 0.55/0.71
% 0.55/0.71 % (12917)Memory used [KB]: 977
% 0.55/0.71 % (12917)Time elapsed: 0.002 s
% 0.55/0.71 % (12917)Instructions burned: 3 (million)
% 0.55/0.71 % (12917)------------------------------
% 0.55/0.71 % (12917)------------------------------
% 0.55/0.71 % (12907)Success in time 0.349 s
% 0.55/0.71 % Vampire---4.8 exiting
%------------------------------------------------------------------------------