%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT049+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n026.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:43 PM UTC 2026
% Result : Theorem 0.10s 0.45s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 5 unt; 0 def)
% Number of atoms : 41 ( 18 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 38 ( 14 ~; 8 |; 10 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 36 ( 30 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0,X1,X2] :
( organization(X0)
=> ( ( greater(external_ties(X0,X2),external_ties(X0,X1))
=> greater(position(X0,X2),position(X0,X1)) )
& ( external_ties(X0,X2) = external_ties(X0,X1)
=> position(X0,X2) = position(X0,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_6) ).
fof(f8,axiom,
! [X0,X1,X2] :
( organization(X0)
=> external_ties(X0,X2) = external_ties(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_11) ).
fof(f9,conjecture,
! [X0,X1,X2] :
( ( organization(X0)
& greater(age(X0,X2),age(X0,X1)) )
=> position(X0,X2) = position(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_6) ).
fof(f10,negated_conjecture,
~ ! [X0,X1,X2] :
( ( organization(X0)
& greater(age(X0,X2),age(X0,X1)) )
=> position(X0,X2) = position(X0,X1) ),
inference(negated_conjecture,[status(cth)],[f9]) ).
fof(f16,plain,
! [X0,X1,X2] :
( ( ( greater(position(X0,X2),position(X0,X1))
| ~ greater(external_ties(X0,X2),external_ties(X0,X1)) )
& ( position(X0,X2) = position(X0,X1)
| external_ties(X0,X2) != external_ties(X0,X1) ) )
| ~ organization(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f17,plain,
! [X0,X1,X2] :
( external_ties(X0,X2) = external_ties(X0,X1)
| ~ organization(X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f18,plain,
? [X0,X1,X2] :
( position(X0,X2) != position(X0,X1)
& organization(X0)
& greater(age(X0,X2),age(X0,X1)) ),
inference(ennf_transformation,[],[f10]) ).
fof(f19,plain,
? [X0,X1,X2] :
( position(X0,X2) != position(X0,X1)
& organization(X0)
& greater(age(X0,X2),age(X0,X1)) ),
inference(flattening,[],[f18]) ).
fof(f20,plain,
( position(sK0,sK2) != position(sK0,sK1)
& organization(sK0)
& greater(age(sK0,sK2),age(sK0,sK1)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f19]) ).
fof(f25,plain,
! [X2,X0,X1] :
( position(X0,X2) = position(X0,X1)
| external_ties(X0,X2) != external_ties(X0,X1)
| ~ organization(X0) ),
inference(cnf_transformation,[],[f16]) ).
fof(f27,plain,
! [X2,X0,X1] :
( external_ties(X0,X2) = external_ties(X0,X1)
| ~ organization(X0) ),
inference(cnf_transformation,[],[f17]) ).
fof(f29,plain,
organization(sK0),
inference(cnf_transformation,[],[f20]) ).
fof(f30,plain,
position(sK0,sK2) != position(sK0,sK1),
inference(cnf_transformation,[],[f20]) ).
fof(f31,plain,
! [X2,X0,X1] :
( ~ organization(X0)
| position(X0,X2) = position(X0,X1) ),
inference(global_subsumption,[],[f25,f27]) ).
fof(f66,plain,
! [X0,X1] : position(sK0,X0) = position(sK0,X1),
inference(resolution,[],[f31,f29]) ).
fof(f74,plain,
! [X0] : position(sK0,sK1) != position(sK0,X0),
inference(superposition,[],[f30,f66]) ).
fof(f75,plain,
$false,
inference(forward_subsumption_resolution,[],[f74,f66]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT049+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37 % Computer : n026.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 27 17:30:26 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40 Running first-order model finding
% 0.10/0.40 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.10/0.45 % (3085375)Will run a generic schedule for satisfiability detection.
% 0.10/0.45 % (3085382)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1466479106:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.45 % (3085382) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3085375-3085382"...
% 0.10/0.45 % (3085382)...printing done.
% 0.10/0.45 % (3085381)% WARNING: option uhcvi not known.
% 0.10/0.45 % (3085382)Refutation found. Thanks to Tanya!
% 0.10/0.45 % SZS status Theorem for theBenchmark
% 0.10/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.45 % (3085382)------------------------------
% 0.10/0.45 % (3085382)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.45 % (3085382)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.45 % (3085382)CaDiCaL version: 2.1.3
% 0.10/0.45 % (3085382)Termination reason: Refutation
% 0.10/0.45 % (3085382)Time elapsed: 0.002 s
% 0.10/0.45 % (3085382)Peak memory usage: 11 MB
% 0.10/0.45 % (3085382)Instructions burned: 2 (million)
% 0.10/0.45 % (3085375)Success in time 0.038 s
% 0.10/0.45 % Vampire exiting
%------------------------------------------------------------------------------