%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : MGT093+1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 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:02:22 PM UTC 2026
% Result : Theorem 2.67s 1.36s
% Output : Refutation 2.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 23 ( 14 unt; 3 def)
% Number of atoms : 53 ( 17 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 55 ( 25 ~; 26 |; 3 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 10 ( 10 !; 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/sandbox2/benchmark/theBenchmark.p',xone_compat) ).
fof(f26,axiom,
is_verdict(conflict),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conflict_is_verdict) ).
fof(f27,axiom,
is_verdict(compatible),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',compatible_is_verdict) ).
fof(f37,conjecture,
xone_verdict(compatible,conflict) = compatible,
file('/export/starexec/sandbox2/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(f46,plain,
! [X0,X1] :
( xone_verdict(X0,X1) = compatible
| ~ is_verdict(X0)
| ~ is_verdict(X1)
| compatible != X0
| conflict != X1 ),
inference(ennf_transformation,[],[f14]) ).
fof(f47,plain,
! [X0,X1] :
( xone_verdict(X0,X1) = compatible
| ~ is_verdict(X0)
| ~ is_verdict(X1)
| compatible != X0
| conflict != X1 ),
inference(flattening,[],[f46]) ).
fof(f48,plain,
compatible != xone_verdict(compatible,conflict),
inference(cnf_transformation,[],[f39]) ).
fof(f50,plain,
is_verdict(compatible),
inference(cnf_transformation,[],[f27]) ).
fof(f51,plain,
is_verdict(conflict),
inference(cnf_transformation,[],[f26]) ).
fof(f58,plain,
! [X0,X1] :
( compatible = xone_verdict(X0,X1)
| ~ is_verdict(X0)
| ~ is_verdict(X1)
| compatible != X0
| conflict != X1 ),
inference(cnf_transformation,[],[f47]) ).
fof(f59,definition,
~ sP0(compatible),
introduced(definition,[new_symbols(definition,[sP0])],[inequality_splitting_name_introduction]) ).
fof(f60,plain,
sP0(xone_verdict(compatible,conflict)),
inference(inequality_splitting,[],[f48,f59]) ).
fof(f66,definition,
~ sP4(compatible),
introduced(definition,[new_symbols(definition,[sP4])],[inequality_splitting_name_introduction]) ).
fof(f67,definition,
~ sP5(conflict),
introduced(definition,[new_symbols(definition,[sP5])],[inequality_splitting_name_introduction]) ).
fof(f68,plain,
! [X0,X1] :
( compatible = xone_verdict(X0,X1)
| ~ is_verdict(X0)
| ~ is_verdict(X1)
| sP4(X0)
| sP5(X1) ),
inference(inequality_splitting,[],[f58,f67,f66]) ).
fof(f72,plain,
( sP0(compatible)
| ~ is_verdict(compatible)
| ~ is_verdict(conflict)
| sP4(compatible)
| sP5(conflict) ),
inference(superposition,[],[f60,f68]) ).
fof(f77,plain,
( ~ is_verdict(compatible)
| ~ is_verdict(conflict)
| sP4(compatible)
| sP5(conflict) ),
inference(forward_subsumption_resolution,[],[f72,f59]) ).
fof(f80,plain,
( ~ is_verdict(conflict)
| sP4(compatible)
| sP5(conflict) ),
inference(forward_subsumption_resolution,[],[f77,f50]) ).
fof(f95,plain,
( sP4(compatible)
| sP5(conflict) ),
inference(forward_subsumption_resolution,[],[f80,f51]) ).
fof(f105,plain,
sP5(conflict),
inference(forward_subsumption_resolution,[],[f95,f66]) ).
fof(f106,plain,
$false,
inference(forward_subsumption_resolution,[],[f105,f67]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT093+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.39 % Computer : n008.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:55 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/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
% 2.67/1.36 % (1487178)Detected formulas, will run a generic FOF schedule.
% 2.67/1.36 % (1487186)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=248029624:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.67/1.36 % (1487186)First to succeed.
% 2.67/1.36 % (1487186)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1487178"
% 2.67/1.36 % (1487188)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=635476049:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.67/1.36 % (1487185)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=1400517387:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.67/1.36 % (1487189)dis-21_1_sil=8000:lcm=predicate:random_seed=1535503043: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)
% 2.67/1.36 % (1487184)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=4024152363:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.67/1.36 % (1487187)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1301189948:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.67/1.36 % (1487183)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=1621214408:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.67/1.36 % (1487187)Also succeeded, but the first one will report.
% 2.67/1.36 % (1487188)Also succeeded, but the first one will report.
% 2.67/1.36 % (1487189)Also succeeded, but the first one will report.
% 2.67/1.36 % (1487186)Refutation found. Thanks to Tanya!
% 2.67/1.36 % SZS status Theorem for theBenchmark
% 2.67/1.36 % SZS output start Proof for theBenchmark
% See solution above
% 2.67/1.36 % (1487186)------------------------------
% 2.67/1.36 % (1487186)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.67/1.36 % (1487186)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.67/1.36 % (1487186)CaDiCaL version: 2.1.3
% 2.67/1.36 % (1487186)Termination reason: Refutation
% 2.67/1.36 % (1487186)Time elapsed: 0.001 s
% 2.67/1.36 % (1487186)Peak memory usage: 88 MB
% 2.67/1.36 % (1487186)Instructions burned: 1 (million)
% 2.67/1.36 % (1487186)------------------------------
% 2.67/1.36 % (1487186)------------------------------
% 2.67/1.36 % (1487178)Success in time 0.295 s
% 2.67/1.36 % Vampire exiting
%------------------------------------------------------------------------------