%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : MGT079+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 : 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:02:20 PM UTC 2026
% Result : Theorem 3.34s 1.38s
% Output : Refutation 3.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of formulae : 55 ( 19 unt; 3 def)
% Number of atoms : 138 ( 6 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 151 ( 68 ~; 55 |; 22 &)
% ( 5 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 4 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 66 ( 0 sgn 60 !; 6 ?)
% 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(f7,axiom,
! [X0,X1,X2] :
( ( leq(X0,X1)
& less(X1,X2) )
=> less(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leq_less_trans) ).
fof(f11,axiom,
! [X0,X1,X2] :
( in_lopen(X0,X1,X2)
<=> ( less(X1,X0)
& leq(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',in_lopen) ).
fof(f36,axiom,
less(v0,v32),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v0_v32) ).
fof(f37,axiom,
less(v0,v400),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v0_v400) ).
fof(f38,axiom,
less(v0,v600),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v0_v600) ).
fof(f41,axiom,
less(v16,v32),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v16_v32) ).
fof(f57,conjecture,
? [X0,X1,X2] :
( in_lopen(X0,v0,v600)
& in_lopen(X1,v0,v400)
& in_lopen(X2,v0,v32)
& ~ ( in_lopen(X0,v0,v1200)
& in_lopen(X1,v0,v800)
& in_lopen(X2,v0,v16) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl350) ).
fof(f58,negated_conjecture,
~ ? [X0,X1,X2] :
( in_lopen(X0,v0,v600)
& in_lopen(X1,v0,v400)
& in_lopen(X2,v0,v32)
& ~ ( in_lopen(X0,v0,v1200)
& in_lopen(X1,v0,v800)
& in_lopen(X2,v0,v16) ) ),
inference(negated_conjecture,[status(cth)],[f57]) ).
fof(f71,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ leq(X0,X1)
| ~ less(X1,X2) ),
inference(ennf_transformation,[],[f7]) ).
fof(f72,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ leq(X0,X1)
| ~ less(X1,X2) ),
inference(flattening,[],[f71]) ).
fof(f87,plain,
! [X0,X1,X2] :
( ~ in_lopen(X0,v0,v600)
| ~ in_lopen(X1,v0,v400)
| ~ in_lopen(X2,v0,v32)
| ( in_lopen(X0,v0,v1200)
& in_lopen(X1,v0,v800)
& in_lopen(X2,v0,v16) ) ),
inference(ennf_transformation,[],[f58]) ).
fof(f88,plain,
! [X0,X1] :
( ( leq(X0,X1)
| ( ~ less(X0,X1)
& X0 != X1 ) )
& ( less(X0,X1)
| X0 = X1
| ~ leq(X0,X1) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f89,plain,
! [X0,X1] :
( ( leq(X0,X1)
| ( ~ less(X0,X1)
& X0 != X1 ) )
& ( less(X0,X1)
| X0 = X1
| ~ leq(X0,X1) ) ),
inference(flattening,[],[f88]) ).
fof(f90,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(f91,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,[],[f90]) ).
fof(f92,plain,
! [X0] : ~ less(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f96,plain,
! [X0,X1] :
( leq(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f89]) ).
fof(f100,plain,
! [X2,X0,X1] :
( ~ leq(X0,X1)
| less(X0,X2)
| ~ less(X1,X2) ),
inference(cnf_transformation,[],[f72]) ).
fof(f103,plain,
! [X2,X0,X1] :
( leq(X0,X2)
| ~ in_lopen(X0,X1,X2) ),
inference(cnf_transformation,[],[f91]) ).
fof(f105,plain,
! [X2,X0,X1] :
( ~ leq(X0,X2)
| ~ less(X1,X0)
| in_lopen(X0,X1,X2) ),
inference(cnf_transformation,[],[f91]) ).
fof(f120,plain,
less(v0,v32),
inference(cnf_transformation,[],[f36]) ).
fof(f121,plain,
less(v0,v400),
inference(cnf_transformation,[],[f37]) ).
fof(f122,plain,
less(v0,v600),
inference(cnf_transformation,[],[f38]) ).
fof(f125,plain,
less(v16,v32),
inference(cnf_transformation,[],[f41]) ).
fof(f161,plain,
! [X2,X0,X1] :
( ~ in_lopen(X0,v0,v600)
| ~ in_lopen(X1,v0,v400)
| ~ in_lopen(X2,v0,v32)
| in_lopen(X2,v0,v16) ),
inference(cnf_transformation,[],[f87]) ).
fof(f164,plain,
! [X1] : leq(X1,X1),
inference(equality_resolution,[],[f96]) ).
fof(f173,definition,
( spl0_1
<=> ! [X2] :
( ~ in_lopen(X2,v0,v32)
| in_lopen(X2,v0,v16) ) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f174,plain,
( ! [X2] :
( in_lopen(X2,v0,v16)
| ~ in_lopen(X2,v0,v32) )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f173]) ).
fof(f176,definition,
( spl0_2
<=> ! [X1] : ~ in_lopen(X1,v0,v400) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f177,plain,
( ! [X1] : ~ in_lopen(X1,v0,v400)
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f176]) ).
fof(f179,definition,
( spl0_3
<=> ! [X0] : ~ in_lopen(X0,v0,v600) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f180,plain,
( ! [X0] : ~ in_lopen(X0,v0,v600)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f179]) ).
fof(f181,plain,
( spl0_1
| spl0_2
| spl0_3 ),
inference(avatar_split_clause,[],[f161,f179,f176,f173]) ).
fof(f235,plain,
! [X0,X1] :
( in_lopen(X1,X0,X1)
| ~ less(X0,X1) ),
inference(resolution,[],[f164,f105]) ).
fof(f237,plain,
( ~ less(v0,v400)
| ~ spl0_2 ),
inference(resolution,[],[f235,f177]) ).
fof(f238,plain,
( ~ less(v0,v600)
| ~ spl0_3 ),
inference(resolution,[],[f235,f180]) ).
fof(f240,plain,
( $false
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[],[f238,f122]) ).
fof(f241,plain,
~ spl0_3,
inference(avatar_contradiction_clause,[],[f240]) ).
fof(f242,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f237,f121]) ).
fof(f243,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f242]) ).
fof(f288,plain,
! [X2,X3,X0,X1] :
( ~ in_lopen(X0,X3,X2)
| ~ less(X2,X1)
| less(X0,X1) ),
inference(resolution,[],[f100,f103]) ).
fof(f379,plain,
( ! [X0,X1] :
( ~ in_lopen(X1,v0,v32)
| less(X1,X0)
| ~ less(v16,X0) )
| ~ spl0_1 ),
inference(resolution,[],[f288,f174]) ).
fof(f382,plain,
( ! [X0] :
( less(v32,X0)
| ~ less(v16,X0)
| ~ less(v0,v32) )
| ~ spl0_1 ),
inference(resolution,[],[f379,f235]) ).
fof(f385,plain,
( ! [X0] :
( less(v32,X0)
| ~ less(v16,X0) )
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f382,f120]) ).
fof(f394,plain,
( ~ less(v16,v32)
| ~ spl0_1 ),
inference(resolution,[],[f385,f92]) ).
fof(f396,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f394,f125]) ).
fof(f397,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f396]) ).
cnf(s1,plain,
( spl0_1
| spl0_2
| spl0_3 ),
inference(sat_conversion,[],[f181]) ).
cnf(s13,plain,
~ spl0_3,
inference(sat_conversion,[],[f241]) ).
cnf(s14,plain,
~ spl0_2,
inference(sat_conversion,[],[f243]) ).
cnf(s15,plain,
~ spl0_1,
inference(sat_conversion,[],[f397]) ).
cnf(s23,plain,
$false,
inference(rat,[],[s1,s13,s14,s15]) ).
fof(f398,plain,
$false,
inference(avatar_sat_refutation,[],[s23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT079+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.39 % Computer : n001.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Sun Sep 27 17:40:17 UTC 2026
% 0.13/0.40 % CPUTime :
% 0.13/0.40 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.43 Running first-order theorem proving
% 0.13/0.43 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
% 3.34/1.38 % (3828311)Detected formulas, will run a generic FOF schedule.
% 3.34/1.38 % (3828317)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=3867493697:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.34/1.38 % (3828318)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=1982171369:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.34/1.38 % (3828321)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=82375107:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.34/1.38 % (3828319)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=569583967:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.34/1.38 % (3828316)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=1240852280:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.34/1.38 % (3828319)Refutation not found, incomplete strategy
% 3.34/1.38 % (3828319)------------------------------
% 3.34/1.38 % (3828319)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.34/1.38 % (3828319)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.34/1.38 % (3828319)CaDiCaL version: 2.1.3
% 3.34/1.38 % (3828319)Termination reason: Refutation not found, incomplete strategy
% 3.34/1.38 % (3828319)Time elapsed: 0.002 s
% 3.34/1.38 % (3828319)Peak memory usage: 88 MB
% 3.34/1.38 % (3828319)Instructions burned: 2 (million)
% 3.34/1.38 % (3828321)First to succeed.
% 3.34/1.38 % (3828320)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4246018274:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.34/1.38 % (3828321)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3828311"
% 3.34/1.38 % (3828322)dis-21_1_sil=8000:lcm=predicate:random_seed=1406449360: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)
% 3.34/1.38 % (3828320)Also succeeded, but the first one will report.
% 3.34/1.38 % (3828322)Also succeeded, but the first one will report.
% 3.34/1.38 % (3828319)------------------------------
% 3.34/1.38 % (3828319)------------------------------
% 3.34/1.38 % (3828321)Refutation found. Thanks to Tanya!
% 3.34/1.38 % SZS status Theorem for theBenchmark
% 3.34/1.38 % SZS output start Proof for theBenchmark
% See solution above
% 3.34/1.38 % (3828321)------------------------------
% 3.34/1.38 % (3828321)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.34/1.38 % (3828321)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.34/1.38 % (3828321)CaDiCaL version: 2.1.3
% 3.34/1.38 % (3828321)Termination reason: Refutation
% 3.34/1.38 % (3828321)Time elapsed: 0.009 s
% 3.34/1.38 % (3828321)Peak memory usage: 90 MB
% 3.34/1.38 % (3828321)Instructions burned: 10 (million)
% 3.34/1.38 % (3828321)------------------------------
% 3.34/1.38 % (3828321)------------------------------
% 3.34/1.38 % (3828311)Success in time 0.408 s
% 3.34/1.38 % Vampire exiting
%------------------------------------------------------------------------------