TSTP Solution File: MGT041+2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : MGT041+2 : 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n028.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 : Sun May 5 07:56:48 EDT 2024
% Result : Theorem 0.58s 0.74s
% Output : Refutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 40 ( 9 unt; 0 def)
% Number of atoms : 112 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 136 ( 64 ~; 46 |; 21 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 3 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 43 ( 35 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f42,plain,
$false,
inference(avatar_sat_refutation,[],[f35,f39,f41]) ).
fof(f41,plain,
~ spl2_1,
inference(avatar_contradiction_clause,[],[f40]) ).
fof(f40,plain,
( $false
| ~ spl2_1 ),
inference(resolution,[],[f31,f17]) ).
fof(f17,plain,
organisation_at_time(sK0,sK1),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
( ~ has_elaborated_routines(sK0,sK1)
& number_of_routines(sK0,sK1,high)
& founding_time(sK0,sK1)
& organisation_at_time(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f4,f13]) ).
fof(f13,plain,
( ? [X0,X1] :
( ~ has_elaborated_routines(X0,X1)
& number_of_routines(X0,X1,high)
& founding_time(X0,X1)
& organisation_at_time(X0,X1) )
=> ( ~ has_elaborated_routines(sK0,sK1)
& number_of_routines(sK0,sK1,high)
& founding_time(sK0,sK1)
& organisation_at_time(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f4,axiom,
? [X0,X1] :
( ~ has_elaborated_routines(X0,X1)
& number_of_routines(X0,X1,high)
& founding_time(X0,X1)
& organisation_at_time(X0,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.KH8D0OWJHQ/Vampire---4.8_25500',a16) ).
fof(f31,plain,
( ! [X1] : ~ organisation_at_time(sK0,X1)
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f30]) ).
fof(f30,plain,
( spl2_1
<=> ! [X1] : ~ organisation_at_time(sK0,X1) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
fof(f39,plain,
~ spl2_2,
inference(avatar_contradiction_clause,[],[f38]) ).
fof(f38,plain,
( $false
| ~ spl2_2 ),
inference(subsumption_resolution,[],[f37,f17]) ).
fof(f37,plain,
( ~ organisation_at_time(sK0,sK1)
| ~ spl2_2 ),
inference(subsumption_resolution,[],[f36,f23]) ).
fof(f23,plain,
~ number_of_routines(sK0,sK1,low),
inference(resolution,[],[f19,f22]) ).
fof(f22,plain,
! [X0,X1] :
( ~ number_of_routines(X0,X1,high)
| ~ number_of_routines(X0,X1,low) ),
inference(cnf_transformation,[],[f12]) ).
fof(f12,plain,
! [X0,X1] :
( ~ number_of_routines(X0,X1,high)
| ~ number_of_routines(X0,X1,low) ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
~ ( number_of_routines(X0,X1,high)
& number_of_routines(X0,X1,low) ),
file('/export/starexec/sandbox2/tmp/tmp.KH8D0OWJHQ/Vampire---4.8_25500',mp_not_high_and_low) ).
fof(f19,plain,
number_of_routines(sK0,sK1,high),
inference(cnf_transformation,[],[f14]) ).
fof(f36,plain,
( number_of_routines(sK0,sK1,low)
| ~ organisation_at_time(sK0,sK1)
| ~ spl2_2 ),
inference(resolution,[],[f34,f18]) ).
fof(f18,plain,
founding_time(sK0,sK1),
inference(cnf_transformation,[],[f14]) ).
fof(f34,plain,
( ! [X0] :
( ~ founding_time(sK0,X0)
| number_of_routines(sK0,X0,low)
| ~ organisation_at_time(sK0,X0) )
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f33]) ).
fof(f33,plain,
( spl2_2
<=> ! [X0] :
( number_of_routines(sK0,X0,low)
| ~ founding_time(sK0,X0)
| ~ organisation_at_time(sK0,X0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
fof(f35,plain,
( spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f28,f33,f30]) ).
fof(f28,plain,
! [X0,X1] :
( number_of_routines(sK0,X0,low)
| ~ organisation_at_time(sK0,X0)
| ~ founding_time(sK0,X0)
| ~ organisation_at_time(sK0,X1) ),
inference(resolution,[],[f27,f26]) ).
fof(f26,plain,
~ efficient_producer(sK0),
inference(subsumption_resolution,[],[f25,f17]) ).
fof(f25,plain,
( ~ efficient_producer(sK0)
| ~ organisation_at_time(sK0,sK1) ),
inference(subsumption_resolution,[],[f24,f18]) ).
fof(f24,plain,
( ~ founding_time(sK0,sK1)
| ~ efficient_producer(sK0)
| ~ organisation_at_time(sK0,sK1) ),
inference(resolution,[],[f15,f20]) ).
fof(f20,plain,
~ has_elaborated_routines(sK0,sK1),
inference(cnf_transformation,[],[f14]) ).
fof(f15,plain,
! [X0,X1] :
( has_elaborated_routines(X0,X1)
| ~ founding_time(X0,X1)
| ~ efficient_producer(X0)
| ~ organisation_at_time(X0,X1) ),
inference(cnf_transformation,[],[f8]) ).
fof(f8,plain,
! [X0,X1] :
( has_elaborated_routines(X0,X1)
| ~ founding_time(X0,X1)
| ~ efficient_producer(X0)
| ~ organisation_at_time(X0,X1) ),
inference(flattening,[],[f7]) ).
fof(f7,plain,
! [X0,X1] :
( has_elaborated_routines(X0,X1)
| ~ founding_time(X0,X1)
| ~ efficient_producer(X0)
| ~ organisation_at_time(X0,X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] :
( ( founding_time(X0,X1)
& efficient_producer(X0)
& organisation_at_time(X0,X1) )
=> has_elaborated_routines(X0,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.KH8D0OWJHQ/Vampire---4.8_25500',a14) ).
fof(f27,plain,
! [X2,X0,X1] :
( efficient_producer(X0)
| number_of_routines(X0,X1,low)
| ~ organisation_at_time(X0,X1)
| ~ founding_time(X0,X1)
| ~ organisation_at_time(X0,X2) ),
inference(resolution,[],[f16,f21]) ).
fof(f21,plain,
! [X0,X1] :
( first_mover(X0)
| efficient_producer(X0)
| ~ organisation_at_time(X0,X1) ),
inference(cnf_transformation,[],[f11]) ).
fof(f11,plain,
! [X0,X1] :
( efficient_producer(X0)
| first_mover(X0)
| ~ organisation_at_time(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,negated_conjecture,
~ ? [X0,X1] :
( ~ efficient_producer(X0)
& ~ first_mover(X0)
& organisation_at_time(X0,X1) ),
inference(negated_conjecture,[],[f5]) ).
fof(f5,conjecture,
? [X0,X1] :
( ~ efficient_producer(X0)
& ~ first_mover(X0)
& organisation_at_time(X0,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.KH8D0OWJHQ/Vampire---4.8_25500',prove_t10) ).
fof(f16,plain,
! [X0,X1] :
( ~ first_mover(X0)
| ~ founding_time(X0,X1)
| number_of_routines(X0,X1,low)
| ~ organisation_at_time(X0,X1) ),
inference(cnf_transformation,[],[f10]) ).
fof(f10,plain,
! [X0,X1] :
( number_of_routines(X0,X1,low)
| ~ founding_time(X0,X1)
| ~ first_mover(X0)
| ~ organisation_at_time(X0,X1) ),
inference(flattening,[],[f9]) ).
fof(f9,plain,
! [X0,X1] :
( number_of_routines(X0,X1,low)
| ~ founding_time(X0,X1)
| ~ first_mover(X0)
| ~ organisation_at_time(X0,X1) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] :
( ( founding_time(X0,X1)
& first_mover(X0)
& organisation_at_time(X0,X1) )
=> number_of_routines(X0,X1,low) ),
file('/export/starexec/sandbox2/tmp/tmp.KH8D0OWJHQ/Vampire---4.8_25500',a15) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : MGT041+2 : TPTP v8.1.2. Released v2.0.0.
% 0.15/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.35 % Computer : n028.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.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 20:03:08 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_EPR_NEQ problem
% 0.15/0.36 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.KH8D0OWJHQ/Vampire---4.8_25500
% 0.58/0.74 % (25857)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.58/0.74 % (25850)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.58/0.74 % (25857)First to succeed.
% 0.58/0.74 % (25852)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.58/0.74 % (25853)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.58/0.74 % (25851)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.58/0.74 % (25854)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.58/0.74 % (25855)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.58/0.74 % (25856)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.58/0.74 % (25857)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-25694"
% 0.58/0.74 % (25857)Refutation found. Thanks to Tanya!
% 0.58/0.74 % SZS status Theorem for Vampire---4
% 0.58/0.74 % SZS output start Proof for Vampire---4
% See solution above
% 0.58/0.74 % (25857)------------------------------
% 0.58/0.74 % (25857)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.74 % (25857)Termination reason: Refutation
% 0.58/0.74
% 0.58/0.74 % (25857)Memory used [KB]: 972
% 0.58/0.74 % (25857)Time elapsed: 0.002 s
% 0.58/0.74 % (25857)Instructions burned: 3 (million)
% 0.58/0.74 % (25694)Success in time 0.378 s
% 0.58/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------