%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT086+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n008.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:04:31 PM UTC 2026
% Result : Theorem 0.19s 0.51s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 52 ( 16 unt; 2 def)
% Number of atoms : 137 ( 6 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 159 ( 74 ~; 61 |; 19 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 60 ( 0 sgn 56 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : ~ less(X0,X0),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',irreflexive) ).
fof(f4,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> ( less(X0,X1)
| X0 = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',leq_def) ).
fof(f7,axiom,
! [X0,X1,X2] :
( ( leq(X0,X1)
& less(X1,X2) )
=> less(X0,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',leq_less_trans) ).
fof(f11,axiom,
! [X0,X1,X2] :
( in_lopen(X0,X1,X2)
<=> ( less(X1,X0)
& leq(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',in_lopen) ).
fof(f33,axiom,
less(v0,v200),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v0_v200) ).
fof(f37,axiom,
less(v200,v400),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v200_v400) ).
fof(f42,axiom,
less(v600,v800),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v600_v800) ).
fof(f44,conjecture,
? [X0,X1] :
( leq(v800,X0)
& in_lopen(X1,v0,v200)
& ( ( in_lopen(X0,v0,v600)
& ~ in_lopen(X1,v0,v400) )
| ( ~ in_lopen(X0,v0,v600)
& in_lopen(X1,v0,v400) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl462) ).
fof(f45,negated_conjecture,
~ ? [X0,X1] :
( leq(v800,X0)
& in_lopen(X1,v0,v200)
& ( ( in_lopen(X0,v0,v600)
& ~ in_lopen(X1,v0,v400) )
| ( ~ in_lopen(X0,v0,v600)
& in_lopen(X1,v0,v400) ) ) ),
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f56,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ leq(X0,X1)
| ~ less(X1,X2) ),
inference(ennf_transformation,[],[f7]) ).
fof(f57,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ leq(X0,X1)
| ~ less(X1,X2) ),
inference(flattening,[],[f56]) ).
fof(f72,plain,
! [X0,X1] :
( ~ leq(v800,X0)
| ~ in_lopen(X1,v0,v200)
| ( ( ~ in_lopen(X0,v0,v600)
| in_lopen(X1,v0,v400) )
& ( in_lopen(X0,v0,v600)
| ~ in_lopen(X1,v0,v400) ) ) ),
inference(ennf_transformation,[],[f45]) ).
fof(f73,plain,
! [X0,X1] :
( ( leq(X0,X1)
| ( ~ less(X0,X1)
& X0 != X1 ) )
& ( less(X0,X1)
| X0 = X1
| ~ leq(X0,X1) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f74,plain,
! [X0,X1] :
( ( leq(X0,X1)
| ( ~ less(X0,X1)
& X0 != X1 ) )
& ( less(X0,X1)
| X0 = X1
| ~ leq(X0,X1) ) ),
inference(flattening,[],[f73]) ).
fof(f75,plain,
! [X0,X1,X2] :
( ( in_lopen(X0,X1,X2)
| ~ less(X1,X0)
| ~ leq(X0,X2) )
& ( ( less(X1,X0)
& leq(X0,X2) )
| ~ in_lopen(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f76,plain,
! [X0,X1,X2] :
( ( in_lopen(X0,X1,X2)
| ~ less(X1,X0)
| ~ leq(X0,X2) )
& ( ( less(X1,X0)
& leq(X0,X2) )
| ~ in_lopen(X0,X1,X2) ) ),
inference(flattening,[],[f75]) ).
fof(f77,plain,
! [X0] : ~ less(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f81,plain,
! [X0,X1] :
( leq(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f74]) ).
fof(f82,plain,
! [X0,X1] :
( ~ less(X0,X1)
| leq(X0,X1) ),
inference(cnf_transformation,[],[f74]) ).
fof(f85,plain,
! [X2,X0,X1] :
( ~ leq(X0,X1)
| less(X0,X2)
| ~ less(X1,X2) ),
inference(cnf_transformation,[],[f57]) ).
fof(f88,plain,
! [X2,X0,X1] :
( ~ in_lopen(X0,X1,X2)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f76]) ).
fof(f89,plain,
! [X2,X0,X1] :
( ~ in_lopen(X0,X1,X2)
| less(X1,X0) ),
inference(cnf_transformation,[],[f76]) ).
fof(f90,plain,
! [X2,X0,X1] :
( in_lopen(X0,X1,X2)
| ~ less(X1,X0)
| ~ leq(X0,X2) ),
inference(cnf_transformation,[],[f76]) ).
fof(f104,plain,
less(v0,v200),
inference(cnf_transformation,[],[f33]) ).
fof(f108,plain,
less(v200,v400),
inference(cnf_transformation,[],[f37]) ).
fof(f113,plain,
less(v600,v800),
inference(cnf_transformation,[],[f42]) ).
fof(f124,plain,
! [X0,X1] :
( ~ leq(v800,X0)
| ~ in_lopen(X1,v0,v200)
| in_lopen(X0,v0,v600)
| ~ in_lopen(X1,v0,v400) ),
inference(cnf_transformation,[],[f72]) ).
fof(f126,plain,
! [X1] : leq(X1,X1),
inference(equality_resolution,[],[f81]) ).
fof(f135,definition,
( spl0_1
<=> ! [X1] :
( ~ in_lopen(X1,v0,v200)
| ~ in_lopen(X1,v0,v400) ) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f136,plain,
( ! [X1] :
( ~ in_lopen(X1,v0,v400)
| ~ in_lopen(X1,v0,v200) )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f135]) ).
fof(f138,definition,
( spl0_2
<=> ! [X0] :
( ~ leq(v800,X0)
| in_lopen(X0,v0,v600) ) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f139,plain,
( ! [X0] :
( in_lopen(X0,v0,v600)
| ~ leq(v800,X0) )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f138]) ).
fof(f140,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f124,f138,f135]) ).
fof(f193,plain,
leq(v200,v400),
inference(resolution,[],[f82,f108]) ).
fof(f199,plain,
( ! [X0] :
( ~ leq(v800,X0)
| leq(X0,v600) )
| ~ spl0_2 ),
inference(resolution,[],[f88,f139]) ).
fof(f200,plain,
( leq(v800,v600)
| ~ spl0_2 ),
inference(resolution,[],[f199,f126]) ).
fof(f255,plain,
( ! [X0] :
( ~ less(v600,X0)
| less(v800,X0) )
| ~ spl0_2 ),
inference(resolution,[],[f85,f200]) ).
fof(f256,plain,
( less(v800,v800)
| ~ spl0_2 ),
inference(resolution,[],[f255,f113]) ).
fof(f259,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f256,f77]) ).
fof(f260,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f259]) ).
fof(f301,plain,
( ! [X0] :
( ~ in_lopen(X0,v0,v200)
| ~ less(v0,X0)
| ~ leq(X0,v400) )
| ~ spl0_1 ),
inference(resolution,[],[f136,f90]) ).
fof(f302,plain,
( ! [X0] :
( ~ in_lopen(X0,v0,v200)
| ~ leq(X0,v400) )
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f301,f89]) ).
fof(f308,plain,
( ! [X0] :
( ~ leq(X0,v400)
| ~ less(v0,X0)
| ~ leq(X0,v200) )
| ~ spl0_1 ),
inference(resolution,[],[f302,f90]) ).
fof(f324,plain,
( ~ less(v0,v200)
| ~ leq(v200,v200)
| ~ spl0_1 ),
inference(resolution,[],[f308,f193]) ).
fof(f325,plain,
( ~ leq(v200,v200)
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f324,f104]) ).
fof(f327,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f325,f126]) ).
fof(f328,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f327]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f140]) ).
cnf(s12,plain,
~ spl0_2,
inference(sat_conversion,[],[f260]) ).
cnf(s14,plain,
~ spl0_1,
inference(sat_conversion,[],[f328]) ).
cnf(s20,plain,
$false,
inference(rat,[],[s1,s12,s14]) ).
fof(f329,plain,
$false,
inference(avatar_sat_refutation,[],[s20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT086+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42 % Computer : n008.cluster.edu
% 0.12/0.42 % Model : x86_64 x86_64
% 0.12/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.42 % Memory : 8046.5625MB
% 0.12/0.42 % OS : Linux 6.8.0-71-generic
% 0.12/0.42 % CPULimit : 300
% 0.12/0.42 % WCLimit : 300
% 0.12/0.42 % DateTime : Sun Sep 27 17:35:55 UTC 2026
% 0.12/0.42 % CPUTime :
% 0.12/0.42 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.46 Running first-order model finding
% 0.12/0.46 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.51 % (1486298)Will run a generic schedule for satisfiability detection.
% 0.19/0.51 % (1486309)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3275126517:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.51 % (1486304)% WARNING: option uhcvi not known.
% 0.19/0.51 % (1486303)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2850287047_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.51 % (1486304)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1441076477:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.51 % (1486306)dis+10_1_sil=32000:sp=arity:random_seed=2123431290:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.51 % (1486305)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4005115152:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.51 % (1486307)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=516987157:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.51 % (1486308)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=792332273:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.51 % Detected minimum model sizes of [5]
% 0.19/0.51 % Detected maximum model sizes of [max]
% 0.19/0.51 % TRYING [5]
% 0.19/0.51 % (1486306) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1486298-1486306"...
% 0.19/0.51 % (1486306)...printing done.
% 0.19/0.51 % (1486303) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1486298-1486303"...
% 0.19/0.51 % (1486306)Refutation found. Thanks to Tanya!
% 0.19/0.51 % SZS status Theorem for theBenchmark
% 0.19/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.51 % (1486306)------------------------------
% 0.19/0.51 % (1486306)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.51 % (1486306)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.51 % (1486306)CaDiCaL version: 2.1.3
% 0.19/0.51 % (1486306)Termination reason: Refutation
% 0.19/0.51 % (1486306)Time elapsed: 0.006 s
% 0.19/0.51 % (1486306)Peak memory usage: 12 MB
% 0.19/0.51 % (1486306)Instructions burned: 7 (million)
% 0.19/0.51 % (1486298)Success in time 0.046 s
% 0.19/0.51 % Vampire exiting
%------------------------------------------------------------------------------