%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT009-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 : n026.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.17s 0.46s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 19
% Syntax : Number of formulae : 55 ( 21 unt; 4 def)
% Number of atoms : 167 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 235 ( 123 ~; 108 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 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 : 75 ( 0 sgn 75 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( inertia(X0,sk1(X1,X0),X1)
| ~ organization(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp5_1) ).
fof(f3,axiom,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( ~ reproducibility(X2,X5,X3)
| ~ organization(X2,X3)
| ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(X2,X3,X3)
| ~ reproducibility(X0,X4,X1)
| ~ organization(X0,X1)
| ~ inertia(X0,X6,X1)
| ~ inertia(X2,X7,X3)
| ~ greater(X7,X6)
| greater(X5,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a3_FOL_3) ).
fof(f4,axiom,
! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
( ~ size(X2,X6,X3)
| ~ organization(X2,X3)
| ~ class(X0,X4,X1)
| ~ class(X2,X4,X3)
| ~ size(X0,X5,X1)
| ~ organization(X0,X1)
| ~ inertia(X0,X7,X1)
| ~ inertia(X2,X8,X3)
| ~ greater(X6,X5)
| greater(X8,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a5_FOL_4) ).
fof(f5,negated_conjecture,
organization(sk2,sk9),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t9_FOL_5) ).
fof(f6,negated_conjecture,
organization(sk3,sk10),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t9_FOL_6) ).
fof(f7,negated_conjecture,
reorganization_free(sk2,sk9,sk9),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t9_FOL_7) ).
fof(f8,negated_conjecture,
reorganization_free(sk3,sk10,sk10),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t9_FOL_8) ).
fof(f9,negated_conjecture,
class(sk2,sk4,sk9),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t9_FOL_9) ).
fof(f10,negated_conjecture,
class(sk3,sk4,sk10),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t9_FOL_10) ).
fof(f11,negated_conjecture,
reproducibility(sk2,sk5,sk9),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t9_FOL_11) ).
fof(f12,negated_conjecture,
reproducibility(sk3,sk6,sk10),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t9_FOL_12) ).
fof(f13,negated_conjecture,
size(sk2,sk7,sk9),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t9_FOL_13) ).
fof(f14,negated_conjecture,
size(sk3,sk8,sk10),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t9_FOL_14) ).
fof(f15,negated_conjecture,
greater(sk8,sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t9_FOL_15) ).
fof(f16,negated_conjecture,
~ greater(sk6,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t9_FOL_16) ).
fof(f36,plain,
! [X2,X3,X0,X1,X4] :
( ~ organization(sk3,sk10)
| ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(sk3,sk10,sk10)
| ~ reproducibility(X0,X2,X1)
| ~ organization(X0,X1)
| ~ inertia(X0,X3,X1)
| ~ inertia(sk3,X4,sk10)
| ~ greater(X4,X3)
| greater(sk6,X2) ),
inference(resolution,[],[f3,f12]) ).
fof(f37,plain,
! [X2,X3,X0,X1,X4] :
( ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(sk3,sk10,sk10)
| ~ reproducibility(X0,X2,X1)
| ~ organization(X0,X1)
| ~ inertia(X0,X3,X1)
| ~ inertia(sk3,X4,sk10)
| ~ greater(X4,X3)
| greater(sk6,X2) ),
inference(forward_subsumption_resolution,[],[f36,f6]) ).
fof(f39,plain,
! [X2,X3,X0,X1,X4] :
( ~ reproducibility(X0,X2,X1)
| ~ reorganization_free(X0,X1,X1)
| ~ organization(X0,X1)
| ~ inertia(X0,X3,X1)
| ~ inertia(sk3,X4,sk10)
| ~ greater(X4,X3)
| greater(sk6,X2) ),
inference(forward_subsumption_resolution,[],[f37,f8]) ).
fof(f42,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ organization(sk3,sk10)
| ~ class(X0,X1,X2)
| ~ class(sk3,X1,sk10)
| ~ size(X0,X3,X2)
| ~ organization(X0,X2)
| ~ inertia(X0,X4,X2)
| ~ inertia(sk3,X5,sk10)
| ~ greater(sk8,X3)
| greater(X5,X4) ),
inference(resolution,[],[f4,f14]) ).
fof(f43,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ size(X0,X3,X2)
| ~ class(sk3,X1,sk10)
| ~ class(X0,X1,X2)
| ~ organization(X0,X2)
| ~ inertia(X0,X4,X2)
| ~ inertia(sk3,X5,sk10)
| ~ greater(sk8,X3)
| greater(X5,X4) ),
inference(forward_subsumption_resolution,[],[f42,f6]) ).
fof(f67,plain,
! [X0,X1] :
( ~ reorganization_free(sk2,sk9,sk9)
| ~ organization(sk2,sk9)
| ~ inertia(sk2,X0,sk9)
| ~ inertia(sk3,X1,sk10)
| ~ greater(X1,X0)
| greater(sk6,sk5) ),
inference(resolution,[],[f39,f11]) ).
fof(f70,plain,
! [X0,X1] :
( ~ organization(sk2,sk9)
| ~ inertia(sk2,X0,sk9)
| ~ inertia(sk3,X1,sk10)
| ~ greater(X1,X0)
| greater(sk6,sk5) ),
inference(forward_subsumption_resolution,[],[f67,f7]) ).
fof(f72,plain,
! [X0,X1] :
( ~ inertia(sk2,X0,sk9)
| ~ inertia(sk3,X1,sk10)
| ~ greater(X1,X0)
| greater(sk6,sk5) ),
inference(forward_subsumption_resolution,[],[f70,f5]) ).
fof(f74,plain,
! [X0,X1] :
( ~ inertia(sk3,X1,sk10)
| ~ inertia(sk2,X0,sk9)
| ~ greater(X1,X0) ),
inference(forward_subsumption_resolution,[],[f72,f16]) ).
fof(f86,plain,
! [X2,X0,X1] :
( ~ class(sk3,X0,sk10)
| ~ class(sk2,X0,sk9)
| ~ organization(sk2,sk9)
| ~ inertia(sk2,X1,sk9)
| ~ inertia(sk3,X2,sk10)
| ~ greater(sk8,sk7)
| greater(X2,X1) ),
inference(resolution,[],[f43,f13]) ).
fof(f90,plain,
! [X2,X0,X1] :
( ~ class(sk3,X0,sk10)
| ~ class(sk2,X0,sk9)
| ~ inertia(sk2,X1,sk9)
| ~ inertia(sk3,X2,sk10)
| ~ greater(sk8,sk7)
| greater(X2,X1) ),
inference(forward_subsumption_resolution,[],[f86,f5]) ).
fof(f99,plain,
! [X2,X0,X1] :
( ~ class(sk3,X0,sk10)
| ~ class(sk2,X0,sk9)
| ~ inertia(sk2,X1,sk9)
| ~ inertia(sk3,X2,sk10)
| greater(X2,X1) ),
inference(forward_subsumption_resolution,[],[f90,f15]) ).
fof(f101,definition,
( spl0_10
<=> ! [X2,X1] :
( ~ inertia(sk2,X1,sk9)
| ~ inertia(sk3,X2,sk10)
| greater(X2,X1) ) ),
introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).
fof(f102,plain,
( ! [X2,X1] :
( ~ inertia(sk2,X1,sk9)
| ~ inertia(sk3,X2,sk10)
| greater(X2,X1) )
| ~ spl0_10 ),
inference(avatar_component_clause,[],[f101]) ).
fof(f104,definition,
( spl0_11
<=> ! [X0] :
( ~ class(sk3,X0,sk10)
| ~ class(sk2,X0,sk9) ) ),
introduced(definition,[new_symbols(definition,[spl0_11])],[avatar_definition]) ).
fof(f105,plain,
( ! [X0] :
( ~ class(sk3,X0,sk10)
| ~ class(sk2,X0,sk9) )
| ~ spl0_11 ),
inference(avatar_component_clause,[],[f104]) ).
fof(f106,plain,
( spl0_10
| spl0_11 ),
inference(avatar_split_clause,[],[f99,f104,f101]) ).
fof(f145,definition,
( spl0_17
<=> ! [X2] : ~ inertia(sk3,X2,sk10) ),
introduced(definition,[new_symbols(definition,[spl0_17])],[avatar_definition]) ).
fof(f146,plain,
( ! [X2] : ~ inertia(sk3,X2,sk10)
| ~ spl0_17 ),
inference(avatar_component_clause,[],[f145]) ).
fof(f148,definition,
( spl0_18
<=> ! [X1] : ~ inertia(sk2,X1,sk9) ),
introduced(definition,[new_symbols(definition,[spl0_18])],[avatar_definition]) ).
fof(f149,plain,
( ! [X1] : ~ inertia(sk2,X1,sk9)
| ~ spl0_18 ),
inference(avatar_component_clause,[],[f148]) ).
fof(f151,plain,
( ~ class(sk2,sk4,sk9)
| ~ spl0_11 ),
inference(resolution,[],[f105,f10]) ).
fof(f152,plain,
( $false
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f151,f9]) ).
fof(f153,plain,
~ spl0_11,
inference(avatar_contradiction_clause,[],[f152]) ).
fof(f154,plain,
( ! [X2,X1] :
( ~ inertia(sk2,X1,sk9)
| ~ inertia(sk3,X2,sk10) )
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[],[f102,f74]) ).
fof(f156,plain,
( spl0_17
| spl0_18
| ~ spl0_10 ),
inference(avatar_split_clause,[],[f154,f101,f148,f145]) ).
fof(f157,plain,
( ~ organization(sk3,sk10)
| ~ spl0_17 ),
inference(resolution,[],[f146,f1]) ).
fof(f158,plain,
( $false
| ~ spl0_17 ),
inference(forward_subsumption_resolution,[],[f157,f6]) ).
fof(f159,plain,
~ spl0_17,
inference(avatar_contradiction_clause,[],[f158]) ).
fof(f160,plain,
( ~ organization(sk2,sk9)
| ~ spl0_18 ),
inference(resolution,[],[f149,f1]) ).
fof(f161,plain,
( $false
| ~ spl0_18 ),
inference(forward_subsumption_resolution,[],[f160,f5]) ).
fof(f162,plain,
~ spl0_18,
inference(avatar_contradiction_clause,[],[f161]) ).
cnf(s6,plain,
( spl0_10
| spl0_11 ),
inference(sat_conversion,[],[f106]) ).
cnf(s11,plain,
~ spl0_11,
inference(sat_conversion,[],[f153]) ).
cnf(s13,plain,
( ~ spl0_10
| spl0_17
| spl0_18 ),
inference(sat_conversion,[],[f156]) ).
cnf(s14,plain,
~ spl0_17,
inference(sat_conversion,[],[f159]) ).
cnf(s15,plain,
~ spl0_18,
inference(sat_conversion,[],[f162]) ).
cnf(s16,plain,
~ spl0_10,
inference(rat,[],[s13,s15,s14]) ).
cnf(s18,plain,
$false,
inference(rat,[],[s6,s11,s16]) ).
fof(f163,plain,
$false,
inference(avatar_sat_refutation,[],[s18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT009-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.10/0.38 % Computer : n026.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 27 17:18:57 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41 Running first-order model finding
% 0.10/0.41 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.17/0.46 % (3081157)Will run a generic schedule for satisfiability detection.
% 0.17/0.46 % (3081162)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3064918067_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.46 % TRYING [1]
% 0.17/0.46 % TRYING [2]
% 0.17/0.46 % TRYING [3]
% 0.17/0.46 % (3081163)% WARNING: option uhcvi not known.
% 0.17/0.46 % TRYING [4]
% 0.17/0.46 % (3081164)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1734117475:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.46 % (3081163)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4251384622:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.46 % (3081165)dis+10_1_sil=32000:sp=arity:random_seed=2053925741:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.46 % (3081166)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4282382876:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.46 % (3081168)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3546609055:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.46 % (3081167)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=308717338:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.46 % TRYING [5]
% 0.17/0.46 % (3081165) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3081157-3081165"...
% 0.17/0.46 % (3081163) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3081157-3081163"...
% 0.17/0.46 % (3081167) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3081157-3081167"...
% 0.17/0.46 % (3081166) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3081157-3081166"...
% 0.17/0.46 % (3081168) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3081157-3081168"...
% 0.17/0.46 % (3081164) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3081157-3081164"...
% 0.17/0.46 % (3081165)...printing done.
% 0.17/0.46 % (3081163)...printing done.
% 0.17/0.46 % (3081166)...printing done.
% 0.17/0.46 % (3081167)...printing done.
% 0.17/0.46 % (3081165)Refutation found. Thanks to Tanya!
% 0.17/0.46 % SZS status Unsatisfiable for theBenchmark
% 0.17/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.46 % (3081165)------------------------------
% 0.17/0.46 % (3081165)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.46 % (3081165)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.46 % (3081165)CaDiCaL version: 2.1.3
% 0.17/0.46 % (3081165)Termination reason: Refutation
% 0.17/0.46 % (3081165)Time elapsed: 0.004 s
% 0.17/0.46 % (3081165)Peak memory usage: 11 MB
% 0.17/0.46 % (3081165)Instructions burned: 4 (million)
% 0.17/0.46 % (3081157)Success in time 0.04 s
% 0.17/0.46 % Vampire exiting
%------------------------------------------------------------------------------