%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT106+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 : n003.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:38 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.46s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 11
% Syntax : Number of formulae : 57 ( 20 unt; 2 def)
% Number of atoms : 118 ( 10 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 103 ( 42 ~; 47 |; 6 &)
% ( 4 <=>; 4 =>; 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 : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 72 ( 0 sgn 72 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : ~ less(X0,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',irreflexive) ).
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(f5,axiom,
! [X0,X1] :
( ( leq(X0,X1)
& leq(X1,X0) )
=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',leq_antisym) ).
fof(f7,axiom,
! [X0,X1,X2] :
( ( leq(X0,X1)
& less(X1,X2) )
=> less(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',leq_less_trans) ).
fof(f9,axiom,
! [X0,X1,X2] :
( ( leq(X0,X1)
& leq(X1,X2) )
=> leq(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',leq_trans) ).
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(f32,axiom,
less(v600,v800),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v600_v800) ).
fof(f35,axiom,
in_lopen(w,v0,v600),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',wit_in_lopen) ).
fof(f36,axiom,
leq(v800,w),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',wit_leq) ).
fof(f37,plain,
! [X0,X1,X2] :
( in_lopen(X0,X1,X2)
=> ( less(X1,X0)
& leq(X0,X2) ) ),
inference(unused_predicate_definition_removal,[],[f11]) ).
fof(f44,plain,
! [X0,X1] :
( X0 = X1
| ~ leq(X0,X1)
| ~ leq(X1,X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f45,plain,
! [X0,X1] :
( X0 = X1
| ~ leq(X0,X1)
| ~ leq(X1,X0) ),
inference(flattening,[],[f44]) ).
fof(f47,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ leq(X0,X1)
| ~ less(X1,X2) ),
inference(ennf_transformation,[],[f7]) ).
fof(f48,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ leq(X0,X1)
| ~ less(X1,X2) ),
inference(flattening,[],[f47]) ).
fof(f51,plain,
! [X0,X1,X2] :
( leq(X0,X2)
| ~ leq(X0,X1)
| ~ leq(X1,X2) ),
inference(ennf_transformation,[],[f9]) ).
fof(f52,plain,
! [X0,X1,X2] :
( leq(X0,X2)
| ~ leq(X0,X1)
| ~ leq(X1,X2) ),
inference(flattening,[],[f51]) ).
fof(f53,plain,
! [X0,X1,X2] :
( ( less(X1,X0)
& leq(X0,X2) )
| ~ in_lopen(X0,X1,X2) ),
inference(ennf_transformation,[],[f37]) ).
fof(f64,plain,
! [X0] : ~ less(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f69,plain,
! [X0,X1] :
( ~ less(X0,X1)
| leq(X0,X1) ),
inference(cnf_transformation,[],[f4]) ).
fof(f70,plain,
! [X0,X1] :
( ~ leq(X1,X0)
| ~ leq(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f45]) ).
fof(f72,plain,
! [X2,X0,X1] :
( ~ less(X1,X2)
| ~ leq(X0,X1)
| less(X0,X2) ),
inference(cnf_transformation,[],[f48]) ).
fof(f74,plain,
! [X2,X0,X1] :
( ~ leq(X1,X2)
| ~ leq(X0,X1)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f52]) ).
fof(f75,plain,
! [X2,X0,X1] :
( ~ in_lopen(X0,X1,X2)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f53]) ).
fof(f91,plain,
less(v600,v800),
inference(cnf_transformation,[],[f32]) ).
fof(f95,plain,
in_lopen(w,v0,v600),
inference(cnf_transformation,[],[f35]) ).
fof(f96,plain,
leq(v800,w),
inference(cnf_transformation,[],[f36]) ).
fof(f104,plain,
! [X0] : less(X0,X0),
inference(consistent_polarity_flipping,[],[f64]) ).
fof(f107,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| less(X0,X1) ),
inference(consistent_polarity_flipping,[],[f69]) ).
fof(f110,plain,
! [X0,X1] :
( leq(X1,X0)
| leq(X0,X1)
| X0 = X1 ),
inference(consistent_polarity_flipping,[],[f70]) ).
fof(f112,plain,
! [X2,X0,X1] :
( ~ less(X0,X2)
| leq(X0,X1)
| less(X1,X2) ),
inference(consistent_polarity_flipping,[],[f72]) ).
fof(f114,plain,
! [X2,X0,X1] :
( ~ leq(X0,X2)
| leq(X0,X1)
| leq(X1,X2) ),
inference(consistent_polarity_flipping,[],[f74]) ).
fof(f116,plain,
! [X2,X0,X1] :
( in_lopen(X0,X1,X2)
| ~ leq(X0,X2) ),
inference(consistent_polarity_flipping,[],[f75]) ).
fof(f128,plain,
~ less(v600,v800),
inference(consistent_polarity_flipping,[],[f91]) ).
fof(f129,plain,
~ in_lopen(w,v0,v600),
inference(consistent_polarity_flipping,[],[f95]) ).
fof(f130,plain,
~ leq(v800,w),
inference(consistent_polarity_flipping,[],[f96]) ).
fof(f174,plain,
~ leq(w,v600),
inference(resolution,[],[f116,f129]) ).
fof(f190,definition,
( spl0_10
<=> v600 = w ),
introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).
fof(f192,plain,
( v600 = w
| ~ spl0_10 ),
inference(avatar_component_clause,[],[f190]) ).
fof(f208,plain,
! [X0,X1] :
( leq(X0,X1)
| less(X1,X0) ),
inference(resolution,[],[f112,f104]) ).
fof(f212,plain,
! [X2,X0,X1] :
( leq(X0,X1)
| leq(X1,X2)
| leq(X2,X0)
| X0 = X2 ),
inference(resolution,[],[f114,f110]) ).
fof(f253,plain,
less(w,v800),
inference(resolution,[],[f208,f130]) ).
fof(f291,plain,
! [X0] :
( leq(v600,X0)
| leq(X0,w)
| v600 = w ),
inference(resolution,[],[f212,f174]) ).
fof(f299,definition,
( spl0_16
<=> ! [X0] :
( leq(v600,X0)
| leq(X0,w) ) ),
introduced(definition,[new_symbols(definition,[spl0_16])],[avatar_definition]) ).
fof(f300,plain,
( ! [X0] :
( leq(v600,X0)
| leq(X0,w) )
| ~ spl0_16 ),
inference(avatar_component_clause,[],[f299]) ).
fof(f301,plain,
( spl0_10
| spl0_16 ),
inference(avatar_split_clause,[],[f291,f299,f190]) ).
fof(f309,plain,
( less(v600,v800)
| ~ spl0_10 ),
inference(superposition,[],[f253,f192]) ).
fof(f310,plain,
( $false
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[],[f309,f128]) ).
fof(f311,plain,
~ spl0_10,
inference(avatar_contradiction_clause,[],[f310]) ).
fof(f349,plain,
( leq(v600,v800)
| ~ spl0_16 ),
inference(resolution,[],[f300,f130]) ).
fof(f395,plain,
( less(v600,v800)
| ~ spl0_16 ),
inference(resolution,[],[f349,f107]) ).
fof(f396,plain,
( $false
| ~ spl0_16 ),
inference(forward_subsumption_resolution,[],[f395,f128]) ).
fof(f397,plain,
~ spl0_16,
inference(avatar_contradiction_clause,[],[f396]) ).
cnf(s15,plain,
( spl0_10
| spl0_16 ),
inference(sat_conversion,[],[f301]) ).
cnf(s16,plain,
~ spl0_10,
inference(sat_conversion,[],[f311]) ).
cnf(s20,plain,
~ spl0_16,
inference(sat_conversion,[],[f397]) ).
cnf(s21,plain,
$false,
inference(rat,[],[s15,s20,s16]) ).
fof(f398,plain,
$false,
inference(avatar_sat_refutation,[],[s21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT106+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.10/0.36 % Computer : n003.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 27 17:40:56 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.42 Running first-order model finding
% 0.10/0.42 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.10/0.46 % (813347)Will run a generic schedule for satisfiability detection.
% 0.10/0.46 % (813353)% WARNING: option uhcvi not known.
% 0.10/0.46 % (813353)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3894626054:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.10/0.46 % (813353) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-813347-813353"...
% 0.10/0.46 % (813353)...printing done.
% 0.10/0.46 % (813353)Refutation found. Thanks to Tanya!
% 0.10/0.46 % SZS status Unsatisfiable for theBenchmark
% 0.10/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.46 % (813353)------------------------------
% 0.10/0.46 % (813353)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.46 % (813353)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.46 % (813353)CaDiCaL version: 2.1.3
% 0.10/0.46 % (813353)Termination reason: Refutation
% 0.10/0.46 % (813353)Time elapsed: 0.007 s
% 0.10/0.46 % (813353)Peak memory usage: 13 MB
% 0.10/0.46 % (813353)Instructions burned: 10 (million)
% 0.10/0.46 % (813347)Success in time 0.03 s
% 0.10/0.46 % Vampire exiting
%------------------------------------------------------------------------------