%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT011-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 : n018.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 : Unsatisfiable 0.18s 0.47s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 15
% Syntax : Number of formulae : 56 ( 17 unt; 2 def)
% Number of atoms : 165 ( 8 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 225 ( 116 ~; 107 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 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 : 72 ( 0 sgn 72 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( inertia(X0,sk1(X1,X0),X1)
| ~ organization(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp5_20) ).
fof(f3,axiom,
! [X0,X1] :
( ~ greater(X0,X1)
| ~ greater(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp6_2_22) ).
fof(f4,axiom,
! [X0,X1] :
( class(X0,sk2(X1,X0),X1)
| ~ organization(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp9_23) ).
fof(f5,axiom,
! [X2,X3,X0,X1,X4] :
( ~ reorganization_free(X0,X1,X2)
| ~ organization(X0,X2)
| ~ organization(X0,X1)
| ~ class(X0,X3,X1)
| ~ class(X0,X4,X2)
| X3 = X4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp10_24) ).
fof(f6,axiom,
! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
( ~ size(X0,X5,X1)
| ~ size(X2,X6,X3)
| ~ class(X0,X4,X1)
| ~ class(X2,X4,X3)
| ~ organization(X0,X1)
| ~ organization(X2,X3)
| ~ inertia(X0,X7,X1)
| ~ inertia(X2,X8,X3)
| ~ greater(X6,X5)
| greater(X8,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a5_FOL_25) ).
fof(f7,axiom,
! [X2,X3,X0,X1,X4] :
( ~ reorganization_free(X0,X1,X2)
| ~ organization(X0,X2)
| ~ organization(X0,X1)
| ~ inertia(X0,X3,X1)
| ~ inertia(X0,X4,X2)
| ~ greater(X2,X1)
| greater(X4,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_FOL_26) ).
fof(f8,negated_conjecture,
organization(sk3,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t11_FOL_27) ).
fof(f9,negated_conjecture,
organization(sk3,sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t11_FOL_28) ).
fof(f10,negated_conjecture,
reorganization_free(sk3,sk6,sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t11_FOL_29) ).
fof(f11,negated_conjecture,
size(sk3,sk4,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t11_FOL_30) ).
fof(f12,negated_conjecture,
size(sk3,sk5,sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t11_FOL_31) ).
fof(f13,negated_conjecture,
greater(sk7,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t11_FOL_32) ).
fof(f14,negated_conjecture,
greater(sk4,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t11_FOL_33) ).
fof(f18,plain,
! [X0,X1] :
( ~ organization(sk3,sk7)
| ~ organization(sk3,sk6)
| ~ class(sk3,X0,sk6)
| ~ class(sk3,X1,sk7)
| X0 = X1 ),
inference(resolution,[],[f5,f10]) ).
fof(f19,plain,
! [X0,X1] :
( ~ organization(sk3,sk6)
| ~ class(sk3,X0,sk6)
| ~ class(sk3,X1,sk7)
| X0 = X1 ),
inference(forward_subsumption_resolution,[],[f18,f9]) ).
fof(f20,plain,
! [X0,X1] :
( ~ class(sk3,X0,sk6)
| ~ class(sk3,X1,sk7)
| X0 = X1 ),
inference(forward_subsumption_resolution,[],[f19,f8]) ).
fof(f21,plain,
! [X0,X1] :
( ~ organization(sk3,sk7)
| ~ organization(sk3,sk6)
| ~ inertia(sk3,X0,sk6)
| ~ inertia(sk3,X1,sk7)
| ~ greater(sk7,sk6)
| greater(X1,X0) ),
inference(resolution,[],[f7,f10]) ).
fof(f22,plain,
! [X0,X1] :
( ~ organization(sk3,sk6)
| ~ inertia(sk3,X0,sk6)
| ~ inertia(sk3,X1,sk7)
| ~ greater(sk7,sk6)
| greater(X1,X0) ),
inference(forward_subsumption_resolution,[],[f21,f9]) ).
fof(f23,plain,
! [X0,X1] :
( ~ inertia(sk3,X0,sk6)
| ~ inertia(sk3,X1,sk7)
| ~ greater(sk7,sk6)
| greater(X1,X0) ),
inference(forward_subsumption_resolution,[],[f22,f8]) ).
fof(f24,plain,
! [X0,X1] :
( ~ inertia(sk3,X0,sk6)
| ~ inertia(sk3,X1,sk7)
| greater(X1,X0) ),
inference(forward_subsumption_resolution,[],[f23,f13]) ).
fof(f26,plain,
! [X0] :
( ~ class(sk3,X0,sk6)
| sk2(sk7,sk3) = X0
| ~ organization(sk3,sk7) ),
inference(resolution,[],[f20,f4]) ).
fof(f27,plain,
! [X0] :
( ~ class(sk3,X0,sk6)
| sk2(sk7,sk3) = X0 ),
inference(forward_subsumption_resolution,[],[f26,f9]) ).
fof(f31,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ size(X0,X1,X2)
| ~ class(X0,X3,X2)
| ~ class(sk3,X3,sk6)
| ~ organization(X0,X2)
| ~ organization(sk3,sk6)
| ~ inertia(X0,X4,X2)
| ~ inertia(sk3,X5,sk6)
| ~ greater(sk4,X1)
| greater(X5,X4) ),
inference(resolution,[],[f6,f11]) ).
fof(f34,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ size(X0,X1,X2)
| ~ class(X0,X3,X2)
| ~ class(sk3,X3,sk6)
| ~ organization(X0,X2)
| ~ inertia(X0,X4,X2)
| ~ inertia(sk3,X5,sk6)
| ~ greater(sk4,X1)
| greater(X5,X4) ),
inference(forward_subsumption_resolution,[],[f31,f8]) ).
fof(f37,plain,
( sk2(sk6,sk3) = sk2(sk7,sk3)
| ~ organization(sk3,sk6) ),
inference(resolution,[],[f27,f4]) ).
fof(f38,plain,
sk2(sk6,sk3) = sk2(sk7,sk3),
inference(forward_subsumption_resolution,[],[f37,f8]) ).
fof(f40,plain,
! [X0] :
( ~ inertia(sk3,X0,sk6)
| greater(sk1(sk7,sk3),X0)
| ~ organization(sk3,sk7) ),
inference(resolution,[],[f24,f1]) ).
fof(f41,plain,
! [X0] :
( ~ inertia(sk3,X0,sk6)
| greater(sk1(sk7,sk3),X0) ),
inference(forward_subsumption_resolution,[],[f40,f9]) ).
fof(f43,plain,
( class(sk3,sk2(sk6,sk3),sk7)
| ~ organization(sk3,sk7) ),
inference(superposition,[],[f4,f38]) ).
fof(f44,plain,
class(sk3,sk2(sk6,sk3),sk7),
inference(forward_subsumption_resolution,[],[f43,f9]) ).
fof(f50,plain,
! [X2,X0,X1] :
( ~ class(sk3,X0,sk7)
| ~ class(sk3,X0,sk6)
| ~ organization(sk3,sk7)
| ~ inertia(sk3,X1,sk7)
| ~ inertia(sk3,X2,sk6)
| ~ greater(sk4,sk5)
| greater(X2,X1) ),
inference(resolution,[],[f34,f12]) ).
fof(f52,plain,
! [X2,X0,X1] :
( ~ class(sk3,X0,sk7)
| ~ class(sk3,X0,sk6)
| ~ inertia(sk3,X1,sk7)
| ~ inertia(sk3,X2,sk6)
| ~ greater(sk4,sk5)
| greater(X2,X1) ),
inference(forward_subsumption_resolution,[],[f50,f9]) ).
fof(f53,plain,
! [X2,X0,X1] :
( ~ class(sk3,X0,sk7)
| ~ class(sk3,X0,sk6)
| ~ inertia(sk3,X1,sk7)
| ~ inertia(sk3,X2,sk6)
| greater(X2,X1) ),
inference(forward_subsumption_resolution,[],[f52,f14]) ).
fof(f55,definition,
( spl0_1
<=> ! [X2,X1] :
( ~ inertia(sk3,X1,sk7)
| ~ inertia(sk3,X2,sk6)
| greater(X2,X1) ) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f56,plain,
( ! [X2,X1] :
( ~ inertia(sk3,X1,sk7)
| ~ inertia(sk3,X2,sk6)
| greater(X2,X1) )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f55]) ).
fof(f58,definition,
( spl0_2
<=> ! [X0] :
( ~ class(sk3,X0,sk7)
| ~ class(sk3,X0,sk6) ) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f59,plain,
( ! [X0] :
( ~ class(sk3,X0,sk7)
| ~ class(sk3,X0,sk6) )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f58]) ).
fof(f60,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f53,f58,f55]) ).
fof(f61,plain,
( ~ class(sk3,sk2(sk6,sk3),sk6)
| ~ spl0_2 ),
inference(resolution,[],[f59,f44]) ).
fof(f68,plain,
( ~ organization(sk3,sk6)
| ~ spl0_2 ),
inference(resolution,[],[f61,f4]) ).
fof(f69,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f68,f8]) ).
fof(f70,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f69]) ).
fof(f76,plain,
( greater(sk1(sk7,sk3),sk1(sk6,sk3))
| ~ organization(sk3,sk6) ),
inference(resolution,[],[f41,f1]) ).
fof(f77,plain,
greater(sk1(sk7,sk3),sk1(sk6,sk3)),
inference(forward_subsumption_resolution,[],[f76,f8]) ).
fof(f79,plain,
~ greater(sk1(sk6,sk3),sk1(sk7,sk3)),
inference(resolution,[],[f77,f3]) ).
fof(f82,plain,
( ! [X0] :
( ~ inertia(sk3,X0,sk7)
| greater(sk1(sk6,sk3),X0)
| ~ organization(sk3,sk6) )
| ~ spl0_1 ),
inference(resolution,[],[f56,f1]) ).
fof(f83,plain,
( ! [X0] :
( ~ inertia(sk3,X0,sk7)
| greater(sk1(sk6,sk3),X0) )
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f82,f8]) ).
fof(f85,plain,
( greater(sk1(sk6,sk3),sk1(sk7,sk3))
| ~ organization(sk3,sk7)
| ~ spl0_1 ),
inference(resolution,[],[f83,f1]) ).
fof(f86,plain,
( ~ organization(sk3,sk7)
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f85,f79]) ).
fof(f87,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f86,f9]) ).
fof(f88,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f87]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f60]) ).
cnf(s2,plain,
~ spl0_2,
inference(sat_conversion,[],[f70]) ).
cnf(s3,plain,
~ spl0_1,
inference(sat_conversion,[],[f88]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s1,s2,s3]) ).
fof(f89,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT011-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.39 % Computer : n018.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Sun Sep 27 17:18:24 UTC 2026
% 0.12/0.40 % CPUTime :
% 0.12/0.40 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.43 Running first-order model finding
% 0.12/0.43 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.18/0.47 % (2613697)Will run a generic schedule for satisfiability detection.
% 0.18/0.47 % (2613706)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2529441286:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.47 % (2613706) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2613697-2613706"...
% 0.18/0.47 % (2613706)...printing done.
% 0.18/0.47 % (2613703)% WARNING: option uhcvi not known.
% 0.18/0.47 % (2613706)Refutation found. Thanks to Tanya!
% 0.18/0.47 % SZS status Unsatisfiable for theBenchmark
% 0.18/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.47 % (2613706)------------------------------
% 0.18/0.47 % (2613706)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.47 % (2613706)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.47 % (2613706)CaDiCaL version: 2.1.3
% 0.18/0.47 % (2613706)Termination reason: Refutation
% 0.18/0.47 % (2613706)Time elapsed: 0.002 s
% 0.18/0.47 % (2613706)Peak memory usage: 12 MB
% 0.18/0.47 % (2613706)Instructions burned: 4 (million)
% 0.18/0.47 % (2613697)Success in time 0.027 s
% 0.18/0.47 % Vampire exiting
%------------------------------------------------------------------------------