%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT018-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n006.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:30 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.45s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 20
% Syntax : Number of formulae : 59 ( 24 unt; 4 def)
% Number of atoms : 205 ( 0 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 288 ( 142 ~; 142 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 5 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 83 ( 0 sgn 83 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ~ organization(X0,X1)
| inertia(X0,sk1(X1,X0),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp5_1) ).
fof(f2,axiom,
! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
( ~ greater(X6,X5)
| ~ organization(X2,X3)
| ~ class(X0,X4,X1)
| ~ class(X2,X4,X3)
| ~ size(X0,X5,X1)
| ~ size(X2,X6,X3)
| ~ inertia(X0,X7,X1)
| ~ inertia(X2,X8,X3)
| ~ organization(X0,X1)
| greater(X8,X7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a5_FOL_2) ).
fof(f3,axiom,
! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
( ~ greater(X8,X7)
| ~ organization(X2,X1)
| organization(X2,X3)
| ~ class(X0,X4,X1)
| ~ class(X2,X4,X1)
| ~ reorganization(X0,X1,X5)
| ~ reorganization(X2,X1,X3)
| ~ reorganization_type(X0,X6,X1)
| ~ reorganization_type(X2,X6,X1)
| ~ inertia(X0,X7,X1)
| ~ inertia(X2,X8,X1)
| ~ organization(X0,X1)
| greater(X5,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a14_FOL_3) ).
fof(f4,negated_conjecture,
organization(sk2,sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t18_FOL_4) ).
fof(f5,negated_conjecture,
organization(sk3,sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t18_FOL_5) ).
fof(f6,negated_conjecture,
~ organization(sk3,sk10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t18_FOL_6) ).
fof(f7,negated_conjecture,
class(sk2,sk5,sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t18_FOL_7) ).
fof(f8,negated_conjecture,
class(sk3,sk5,sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t18_FOL_8) ).
fof(f9,negated_conjecture,
reorganization(sk2,sk8,sk9),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t18_FOL_9) ).
fof(f10,negated_conjecture,
reorganization(sk3,sk8,sk10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t18_FOL_10) ).
fof(f11,negated_conjecture,
reorganization_type(sk2,sk4,sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t18_FOL_11) ).
fof(f12,negated_conjecture,
reorganization_type(sk3,sk4,sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t18_FOL_12) ).
fof(f13,negated_conjecture,
size(sk2,sk6,sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t18_FOL_13) ).
fof(f14,negated_conjecture,
size(sk3,sk7,sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t18_FOL_14) ).
fof(f15,negated_conjecture,
greater(sk7,sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t18_FOL_15) ).
fof(f16,negated_conjecture,
~ greater(sk9,sk10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t18_FOL_16) ).
fof(f17,plain,
inertia(sk2,sk1(sk8,sk2),sk8),
inference(resolution,[],[f1,f4]) ).
fof(f18,plain,
inertia(sk3,sk1(sk8,sk3),sk8),
inference(resolution,[],[f1,f5]) ).
fof(f19,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( ~ organization(X0,X1)
| ~ class(X2,X3,X4)
| ~ class(X0,X3,X1)
| ~ size(X2,sk6,X4)
| ~ size(X0,sk7,X1)
| ~ inertia(X2,X5,X4)
| ~ inertia(X0,X6,X1)
| ~ organization(X2,X4)
| greater(X6,X5) ),
inference(resolution,[],[f2,f15]) ).
fof(f22,plain,
! [X2,X3,X0,X1,X4] :
( ~ class(X0,X1,X2)
| ~ class(sk3,X1,sk8)
| ~ size(X0,sk6,X2)
| ~ size(sk3,sk7,sk8)
| ~ inertia(X0,X3,X2)
| ~ inertia(sk3,X4,sk8)
| ~ organization(X0,X2)
| greater(X4,X3) ),
inference(resolution,[],[f19,f5]) ).
fof(f23,plain,
! [X2,X3,X0,X1,X4] :
( ~ organization(X0,X2)
| ~ class(sk3,X1,sk8)
| ~ size(X0,sk6,X2)
| ~ inertia(X0,X3,X2)
| ~ inertia(sk3,X4,sk8)
| ~ class(X0,X1,X2)
| greater(X4,X3) ),
inference(forward_subsumption_resolution,[],[f22,f14]) ).
fof(f50,plain,
! [X2,X0,X1] :
( ~ class(sk3,X0,sk8)
| ~ size(sk2,sk6,sk8)
| ~ inertia(sk2,X1,sk8)
| ~ inertia(sk3,X2,sk8)
| ~ class(sk2,X0,sk8)
| greater(X2,X1) ),
inference(resolution,[],[f23,f4]) ).
fof(f64,plain,
! [X2,X0,X1] :
( ~ class(sk3,X0,sk8)
| ~ inertia(sk2,X1,sk8)
| ~ inertia(sk3,X2,sk8)
| ~ class(sk2,X0,sk8)
| greater(X2,X1) ),
inference(forward_subsumption_resolution,[],[f50,f13]) ).
fof(f66,definition,
( spl0_10
<=> ! [X2,X1] :
( ~ inertia(sk2,X1,sk8)
| ~ inertia(sk3,X2,sk8)
| greater(X2,X1) ) ),
introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).
fof(f67,plain,
( ! [X2,X1] :
( ~ inertia(sk3,X2,sk8)
| ~ inertia(sk2,X1,sk8)
| greater(X2,X1) )
| ~ spl0_10 ),
inference(avatar_component_clause,[],[f66]) ).
fof(f69,definition,
( spl0_11
<=> ! [X0] :
( ~ class(sk3,X0,sk8)
| ~ class(sk2,X0,sk8) ) ),
introduced(definition,[new_symbols(definition,[spl0_11])],[avatar_definition]) ).
fof(f70,plain,
( ! [X0] :
( ~ class(sk3,X0,sk8)
| ~ class(sk2,X0,sk8) )
| ~ spl0_11 ),
inference(avatar_component_clause,[],[f69]) ).
fof(f71,plain,
( spl0_10
| spl0_11 ),
inference(avatar_split_clause,[],[f64,f69,f66]) ).
fof(f72,plain,
( ! [X0] :
( ~ inertia(sk2,X0,sk8)
| greater(sk1(sk8,sk3),X0) )
| ~ spl0_10 ),
inference(resolution,[],[f67,f18]) ).
fof(f73,plain,
( greater(sk1(sk8,sk3),sk1(sk8,sk2))
| ~ spl0_10 ),
inference(resolution,[],[f72,f17]) ).
fof(f74,plain,
( ! [X2,X3,X0,X1,X6,X4,X5] :
( ~ organization(X0,X1)
| organization(X0,X2)
| ~ class(X3,X4,X1)
| ~ class(X0,X4,X1)
| ~ reorganization(X3,X1,X5)
| ~ reorganization(X0,X1,X2)
| ~ reorganization_type(X3,X6,X1)
| ~ reorganization_type(X0,X6,X1)
| ~ inertia(X3,sk1(sk8,sk2),X1)
| ~ inertia(X0,sk1(sk8,sk3),X1)
| ~ organization(X3,X1)
| greater(X5,X2) )
| ~ spl0_10 ),
inference(resolution,[],[f73,f3]) ).
fof(f95,plain,
( ! [X2,X3,X0,X1,X4] :
( organization(sk3,X0)
| ~ class(X1,X2,sk8)
| ~ class(sk3,X2,sk8)
| ~ reorganization(X1,sk8,X3)
| ~ reorganization(sk3,sk8,X0)
| ~ reorganization_type(X1,X4,sk8)
| ~ reorganization_type(sk3,X4,sk8)
| ~ inertia(X1,sk1(sk8,sk2),sk8)
| ~ inertia(sk3,sk1(sk8,sk3),sk8)
| ~ organization(X1,sk8)
| greater(X3,X0) )
| ~ spl0_10 ),
inference(resolution,[],[f74,f5]) ).
fof(f96,plain,
( ! [X2,X3,X0,X1,X4] :
( ~ organization(X1,sk8)
| ~ class(X1,X2,sk8)
| ~ class(sk3,X2,sk8)
| ~ reorganization(X1,sk8,X3)
| ~ reorganization(sk3,sk8,X0)
| ~ reorganization_type(X1,X4,sk8)
| ~ reorganization_type(sk3,X4,sk8)
| ~ inertia(X1,sk1(sk8,sk2),sk8)
| organization(sk3,X0)
| greater(X3,X0) )
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[],[f95,f18]) ).
fof(f105,plain,
( ! [X2,X3,X0,X1] :
( ~ class(sk2,X0,sk8)
| ~ class(sk3,X0,sk8)
| ~ reorganization(sk2,sk8,X1)
| ~ reorganization(sk3,sk8,X2)
| ~ reorganization_type(sk2,X3,sk8)
| ~ reorganization_type(sk3,X3,sk8)
| ~ inertia(sk2,sk1(sk8,sk2),sk8)
| organization(sk3,X2)
| greater(X1,X2) )
| ~ spl0_10 ),
inference(resolution,[],[f96,f4]) ).
fof(f119,plain,
( ! [X2,X3,X0,X1] :
( ~ class(sk2,X0,sk8)
| ~ class(sk3,X0,sk8)
| ~ reorganization(sk2,sk8,X1)
| ~ reorganization(sk3,sk8,X2)
| ~ reorganization_type(sk2,X3,sk8)
| ~ reorganization_type(sk3,X3,sk8)
| organization(sk3,X2)
| greater(X1,X2) )
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[],[f105,f17]) ).
fof(f121,definition,
( spl0_21
<=> ! [X3] :
( ~ reorganization_type(sk2,X3,sk8)
| ~ reorganization_type(sk3,X3,sk8) ) ),
introduced(definition,[new_symbols(definition,[spl0_21])],[avatar_definition]) ).
fof(f122,plain,
( ! [X3] :
( ~ reorganization_type(sk3,X3,sk8)
| ~ reorganization_type(sk2,X3,sk8) )
| ~ spl0_21 ),
inference(avatar_component_clause,[],[f121]) ).
fof(f124,definition,
( spl0_22
<=> ! [X2,X1] :
( ~ reorganization(sk2,sk8,X1)
| greater(X1,X2)
| ~ reorganization(sk3,sk8,X2)
| organization(sk3,X2) ) ),
introduced(definition,[new_symbols(definition,[spl0_22])],[avatar_definition]) ).
fof(f125,plain,
( ! [X2,X1] :
( ~ reorganization(sk3,sk8,X2)
| greater(X1,X2)
| ~ reorganization(sk2,sk8,X1)
| organization(sk3,X2) )
| ~ spl0_22 ),
inference(avatar_component_clause,[],[f124]) ).
fof(f126,plain,
( spl0_21
| spl0_22
| spl0_11
| ~ spl0_10 ),
inference(avatar_split_clause,[],[f119,f66,f69,f124,f121]) ).
fof(f127,plain,
( ~ class(sk2,sk5,sk8)
| ~ spl0_11 ),
inference(resolution,[],[f70,f8]) ).
fof(f128,plain,
( $false
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f127,f7]) ).
fof(f129,plain,
~ spl0_11,
inference(avatar_contradiction_clause,[],[f128]) ).
fof(f130,plain,
( ! [X0] :
( greater(X0,sk10)
| ~ reorganization(sk2,sk8,X0)
| organization(sk3,sk10) )
| ~ spl0_22 ),
inference(resolution,[],[f125,f10]) ).
fof(f131,plain,
( ! [X0] :
( ~ reorganization(sk2,sk8,X0)
| greater(X0,sk10) )
| ~ spl0_22 ),
inference(forward_subsumption_resolution,[],[f130,f6]) ).
fof(f132,plain,
( greater(sk9,sk10)
| ~ spl0_22 ),
inference(resolution,[],[f131,f9]) ).
fof(f133,plain,
( $false
| ~ spl0_22 ),
inference(forward_subsumption_resolution,[],[f132,f16]) ).
fof(f134,plain,
~ spl0_22,
inference(avatar_contradiction_clause,[],[f133]) ).
fof(f135,plain,
( ~ reorganization_type(sk2,sk4,sk8)
| ~ spl0_21 ),
inference(resolution,[],[f122,f12]) ).
fof(f136,plain,
( $false
| ~ spl0_21 ),
inference(forward_subsumption_resolution,[],[f135,f11]) ).
fof(f137,plain,
~ spl0_21,
inference(avatar_contradiction_clause,[],[f136]) ).
cnf(s5,plain,
( spl0_10
| spl0_11 ),
inference(sat_conversion,[],[f71]) ).
cnf(s10,plain,
( ~ spl0_10
| spl0_11
| spl0_21
| spl0_22 ),
inference(sat_conversion,[],[f126]) ).
cnf(s11,plain,
~ spl0_11,
inference(sat_conversion,[],[f129]) ).
cnf(s12,plain,
~ spl0_22,
inference(sat_conversion,[],[f134]) ).
cnf(s13,plain,
~ spl0_21,
inference(sat_conversion,[],[f137]) ).
cnf(s14,plain,
~ spl0_10,
inference(rat,[],[s10,s12,s13,s11]) ).
cnf(s15,plain,
$false,
inference(rat,[],[s5,s11,s14]) ).
fof(f138,plain,
$false,
inference(avatar_sat_refutation,[],[s15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT018-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37 % Computer : n006.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 27 17:16:25 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40 Running first-order model finding
% 0.10/0.41 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.10/0.45 % (3191353)Will run a generic schedule for satisfiability detection.
% 0.10/0.45 % (3191363)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2669282440:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.10/0.45 % (3191363) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3191353-3191363"...
% 0.10/0.45 % (3191363)...printing done.
% 0.10/0.45 % (3191358)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3970216520_2999 on theBenchmark for (2999ds/0Mi)
% 0.10/0.45 % (3191364)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3476308440:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.10/0.45 % (3191360)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3343257580:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.45 % (3191361)dis+10_1_sil=32000:sp=arity:random_seed=3027052224:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.45 % (3191362)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2849069959:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.45 % (3191363)Refutation found. Thanks to Tanya!
% 0.10/0.45 % SZS status Unsatisfiable for theBenchmark
% 0.10/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.45 % (3191363)------------------------------
% 0.10/0.45 % (3191363)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.45 % (3191363)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.45 % (3191363)CaDiCaL version: 2.1.3
% 0.10/0.45 % (3191363)Termination reason: Refutation
% 0.10/0.45 % (3191363)Time elapsed: 0.002 s
% 0.10/0.45 % (3191363)Peak memory usage: 12 MB
% 0.10/0.45 % (3191363)Instructions burned: 4 (million)
% 0.10/0.45 % (3191353)Success in time 0.031 s
% 0.10/0.45 % Vampire exiting
%------------------------------------------------------------------------------