TSTP Solution File: MGT041+2 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : MGT041+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_uns --cores 0 -t %d %s
% Computer : n018.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:07 EDT 2022
% Result : Theorem 0.19s 0.48s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 37 ( 8 unt; 0 def)
% Number of atoms : 110 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 135 ( 62 ~; 41 |; 28 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 52 ( 40 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f37,plain,
$false,
inference(resolution,[],[f36,f25]) ).
fof(f25,plain,
organisation_at_time(sK1,sK0),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
( number_of_routines(sK1,sK0,high)
& organisation_at_time(sK1,sK0)
& founding_time(sK1,sK0)
& ~ has_elaborated_routines(sK1,sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f17,f18]) ).
fof(f18,plain,
( ? [X0,X1] :
( number_of_routines(X1,X0,high)
& organisation_at_time(X1,X0)
& founding_time(X1,X0)
& ~ has_elaborated_routines(X1,X0) )
=> ( number_of_routines(sK1,sK0,high)
& organisation_at_time(sK1,sK0)
& founding_time(sK1,sK0)
& ~ has_elaborated_routines(sK1,sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
? [X0,X1] :
( number_of_routines(X1,X0,high)
& organisation_at_time(X1,X0)
& founding_time(X1,X0)
& ~ has_elaborated_routines(X1,X0) ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
? [X1,X0] :
( number_of_routines(X0,X1,high)
& organisation_at_time(X0,X1)
& founding_time(X0,X1)
& ~ has_elaborated_routines(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a16) ).
fof(f36,plain,
! [X0] : ~ organisation_at_time(sK1,X0),
inference(subsumption_resolution,[],[f35,f25]) ).
fof(f35,plain,
! [X0] :
( ~ organisation_at_time(sK1,X0)
| ~ organisation_at_time(sK1,sK0) ),
inference(subsumption_resolution,[],[f34,f28]) ).
fof(f28,plain,
~ number_of_routines(sK1,sK0,low),
inference(resolution,[],[f26,f20]) ).
fof(f20,plain,
! [X0,X1] :
( ~ number_of_routines(X1,X0,high)
| ~ number_of_routines(X1,X0,low) ),
inference(cnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0,X1] :
( ~ number_of_routines(X1,X0,low)
| ~ number_of_routines(X1,X0,high) ),
inference(rectify,[],[f12]) ).
fof(f12,plain,
! [X1,X0] :
( ~ number_of_routines(X0,X1,low)
| ~ number_of_routines(X0,X1,high) ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X1,X0] :
~ ( number_of_routines(X0,X1,low)
& number_of_routines(X0,X1,high) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_not_high_and_low) ).
fof(f26,plain,
number_of_routines(sK1,sK0,high),
inference(cnf_transformation,[],[f19]) ).
fof(f34,plain,
! [X0] :
( number_of_routines(sK1,sK0,low)
| ~ organisation_at_time(sK1,sK0)
| ~ organisation_at_time(sK1,X0) ),
inference(resolution,[],[f33,f24]) ).
fof(f24,plain,
founding_time(sK1,sK0),
inference(cnf_transformation,[],[f19]) ).
fof(f33,plain,
! [X0,X1] :
( ~ founding_time(sK1,X0)
| ~ organisation_at_time(sK1,X0)
| number_of_routines(sK1,X0,low)
| ~ organisation_at_time(sK1,X1) ),
inference(resolution,[],[f32,f31]) ).
fof(f31,plain,
~ efficient_producer(sK1),
inference(subsumption_resolution,[],[f30,f25]) ).
fof(f30,plain,
( ~ organisation_at_time(sK1,sK0)
| ~ efficient_producer(sK1) ),
inference(subsumption_resolution,[],[f29,f24]) ).
fof(f29,plain,
( ~ founding_time(sK1,sK0)
| ~ organisation_at_time(sK1,sK0)
| ~ efficient_producer(sK1) ),
inference(resolution,[],[f27,f23]) ).
fof(f23,plain,
~ has_elaborated_routines(sK1,sK0),
inference(cnf_transformation,[],[f19]) ).
fof(f27,plain,
! [X0,X1] :
( has_elaborated_routines(X0,X1)
| ~ founding_time(X0,X1)
| ~ organisation_at_time(X0,X1)
| ~ efficient_producer(X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0,X1] :
( has_elaborated_routines(X0,X1)
| ~ organisation_at_time(X0,X1)
| ~ founding_time(X0,X1)
| ~ efficient_producer(X0) ),
inference(flattening,[],[f13]) ).
fof(f13,plain,
! [X0,X1] :
( has_elaborated_routines(X0,X1)
| ~ efficient_producer(X0)
| ~ organisation_at_time(X0,X1)
| ~ founding_time(X0,X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] :
( ( efficient_producer(X0)
& organisation_at_time(X0,X1)
& founding_time(X0,X1) )
=> has_elaborated_routines(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a14) ).
fof(f32,plain,
! [X2,X0,X1] :
( efficient_producer(X0)
| ~ organisation_at_time(X0,X1)
| ~ organisation_at_time(X0,X2)
| ~ founding_time(X0,X1)
| number_of_routines(X0,X1,low) ),
inference(resolution,[],[f22,f21]) ).
fof(f21,plain,
! [X0,X1] :
( first_mover(X1)
| ~ organisation_at_time(X1,X0)
| efficient_producer(X1) ),
inference(cnf_transformation,[],[f11]) ).
fof(f11,plain,
! [X0,X1] :
( ~ organisation_at_time(X1,X0)
| first_mover(X1)
| efficient_producer(X1) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,plain,
~ ? [X1,X0] :
( ~ efficient_producer(X1)
& ~ first_mover(X1)
& organisation_at_time(X1,X0) ),
inference(rectify,[],[f6]) ).
fof(f6,negated_conjecture,
~ ? [X1,X0] :
( organisation_at_time(X0,X1)
& ~ efficient_producer(X0)
& ~ first_mover(X0) ),
inference(negated_conjecture,[],[f5]) ).
fof(f5,conjecture,
? [X1,X0] :
( organisation_at_time(X0,X1)
& ~ efficient_producer(X0)
& ~ first_mover(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t10) ).
fof(f22,plain,
! [X0,X1] :
( ~ first_mover(X0)
| ~ organisation_at_time(X0,X1)
| number_of_routines(X0,X1,low)
| ~ founding_time(X0,X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
! [X0,X1] :
( ~ organisation_at_time(X0,X1)
| ~ first_mover(X0)
| ~ founding_time(X0,X1)
| number_of_routines(X0,X1,low) ),
inference(rectify,[],[f10]) ).
fof(f10,plain,
! [X1,X0] :
( ~ organisation_at_time(X1,X0)
| ~ first_mover(X1)
| ~ founding_time(X1,X0)
| number_of_routines(X1,X0,low) ),
inference(flattening,[],[f9]) ).
fof(f9,plain,
! [X1,X0] :
( number_of_routines(X1,X0,low)
| ~ founding_time(X1,X0)
| ~ first_mover(X1)
| ~ organisation_at_time(X1,X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,plain,
! [X1,X0] :
( ( founding_time(X1,X0)
& first_mover(X1)
& organisation_at_time(X1,X0) )
=> number_of_routines(X1,X0,low) ),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X1,X0] :
( ( first_mover(X0)
& founding_time(X0,X1)
& organisation_at_time(X0,X1) )
=> number_of_routines(X0,X1,low) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a15) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : MGT041+2 : TPTP v8.1.0. Released v2.0.0.
% 0.10/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 30 03:25:25 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 % (21823)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.19/0.47 % (21823)First to succeed.
% 0.19/0.47 % (21825)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.19/0.47 % (21847)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 0.19/0.48 % (21839)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.48 % (21818)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.19/0.48 % (21818)Also succeeded, but the first one will report.
% 0.19/0.48 % (21823)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 % (21823)------------------------------
% 0.19/0.48 % (21823)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.48 % (21823)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.48 % (21823)Termination reason: Refutation
% 0.19/0.48
% 0.19/0.48 % (21823)Memory used [KB]: 1407
% 0.19/0.48 % (21823)Time elapsed: 0.084 s
% 0.19/0.48 % (21823)Instructions burned: 2 (million)
% 0.19/0.48 % (21823)------------------------------
% 0.19/0.48 % (21823)------------------------------
% 0.19/0.48 % (21817)Success in time 0.133 s
%------------------------------------------------------------------------------