%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT059+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n002.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:45 PM UTC 2026
% Result : Theorem 0.12s 0.44s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 19 ( 8 unt; 0 def)
% Number of atoms : 83 ( 27 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 91 ( 27 ~; 26 |; 29 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 20 ( 14 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0,X1] :
( organization(X0)
=> ( ( has_immunity(X0,X1)
=> hazard_of_mortality(X0,X1) = very_low )
& ( ~ has_immunity(X0,X1)
=> ( ( ( is_aligned(X0,X1)
& positional_advantage(X0,X1) )
=> hazard_of_mortality(X0,X1) = low )
& ( ( ~ is_aligned(X0,X1)
& positional_advantage(X0,X1) )
=> hazard_of_mortality(X0,X1) = mod1 )
& ( ( is_aligned(X0,X1)
& ~ positional_advantage(X0,X1) )
=> hazard_of_mortality(X0,X1) = mod2 )
& ( ( ~ is_aligned(X0,X1)
& ~ positional_advantage(X0,X1) )
=> hazard_of_mortality(X0,X1) = high ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_17) ).
fof(f8,conjecture,
! [X0,X1,X2] :
( ( organization(X0)
& has_immunity(X0,X1)
& has_immunity(X0,X2) )
=> hazard_of_mortality(X0,X1) = hazard_of_mortality(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_2) ).
fof(f9,negated_conjecture,
~ ! [X0,X1,X2] :
( ( organization(X0)
& has_immunity(X0,X1)
& has_immunity(X0,X2) )
=> hazard_of_mortality(X0,X1) = hazard_of_mortality(X0,X2) ),
inference(negated_conjecture,[status(cth)],[f8]) ).
fof(f15,plain,
! [X0,X1] :
( ( ( hazard_of_mortality(X0,X1) = very_low
| ~ has_immunity(X0,X1) )
& ( ( ( hazard_of_mortality(X0,X1) = low
| ~ is_aligned(X0,X1)
| ~ positional_advantage(X0,X1) )
& ( hazard_of_mortality(X0,X1) = mod1
| is_aligned(X0,X1)
| ~ positional_advantage(X0,X1) )
& ( hazard_of_mortality(X0,X1) = mod2
| ~ is_aligned(X0,X1)
| positional_advantage(X0,X1) )
& ( hazard_of_mortality(X0,X1) = high
| is_aligned(X0,X1)
| positional_advantage(X0,X1) ) )
| has_immunity(X0,X1) ) )
| ~ organization(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f16,plain,
! [X0,X1] :
( ( ( hazard_of_mortality(X0,X1) = very_low
| ~ has_immunity(X0,X1) )
& ( ( ( hazard_of_mortality(X0,X1) = low
| ~ is_aligned(X0,X1)
| ~ positional_advantage(X0,X1) )
& ( hazard_of_mortality(X0,X1) = mod1
| is_aligned(X0,X1)
| ~ positional_advantage(X0,X1) )
& ( hazard_of_mortality(X0,X1) = mod2
| ~ is_aligned(X0,X1)
| positional_advantage(X0,X1) )
& ( hazard_of_mortality(X0,X1) = high
| is_aligned(X0,X1)
| positional_advantage(X0,X1) ) )
| has_immunity(X0,X1) ) )
| ~ organization(X0) ),
inference(flattening,[],[f15]) ).
fof(f17,plain,
? [X0,X1,X2] :
( hazard_of_mortality(X0,X1) != hazard_of_mortality(X0,X2)
& organization(X0)
& has_immunity(X0,X1)
& has_immunity(X0,X2) ),
inference(ennf_transformation,[],[f9]) ).
fof(f18,plain,
? [X0,X1,X2] :
( hazard_of_mortality(X0,X1) != hazard_of_mortality(X0,X2)
& organization(X0)
& has_immunity(X0,X1)
& has_immunity(X0,X2) ),
inference(flattening,[],[f17]) ).
fof(f19,plain,
( hazard_of_mortality(sK0,sK1) != hazard_of_mortality(sK0,sK2)
& organization(sK0)
& has_immunity(sK0,sK1)
& has_immunity(sK0,sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f18]) ).
fof(f28,plain,
! [X0,X1] :
( ~ has_immunity(X0,X1)
| hazard_of_mortality(X0,X1) = very_low
| ~ organization(X0) ),
inference(cnf_transformation,[],[f16]) ).
fof(f29,plain,
has_immunity(sK0,sK2),
inference(cnf_transformation,[],[f19]) ).
fof(f30,plain,
has_immunity(sK0,sK1),
inference(cnf_transformation,[],[f19]) ).
fof(f31,plain,
organization(sK0),
inference(cnf_transformation,[],[f19]) ).
fof(f32,plain,
hazard_of_mortality(sK0,sK1) != hazard_of_mortality(sK0,sK2),
inference(cnf_transformation,[],[f19]) ).
fof(f133,plain,
( very_low = hazard_of_mortality(sK0,sK2)
| ~ organization(sK0) ),
inference(resolution,[],[f28,f29]) ).
fof(f134,plain,
( very_low = hazard_of_mortality(sK0,sK1)
| ~ organization(sK0) ),
inference(resolution,[],[f28,f30]) ).
fof(f135,plain,
very_low = hazard_of_mortality(sK0,sK1),
inference(forward_subsumption_resolution,[],[f134,f31]) ).
fof(f136,plain,
very_low = hazard_of_mortality(sK0,sK2),
inference(forward_subsumption_resolution,[],[f133,f31]) ).
fof(f143,plain,
very_low != hazard_of_mortality(sK0,sK1),
inference(superposition,[],[f32,f136]) ).
fof(f144,plain,
$false,
inference(forward_subsumption_resolution,[],[f143,f135]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT059+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.37 % Computer : n002.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Sun Sep 27 17:33:21 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.40 Running first-order model finding
% 0.12/0.40 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.12/0.44 % (3764213)Will run a generic schedule for satisfiability detection.
% 0.12/0.44 % (3764220)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2187363683:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.12/0.44 % (3764220) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3764213-3764220"...
% 0.12/0.44 % (3764220)...printing done.
% 0.12/0.44 % (3764220)Refutation found. Thanks to Tanya!
% 0.12/0.44 % SZS status Theorem for theBenchmark
% 0.12/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.44 % (3764220)------------------------------
% 0.12/0.44 % (3764220)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.44 % (3764220)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.44 % (3764220)CaDiCaL version: 2.1.3
% 0.12/0.44 % (3764220)Termination reason: Refutation
% 0.12/0.44 % (3764220)Time elapsed: 0.002 s
% 0.12/0.44 % (3764220)Peak memory usage: 11 MB
% 0.12/0.44 % (3764220)Instructions burned: 3 (million)
% 0.12/0.44 % (3764213)Success in time 0.032 s
% 0.12/0.44 % Vampire exiting
%------------------------------------------------------------------------------