%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT002+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n005.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:25 PM UTC 2026
% Result : Theorem 0.14s 0.48s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 7
% Syntax : Number of formulae : 59 ( 15 unt; 2 def)
% Number of atoms : 230 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 302 ( 131 ~; 117 |; 43 &)
% ( 5 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 3 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 139 ( 0 sgn 127 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( organization(X0,X1)
=> ? [X2] : reproducibility(X0,X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp3) ).
fof(f2,axiom,
! [X0,X1,X2] :
( reorganization_free(X0,X1,X2)
=> ( reorganization_free(X0,X1,X1)
& reorganization_free(X0,X2,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp4) ).
fof(f3,axiom,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ( organization(X0,X2)
& organization(X1,X3)
& reorganization_free(X0,X2,X2)
& reorganization_free(X1,X3,X3)
& reproducibility(X0,X4,X2)
& reproducibility(X1,X5,X3)
& inertia(X0,X6,X2)
& inertia(X1,X7,X3) )
=> ( greater(X5,X4)
<=> greater(X7,X6) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a3_FOL) ).
fof(f4,axiom,
! [X0,X1,X2,X3,X4] :
( ( organization(X0,X3)
& organization(X0,X4)
& reorganization_free(X0,X3,X4)
& reproducibility(X0,X1,X3)
& reproducibility(X0,X2,X4)
& greater(X4,X3) )
=> greater(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a4_FOL) ).
fof(f5,conjecture,
! [X0,X1,X2,X3,X4] :
( ( organization(X0,X3)
& organization(X0,X4)
& reorganization_free(X0,X3,X4)
& inertia(X0,X1,X3)
& inertia(X0,X2,X4)
& greater(X4,X3) )
=> greater(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_FOL) ).
fof(f6,negated_conjecture,
~ ! [X0,X1,X2,X3,X4] :
( ( organization(X0,X3)
& organization(X0,X4)
& reorganization_free(X0,X3,X4)
& inertia(X0,X1,X3)
& inertia(X0,X2,X4)
& greater(X4,X3) )
=> greater(X2,X1) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
fof(f7,plain,
! [X0,X1] :
( ? [X2] : reproducibility(X0,X2,X1)
| ~ organization(X0,X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f8,plain,
! [X0,X1,X2] :
( ( reorganization_free(X0,X1,X1)
& reorganization_free(X0,X2,X2) )
| ~ reorganization_free(X0,X1,X2) ),
inference(ennf_transformation,[],[f2]) ).
fof(f9,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ( greater(X5,X4)
<=> greater(X7,X6) )
| ~ organization(X0,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X0,X2,X2)
| ~ reorganization_free(X1,X3,X3)
| ~ reproducibility(X0,X4,X2)
| ~ reproducibility(X1,X5,X3)
| ~ inertia(X0,X6,X2)
| ~ inertia(X1,X7,X3) ),
inference(ennf_transformation,[],[f3]) ).
fof(f10,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ( greater(X5,X4)
<=> greater(X7,X6) )
| ~ organization(X0,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X0,X2,X2)
| ~ reorganization_free(X1,X3,X3)
| ~ reproducibility(X0,X4,X2)
| ~ reproducibility(X1,X5,X3)
| ~ inertia(X0,X6,X2)
| ~ inertia(X1,X7,X3) ),
inference(flattening,[],[f9]) ).
fof(f11,plain,
! [X0,X1,X2,X3,X4] :
( greater(X2,X1)
| ~ organization(X0,X3)
| ~ organization(X0,X4)
| ~ reorganization_free(X0,X3,X4)
| ~ reproducibility(X0,X1,X3)
| ~ reproducibility(X0,X2,X4)
| ~ greater(X4,X3) ),
inference(ennf_transformation,[],[f4]) ).
fof(f12,plain,
! [X0,X1,X2,X3,X4] :
( greater(X2,X1)
| ~ organization(X0,X3)
| ~ organization(X0,X4)
| ~ reorganization_free(X0,X3,X4)
| ~ reproducibility(X0,X1,X3)
| ~ reproducibility(X0,X2,X4)
| ~ greater(X4,X3) ),
inference(flattening,[],[f11]) ).
fof(f13,plain,
? [X0,X1,X2,X3,X4] :
( ~ greater(X2,X1)
& organization(X0,X3)
& organization(X0,X4)
& reorganization_free(X0,X3,X4)
& inertia(X0,X1,X3)
& inertia(X0,X2,X4)
& greater(X4,X3) ),
inference(ennf_transformation,[],[f6]) ).
fof(f14,plain,
? [X0,X1,X2,X3,X4] :
( ~ greater(X2,X1)
& organization(X0,X3)
& organization(X0,X4)
& reorganization_free(X0,X3,X4)
& inertia(X0,X1,X3)
& inertia(X0,X2,X4)
& greater(X4,X3) ),
inference(flattening,[],[f13]) ).
fof(f15,plain,
! [X0,X1] :
( reproducibility(X0,sK0(X0,X1),X1)
| ~ organization(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f7]) ).
fof(f16,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ( ( greater(X5,X4)
| ~ greater(X7,X6) )
& ( greater(X7,X6)
| ~ greater(X5,X4) ) )
| ~ organization(X0,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X0,X2,X2)
| ~ reorganization_free(X1,X3,X3)
| ~ reproducibility(X0,X4,X2)
| ~ reproducibility(X1,X5,X3)
| ~ inertia(X0,X6,X2)
| ~ inertia(X1,X7,X3) ),
inference(nnf_transformation,[],[f10]) ).
fof(f17,plain,
( ~ greater(sK3,sK2)
& organization(sK1,sK4)
& organization(sK1,sK5)
& reorganization_free(sK1,sK4,sK5)
& inertia(sK1,sK2,sK4)
& inertia(sK1,sK3,sK5)
& greater(sK5,sK4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4,sK5]),skolemize(X0,sK1),skolemize(X1,sK2),skolemize(X2,sK3),skolemize(X3,sK4),skolemize(X4,sK5)],[f14]) ).
fof(f18,plain,
! [X0,X1] :
( reproducibility(X0,sK0(X0,X1),X1)
| ~ organization(X0,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f19,plain,
! [X2,X0,X1] :
( ~ reorganization_free(X0,X1,X2)
| reorganization_free(X0,X2,X2) ),
inference(cnf_transformation,[],[f8]) ).
fof(f20,plain,
! [X2,X0,X1] :
( ~ reorganization_free(X0,X1,X2)
| reorganization_free(X0,X1,X1) ),
inference(cnf_transformation,[],[f8]) ).
fof(f21,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( ~ inertia(X1,X7,X3)
| ~ greater(X5,X4)
| ~ organization(X0,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X0,X2,X2)
| ~ reorganization_free(X1,X3,X3)
| ~ reproducibility(X0,X4,X2)
| ~ reproducibility(X1,X5,X3)
| ~ inertia(X0,X6,X2)
| greater(X7,X6) ),
inference(cnf_transformation,[],[f16]) ).
fof(f23,plain,
! [X2,X3,X0,X1,X4] :
( ~ reorganization_free(X0,X3,X4)
| ~ organization(X0,X3)
| ~ organization(X0,X4)
| greater(X2,X1)
| ~ reproducibility(X0,X1,X3)
| ~ reproducibility(X0,X2,X4)
| ~ greater(X4,X3) ),
inference(cnf_transformation,[],[f12]) ).
fof(f24,plain,
greater(sK5,sK4),
inference(cnf_transformation,[],[f17]) ).
fof(f25,plain,
inertia(sK1,sK3,sK5),
inference(cnf_transformation,[],[f17]) ).
fof(f26,plain,
inertia(sK1,sK2,sK4),
inference(cnf_transformation,[],[f17]) ).
fof(f27,plain,
reorganization_free(sK1,sK4,sK5),
inference(cnf_transformation,[],[f17]) ).
fof(f28,plain,
organization(sK1,sK5),
inference(cnf_transformation,[],[f17]) ).
fof(f29,plain,
organization(sK1,sK4),
inference(cnf_transformation,[],[f17]) ).
fof(f30,plain,
~ greater(sK3,sK2),
inference(cnf_transformation,[],[f17]) ).
fof(f31,plain,
reorganization_free(sK1,sK5,sK5),
inference(resolution,[],[f19,f27]) ).
fof(f33,plain,
reorganization_free(sK1,sK4,sK4),
inference(resolution,[],[f20,f27]) ).
fof(f37,plain,
! [X0,X1] :
( ~ organization(sK1,sK4)
| ~ organization(sK1,sK5)
| greater(X0,X1)
| ~ reproducibility(sK1,X1,sK4)
| ~ reproducibility(sK1,X0,sK5)
| ~ greater(sK5,sK4) ),
inference(resolution,[],[f23,f27]) ).
fof(f44,plain,
! [X0,X1] :
( ~ organization(sK1,sK5)
| greater(X0,X1)
| ~ reproducibility(sK1,X1,sK4)
| ~ reproducibility(sK1,X0,sK5)
| ~ greater(sK5,sK4) ),
inference(forward_subsumption_resolution,[],[f37,f29]) ).
fof(f61,plain,
! [X0,X1] :
( greater(X0,X1)
| ~ reproducibility(sK1,X1,sK4)
| ~ reproducibility(sK1,X0,sK5)
| ~ greater(sK5,sK4) ),
inference(forward_subsumption_resolution,[],[f44,f28]) ).
fof(f62,plain,
! [X0,X1] :
( ~ reproducibility(sK1,X1,sK4)
| greater(X0,X1)
| ~ reproducibility(sK1,X0,sK5) ),
inference(forward_subsumption_resolution,[],[f61,f24]) ).
fof(f63,plain,
! [X2,X3,X0,X1,X4] :
( ~ greater(X0,X1)
| ~ organization(X2,X3)
| ~ organization(sK1,sK5)
| ~ reorganization_free(X2,X3,X3)
| ~ reorganization_free(sK1,sK5,sK5)
| ~ reproducibility(X2,X1,X3)
| ~ reproducibility(sK1,X0,sK5)
| ~ inertia(X2,X4,X3)
| greater(sK3,X4) ),
inference(resolution,[],[f21,f25]) ).
fof(f66,plain,
! [X2,X3,X0,X1,X4] :
( ~ greater(X0,X1)
| ~ organization(X2,X3)
| ~ reorganization_free(X2,X3,X3)
| ~ reorganization_free(sK1,sK5,sK5)
| ~ reproducibility(X2,X1,X3)
| ~ reproducibility(sK1,X0,sK5)
| ~ inertia(X2,X4,X3)
| greater(sK3,X4) ),
inference(forward_subsumption_resolution,[],[f63,f28]) ).
fof(f68,plain,
! [X2,X3,X0,X1,X4] :
( ~ inertia(X2,X4,X3)
| ~ organization(X2,X3)
| ~ reorganization_free(X2,X3,X3)
| ~ reproducibility(X2,X1,X3)
| ~ reproducibility(sK1,X0,sK5)
| ~ greater(X0,X1)
| greater(sK3,X4) ),
inference(forward_subsumption_resolution,[],[f66,f31]) ).
fof(f100,plain,
! [X0,X1] :
( ~ organization(sK1,sK4)
| ~ reorganization_free(sK1,sK4,sK4)
| ~ reproducibility(sK1,X0,sK4)
| ~ reproducibility(sK1,X1,sK5)
| ~ greater(X1,X0)
| greater(sK3,sK2) ),
inference(resolution,[],[f68,f26]) ).
fof(f101,plain,
! [X0,X1] :
( ~ organization(sK1,sK4)
| ~ reorganization_free(sK1,sK4,sK4)
| ~ reproducibility(sK1,X0,sK4)
| ~ reproducibility(sK1,X1,sK5)
| greater(sK3,sK2) ),
inference(forward_subsumption_resolution,[],[f100,f62]) ).
fof(f103,plain,
! [X0,X1] :
( ~ reorganization_free(sK1,sK4,sK4)
| ~ reproducibility(sK1,X0,sK4)
| ~ reproducibility(sK1,X1,sK5)
| greater(sK3,sK2) ),
inference(forward_subsumption_resolution,[],[f101,f29]) ).
fof(f105,plain,
! [X0,X1] :
( ~ reproducibility(sK1,X0,sK4)
| ~ reproducibility(sK1,X1,sK5)
| greater(sK3,sK2) ),
inference(forward_subsumption_resolution,[],[f103,f33]) ).
fof(f114,plain,
! [X0,X1] :
( ~ reproducibility(sK1,X0,sK4)
| ~ reproducibility(sK1,X1,sK5) ),
inference(forward_subsumption_resolution,[],[f105,f30]) ).
fof(f116,definition,
( spl6_11
<=> ! [X1] : ~ reproducibility(sK1,X1,sK5) ),
introduced(definition,[new_symbols(definition,[spl6_11])],[avatar_definition]) ).
fof(f117,plain,
( ! [X1] : ~ reproducibility(sK1,X1,sK5)
| ~ spl6_11 ),
inference(avatar_component_clause,[],[f116]) ).
fof(f119,definition,
( spl6_12
<=> ! [X0] : ~ reproducibility(sK1,X0,sK4) ),
introduced(definition,[new_symbols(definition,[spl6_12])],[avatar_definition]) ).
fof(f120,plain,
( ! [X0] : ~ reproducibility(sK1,X0,sK4)
| ~ spl6_12 ),
inference(avatar_component_clause,[],[f119]) ).
fof(f121,plain,
( spl6_11
| spl6_12 ),
inference(avatar_split_clause,[],[f114,f119,f116]) ).
fof(f137,plain,
( ~ organization(sK1,sK5)
| ~ spl6_11 ),
inference(resolution,[],[f117,f18]) ).
fof(f138,plain,
( $false
| ~ spl6_11 ),
inference(forward_subsumption_resolution,[],[f137,f28]) ).
fof(f139,plain,
~ spl6_11,
inference(avatar_contradiction_clause,[],[f138]) ).
fof(f140,plain,
( ~ organization(sK1,sK4)
| ~ spl6_12 ),
inference(resolution,[],[f120,f18]) ).
fof(f141,plain,
( $false
| ~ spl6_12 ),
inference(forward_subsumption_resolution,[],[f140,f29]) ).
fof(f142,plain,
~ spl6_12,
inference(avatar_contradiction_clause,[],[f141]) ).
cnf(s6,plain,
( spl6_11
| spl6_12 ),
inference(sat_conversion,[],[f121]) ).
cnf(s10,plain,
~ spl6_11,
inference(sat_conversion,[],[f139]) ).
cnf(s11,plain,
~ spl6_12,
inference(sat_conversion,[],[f142]) ).
cnf(s12,plain,
$false,
inference(rat,[],[s6,s11,s10]) ).
fof(f143,plain,
$false,
inference(avatar_sat_refutation,[],[s12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT002+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.40 % Computer : n005.cluster.edu
% 0.09/0.40 % Model : x86_64 x86_64
% 0.09/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.40 % Memory : 8046.5625MB
% 0.09/0.40 % OS : Linux 6.8.0-71-generic
% 0.09/0.40 % CPULimit : 300
% 0.09/0.40 % WCLimit : 300
% 0.09/0.40 % DateTime : Sun Sep 27 17:15:18 UTC 2026
% 0.09/0.41 % CPUTime :
% 0.09/0.41 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.44 Running first-order model finding
% 0.09/0.44 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.14/0.48 % (33043)Will run a generic schedule for satisfiability detection.
% 0.14/0.48 % (33059)dis+10_1_sil=32000:sp=arity:random_seed=101160989:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.14/0.48 % (33059) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-33043-33059"...
% 0.14/0.48 % (33059)...printing done.
% 0.14/0.48 % (33057)% WARNING: option uhcvi not known.
% 0.14/0.48 % (33059)Refutation found. Thanks to Tanya!
% 0.14/0.48 % SZS status Theorem for theBenchmark
% 0.14/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.48 % (33059)------------------------------
% 0.14/0.48 % (33059)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.14/0.48 % (33059)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.14/0.48 % (33059)CaDiCaL version: 2.1.3
% 0.14/0.48 % (33059)Termination reason: Refutation
% 0.14/0.48 % (33059)Time elapsed: 0.002 s
% 0.14/0.48 % (33059)Peak memory usage: 12 MB
% 0.14/0.48 % (33059)Instructions burned: 5 (million)
% 0.14/0.48 % (33043)Success in time 0.031 s
% 0.14/0.48 % Vampire exiting
%------------------------------------------------------------------------------