%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT013-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.46s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 16
% Syntax : Number of formulae : 44 ( 20 unt; 0 def)
% Number of atoms : 114 ( 13 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 153 ( 83 ~; 70 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 43 ( 43 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ~ greater(X0,X1)
| X0 != X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp6_1_18) ).
fof(f3,axiom,
! [X0,X1] :
( ~ organization(X0,X1)
| time(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp15_20) ).
fof(f4,axiom,
! [X0,X1] :
( greater(X1,X0)
| greater(X0,X1)
| ~ time(X1)
| X0 = X1
| ~ time(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp16_21) ).
fof(f5,axiom,
! [X2,X0,X1] :
( ~ reorganization_free(X0,X1,X2)
| reorganization_free(X0,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp17_22) ).
fof(f6,axiom,
! [X2,X3,X0,X1,X4] :
( ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ complexity(X0,X3,X1)
| ~ complexity(X0,X4,X2)
| X1 != X2
| X3 = X4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp18_23) ).
fof(f7,axiom,
! [X2,X3,X0,X1,X4] :
( ~ size(X0,X4,X2)
| ~ organization(X0,X2)
| ~ reorganization_free(X0,X1,X2)
| ~ size(X0,X3,X1)
| ~ organization(X0,X1)
| ~ greater(X2,X1)
| ~ greater(X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t11_FOL_24) ).
fof(f8,axiom,
! [X2,X3,X0,X1,X4] :
( ~ complexity(X0,X4,X2)
| ~ organization(X0,X2)
| ~ reorganization_free(X0,X1,X2)
| ~ complexity(X0,X3,X1)
| ~ organization(X0,X1)
| ~ greater(X2,X1)
| ~ greater(X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_FOL_25) ).
fof(f9,negated_conjecture,
organization(sk1,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_26) ).
fof(f10,negated_conjecture,
organization(sk1,sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_27) ).
fof(f11,negated_conjecture,
reorganization_free(sk1,sk6,sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_28) ).
fof(f12,negated_conjecture,
complexity(sk1,sk2,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_29) ).
fof(f13,negated_conjecture,
complexity(sk1,sk3,sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_30) ).
fof(f14,negated_conjecture,
size(sk1,sk4,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_31) ).
fof(f15,negated_conjecture,
size(sk1,sk5,sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_32) ).
fof(f16,negated_conjecture,
greater(sk3,sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_33) ).
fof(f17,negated_conjecture,
greater(sk4,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL_34) ).
fof(f18,plain,
! [X1] : ~ greater(X1,X1),
inference(equality_resolution,[],[f1]) ).
fof(f19,plain,
! [X2,X3,X0,X4] :
( ~ organization(X0,X2)
| ~ organization(X0,X2)
| ~ complexity(X0,X3,X2)
| ~ complexity(X0,X4,X2)
| X3 = X4 ),
inference(equality_resolution,[],[f6]) ).
fof(f20,plain,
! [X2,X3,X0,X4] :
( ~ complexity(X0,X4,X2)
| ~ complexity(X0,X3,X2)
| ~ organization(X0,X2)
| X3 = X4 ),
inference(duplicate_literal_removal,[],[f19]) ).
fof(f46,plain,
! [X0,X1] :
( ~ organization(sk1,sk6)
| ~ reorganization_free(sk1,X0,sk6)
| ~ complexity(sk1,X1,X0)
| ~ organization(sk1,X0)
| ~ greater(sk6,X0)
| ~ greater(X1,sk2) ),
inference(resolution,[],[f12,f8]) ).
fof(f47,plain,
! [X0,X1] :
( ~ complexity(sk1,X1,X0)
| ~ reorganization_free(sk1,X0,sk6)
| ~ organization(sk1,X0)
| ~ greater(sk6,X0)
| ~ greater(X1,sk2) ),
inference(forward_subsumption_resolution,[],[f46,f9]) ).
fof(f72,plain,
( ~ reorganization_free(sk1,sk7,sk6)
| ~ organization(sk1,sk7)
| ~ greater(sk6,sk7)
| ~ greater(sk3,sk2) ),
inference(resolution,[],[f13,f47]) ).
fof(f91,plain,
! [X0,X1] :
( ~ organization(sk1,sk7)
| ~ reorganization_free(sk1,X0,sk7)
| ~ size(sk1,X1,X0)
| ~ organization(sk1,X0)
| ~ greater(sk7,X0)
| ~ greater(X1,sk5) ),
inference(resolution,[],[f15,f7]) ).
fof(f95,plain,
time(sk6),
inference(resolution,[],[f3,f9]) ).
fof(f96,plain,
time(sk7),
inference(resolution,[],[f3,f10]) ).
fof(f100,plain,
reorganization_free(sk1,sk7,sk6),
inference(resolution,[],[f5,f11]) ).
fof(f355,plain,
! [X0] :
( ~ complexity(sk1,X0,sk6)
| ~ organization(sk1,sk6)
| sk2 = X0 ),
inference(resolution,[],[f20,f12]) ).
fof(f360,plain,
! [X0] :
( ~ complexity(sk1,X0,sk6)
| sk2 = X0 ),
inference(forward_subsumption_resolution,[],[f355,f9]) ).
fof(f521,plain,
( ~ organization(sk1,sk7)
| ~ greater(sk6,sk7)
| ~ greater(sk3,sk2) ),
inference(forward_subsumption_resolution,[],[f72,f100]) ).
fof(f523,plain,
( ~ greater(sk6,sk7)
| ~ greater(sk3,sk2) ),
inference(forward_subsumption_resolution,[],[f521,f10]) ).
fof(f525,plain,
~ greater(sk6,sk7),
inference(forward_subsumption_resolution,[],[f523,f16]) ).
fof(f553,plain,
! [X0,X1] :
( ~ size(sk1,X1,X0)
| ~ reorganization_free(sk1,X0,sk7)
| ~ organization(sk1,X0)
| ~ greater(sk7,X0)
| ~ greater(X1,sk5) ),
inference(forward_subsumption_resolution,[],[f91,f10]) ).
fof(f597,plain,
( ~ reorganization_free(sk1,sk6,sk7)
| ~ organization(sk1,sk6)
| ~ greater(sk7,sk6)
| ~ greater(sk4,sk5) ),
inference(resolution,[],[f553,f14]) ).
fof(f599,plain,
( ~ organization(sk1,sk6)
| ~ greater(sk7,sk6)
| ~ greater(sk4,sk5) ),
inference(forward_subsumption_resolution,[],[f597,f11]) ).
fof(f600,plain,
( ~ greater(sk7,sk6)
| ~ greater(sk4,sk5) ),
inference(forward_subsumption_resolution,[],[f599,f9]) ).
fof(f601,plain,
~ greater(sk7,sk6),
inference(forward_subsumption_resolution,[],[f600,f17]) ).
fof(f603,plain,
( greater(sk6,sk7)
| ~ time(sk7)
| sk6 = sk7
| ~ time(sk6) ),
inference(resolution,[],[f601,f4]) ).
fof(f604,plain,
( ~ time(sk7)
| sk6 = sk7
| ~ time(sk6) ),
inference(forward_subsumption_resolution,[],[f603,f525]) ).
fof(f606,plain,
( sk6 = sk7
| ~ time(sk6) ),
inference(forward_subsumption_resolution,[],[f604,f96]) ).
fof(f608,plain,
sk6 = sk7,
inference(forward_subsumption_resolution,[],[f606,f95]) ).
fof(f612,plain,
complexity(sk1,sk3,sk6),
inference(superposition,[],[f13,f608]) ).
fof(f620,plain,
sk2 = sk3,
inference(resolution,[],[f612,f360]) ).
fof(f627,plain,
greater(sk2,sk2),
inference(superposition,[],[f16,f620]) ).
fof(f631,plain,
$false,
inference(forward_subsumption_resolution,[],[f627,f18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT013-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 : n001.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:22:16 UTC 2026
% 0.10/0.39 % CPUTime :
% 0.10/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.42 Running first-order model finding
% 0.10/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.46 % (3820527)Will run a generic schedule for satisfiability detection.
% 0.16/0.46 % (3820534)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2807903971:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.46 % (3820533)% WARNING: option uhcvi not known.
% 0.16/0.46 % (3820534) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3820527-3820534"...
% 0.16/0.46 % (3820532)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2755238189_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.46 % (3820534)...printing done.
% 0.16/0.46 % (3820533)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1504633474:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.46 % (3820535)dis+10_1_sil=32000:sp=arity:random_seed=2502575880:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.46 % (3820536)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2489687091:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.46 % (3820537)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=99573005:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.46 % (3820534)Refutation found. Thanks to Tanya!
% 0.16/0.46 % SZS status Unsatisfiable for theBenchmark
% 0.16/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.46 % (3820534)------------------------------
% 0.16/0.46 % (3820534)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.46 % (3820534)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.46 % (3820534)CaDiCaL version: 2.1.3
% 0.16/0.46 % (3820534)Termination reason: Refutation
% 0.16/0.46 % (3820534)Time elapsed: 0.007 s
% 0.16/0.46 % (3820534)Peak memory usage: 12 MB
% 0.16/0.46 % (3820534)Instructions burned: 13 (million)
% 0.16/0.46 % (3820527)Success in time 0.035 s
% 0.16/0.46 % Vampire exiting
%------------------------------------------------------------------------------