%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT093+1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n014.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:32 PM UTC 2026
% Result : Theorem 0.17s 0.48s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 32 ( 19 unt; 3 def)
% Number of atoms : 63 ( 21 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 59 ( 28 ~; 24 |; 3 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 4 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 9 ( 0 sgn 9 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f14,axiom,
! [X0,X1] :
( ( is_verdict(X0)
& is_verdict(X1)
& X0 = compatible
& X1 = conflict )
=> xone_verdict(X0,X1) = compatible ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+3.ax',xone_compat) ).
fof(f26,axiom,
is_verdict(conflict),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',conflict_is_verdict) ).
fof(f27,axiom,
is_verdict(compatible),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',compatible_is_verdict) ).
fof(f37,conjecture,
xone_verdict(compatible,conflict) = compatible,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl644) ).
fof(f38,negated_conjecture,
xone_verdict(compatible,conflict) != compatible,
inference(negated_conjecture,[status(cth)],[f37]) ).
fof(f39,plain,
compatible != xone_verdict(compatible,conflict),
inference(flattening,[],[f38]) ).
fof(f60,plain,
! [X0,X1] :
( xone_verdict(X0,X1) = compatible
| ~ is_verdict(X0)
| ~ is_verdict(X1)
| compatible != X0
| conflict != X1 ),
inference(ennf_transformation,[],[f14]) ).
fof(f61,plain,
! [X0,X1] :
( xone_verdict(X0,X1) = compatible
| ~ is_verdict(X0)
| ~ is_verdict(X1)
| compatible != X0
| conflict != X1 ),
inference(flattening,[],[f60]) ).
fof(f98,plain,
! [X0,X1] :
( conflict != X1
| compatible != X0
| ~ is_verdict(X1)
| ~ is_verdict(X0)
| compatible = xone_verdict(X0,X1) ),
inference(cnf_transformation,[],[f61]) ).
fof(f114,plain,
is_verdict(conflict),
inference(cnf_transformation,[],[f26]) ).
fof(f115,plain,
is_verdict(compatible),
inference(cnf_transformation,[],[f27]) ).
fof(f127,plain,
compatible != xone_verdict(compatible,conflict),
inference(cnf_transformation,[],[f39]) ).
fof(f133,plain,
! [X0] :
( compatible != X0
| ~ is_verdict(conflict)
| ~ is_verdict(X0)
| compatible = xone_verdict(X0,conflict) ),
inference(equality_resolution,[],[f98]) ).
fof(f134,plain,
( ~ is_verdict(conflict)
| ~ is_verdict(compatible)
| compatible = xone_verdict(compatible,conflict) ),
inference(equality_resolution,[],[f133]) ).
fof(f149,plain,
( is_verdict(conflict)
| is_verdict(compatible)
| compatible = xone_verdict(compatible,conflict) ),
inference(consistent_polarity_flipping,[],[f134]) ).
fof(f162,plain,
~ is_verdict(conflict),
inference(consistent_polarity_flipping,[],[f114]) ).
fof(f163,plain,
~ is_verdict(compatible),
inference(consistent_polarity_flipping,[],[f115]) ).
fof(f196,definition,
( spl1_6
<=> is_verdict(compatible) ),
introduced(definition,[new_symbols(definition,[spl1_6])],[avatar_definition]) ).
fof(f204,definition,
( spl1_8
<=> is_verdict(conflict) ),
introduced(definition,[new_symbols(definition,[spl1_8])],[avatar_definition]) ).
fof(f214,plain,
~ spl1_6,
inference(avatar_split_clause,[],[f163,f196]) ).
fof(f215,plain,
~ spl1_8,
inference(avatar_split_clause,[],[f162,f204]) ).
fof(f222,definition,
( spl1_11
<=> compatible = xone_verdict(compatible,conflict) ),
introduced(definition,[new_symbols(definition,[spl1_11])],[avatar_definition]) ).
fof(f225,plain,
( spl1_11
| spl1_6
| spl1_8 ),
inference(avatar_split_clause,[],[f149,f204,f196,f222]) ).
fof(f239,plain,
~ spl1_11,
inference(avatar_split_clause,[],[f127,f222]) ).
cnf(s8,plain,
~ spl1_6,
inference(sat_conversion,[],[f214]) ).
cnf(s9,plain,
~ spl1_8,
inference(sat_conversion,[],[f215]) ).
cnf(s11,plain,
( spl1_6
| spl1_8
| spl1_11 ),
inference(sat_conversion,[],[f225]) ).
cnf(s15,plain,
~ spl1_11,
inference(sat_conversion,[],[f239]) ).
cnf(s16,plain,
( spl1_6
| spl1_8 ),
inference(rat,[],[s11,s15]) ).
cnf(s18,plain,
spl1_6,
inference(rat,[],[s16,s9]) ).
cnf(s20,plain,
$false,
inference(rat,[],[s8,s18]) ).
fof(f240,plain,
$false,
inference(avatar_sat_refutation,[],[s20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT093+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.39 % Computer : n014.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Sun Sep 27 17:36:02 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.43 Running first-order model finding
% 0.11/0.43 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.17/0.48 % (1050126)Will run a generic schedule for satisfiability detection.
% 0.17/0.48 % (1050131)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2051925059_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.48 % Detected minimum model sizes of [3]
% 0.17/0.48 % Detected maximum model sizes of [max]
% 0.17/0.48 % TRYING [3]
% 0.17/0.48 % (1050132)% WARNING: option uhcvi not known.
% 0.17/0.48 % (1050132)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2568731111:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.48 % (1050133)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1419092997:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.48 % (1050134)dis+10_1_sil=32000:sp=arity:random_seed=470973324:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.48 % (1050135)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3891310395:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.48 % (1050136)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2403228994:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.48 % (1050137)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4096208479:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.48 % (1050133) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1050126-1050133"...
% 0.17/0.48 % (1050132) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1050126-1050132"...
% 0.17/0.48 % TRYING [4]
% 0.17/0.48 % (1050134) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1050126-1050134"...
% 0.17/0.48 % (1050135) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1050126-1050135"...
% 0.17/0.48 % (1050132)...printing done.
% 0.17/0.48 % (1050133)...printing done.
% 0.17/0.48 % (1050134)...printing done.
% 0.17/0.48 % (1050137) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1050126-1050137"...
% 0.17/0.48 % (1050132)Refutation found. Thanks to Tanya!
% 0.17/0.48 % SZS status Theorem for theBenchmark
% 0.17/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.48 % (1050132)------------------------------
% 0.17/0.48 % (1050132)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.48 % (1050132)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.48 % (1050132)CaDiCaL version: 2.1.3
% 0.17/0.48 % (1050132)Termination reason: Refutation
% 0.17/0.48 % (1050132)Time elapsed: 0.003 s
% 0.17/0.48 % (1050132)Peak memory usage: 12 MB
% 0.17/0.48 % (1050132)Instructions burned: 2 (million)
% 0.17/0.48 % (1050126)Success in time 0.042 s
% 0.17/0.48 % Vampire exiting
%------------------------------------------------------------------------------