%------------------------------------------------------------------------------
% File : Vampire---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 THM
% Computer : n008.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:00 PM UTC 2026
% Result : Unsatisfiable 2.50s 1.33s
% Output : Refutation 2.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 13
% Syntax : Number of formulae : 44 ( 14 unt; 0 def)
% Number of atoms : 158 ( 8 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 233 ( 119 ~; 114 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 94 ( 94 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( inertia(X0,sk1(X1,X0),X1)
| ~ organization(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] :
( ~ class(X0,X4,X1)
| ~ organization(X2,X3)
| ~ organization(X0,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] :
( ~ 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) ),
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(f19,plain,
! [X0,X1] :
( ~ organization(sk3,sk7)
| ~ organization(sk3,sk6)
| ~ class(sk3,X0,sk6)
| ~ class(sk3,X1,sk7)
| X0 = X1 ),
inference(resolution,[],[f5,f10]) ).
fof(f20,plain,
! [X0,X1] :
( ~ organization(sk3,sk6)
| ~ class(sk3,X0,sk6)
| ~ class(sk3,X1,sk7)
| X0 = X1 ),
inference(forward_subsumption_resolution,[],[f19,f9]) ).
fof(f21,plain,
! [X0,X1] :
( ~ class(sk3,X1,sk7)
| ~ class(sk3,X0,sk6)
| X0 = X1 ),
inference(forward_subsumption_resolution,[],[f20,f8]) ).
fof(f22,plain,
! [X0] :
( ~ class(sk3,X0,sk6)
| sk2(sk7,sk3) = X0
| ~ organization(sk3,sk7) ),
inference(resolution,[],[f21,f4]) ).
fof(f23,plain,
! [X0] :
( ~ class(sk3,X0,sk6)
| sk2(sk7,sk3) = X0 ),
inference(forward_subsumption_resolution,[],[f22,f9]) ).
fof(f24,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,[],[f7,f10]) ).
fof(f25,plain,
! [X0,X1] :
( ~ organization(sk3,sk6)
| ~ inertia(sk3,X0,sk6)
| ~ inertia(sk3,X1,sk7)
| ~ greater(sk7,sk6)
| greater(X1,X0) ),
inference(forward_subsumption_resolution,[],[f24,f9]) ).
fof(f26,plain,
! [X0,X1] :
( ~ inertia(sk3,X0,sk6)
| ~ inertia(sk3,X1,sk7)
| ~ greater(sk7,sk6)
| greater(X1,X0) ),
inference(forward_subsumption_resolution,[],[f25,f8]) ).
fof(f27,plain,
! [X0,X1] :
( ~ inertia(sk3,X1,sk7)
| ~ inertia(sk3,X0,sk6)
| greater(X1,X0) ),
inference(forward_subsumption_resolution,[],[f26,f13]) ).
fof(f28,plain,
( sk2(sk7,sk3) = sk2(sk6,sk3)
| ~ organization(sk3,sk6) ),
inference(resolution,[],[f23,f4]) ).
fof(f29,plain,
sk2(sk7,sk3) = sk2(sk6,sk3),
inference(forward_subsumption_resolution,[],[f28,f8]) ).
fof(f30,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( ~ organization(X0,X1)
| ~ organization(X2,X3)
| ~ class(X0,sk2(X3,X2),X1)
| ~ complexity(X2,X4,X3)
| ~ complexity(X0,X5,X1)
| ~ inertia(X2,X6,X3)
| ~ inertia(X0,X7,X1)
| ~ greater(X5,X4)
| greater(X7,X6)
| ~ organization(X2,X3) ),
inference(resolution,[],[f6,f4]) ).
fof(f33,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( ~ inertia(X2,X6,X3)
| ~ organization(X2,X3)
| ~ class(X0,sk2(X3,X2),X1)
| ~ complexity(X2,X4,X3)
| ~ complexity(X0,X5,X1)
| ~ organization(X0,X1)
| ~ inertia(X0,X7,X1)
| ~ greater(X5,X4)
| greater(X7,X6) ),
inference(duplicate_literal_removal,[],[f30]) ).
fof(f36,plain,
! [X0] :
( ~ inertia(sk3,X0,sk6)
| greater(sk1(sk7,sk3),X0)
| ~ organization(sk3,sk7) ),
inference(resolution,[],[f27,f1]) ).
fof(f37,plain,
! [X0] :
( ~ inertia(sk3,X0,sk6)
| greater(sk1(sk7,sk3),X0) ),
inference(forward_subsumption_resolution,[],[f36,f9]) ).
fof(f45,plain,
( greater(sk1(sk7,sk3),sk1(sk6,sk3))
| ~ organization(sk3,sk6) ),
inference(resolution,[],[f37,f1]) ).
fof(f46,plain,
greater(sk1(sk7,sk3),sk1(sk6,sk3)),
inference(forward_subsumption_resolution,[],[f45,f8]) ).
fof(f47,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( ~ organization(X0,X1)
| ~ class(X2,sk2(X1,X0),X3)
| ~ complexity(X0,X4,X1)
| ~ complexity(X2,X5,X3)
| ~ organization(X2,X3)
| ~ inertia(X2,X6,X3)
| ~ greater(X5,X4)
| greater(X6,sk1(X1,X0))
| ~ organization(X0,X1) ),
inference(resolution,[],[f33,f1]) ).
fof(f50,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( ~ inertia(X2,X6,X3)
| ~ class(X2,sk2(X1,X0),X3)
| ~ complexity(X0,X4,X1)
| ~ complexity(X2,X5,X3)
| ~ organization(X2,X3)
| ~ organization(X0,X1)
| ~ greater(X5,X4)
| greater(X6,sk1(X1,X0)) ),
inference(duplicate_literal_removal,[],[f47]) ).
fof(f53,plain,
~ greater(sk1(sk6,sk3),sk1(sk7,sk3)),
inference(resolution,[],[f46,f3]) ).
fof(f59,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ class(X0,sk2(X1,X2),X3)
| ~ complexity(X2,X4,X1)
| ~ complexity(X0,X5,X3)
| ~ organization(X0,X3)
| ~ organization(X2,X1)
| ~ greater(X5,X4)
| greater(sk1(X3,X0),sk1(X1,X2))
| ~ organization(X0,X3) ),
inference(resolution,[],[f50,f1]) ).
fof(f60,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ organization(X0,X3)
| ~ complexity(X2,X4,X1)
| ~ complexity(X0,X5,X3)
| ~ class(X0,sk2(X1,X2),X3)
| ~ organization(X2,X1)
| ~ greater(X5,X4)
| greater(sk1(X3,X0),sk1(X1,X2)) ),
inference(duplicate_literal_removal,[],[f59]) ).
fof(f66,plain,
! [X2,X3,X0,X1] :
( ~ complexity(sk3,X3,sk6)
| ~ complexity(X0,X1,X2)
| ~ class(sk3,sk2(X2,X0),sk6)
| ~ organization(X0,X2)
| ~ greater(X3,X1)
| greater(sk1(sk6,sk3),sk1(X2,X0)) ),
inference(resolution,[],[f60,f8]) ).
fof(f72,plain,
! [X2,X0,X1] :
( ~ greater(sk4,X1)
| ~ class(sk3,sk2(X2,X0),sk6)
| ~ organization(X0,X2)
| ~ complexity(X0,X1,X2)
| greater(sk1(sk6,sk3),sk1(X2,X0)) ),
inference(resolution,[],[f66,f11]) ).
fof(f74,plain,
! [X0,X1] :
( ~ complexity(X1,sk5,X0)
| ~ organization(X1,X0)
| ~ class(sk3,sk2(X0,X1),sk6)
| greater(sk1(sk6,sk3),sk1(X0,X1)) ),
inference(resolution,[],[f72,f14]) ).
fof(f77,plain,
( ~ organization(sk3,sk7)
| ~ class(sk3,sk2(sk7,sk3),sk6)
| greater(sk1(sk6,sk3),sk1(sk7,sk3)) ),
inference(resolution,[],[f74,f12]) ).
fof(f78,plain,
( ~ class(sk3,sk2(sk7,sk3),sk6)
| greater(sk1(sk6,sk3),sk1(sk7,sk3)) ),
inference(forward_subsumption_resolution,[],[f77,f9]) ).
fof(f79,plain,
~ class(sk3,sk2(sk7,sk3),sk6),
inference(forward_subsumption_resolution,[],[f78,f53]) ).
fof(f80,plain,
~ class(sk3,sk2(sk6,sk3),sk6),
inference(forward_demodulation,[],[f79,f29]) ).
fof(f81,plain,
~ organization(sk3,sk6),
inference(resolution,[],[f80,f4]) ).
fof(f82,plain,
$false,
inference(forward_subsumption_resolution,[],[f81,f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT012-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n008.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.39 % CPULimit : 300
% 0.10/0.39 % WCLimit : 300
% 0.10/0.39 % DateTime : Sun Sep 27 17:16:55 UTC 2026
% 0.10/0.39 % CPUTime :
% 0.10/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.50/1.33 % (1476339)Input is clausal, will run a generic CNF schedule.
% 2.50/1.33 % (1476396)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4194511628:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.50/1.33 % (1476396)First to succeed.
% 2.50/1.33 % (1476396)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1476339"
% 2.50/1.33 % (1476392)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3743584763:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.50/1.33 % (1476393)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2454885685:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.50/1.33 % (1476391)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=2067711974:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.50/1.33 % (1476394)lrs+10_1_sil=8000:sp=occurrence:random_seed=1783581657:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.50/1.33 % (1476394)Also succeeded, but the first one will report.
% 2.50/1.33 % (1476397)dis-21_1_sil=8000:lcm=predicate:random_seed=4196749250:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 2.50/1.33 % (1476395)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=998883670:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.50/1.33 % (1476395)Refutation not found, incomplete strategy
% 2.50/1.33 % (1476395)------------------------------
% 2.50/1.33 % (1476395)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.50/1.33 % (1476395)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.50/1.33 % (1476395)CaDiCaL version: 2.1.3
% 2.50/1.33 % (1476395)Termination reason: Refutation not found, incomplete strategy
% 2.50/1.33 % (1476395)Time elapsed: 0.001 s
% 2.50/1.33 % (1476395)Peak memory usage: 87 MB
% 2.50/1.33 % (1476397)Refutation not found, incomplete strategy
% 2.50/1.33 % (1476397)------------------------------
% 2.50/1.33 % (1476397)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.50/1.33 % (1476397)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.50/1.33 % (1476397)CaDiCaL version: 2.1.3
% 2.50/1.33 % (1476397)Termination reason: Refutation not found, incomplete strategy
% 2.50/1.33 % (1476397)Time elapsed: 0.004 s
% 2.50/1.33 % (1476397)Peak memory usage: 88 MB
% 2.50/1.33 % (1476397)Instructions burned: 5 (million)
% 2.50/1.33 % (1476396)Refutation found. Thanks to Tanya!
% 2.50/1.33 % SZS status Unsatisfiable for theBenchmark
% 2.50/1.33 % SZS output start Proof for theBenchmark
% See solution above
% 2.50/1.34 % (1476396)------------------------------
% 2.50/1.34 % (1476396)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.50/1.34 % (1476396)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.50/1.34 % (1476396)CaDiCaL version: 2.1.3
% 2.50/1.34 % (1476396)Termination reason: Refutation
% 2.50/1.34 % (1476396)Time elapsed: 0.003 s
% 2.50/1.34 % (1476396)Peak memory usage: 88 MB
% 2.50/1.34 % (1476396)Instructions burned: 7 (million)
% 2.50/1.34 % (1476396)------------------------------
% 2.50/1.34 % (1476396)------------------------------
% 2.50/1.34 % (1476339)Success in time 0.273 s
% 2.50/1.34 % Vampire exiting
%------------------------------------------------------------------------------