%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : MGT075+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 12:02:20 PM UTC 2026
% Result : Theorem 2.58s 1.32s
% Output : Refutation 2.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 42 ( 12 unt; 2 def)
% Number of atoms : 89 ( 13 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 83 ( 36 ~; 29 |; 12 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 36 ( 0 sgn 33 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : ~ less(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',irreflexive) ).
fof(f4,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> ( less(X0,X1)
| X0 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leq_def) ).
fof(f5,axiom,
! [X0,X1] :
( ( leq(X0,X1)
& leq(X1,X0) )
=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leq_antisym) ).
fof(f13,axiom,
! [X0,X1,X2] :
( in_open(X0,X1,X2)
<=> ( less(X1,X0)
& less(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',in_open) ).
fof(f32,conjecture,
~ ? [X0] :
( in_open(X0,v0,v600)
& leq(v600,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl302) ).
fof(f33,negated_conjecture,
~ ~ ? [X0] :
( in_open(X0,v0,v600)
& leq(v600,X0) ),
inference(negated_conjecture,[status(cth)],[f32]) ).
fof(f34,plain,
? [X0] :
( in_open(X0,v0,v600)
& leq(v600,X0) ),
inference(flattening,[],[f33]) ).
fof(f35,plain,
! [X0,X1,X2] :
( in_open(X0,X1,X2)
=> ( less(X1,X0)
& less(X0,X2) ) ),
inference(unused_predicate_definition_removal,[],[f13]) ).
fof(f40,plain,
! [X0,X1] :
( X0 = X1
| ~ leq(X0,X1)
| ~ leq(X1,X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f41,plain,
! [X0,X1] :
( X0 = X1
| ~ leq(X0,X1)
| ~ leq(X1,X0) ),
inference(flattening,[],[f40]) ).
fof(f49,plain,
! [X0,X1,X2] :
( ( less(X1,X0)
& less(X0,X2) )
| ~ in_open(X0,X1,X2) ),
inference(ennf_transformation,[],[f35]) ).
fof(f60,plain,
! [X0,X1] :
( ( leq(X0,X1)
| ( ~ less(X0,X1)
& X0 != X1 ) )
& ( less(X0,X1)
| X0 = X1
| ~ leq(X0,X1) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f61,plain,
! [X0,X1] :
( ( leq(X0,X1)
| ( ~ less(X0,X1)
& X0 != X1 ) )
& ( less(X0,X1)
| X0 = X1
| ~ leq(X0,X1) ) ),
inference(flattening,[],[f60]) ).
fof(f62,plain,
( in_open(sK0,v0,v600)
& leq(v600,sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f34]) ).
fof(f63,plain,
! [X0] : ~ less(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f68,plain,
! [X0,X1] :
( leq(X0,X1)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f61]) ).
fof(f69,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| X0 = X1
| ~ leq(X1,X0) ),
inference(cnf_transformation,[],[f41]) ).
fof(f74,plain,
! [X2,X0,X1] :
( less(X0,X2)
| ~ in_open(X0,X1,X2) ),
inference(cnf_transformation,[],[f49]) ).
fof(f91,plain,
leq(v600,sK0),
inference(cnf_transformation,[],[f62]) ).
fof(f92,plain,
in_open(sK0,v0,v600),
inference(cnf_transformation,[],[f62]) ).
fof(f142,plain,
! [X0,X1] : ~ in_open(X0,X1,X0),
inference(resolution,[],[f74,f63]) ).
fof(f150,definition,
( spl1_10
<=> leq(sK0,v600) ),
introduced(definition,[new_symbols(definition,[spl1_10])],[avatar_definition]) ).
fof(f151,plain,
( leq(sK0,v600)
| ~ spl1_10 ),
inference(avatar_component_clause,[],[f150]) ).
fof(f152,plain,
( ~ leq(sK0,v600)
| spl1_10 ),
inference(avatar_component_clause,[],[f150]) ).
fof(f154,definition,
( spl1_11
<=> v600 = sK0 ),
introduced(definition,[new_symbols(definition,[spl1_11])],[avatar_definition]) ).
fof(f156,plain,
( v600 = sK0
| ~ spl1_11 ),
inference(avatar_component_clause,[],[f154]) ).
fof(f158,plain,
( ~ less(sK0,v600)
| spl1_10 ),
inference(resolution,[],[f152,f68]) ).
fof(f163,plain,
( ! [X0] : ~ in_open(sK0,X0,v600)
| spl1_10 ),
inference(resolution,[],[f158,f74]) ).
fof(f168,plain,
( $false
| spl1_10 ),
inference(resolution,[],[f163,f92]) ).
fof(f169,plain,
spl1_10,
inference(avatar_contradiction_clause,[],[f168]) ).
fof(f170,plain,
( v600 = sK0
| ~ leq(v600,sK0)
| ~ spl1_10 ),
inference(resolution,[],[f151,f69]) ).
fof(f171,plain,
( v600 = sK0
| ~ spl1_10 ),
inference(forward_subsumption_resolution,[],[f170,f91]) ).
fof(f172,plain,
( spl1_11
| ~ spl1_10 ),
inference(avatar_split_clause,[],[f171,f150,f154]) ).
fof(f174,plain,
( in_open(v600,v0,v600)
| ~ spl1_11 ),
inference(superposition,[],[f92,f156]) ).
fof(f176,plain,
( $false
| ~ spl1_11 ),
inference(forward_subsumption_resolution,[],[f174,f142]) ).
fof(f177,plain,
~ spl1_11,
inference(avatar_contradiction_clause,[],[f176]) ).
cnf(s11,plain,
spl1_10,
inference(sat_conversion,[],[f169]) ).
cnf(s12,plain,
( ~ spl1_10
| spl1_11 ),
inference(sat_conversion,[],[f172]) ).
cnf(s13,plain,
~ spl1_11,
inference(sat_conversion,[],[f177]) ).
cnf(s14,plain,
~ spl1_10,
inference(rat,[],[s12,s13]) ).
cnf(s15,plain,
$false,
inference(rat,[],[s11,s14]) ).
fof(f178,plain,
$false,
inference(avatar_sat_refutation,[],[s15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT075+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.37 % Computer : n017.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8046.5625MB
% 0.13/0.37 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Sun Sep 27 17:29:20 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.58/1.32 % (2825949)Detected formulas, will run a generic FOF schedule.
% 2.58/1.32 % (2825959)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1043264191:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.58/1.32 % (2825959)First to succeed.
% 2.58/1.32 % (2825959)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2825949"
% 2.58/1.32 % (2825958)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3250806666:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.58/1.32 % (2825958)Also succeeded, but the first one will report.
% 2.58/1.32 % (2825957)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=537820423:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.58/1.32 % (2825954)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=324098319:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.58/1.32 % (2825955)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=3096128496:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.58/1.32 % (2825956)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=1920008063:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.58/1.32 % (2825957)Refutation not found, incomplete strategy
% 2.58/1.32 % (2825957)------------------------------
% 2.58/1.32 % (2825957)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.58/1.32 % (2825957)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.58/1.32 % (2825957)CaDiCaL version: 2.1.3
% 2.58/1.32 % (2825957)Termination reason: Refutation not found, incomplete strategy
% 2.58/1.32 % (2825957)Time elapsed: 0.002 s
% 2.58/1.32 % (2825957)Peak memory usage: 88 MB
% 2.58/1.32 % (2825957)Instructions burned: 1 (million)
% 2.58/1.32 % (2825960)dis-21_1_sil=8000:lcm=predicate:random_seed=3616125842:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.58/1.32 % (2825960)Also succeeded, but the first one will report.
% 2.58/1.32 % (2825959)Refutation found. Thanks to Tanya!
% 2.58/1.32 % SZS status Theorem for theBenchmark
% 2.58/1.32 % SZS output start Proof for theBenchmark
% See solution above
% 2.58/1.32 % (2825959)------------------------------
% 2.58/1.32 % (2825959)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.58/1.32 % (2825959)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.58/1.32 % (2825959)CaDiCaL version: 2.1.3
% 2.58/1.32 % (2825959)Termination reason: Refutation
% 2.58/1.32 % (2825959)Time elapsed: 0.002 s
% 2.58/1.32 % (2825959)Peak memory usage: 90 MB
% 2.58/1.32 % (2825959)Instructions burned: 3 (million)
% 2.58/1.32 % (2825959)------------------------------
% 2.58/1.32 % (2825959)------------------------------
% 2.58/1.32 % (2825949)Success in time 0.276 s
% 2.58/1.32 % Vampire exiting
%------------------------------------------------------------------------------