%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT012-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 : n001.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:29 PM UTC 2026
% Result : Unsatisfiable 0.16s 0.47s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 16
% Syntax : Number of formulae : 66 ( 22 unt; 3 def)
% Number of atoms : 198 ( 8 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 225 ( 93 ~; 129 |; 0 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 4 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 102 ( 0 sgn 102 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ~ organization(X0,X1)
| inertia(X0,sk1(X1,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] :
( ~ organization(X0,X1)
| ~ organization(X2,X3)
| ~ class(X0,X4,X1)
| ~ class(X2,X4,X3)
| ~ complexity(X0,X5,X1)
| ~ complexity(X2,X6,X3)
| ~ inertia(X0,X7,X1)
| ~ inertia(X2,X8,X3)
| ~ greater(X6,X5)
| greater(X8,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a12_FOL_25) ).
fof(f7,axiom,
! [X2,X3,X0,X1,X4] :
( ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ reorganization_free(X0,X1,X2)
| ~ 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',t12_FOL_27) ).
fof(f9,negated_conjecture,
organization(sk3,sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_FOL_28) ).
fof(f10,negated_conjecture,
reorganization_free(sk3,sk6,sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_FOL_29) ).
fof(f11,negated_conjecture,
complexity(sk3,sk4,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_FOL_30) ).
fof(f12,negated_conjecture,
complexity(sk3,sk5,sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_FOL_31) ).
fof(f13,negated_conjecture,
greater(sk7,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_FOL_32) ).
fof(f14,negated_conjecture,
greater(sk4,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_FOL_33) ).
fof(f16,plain,
! [X0,X1] :
( ~ inertia(X0,sk1(X1,X0),X1)
| ~ organization(X0,X1) ),
inference(consistent_polarity_flipping,[],[f1]) ).
fof(f18,plain,
! [X0,X1] :
( greater(X0,X1)
| greater(X1,X0) ),
inference(consistent_polarity_flipping,[],[f3]) ).
fof(f19,plain,
! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
( ~ class(X2,X4,X3)
| ~ organization(X2,X3)
| ~ class(X0,X4,X1)
| ~ organization(X0,X1)
| complexity(X0,X5,X1)
| complexity(X2,X6,X3)
| inertia(X0,X7,X1)
| inertia(X2,X8,X3)
| greater(X6,X5)
| ~ greater(X8,X7) ),
inference(consistent_polarity_flipping,[],[f6]) ).
fof(f20,plain,
! [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) ),
inference(consistent_polarity_flipping,[],[f7]) ).
fof(f21,plain,
~ complexity(sk3,sk4,sk6),
inference(consistent_polarity_flipping,[],[f11]) ).
fof(f22,plain,
~ complexity(sk3,sk5,sk7),
inference(consistent_polarity_flipping,[],[f12]) ).
fof(f23,plain,
~ greater(sk7,sk6),
inference(consistent_polarity_flipping,[],[f13]) ).
fof(f24,plain,
~ greater(sk4,sk5),
inference(consistent_polarity_flipping,[],[f14]) ).
fof(f28,plain,
! [X0,X1] :
( ~ organization(sk3,sk7)
| ~ organization(sk3,sk6)
| ~ class(sk3,X0,sk6)
| ~ class(sk3,X1,sk7)
| X0 = X1 ),
inference(resolution,[],[f5,f10]) ).
fof(f29,plain,
! [X0,X1] :
( ~ organization(sk3,sk6)
| ~ class(sk3,X0,sk6)
| ~ class(sk3,X1,sk7)
| X0 = X1 ),
inference(forward_subsumption_resolution,[],[f28,f9]) ).
fof(f30,plain,
! [X0,X1] :
( ~ class(sk3,X1,sk7)
| ~ class(sk3,X0,sk6)
| X0 = X1 ),
inference(forward_subsumption_resolution,[],[f29,f8]) ).
fof(f31,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,[],[f20,f10]) ).
fof(f32,plain,
! [X0,X1] :
( ~ organization(sk3,sk6)
| inertia(sk3,X0,sk6)
| inertia(sk3,X1,sk7)
| greater(sk7,sk6)
| ~ greater(X1,X0) ),
inference(forward_subsumption_resolution,[],[f31,f9]) ).
fof(f33,plain,
! [X0,X1] :
( inertia(sk3,X0,sk6)
| inertia(sk3,X1,sk7)
| greater(sk7,sk6)
| ~ greater(X1,X0) ),
inference(forward_subsumption_resolution,[],[f32,f8]) ).
fof(f34,plain,
! [X0,X1] :
( ~ greater(X1,X0)
| inertia(sk3,X1,sk7)
| inertia(sk3,X0,sk6) ),
inference(forward_subsumption_resolution,[],[f33,f23]) ).
fof(f35,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( ~ organization(X0,X1)
| ~ class(X2,sk2(X1,X0),X3)
| ~ organization(X2,X3)
| complexity(X2,X4,X3)
| complexity(X0,X5,X1)
| inertia(X2,X6,X3)
| inertia(X0,X7,X1)
| greater(X5,X4)
| ~ greater(X7,X6)
| ~ organization(X0,X1) ),
inference(resolution,[],[f19,f4]) ).
fof(f36,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( ~ class(X2,sk2(X1,X0),X3)
| ~ organization(X0,X1)
| ~ organization(X2,X3)
| complexity(X2,X4,X3)
| complexity(X0,X5,X1)
| inertia(X2,X6,X3)
| inertia(X0,X7,X1)
| greater(X5,X4)
| ~ greater(X7,X6) ),
inference(duplicate_literal_removal,[],[f35]) ).
fof(f37,plain,
! [X0] :
( ~ class(sk3,X0,sk6)
| sk2(sk7,sk3) = X0
| ~ organization(sk3,sk7) ),
inference(resolution,[],[f30,f4]) ).
fof(f38,plain,
! [X0] :
( ~ class(sk3,X0,sk6)
| sk2(sk7,sk3) = X0 ),
inference(forward_subsumption_resolution,[],[f37,f9]) ).
fof(f39,plain,
( sk2(sk7,sk3) = sk2(sk6,sk3)
| ~ organization(sk3,sk6) ),
inference(resolution,[],[f38,f4]) ).
fof(f40,plain,
sk2(sk7,sk3) = sk2(sk6,sk3),
inference(forward_subsumption_resolution,[],[f39,f8]) ).
fof(f42,plain,
! [X0,X1] :
( inertia(sk3,X0,sk7)
| inertia(sk3,X1,sk6)
| greater(X1,X0) ),
inference(resolution,[],[f34,f18]) ).
fof(f80,plain,
( class(sk3,sk2(sk6,sk3),sk7)
| ~ organization(sk3,sk7) ),
inference(superposition,[],[f4,f40]) ).
fof(f81,plain,
class(sk3,sk2(sk6,sk3),sk7),
inference(forward_subsumption_resolution,[],[f80,f9]) ).
fof(f96,definition,
( spl0_7
<=> ! [X0] : inertia(sk3,X0,sk7) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f97,plain,
( ! [X0] : inertia(sk3,X0,sk7)
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f96]) ).
fof(f159,definition,
( spl0_12
<=> ! [X1] : inertia(sk3,X1,sk6) ),
introduced(definition,[new_symbols(definition,[spl0_12])],[avatar_definition]) ).
fof(f160,plain,
( ! [X1] : inertia(sk3,X1,sk6)
| ~ spl0_12 ),
inference(avatar_component_clause,[],[f159]) ).
fof(f183,plain,
( ~ organization(sk3,sk7)
| ~ spl0_7 ),
inference(resolution,[],[f97,f16]) ).
fof(f184,plain,
( $false
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f183,f9]) ).
fof(f185,plain,
~ spl0_7,
inference(avatar_contradiction_clause,[],[f184]) ).
fof(f214,plain,
( ~ organization(sk3,sk6)
| ~ spl0_12 ),
inference(resolution,[],[f160,f16]) ).
fof(f215,plain,
( $false
| ~ spl0_12 ),
inference(forward_subsumption_resolution,[],[f214,f8]) ).
fof(f216,plain,
~ spl0_12,
inference(avatar_contradiction_clause,[],[f215]) ).
fof(f218,plain,
! [X2,X3,X0,X1] :
( ~ organization(sk3,sk6)
| ~ organization(sk3,sk7)
| complexity(sk3,X0,sk7)
| complexity(sk3,X1,sk6)
| inertia(sk3,X2,sk7)
| inertia(sk3,X3,sk6)
| greater(X1,X0)
| ~ greater(X3,X2) ),
inference(resolution,[],[f81,f36]) ).
fof(f221,plain,
! [X2,X3,X0,X1] :
( ~ organization(sk3,sk6)
| ~ organization(sk3,sk7)
| complexity(sk3,X0,sk7)
| complexity(sk3,X1,sk6)
| inertia(sk3,X2,sk7)
| inertia(sk3,X3,sk6)
| greater(X1,X0) ),
inference(forward_subsumption_resolution,[],[f218,f42]) ).
fof(f222,plain,
! [X2,X3,X0,X1] :
( ~ organization(sk3,sk7)
| complexity(sk3,X0,sk7)
| complexity(sk3,X1,sk6)
| inertia(sk3,X2,sk7)
| inertia(sk3,X3,sk6)
| greater(X1,X0) ),
inference(forward_subsumption_resolution,[],[f221,f8]) ).
fof(f223,plain,
! [X2,X3,X0,X1] :
( complexity(sk3,X0,sk7)
| complexity(sk3,X1,sk6)
| inertia(sk3,X2,sk7)
| inertia(sk3,X3,sk6)
| greater(X1,X0) ),
inference(forward_subsumption_resolution,[],[f222,f9]) ).
fof(f225,definition,
( spl0_15
<=> ! [X0,X1] :
( complexity(sk3,X0,sk7)
| complexity(sk3,X1,sk6)
| greater(X1,X0) ) ),
introduced(definition,[new_symbols(definition,[spl0_15])],[avatar_definition]) ).
fof(f226,plain,
( ! [X0,X1] :
( complexity(sk3,X0,sk7)
| complexity(sk3,X1,sk6)
| greater(X1,X0) )
| ~ spl0_15 ),
inference(avatar_component_clause,[],[f225]) ).
fof(f227,plain,
( spl0_12
| spl0_7
| spl0_15 ),
inference(avatar_split_clause,[],[f223,f225,f96,f159]) ).
fof(f238,plain,
( ! [X0] :
( complexity(sk3,X0,sk6)
| greater(X0,sk5) )
| ~ spl0_15 ),
inference(resolution,[],[f226,f22]) ).
fof(f241,plain,
( greater(sk4,sk5)
| ~ spl0_15 ),
inference(resolution,[],[f238,f21]) ).
fof(f242,plain,
( $false
| ~ spl0_15 ),
inference(forward_subsumption_resolution,[],[f241,f24]) ).
fof(f243,plain,
~ spl0_15,
inference(avatar_contradiction_clause,[],[f242]) ).
cnf(s40,plain,
~ spl0_7,
inference(sat_conversion,[],[f185]) ).
cnf(s52,plain,
~ spl0_12,
inference(sat_conversion,[],[f216]) ).
cnf(s53,plain,
( spl0_7
| spl0_12
| spl0_15 ),
inference(sat_conversion,[],[f227]) ).
cnf(s54,plain,
~ spl0_15,
inference(sat_conversion,[],[f243]) ).
cnf(s55,plain,
( spl0_7
| spl0_12 ),
inference(rat,[],[s53,s54]) ).
cnf(s56,plain,
spl0_7,
inference(rat,[],[s55,s52]) ).
cnf(s58,plain,
$false,
inference(rat,[],[s40,s56]) ).
fof(f244,plain,
$false,
inference(avatar_sat_refutation,[],[s58]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT012-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 : n001.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:22:01 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42 Running first-order model finding
% 0.12/0.42 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.16/0.47 % (3820120)Will run a generic schedule for satisfiability detection.
% 0.16/0.47 % (3820126)% WARNING: option uhcvi not known.
% 0.16/0.47 % (3820126)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4061956150:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.47 % (3820126) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3820120-3820126"...
% 0.16/0.47 % (3820126)...printing done.
% 0.16/0.47 % (3820126)Refutation found. Thanks to Tanya!
% 0.16/0.47 % SZS status Unsatisfiable for theBenchmark
% 0.16/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.47 % (3820126)------------------------------
% 0.16/0.47 % (3820126)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.47 % (3820126)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.47 % (3820126)CaDiCaL version: 2.1.3
% 0.16/0.47 % (3820126)Termination reason: Refutation
% 0.16/0.47 % (3820126)Time elapsed: 0.004 s
% 0.16/0.47 % (3820126)Peak memory usage: 12 MB
% 0.16/0.47 % (3820126)Instructions burned: 9 (million)
% 0.16/0.47 % (3820120)Success in time 0.032 s
% 0.16/0.47 % Vampire exiting
%------------------------------------------------------------------------------