%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT011+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:28 PM UTC 2026
% Result : Theorem 0.18s 0.53s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 9
% Syntax : Number of formulae : 75 ( 17 unt; 2 def)
% Number of atoms : 274 ( 11 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 363 ( 164 ~; 150 |; 40 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 3 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 165 ( 0 sgn 151 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( organization(X0,X1)
=> ? [X2] : inertia(X0,X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp5) ).
fof(f3,axiom,
! [X0,X1] :
~ ( greater(X0,X1)
& greater(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp6_2) ).
fof(f4,axiom,
! [X0,X1] :
( organization(X0,X1)
=> ? [X2] : class(X0,X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp9) ).
fof(f5,axiom,
! [X0,X1,X2,X3,X4] :
( ( organization(X0,X1)
& organization(X0,X2)
& reorganization_free(X0,X1,X2)
& class(X0,X3,X1)
& class(X0,X4,X2) )
=> X3 = X4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp10) ).
fof(f6,axiom,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( ( organization(X0,X7)
& organization(X1,X8)
& class(X0,X2,X7)
& class(X1,X2,X8)
& size(X0,X3,X7)
& size(X1,X4,X8)
& inertia(X0,X5,X7)
& inertia(X1,X6,X8)
& greater(X4,X3) )
=> greater(X6,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a5_FOL) ).
fof(f7,axiom,
! [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(f8,conjecture,
! [X0,X1,X2,X3,X4] :
( ( organization(X0,X3)
& organization(X0,X4)
& reorganization_free(X0,X3,X4)
& size(X0,X1,X3)
& size(X0,X2,X4)
& greater(X4,X3) )
=> ~ greater(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t11_FOL) ).
fof(f9,negated_conjecture,
~ ! [X0,X1,X2,X3,X4] :
( ( organization(X0,X3)
& organization(X0,X4)
& reorganization_free(X0,X3,X4)
& size(X0,X1,X3)
& size(X0,X2,X4)
& greater(X4,X3) )
=> ~ greater(X1,X2) ),
inference(negated_conjecture,[status(cth)],[f8]) ).
fof(f10,plain,
! [X0,X1] :
( ? [X2] : inertia(X0,X2,X1)
| ~ organization(X0,X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f12,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| ~ greater(X1,X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f13,plain,
! [X0,X1] :
( ? [X2] : class(X0,X2,X1)
| ~ organization(X0,X1) ),
inference(ennf_transformation,[],[f4]) ).
fof(f14,plain,
! [X0,X1,X2,X3,X4] :
( X3 = X4
| ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ reorganization_free(X0,X1,X2)
| ~ class(X0,X3,X1)
| ~ class(X0,X4,X2) ),
inference(ennf_transformation,[],[f5]) ).
fof(f15,plain,
! [X0,X1,X2,X3,X4] :
( X3 = X4
| ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ reorganization_free(X0,X1,X2)
| ~ class(X0,X3,X1)
| ~ class(X0,X4,X2) ),
inference(flattening,[],[f14]) ).
fof(f16,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( greater(X6,X5)
| ~ organization(X0,X7)
| ~ organization(X1,X8)
| ~ class(X0,X2,X7)
| ~ class(X1,X2,X8)
| ~ size(X0,X3,X7)
| ~ size(X1,X4,X8)
| ~ inertia(X0,X5,X7)
| ~ inertia(X1,X6,X8)
| ~ greater(X4,X3) ),
inference(ennf_transformation,[],[f6]) ).
fof(f17,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( greater(X6,X5)
| ~ organization(X0,X7)
| ~ organization(X1,X8)
| ~ class(X0,X2,X7)
| ~ class(X1,X2,X8)
| ~ size(X0,X3,X7)
| ~ size(X1,X4,X8)
| ~ inertia(X0,X5,X7)
| ~ inertia(X1,X6,X8)
| ~ greater(X4,X3) ),
inference(flattening,[],[f16]) ).
fof(f18,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,[],[f7]) ).
fof(f19,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,[],[f18]) ).
fof(f20,plain,
? [X0,X1,X2,X3,X4] :
( greater(X1,X2)
& organization(X0,X3)
& organization(X0,X4)
& reorganization_free(X0,X3,X4)
& size(X0,X1,X3)
& size(X0,X2,X4)
& greater(X4,X3) ),
inference(ennf_transformation,[],[f9]) ).
fof(f21,plain,
? [X0,X1,X2,X3,X4] :
( greater(X1,X2)
& organization(X0,X3)
& organization(X0,X4)
& reorganization_free(X0,X3,X4)
& size(X0,X1,X3)
& size(X0,X2,X4)
& greater(X4,X3) ),
inference(flattening,[],[f20]) ).
fof(f22,plain,
! [X0,X1] :
( inertia(X0,sK0(X0,X1),X1)
| ~ organization(X0,X1) ),
inference(cnf_transformation,[],[f10]) ).
fof(f24,plain,
! [X0,X1] :
( ~ greater(X1,X0)
| ~ greater(X0,X1) ),
inference(cnf_transformation,[],[f12]) ).
fof(f25,plain,
! [X0,X1] :
( class(X0,sK1(X0,X1),X1)
| ~ organization(X0,X1) ),
inference(cnf_transformation,[],[f13]) ).
fof(f26,plain,
! [X2,X3,X0,X1,X4] :
( ~ reorganization_free(X0,X1,X2)
| ~ class(X0,X3,X1)
| ~ class(X0,X4,X2)
| ~ organization(X0,X2)
| ~ organization(X0,X1)
| X3 = X4 ),
inference(cnf_transformation,[],[f15]) ).
fof(f27,plain,
! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
( ~ size(X1,X4,X8)
| ~ size(X0,X3,X7)
| ~ inertia(X0,X5,X7)
| ~ greater(X4,X3)
| ~ inertia(X1,X6,X8)
| ~ class(X1,X2,X8)
| ~ class(X0,X2,X7)
| ~ organization(X1,X8)
| ~ organization(X0,X7)
| greater(X6,X5) ),
inference(cnf_transformation,[],[f17]) ).
fof(f28,plain,
! [X2,X3,X0,X1,X4] :
( ~ reorganization_free(X0,X3,X4)
| ~ inertia(X0,X2,X4)
| ~ inertia(X0,X1,X3)
| ~ greater(X4,X3)
| ~ organization(X0,X4)
| ~ organization(X0,X3)
| greater(X2,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f29,plain,
greater(sK6,sK5),
inference(cnf_transformation,[],[f21]) ).
fof(f30,plain,
size(sK2,sK4,sK6),
inference(cnf_transformation,[],[f21]) ).
fof(f31,plain,
size(sK2,sK3,sK5),
inference(cnf_transformation,[],[f21]) ).
fof(f32,plain,
reorganization_free(sK2,sK5,sK6),
inference(cnf_transformation,[],[f21]) ).
fof(f33,plain,
organization(sK2,sK6),
inference(cnf_transformation,[],[f21]) ).
fof(f34,plain,
organization(sK2,sK5),
inference(cnf_transformation,[],[f21]) ).
fof(f35,plain,
greater(sK3,sK4),
inference(cnf_transformation,[],[f21]) ).
fof(f39,plain,
! [X0,X1] :
( ~ class(sK2,X0,sK5)
| ~ class(sK2,X1,sK6)
| ~ organization(sK2,sK6)
| ~ organization(sK2,sK5)
| X0 = X1 ),
inference(resolution,[],[f26,f32]) ).
fof(f40,plain,
! [X0,X1] :
( ~ class(sK2,X0,sK5)
| ~ class(sK2,X1,sK6)
| ~ organization(sK2,sK5)
| X0 = X1 ),
inference(forward_subsumption_resolution,[],[f39,f33]) ).
fof(f41,plain,
! [X0,X1] :
( ~ class(sK2,X0,sK5)
| ~ class(sK2,X1,sK6)
| X0 = X1 ),
inference(forward_subsumption_resolution,[],[f40,f34]) ).
fof(f42,plain,
! [X0,X1] :
( ~ inertia(sK2,X0,sK6)
| ~ inertia(sK2,X1,sK5)
| ~ greater(sK6,sK5)
| ~ organization(sK2,sK6)
| ~ organization(sK2,sK5)
| greater(X0,X1) ),
inference(resolution,[],[f28,f32]) ).
fof(f43,plain,
! [X0,X1] :
( ~ inertia(sK2,X0,sK6)
| ~ inertia(sK2,X1,sK5)
| ~ organization(sK2,sK6)
| ~ organization(sK2,sK5)
| greater(X0,X1) ),
inference(forward_subsumption_resolution,[],[f42,f29]) ).
fof(f44,plain,
! [X0,X1] :
( ~ inertia(sK2,X0,sK6)
| ~ inertia(sK2,X1,sK5)
| ~ organization(sK2,sK5)
| greater(X0,X1) ),
inference(forward_subsumption_resolution,[],[f43,f33]) ).
fof(f45,plain,
! [X0,X1] :
( ~ inertia(sK2,X0,sK6)
| ~ inertia(sK2,X1,sK5)
| greater(X0,X1) ),
inference(forward_subsumption_resolution,[],[f44,f34]) ).
fof(f47,plain,
! [X0] :
( ~ class(sK2,X0,sK5)
| sK1(sK2,sK6) = X0
| ~ organization(sK2,sK6) ),
inference(resolution,[],[f41,f25]) ).
fof(f48,plain,
! [X0] :
( ~ class(sK2,X0,sK5)
| sK1(sK2,sK6) = X0 ),
inference(forward_subsumption_resolution,[],[f47,f33]) ).
fof(f52,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ size(X0,X1,X2)
| ~ inertia(sK2,X3,sK6)
| ~ greater(X1,sK4)
| ~ inertia(X0,X4,X2)
| ~ class(X0,X5,X2)
| ~ class(sK2,X5,sK6)
| ~ organization(X0,X2)
| ~ organization(sK2,sK6)
| greater(X4,X3) ),
inference(resolution,[],[f27,f30]) ).
fof(f55,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ size(X0,X1,X2)
| ~ inertia(sK2,X3,sK6)
| ~ greater(X1,sK4)
| ~ inertia(X0,X4,X2)
| ~ class(X0,X5,X2)
| ~ class(sK2,X5,sK6)
| ~ organization(X0,X2)
| greater(X4,X3) ),
inference(forward_subsumption_resolution,[],[f52,f33]) ).
fof(f58,plain,
( sK1(sK2,sK5) = sK1(sK2,sK6)
| ~ organization(sK2,sK5) ),
inference(resolution,[],[f48,f25]) ).
fof(f59,plain,
sK1(sK2,sK5) = sK1(sK2,sK6),
inference(forward_subsumption_resolution,[],[f58,f34]) ).
fof(f61,plain,
! [X0] :
( ~ inertia(sK2,X0,sK6)
| greater(X0,sK0(sK2,sK5))
| ~ organization(sK2,sK5) ),
inference(resolution,[],[f45,f22]) ).
fof(f62,plain,
! [X0] :
( ~ inertia(sK2,X0,sK6)
| greater(X0,sK0(sK2,sK5)) ),
inference(forward_subsumption_resolution,[],[f61,f34]) ).
fof(f64,plain,
( class(sK2,sK1(sK2,sK5),sK6)
| ~ organization(sK2,sK6) ),
inference(superposition,[],[f25,f59]) ).
fof(f65,plain,
class(sK2,sK1(sK2,sK5),sK6),
inference(forward_subsumption_resolution,[],[f64,f33]) ).
fof(f71,plain,
! [X2,X0,X1] :
( ~ inertia(sK2,X0,sK6)
| ~ greater(sK3,sK4)
| ~ inertia(sK2,X1,sK5)
| ~ class(sK2,X2,sK5)
| ~ class(sK2,X2,sK6)
| ~ organization(sK2,sK5)
| greater(X1,X0) ),
inference(resolution,[],[f55,f31]) ).
fof(f73,plain,
! [X2,X0,X1] :
( ~ inertia(sK2,X0,sK6)
| ~ inertia(sK2,X1,sK5)
| ~ class(sK2,X2,sK5)
| ~ class(sK2,X2,sK6)
| ~ organization(sK2,sK5)
| greater(X1,X0) ),
inference(forward_subsumption_resolution,[],[f71,f35]) ).
fof(f74,plain,
! [X2,X0,X1] :
( ~ inertia(sK2,X0,sK6)
| ~ inertia(sK2,X1,sK5)
| ~ class(sK2,X2,sK5)
| ~ class(sK2,X2,sK6)
| greater(X1,X0) ),
inference(forward_subsumption_resolution,[],[f73,f34]) ).
fof(f76,definition,
( spl7_1
<=> ! [X2] :
( ~ class(sK2,X2,sK5)
| ~ class(sK2,X2,sK6) ) ),
introduced(definition,[new_symbols(definition,[spl7_1])],[avatar_definition]) ).
fof(f77,plain,
( ! [X2] :
( ~ class(sK2,X2,sK6)
| ~ class(sK2,X2,sK5) )
| ~ spl7_1 ),
inference(avatar_component_clause,[],[f76]) ).
fof(f79,definition,
( spl7_2
<=> ! [X0,X1] :
( ~ inertia(sK2,X0,sK6)
| ~ inertia(sK2,X1,sK5)
| greater(X1,X0) ) ),
introduced(definition,[new_symbols(definition,[spl7_2])],[avatar_definition]) ).
fof(f80,plain,
( ! [X0,X1] :
( ~ inertia(sK2,X0,sK6)
| ~ inertia(sK2,X1,sK5)
| greater(X1,X0) )
| ~ spl7_2 ),
inference(avatar_component_clause,[],[f79]) ).
fof(f81,plain,
( spl7_1
| spl7_2 ),
inference(avatar_split_clause,[],[f74,f79,f76]) ).
fof(f87,plain,
( greater(sK0(sK2,sK6),sK0(sK2,sK5))
| ~ organization(sK2,sK6) ),
inference(resolution,[],[f62,f22]) ).
fof(f88,plain,
greater(sK0(sK2,sK6),sK0(sK2,sK5)),
inference(forward_subsumption_resolution,[],[f87,f33]) ).
fof(f93,plain,
~ greater(sK0(sK2,sK5),sK0(sK2,sK6)),
inference(resolution,[],[f88,f24]) ).
fof(f96,plain,
( ! [X0] :
( ~ inertia(sK2,X0,sK6)
| greater(sK0(sK2,sK5),X0)
| ~ organization(sK2,sK5) )
| ~ spl7_2 ),
inference(resolution,[],[f80,f22]) ).
fof(f97,plain,
( ! [X0] :
( ~ inertia(sK2,X0,sK6)
| greater(sK0(sK2,sK5),X0) )
| ~ spl7_2 ),
inference(forward_subsumption_resolution,[],[f96,f34]) ).
fof(f99,plain,
( greater(sK0(sK2,sK5),sK0(sK2,sK6))
| ~ organization(sK2,sK6)
| ~ spl7_2 ),
inference(resolution,[],[f97,f22]) ).
fof(f100,plain,
( ~ organization(sK2,sK6)
| ~ spl7_2 ),
inference(forward_subsumption_resolution,[],[f99,f93]) ).
fof(f101,plain,
( $false
| ~ spl7_2 ),
inference(forward_subsumption_resolution,[],[f100,f33]) ).
fof(f102,plain,
~ spl7_2,
inference(avatar_contradiction_clause,[],[f101]) ).
fof(f103,plain,
( ~ class(sK2,sK1(sK2,sK5),sK5)
| ~ spl7_1 ),
inference(resolution,[],[f77,f65]) ).
fof(f107,plain,
( ~ organization(sK2,sK5)
| ~ spl7_1 ),
inference(resolution,[],[f103,f25]) ).
fof(f108,plain,
( $false
| ~ spl7_1 ),
inference(forward_subsumption_resolution,[],[f107,f34]) ).
fof(f109,plain,
~ spl7_1,
inference(avatar_contradiction_clause,[],[f108]) ).
cnf(s1,plain,
( spl7_1
| spl7_2 ),
inference(sat_conversion,[],[f81]) ).
cnf(s2,plain,
~ spl7_2,
inference(sat_conversion,[],[f102]) ).
cnf(s3,plain,
~ spl7_1,
inference(sat_conversion,[],[f109]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s1,s2,s3]) ).
fof(f110,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : MGT011+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.10 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.18/0.46 % Computer : n005.cluster.edu
% 0.18/0.46 % Model : x86_64 x86_64
% 0.18/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.46 % Memory : 8046.5625MB
% 0.18/0.46 % OS : Linux 6.8.0-71-generic
% 0.18/0.46 % CPULimit : 300
% 0.18/0.46 % WCLimit : 300
% 0.18/0.46 % DateTime : Sun Sep 27 17:16:02 UTC 2026
% 0.18/0.46 % CPUTime :
% 0.18/0.46 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.18/0.49 Running first-order model finding
% 0.18/0.49 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.18/0.53 % (35174)Will run a generic schedule for satisfiability detection.
% 0.18/0.53 % (35183)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=971630284:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.53 % (35180)% WARNING: option uhcvi not known.
% 0.18/0.53 % (35183) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-35174-35183"...
% 0.18/0.53 % (35183)...printing done.
% 0.18/0.53 % (35183)Refutation found. Thanks to Tanya!
% 0.18/0.53 % SZS status Theorem for theBenchmark
% 0.18/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.53 % (35183)------------------------------
% 0.18/0.53 % (35183)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.53 % (35183)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.53 % (35183)CaDiCaL version: 2.1.3
% 0.18/0.53 % (35183)Termination reason: Refutation
% 0.18/0.53 % (35183)Time elapsed: 0.003 s
% 0.18/0.53 % (35183)Peak memory usage: 12 MB
% 0.18/0.53 % (35183)Instructions burned: 6 (million)
% 0.18/0.53 % (35174)Success in time 0.029 s
% 0.18/0.53 % Vampire exiting
%------------------------------------------------------------------------------