TSTP Solution File: MGT041+2 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : MGT041+2 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n019.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:58:03 EDT 2024
% Result : Theorem 0.14s 0.36s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 40 ( 7 unt; 0 def)
% Number of atoms : 109 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 126 ( 57 ~; 43 |; 21 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 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 : 36 ( 28 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f44,plain,
$false,
inference(avatar_sat_refutation,[],[f32,f38,f43]) ).
fof(f43,plain,
~ spl2_1,
inference(avatar_contradiction_clause,[],[f42]) ).
fof(f42,plain,
( $false
| ~ spl2_1 ),
inference(subsumption_resolution,[],[f41,f18]) ).
fof(f18,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/sandbox/benchmark/theBenchmark.p',a16) ).
fof(f41,plain,
( ~ organisation_at_time(sK0,sK1)
| ~ spl2_1 ),
inference(subsumption_resolution,[],[f40,f19]) ).
fof(f19,plain,
founding_time(sK0,sK1),
inference(cnf_transformation,[],[f14]) ).
fof(f40,plain,
( ~ founding_time(sK0,sK1)
| ~ organisation_at_time(sK0,sK1)
| ~ spl2_1 ),
inference(resolution,[],[f39,f21]) ).
fof(f21,plain,
~ has_elaborated_routines(sK0,sK1),
inference(cnf_transformation,[],[f14]) ).
fof(f39,plain,
( ! [X0] :
( has_elaborated_routines(sK0,X0)
| ~ founding_time(sK0,X0)
| ~ organisation_at_time(sK0,X0) )
| ~ spl2_1 ),
inference(resolution,[],[f27,f16]) ).
fof(f16,plain,
! [X0,X1] :
( ~ efficient_producer(X0)
| ~ founding_time(X0,X1)
| has_elaborated_routines(X0,X1)
| ~ organisation_at_time(X0,X1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f9,plain,
! [X0,X1] :
( has_elaborated_routines(X0,X1)
| ~ founding_time(X0,X1)
| ~ efficient_producer(X0)
| ~ organisation_at_time(X0,X1) ),
inference(flattening,[],[f8]) ).
fof(f8,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/sandbox/benchmark/theBenchmark.p',a14) ).
fof(f27,plain,
( efficient_producer(sK0)
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f25]) ).
fof(f25,plain,
( spl2_1
<=> efficient_producer(sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
fof(f38,plain,
~ spl2_2,
inference(avatar_contradiction_clause,[],[f37]) ).
fof(f37,plain,
( $false
| ~ spl2_2 ),
inference(subsumption_resolution,[],[f36,f20]) ).
fof(f20,plain,
number_of_routines(sK0,sK1,high),
inference(cnf_transformation,[],[f14]) ).
fof(f36,plain,
( ~ number_of_routines(sK0,sK1,high)
| ~ spl2_2 ),
inference(resolution,[],[f35,f22]) ).
fof(f22,plain,
! [X0,X1] :
( ~ number_of_routines(X0,X1,low)
| ~ number_of_routines(X0,X1,high) ),
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/sandbox/benchmark/theBenchmark.p',mp_not_high_and_low) ).
fof(f35,plain,
( number_of_routines(sK0,sK1,low)
| ~ spl2_2 ),
inference(subsumption_resolution,[],[f34,f18]) ).
fof(f34,plain,
( number_of_routines(sK0,sK1,low)
| ~ organisation_at_time(sK0,sK1)
| ~ spl2_2 ),
inference(resolution,[],[f33,f19]) ).
fof(f33,plain,
( ! [X0] :
( ~ founding_time(sK0,X0)
| number_of_routines(sK0,X0,low)
| ~ organisation_at_time(sK0,X0) )
| ~ spl2_2 ),
inference(resolution,[],[f17,f31]) ).
fof(f31,plain,
( first_mover(sK0)
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f29]) ).
fof(f29,plain,
( spl2_2
<=> first_mover(sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
fof(f17,plain,
! [X0,X1] :
( ~ first_mover(X0)
| ~ founding_time(X0,X1)
| number_of_routines(X0,X1,low)
| ~ organisation_at_time(X0,X1) ),
inference(cnf_transformation,[],[f11]) ).
fof(f11,plain,
! [X0,X1] :
( number_of_routines(X0,X1,low)
| ~ founding_time(X0,X1)
| ~ first_mover(X0)
| ~ organisation_at_time(X0,X1) ),
inference(flattening,[],[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(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/sandbox/benchmark/theBenchmark.p',a15) ).
fof(f32,plain,
( spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f23,f29,f25]) ).
fof(f23,plain,
( first_mover(sK0)
| efficient_producer(sK0) ),
inference(resolution,[],[f15,f18]) ).
fof(f15,plain,
! [X0,X1] :
( ~ organisation_at_time(X0,X1)
| first_mover(X0)
| efficient_producer(X0) ),
inference(cnf_transformation,[],[f7]) ).
fof(f7,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/sandbox/benchmark/theBenchmark.p',prove_t10) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT041+2 : TPTP v8.1.2. Released v2.0.0.
% 0.13/0.13 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.34 % Computer : n019.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 20:03:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 % (6170)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.36 % (6176)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.14/0.36 % (6176)First to succeed.
% 0.14/0.36 % (6176)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-6170"
% 0.14/0.36 % (6176)Refutation found. Thanks to Tanya!
% 0.14/0.36 % SZS status Theorem for theBenchmark
% 0.14/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.36 % (6176)------------------------------
% 0.14/0.36 % (6176)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.14/0.36 % (6176)Termination reason: Refutation
% 0.14/0.36
% 0.14/0.36 % (6176)Memory used [KB]: 746
% 0.14/0.36 % (6176)Time elapsed: 0.002 s
% 0.14/0.36 % (6176)Instructions burned: 3 (million)
% 0.14/0.36 % (6170)Success in time 0.012 s
%------------------------------------------------------------------------------