%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT002-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:25 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.50s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 12
% Syntax : Number of formulae : 32 ( 14 unt; 0 def)
% Number of atoms : 101 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 139 ( 70 ~; 69 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 56 ( 56 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ~ organization(X0,X1)
| reproducibility(X0,sk1(X1,X0),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp3_1) ).
fof(f2,axiom,
! [X2,X0,X1] :
( ~ reorganization_free(X0,X1,X2)
| reorganization_free(X0,X1,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp4_2) ).
fof(f3,axiom,
! [X2,X0,X1] :
( ~ reorganization_free(X0,X1,X2)
| reorganization_free(X0,X2,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp4_3) ).
fof(f4,axiom,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( ~ greater(X5,X4)
| ~ organization(X2,X3)
| ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(X2,X3,X3)
| ~ reproducibility(X0,X4,X1)
| ~ reproducibility(X2,X5,X3)
| ~ inertia(X0,X6,X1)
| ~ inertia(X2,X7,X3)
| ~ organization(X0,X1)
| greater(X7,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a3_FOL_4) ).
fof(f6,axiom,
! [X2,X3,X0,X1,X4] :
( ~ greater(X2,X1)
| ~ organization(X0,X2)
| ~ reorganization_free(X0,X1,X2)
| ~ reproducibility(X0,X3,X1)
| ~ reproducibility(X0,X4,X2)
| ~ organization(X0,X1)
| greater(X4,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a4_FOL_6) ).
fof(f7,negated_conjecture,
organization(sk2,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_FOL_7) ).
fof(f8,negated_conjecture,
organization(sk2,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_FOL_8) ).
fof(f9,negated_conjecture,
reorganization_free(sk2,sk5,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_FOL_9) ).
fof(f10,negated_conjecture,
inertia(sk2,sk3,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_FOL_10) ).
fof(f11,negated_conjecture,
inertia(sk2,sk4,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_FOL_11) ).
fof(f12,negated_conjecture,
greater(sk6,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_FOL_12) ).
fof(f13,negated_conjecture,
~ greater(sk4,sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_FOL_13) ).
fof(f14,plain,
reorganization_free(sk2,sk5,sk5),
inference(resolution,[],[f2,f9]) ).
fof(f16,plain,
reorganization_free(sk2,sk6,sk6),
inference(resolution,[],[f3,f9]) ).
fof(f20,plain,
reproducibility(sk2,sk1(sk5,sk2),sk5),
inference(resolution,[],[f1,f7]) ).
fof(f21,plain,
reproducibility(sk2,sk1(sk6,sk2),sk6),
inference(resolution,[],[f1,f8]) ).
fof(f22,plain,
! [X2,X0,X1] :
( ~ organization(X0,sk6)
| ~ reorganization_free(X0,sk5,sk6)
| ~ reproducibility(X0,X1,sk5)
| ~ reproducibility(X0,X2,sk6)
| ~ organization(X0,sk5)
| greater(X2,X1) ),
inference(resolution,[],[f6,f12]) ).
fof(f24,plain,
! [X0,X1] :
( ~ reorganization_free(sk2,sk5,sk6)
| ~ reproducibility(sk2,X0,sk5)
| ~ reproducibility(sk2,X1,sk6)
| ~ organization(sk2,sk5)
| greater(X1,X0) ),
inference(resolution,[],[f22,f8]) ).
fof(f25,plain,
! [X0,X1] :
( ~ reproducibility(sk2,X0,sk5)
| ~ reproducibility(sk2,X1,sk6)
| ~ organization(sk2,sk5)
| greater(X1,X0) ),
inference(forward_subsumption_resolution,[],[f24,f9]) ).
fof(f26,plain,
! [X0,X1] :
( ~ reproducibility(sk2,X0,sk5)
| ~ reproducibility(sk2,X1,sk6)
| greater(X1,X0) ),
inference(forward_subsumption_resolution,[],[f25,f7]) ).
fof(f28,plain,
! [X0] :
( ~ reproducibility(sk2,X0,sk6)
| greater(X0,sk1(sk5,sk2)) ),
inference(resolution,[],[f26,f20]) ).
fof(f69,plain,
greater(sk1(sk6,sk2),sk1(sk5,sk2)),
inference(resolution,[],[f28,f21]) ).
fof(f71,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ organization(X0,X1)
| ~ reorganization_free(X2,X3,X3)
| ~ reorganization_free(X0,X1,X1)
| ~ reproducibility(X2,sk1(sk5,sk2),X3)
| ~ reproducibility(X0,sk1(sk6,sk2),X1)
| ~ inertia(X2,X4,X3)
| ~ inertia(X0,X5,X1)
| ~ organization(X2,X3)
| greater(X5,X4) ),
inference(resolution,[],[f69,f4]) ).
fof(f94,plain,
! [X2,X3,X0,X1] :
( ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(sk2,sk6,sk6)
| ~ reproducibility(X0,sk1(sk5,sk2),X1)
| ~ reproducibility(sk2,sk1(sk6,sk2),sk6)
| ~ inertia(X0,X2,X1)
| ~ inertia(sk2,X3,sk6)
| ~ organization(X0,X1)
| greater(X3,X2) ),
inference(resolution,[],[f71,f8]) ).
fof(f95,plain,
! [X2,X3,X0,X1] :
( ~ reorganization_free(X0,X1,X1)
| ~ reproducibility(X0,sk1(sk5,sk2),X1)
| ~ reproducibility(sk2,sk1(sk6,sk2),sk6)
| ~ inertia(X0,X2,X1)
| ~ inertia(sk2,X3,sk6)
| ~ organization(X0,X1)
| greater(X3,X2) ),
inference(forward_subsumption_resolution,[],[f94,f16]) ).
fof(f97,plain,
! [X2,X3,X0,X1] :
( ~ organization(X0,X1)
| ~ reproducibility(X0,sk1(sk5,sk2),X1)
| ~ inertia(X0,X2,X1)
| ~ inertia(sk2,X3,sk6)
| ~ reorganization_free(X0,X1,X1)
| greater(X3,X2) ),
inference(forward_subsumption_resolution,[],[f95,f21]) ).
fof(f106,plain,
! [X0,X1] :
( ~ reproducibility(sk2,sk1(sk5,sk2),sk5)
| ~ inertia(sk2,X0,sk5)
| ~ inertia(sk2,X1,sk6)
| ~ reorganization_free(sk2,sk5,sk5)
| greater(X1,X0) ),
inference(resolution,[],[f97,f7]) ).
fof(f109,plain,
! [X0,X1] :
( ~ inertia(sk2,X0,sk5)
| ~ inertia(sk2,X1,sk6)
| ~ reorganization_free(sk2,sk5,sk5)
| greater(X1,X0) ),
inference(forward_subsumption_resolution,[],[f106,f20]) ).
fof(f118,plain,
! [X0,X1] :
( ~ inertia(sk2,X0,sk5)
| ~ inertia(sk2,X1,sk6)
| greater(X1,X0) ),
inference(forward_subsumption_resolution,[],[f109,f14]) ).
fof(f119,plain,
! [X0] :
( ~ inertia(sk2,X0,sk6)
| greater(X0,sk3) ),
inference(resolution,[],[f118,f10]) ).
fof(f120,plain,
greater(sk4,sk3),
inference(resolution,[],[f119,f11]) ).
fof(f121,plain,
$false,
inference(forward_subsumption_resolution,[],[f120,f13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT002-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.43 % Computer : n018.cluster.edu
% 0.10/0.43 % Model : x86_64 x86_64
% 0.10/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.43 % Memory : 8046.5625MB
% 0.10/0.43 % OS : Linux 6.8.0-71-generic
% 0.10/0.43 % CPULimit : 300
% 0.10/0.43 % WCLimit : 300
% 0.10/0.43 % DateTime : Sun Sep 27 17:17:39 UTC 2026
% 0.10/0.43 % CPUTime :
% 0.10/0.43 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.15/0.46 Running first-order model finding
% 0.15/0.46 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.15/0.50 % (2612458)Will run a generic schedule for satisfiability detection.
% 0.15/0.50 % (2612468)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3159314973:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.15/0.50 % (2612468) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2612458-2612468"...
% 0.15/0.50 % (2612468)...printing done.
% 0.15/0.50 % (2612464)% WARNING: option uhcvi not known.
% 0.15/0.50 % (2612468)Refutation found. Thanks to Tanya!
% 0.15/0.50 % SZS status Unsatisfiable for theBenchmark
% 0.15/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.50 % (2612468)------------------------------
% 0.15/0.50 % (2612468)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.50 % (2612468)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.50 % (2612468)CaDiCaL version: 2.1.3
% 0.15/0.50 % (2612468)Termination reason: Refutation
% 0.15/0.50 % (2612468)Time elapsed: 0.002 s
% 0.15/0.50 % (2612468)Peak memory usage: 11 MB
% 0.15/0.50 % (2612468)Instructions burned: 3 (million)
% 0.15/0.50 % (2612458)Success in time 0.028 s
% 0.15/0.50 % Vampire exiting
%------------------------------------------------------------------------------