%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT081+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n001.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:30 PM UTC 2026
% Result : Theorem 0.11s 0.44s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 11
% Syntax : Number of formulae : 65 ( 14 unt; 4 def)
% Number of atoms : 159 ( 24 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 170 ( 76 ~; 57 |; 29 &)
% ( 6 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 5 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 42 ( 0 sgn 36 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : ~ less(X0,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',irreflexive) ).
fof(f2,axiom,
! [X0,X1,X2] :
( ( less(X0,X1)
& less(X1,X2) )
=> less(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',transitive) ).
fof(f4,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> ( less(X0,X1)
| X0 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',leq_def) ).
fof(f11,axiom,
! [X0,X1,X2] :
( in_lopen(X0,X1,X2)
<=> ( less(X1,X0)
& leq(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+2.ax',in_lopen) ).
fof(f41,axiom,
less(v400,v800),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v400_v800) ).
fof(f43,axiom,
( v0 != v200
& v0 != v400
& v0 != v600
& v0 != v800
& v200 != v400
& v200 != v600
& v200 != v800
& v400 != v600
& v400 != v800
& v600 != v800 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distinct) ).
fof(f44,conjecture,
~ ? [X0,X1] :
( in_lopen(X0,v0,v400)
& leq(v800,X0)
& in_lopen(X1,v0,v600)
& leq(v200,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl402) ).
fof(f45,negated_conjecture,
~ ~ ? [X0,X1] :
( in_lopen(X0,v0,v400)
& leq(v800,X0)
& in_lopen(X1,v0,v600)
& leq(v200,X1) ),
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f46,plain,
? [X0,X1] :
( in_lopen(X0,v0,v400)
& leq(v800,X0)
& in_lopen(X1,v0,v600)
& leq(v200,X1) ),
inference(flattening,[],[f45]) ).
fof(f47,plain,
! [X0,X1,X2] :
( in_lopen(X0,X1,X2)
=> ( less(X1,X0)
& leq(X0,X2) ) ),
inference(unused_predicate_definition_removal,[],[f11]) ).
fof(f53,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ less(X0,X1)
| ~ less(X1,X2) ),
inference(ennf_transformation,[],[f2]) ).
fof(f54,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ less(X0,X1)
| ~ less(X1,X2) ),
inference(flattening,[],[f53]) ).
fof(f64,plain,
! [X0,X1,X2] :
( ( less(X1,X0)
& leq(X0,X2) )
| ~ in_lopen(X0,X1,X2) ),
inference(ennf_transformation,[],[f47]) ).
fof(f75,plain,
! [X0,X1] :
( ( leq(X0,X1)
| ( ~ less(X0,X1)
& X0 != X1 ) )
& ( less(X0,X1)
| X0 = X1
| ~ leq(X0,X1) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f76,plain,
! [X0,X1] :
( ( leq(X0,X1)
| ( ~ less(X0,X1)
& X0 != X1 ) )
& ( less(X0,X1)
| X0 = X1
| ~ leq(X0,X1) ) ),
inference(flattening,[],[f75]) ).
fof(f77,plain,
( in_lopen(sK0,v0,v400)
& leq(v800,sK0)
& in_lopen(sK1,v0,v600)
& leq(v200,sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f46]) ).
fof(f78,plain,
! [X0] : ~ less(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f79,plain,
! [X2,X0,X1] :
( ~ less(X1,X2)
| ~ less(X0,X1)
| less(X0,X2) ),
inference(cnf_transformation,[],[f54]) ).
fof(f81,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| X0 = X1
| less(X0,X1) ),
inference(cnf_transformation,[],[f76]) ).
fof(f89,plain,
! [X2,X0,X1] :
( ~ in_lopen(X0,X1,X2)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f64]) ).
fof(f112,plain,
less(v400,v800),
inference(cnf_transformation,[],[f41]) ).
fof(f115,plain,
v400 != v800,
inference(cnf_transformation,[],[f43]) ).
fof(f126,plain,
leq(v800,sK0),
inference(cnf_transformation,[],[f77]) ).
fof(f127,plain,
in_lopen(sK0,v0,v400),
inference(cnf_transformation,[],[f77]) ).
fof(f200,plain,
! [X0] :
( ~ less(X0,v400)
| less(X0,v800) ),
inference(resolution,[],[f79,f112]) ).
fof(f634,plain,
leq(sK0,v400),
inference(resolution,[],[f89,f127]) ).
fof(f650,plain,
( v800 = sK0
| less(v800,sK0) ),
inference(resolution,[],[f81,f126]) ).
fof(f651,plain,
( v400 = sK0
| less(sK0,v400) ),
inference(resolution,[],[f81,f634]) ).
fof(f695,definition,
( spl2_20
<=> less(v800,sK0) ),
introduced(definition,[new_symbols(definition,[spl2_20])],[avatar_definition]) ).
fof(f697,plain,
( less(v800,sK0)
| ~ spl2_20 ),
inference(avatar_component_clause,[],[f695]) ).
fof(f699,definition,
( spl2_21
<=> v800 = sK0 ),
introduced(definition,[new_symbols(definition,[spl2_21])],[avatar_definition]) ).
fof(f701,plain,
( v800 = sK0
| ~ spl2_21 ),
inference(avatar_component_clause,[],[f699]) ).
fof(f702,plain,
( spl2_20
| spl2_21 ),
inference(avatar_split_clause,[],[f650,f699,f695]) ).
fof(f703,plain,
( ! [X0] :
( ~ less(X0,v800)
| less(X0,sK0) )
| ~ spl2_20 ),
inference(resolution,[],[f697,f79]) ).
fof(f706,definition,
( spl2_22
<=> less(sK0,v400) ),
introduced(definition,[new_symbols(definition,[spl2_22])],[avatar_definition]) ).
fof(f708,plain,
( less(sK0,v400)
| ~ spl2_22 ),
inference(avatar_component_clause,[],[f706]) ).
fof(f710,definition,
( spl2_23
<=> v400 = sK0 ),
introduced(definition,[new_symbols(definition,[spl2_23])],[avatar_definition]) ).
fof(f712,plain,
( v400 = sK0
| ~ spl2_23 ),
inference(avatar_component_clause,[],[f710]) ).
fof(f713,plain,
( spl2_22
| spl2_23 ),
inference(avatar_split_clause,[],[f651,f710,f706]) ).
fof(f714,plain,
( less(sK0,v800)
| ~ spl2_22 ),
inference(resolution,[],[f708,f200]) ).
fof(f761,plain,
( less(sK0,sK0)
| ~ spl2_20
| ~ spl2_22 ),
inference(resolution,[],[f703,f714]) ).
fof(f763,plain,
( $false
| ~ spl2_20
| ~ spl2_22 ),
inference(forward_subsumption_resolution,[],[f761,f78]) ).
fof(f764,plain,
( ~ spl2_20
| ~ spl2_22 ),
inference(avatar_contradiction_clause,[],[f763]) ).
fof(f789,plain,
( less(v800,v800)
| ~ spl2_21
| ~ spl2_22 ),
inference(superposition,[],[f714,f701]) ).
fof(f793,plain,
( $false
| ~ spl2_21
| ~ spl2_22 ),
inference(forward_subsumption_resolution,[],[f789,f78]) ).
fof(f794,plain,
( ~ spl2_21
| ~ spl2_22 ),
inference(avatar_contradiction_clause,[],[f793]) ).
fof(f798,plain,
( v400 = v800
| ~ spl2_21
| ~ spl2_23 ),
inference(superposition,[],[f712,f701]) ).
fof(f808,plain,
( $false
| ~ spl2_21
| ~ spl2_23 ),
inference(forward_subsumption_resolution,[],[f798,f115]) ).
fof(f809,plain,
( ~ spl2_21
| ~ spl2_23 ),
inference(avatar_contradiction_clause,[],[f808]) ).
fof(f810,plain,
( less(v800,v400)
| ~ spl2_20
| ~ spl2_23 ),
inference(forward_demodulation,[],[f697,f712]) ).
fof(f813,plain,
( less(v800,v800)
| ~ spl2_20
| ~ spl2_23 ),
inference(resolution,[],[f810,f200]) ).
fof(f817,plain,
( $false
| ~ spl2_20
| ~ spl2_23 ),
inference(forward_subsumption_resolution,[],[f813,f78]) ).
fof(f818,plain,
( ~ spl2_20
| ~ spl2_23 ),
inference(avatar_contradiction_clause,[],[f817]) ).
cnf(s420,plain,
( spl2_20
| spl2_21 ),
inference(sat_conversion,[],[f702]) ).
cnf(s425,plain,
( spl2_22
| spl2_23 ),
inference(sat_conversion,[],[f713]) ).
cnf(s458,plain,
( ~ spl2_20
| ~ spl2_22 ),
inference(sat_conversion,[],[f764]) ).
cnf(s481,plain,
( ~ spl2_21
| ~ spl2_22 ),
inference(sat_conversion,[],[f794]) ).
cnf(s492,plain,
( ~ spl2_21
| ~ spl2_23 ),
inference(sat_conversion,[],[f809]) ).
cnf(s498,plain,
( ~ spl2_20
| ~ spl2_23 ),
inference(sat_conversion,[],[f818]) ).
cnf(s499,plain,
~ spl2_21,
inference(rat,[],[s425,s481,s492]) ).
cnf(s500,plain,
spl2_20,
inference(rat,[],[s420,s499]) ).
cnf(s501,plain,
~ spl2_23,
inference(rat,[],[s498,s500]) ).
cnf(s502,plain,
~ spl2_22,
inference(rat,[],[s458,s500]) ).
cnf(s503,plain,
$false,
inference(rat,[],[s425,s501,s502]) ).
fof(f819,plain,
$false,
inference(avatar_sat_refutation,[],[s503]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT081+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 % Computer : n001.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 17:40:31 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40 Running first-order model finding
% 0.11/0.40 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.44 % (3828736)Will run a generic schedule for satisfiability detection.
% 0.11/0.44 % (3828743)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3151221905:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.44 % (3828742)% WARNING: option uhcvi not known.
% 0.11/0.44 % (3828743) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3828736-3828743"...
% 0.11/0.44 % (3828741)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=649099968_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.44 % (3828746)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2179301517:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.44 % (3828744)dis+10_1_sil=32000:sp=arity:random_seed=3840819554:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.44 % (3828745)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=146869733:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.44 % (3828743)...printing done.
% 0.11/0.44 % (3828747)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1784290900:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.44 % (3828743)Refutation found. Thanks to Tanya!
% 0.11/0.44 % SZS status Theorem for theBenchmark
% 0.11/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.44 % (3828743)------------------------------
% 0.11/0.44 % (3828743)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.44 % (3828743)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.44 % (3828743)CaDiCaL version: 2.1.3
% 0.11/0.44 % (3828743)Termination reason: Refutation
% 0.11/0.44 % (3828743)Time elapsed: 0.007 s
% 0.11/0.44 % (3828743)Peak memory usage: 12 MB
% 0.11/0.44 % (3828743)Instructions burned: 15 (million)
% 0.11/0.44 % (3828736)Success in time 0.032 s
% 0.11/0.44 % Vampire exiting
%------------------------------------------------------------------------------