%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT013+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n019.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 : Theorem 0.18s 0.48s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 8
% Syntax : Number of formulae : 67 ( 20 unt; 0 def)
% Number of atoms : 246 ( 24 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 314 ( 135 ~; 117 |; 54 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 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 : 136 ( 122 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
~ ( greater(X0,X1)
& X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp6_1) ).
fof(f3,axiom,
! [X0,X1] :
( organization(X0,X1)
=> time(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp15) ).
fof(f4,axiom,
! [X0,X1] :
( ( time(X0)
& time(X1) )
=> ( greater(X0,X1)
| X0 = X1
| greater(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp16) ).
fof(f5,axiom,
! [X0,X1,X2] :
( reorganization_free(X0,X1,X2)
=> reorganization_free(X0,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp17) ).
fof(f6,axiom,
! [X0,X1,X2,X3,X4] :
( ( organization(X0,X3)
& organization(X0,X4)
& complexity(X0,X1,X3)
& complexity(X0,X2,X4)
& X3 = X4 )
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp18) ).
fof(f7,axiom,
! [X0,X1,X2,X3,X4] :
( ( organization(X0,X3)
& organization(X0,X4)
& reorganization_free(X0,X3,X4)
& size(X0,X1,X3)
& size(X0,X2,X4)
& greater(X4,X3) )
=> ~ greater(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t11_FOL) ).
fof(f8,axiom,
! [X0,X1,X2,X3,X4] :
( ( organization(X0,X3)
& organization(X0,X4)
& reorganization_free(X0,X3,X4)
& complexity(X0,X1,X3)
& complexity(X0,X2,X4)
& greater(X4,X3) )
=> ~ greater(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_FOL) ).
fof(f9,conjecture,
! [X0,X1,X2,X3,X4,X5,X6] :
( ( organization(X0,X5)
& organization(X0,X6)
& reorganization_free(X0,X5,X6)
& complexity(X0,X1,X5)
& complexity(X0,X2,X6)
& size(X0,X3,X5)
& size(X0,X4,X6)
& greater(X2,X1) )
=> ~ greater(X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL) ).
fof(f10,negated_conjecture,
~ ! [X0,X1,X2,X3,X4,X5,X6] :
( ( organization(X0,X5)
& organization(X0,X6)
& reorganization_free(X0,X5,X6)
& complexity(X0,X1,X5)
& complexity(X0,X2,X6)
& size(X0,X3,X5)
& size(X0,X4,X6)
& greater(X2,X1) )
=> ~ greater(X3,X4) ),
inference(negated_conjecture,[status(cth)],[f9]) ).
fof(f11,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| X0 != X1 ),
inference(ennf_transformation,[],[f1]) ).
fof(f13,plain,
! [X0,X1] :
( time(X1)
| ~ organization(X0,X1) ),
inference(ennf_transformation,[],[f3]) ).
fof(f14,plain,
! [X0,X1] :
( greater(X0,X1)
| X0 = X1
| greater(X1,X0)
| ~ time(X0)
| ~ time(X1) ),
inference(ennf_transformation,[],[f4]) ).
fof(f15,plain,
! [X0,X1] :
( greater(X0,X1)
| X0 = X1
| greater(X1,X0)
| ~ time(X0)
| ~ time(X1) ),
inference(flattening,[],[f14]) ).
fof(f16,plain,
! [X0,X1,X2] :
( reorganization_free(X0,X2,X1)
| ~ reorganization_free(X0,X1,X2) ),
inference(ennf_transformation,[],[f5]) ).
fof(f17,plain,
! [X0,X1,X2,X3,X4] :
( X1 = X2
| ~ organization(X0,X3)
| ~ organization(X0,X4)
| ~ complexity(X0,X1,X3)
| ~ complexity(X0,X2,X4)
| X3 != X4 ),
inference(ennf_transformation,[],[f6]) ).
fof(f18,plain,
! [X0,X1,X2,X3,X4] :
( X1 = X2
| ~ organization(X0,X3)
| ~ organization(X0,X4)
| ~ complexity(X0,X1,X3)
| ~ complexity(X0,X2,X4)
| X3 != X4 ),
inference(flattening,[],[f17]) ).
fof(f19,plain,
! [X0,X1,X2,X3,X4] :
( ~ greater(X1,X2)
| ~ organization(X0,X3)
| ~ organization(X0,X4)
| ~ reorganization_free(X0,X3,X4)
| ~ size(X0,X1,X3)
| ~ size(X0,X2,X4)
| ~ greater(X4,X3) ),
inference(ennf_transformation,[],[f7]) ).
fof(f20,plain,
! [X0,X1,X2,X3,X4] :
( ~ greater(X1,X2)
| ~ organization(X0,X3)
| ~ organization(X0,X4)
| ~ reorganization_free(X0,X3,X4)
| ~ size(X0,X1,X3)
| ~ size(X0,X2,X4)
| ~ greater(X4,X3) ),
inference(flattening,[],[f19]) ).
fof(f21,plain,
! [X0,X1,X2,X3,X4] :
( ~ greater(X1,X2)
| ~ organization(X0,X3)
| ~ organization(X0,X4)
| ~ reorganization_free(X0,X3,X4)
| ~ complexity(X0,X1,X3)
| ~ complexity(X0,X2,X4)
| ~ greater(X4,X3) ),
inference(ennf_transformation,[],[f8]) ).
fof(f22,plain,
! [X0,X1,X2,X3,X4] :
( ~ greater(X1,X2)
| ~ organization(X0,X3)
| ~ organization(X0,X4)
| ~ reorganization_free(X0,X3,X4)
| ~ complexity(X0,X1,X3)
| ~ complexity(X0,X2,X4)
| ~ greater(X4,X3) ),
inference(flattening,[],[f21]) ).
fof(f23,plain,
? [X0,X1,X2,X3,X4,X5,X6] :
( greater(X3,X4)
& organization(X0,X5)
& organization(X0,X6)
& reorganization_free(X0,X5,X6)
& complexity(X0,X1,X5)
& complexity(X0,X2,X6)
& size(X0,X3,X5)
& size(X0,X4,X6)
& greater(X2,X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f24,plain,
? [X0,X1,X2,X3,X4,X5,X6] :
( greater(X3,X4)
& organization(X0,X5)
& organization(X0,X6)
& reorganization_free(X0,X5,X6)
& complexity(X0,X1,X5)
& complexity(X0,X2,X6)
& size(X0,X3,X5)
& size(X0,X4,X6)
& greater(X2,X1) ),
inference(flattening,[],[f23]) ).
fof(f25,plain,
( greater(sK3,sK4)
& organization(sK0,sK5)
& organization(sK0,sK6)
& reorganization_free(sK0,sK5,sK6)
& complexity(sK0,sK1,sK5)
& complexity(sK0,sK2,sK6)
& size(sK0,sK3,sK5)
& size(sK0,sK4,sK6)
& greater(sK2,sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5),skolemize(X6,sK6)],[f24]) ).
fof(f26,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f11]) ).
fof(f28,plain,
! [X0,X1] :
( ~ organization(X0,X1)
| time(X1) ),
inference(cnf_transformation,[],[f13]) ).
fof(f29,plain,
! [X0,X1] :
( greater(X1,X0)
| greater(X0,X1)
| X0 = X1
| ~ time(X0)
| ~ time(X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f30,plain,
! [X2,X0,X1] :
( ~ reorganization_free(X0,X1,X2)
| reorganization_free(X0,X2,X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f31,plain,
! [X2,X3,X0,X1,X4] :
( X1 = X2
| ~ organization(X0,X3)
| ~ organization(X0,X4)
| ~ complexity(X0,X1,X3)
| ~ complexity(X0,X2,X4)
| X3 != X4 ),
inference(cnf_transformation,[],[f18]) ).
fof(f32,plain,
! [X2,X3,X0,X1,X4] :
( ~ size(X0,X2,X4)
| ~ organization(X0,X3)
| ~ organization(X0,X4)
| ~ reorganization_free(X0,X3,X4)
| ~ size(X0,X1,X3)
| ~ greater(X1,X2)
| ~ greater(X4,X3) ),
inference(cnf_transformation,[],[f20]) ).
fof(f33,plain,
! [X2,X3,X0,X1,X4] :
( ~ complexity(X0,X2,X4)
| ~ organization(X0,X3)
| ~ organization(X0,X4)
| ~ reorganization_free(X0,X3,X4)
| ~ complexity(X0,X1,X3)
| ~ greater(X1,X2)
| ~ greater(X4,X3) ),
inference(cnf_transformation,[],[f22]) ).
fof(f34,plain,
greater(sK2,sK1),
inference(cnf_transformation,[],[f25]) ).
fof(f35,plain,
size(sK0,sK4,sK6),
inference(cnf_transformation,[],[f25]) ).
fof(f36,plain,
size(sK0,sK3,sK5),
inference(cnf_transformation,[],[f25]) ).
fof(f37,plain,
complexity(sK0,sK2,sK6),
inference(cnf_transformation,[],[f25]) ).
fof(f38,plain,
complexity(sK0,sK1,sK5),
inference(cnf_transformation,[],[f25]) ).
fof(f39,plain,
reorganization_free(sK0,sK5,sK6),
inference(cnf_transformation,[],[f25]) ).
fof(f40,plain,
organization(sK0,sK6),
inference(cnf_transformation,[],[f25]) ).
fof(f41,plain,
organization(sK0,sK5),
inference(cnf_transformation,[],[f25]) ).
fof(f42,plain,
greater(sK3,sK4),
inference(cnf_transformation,[],[f25]) ).
fof(f43,plain,
! [X1] : ~ greater(X1,X1),
inference(equality_resolution,[],[f26]) ).
fof(f44,plain,
! [X2,X0,X1,X4] :
( X1 = X2
| ~ organization(X0,X4)
| ~ organization(X0,X4)
| ~ complexity(X0,X1,X4)
| ~ complexity(X0,X2,X4) ),
inference(equality_resolution,[],[f31]) ).
fof(f45,plain,
! [X2,X0,X1,X4] :
( ~ complexity(X0,X2,X4)
| ~ organization(X0,X4)
| ~ complexity(X0,X1,X4)
| X1 = X2 ),
inference(duplicate_literal_removal,[],[f44]) ).
fof(f66,plain,
! [X0,X1] :
( ~ organization(sK0,X0)
| ~ organization(sK0,sK6)
| ~ reorganization_free(sK0,X0,sK6)
| ~ size(sK0,X1,X0)
| ~ greater(X1,sK4)
| ~ greater(sK6,X0) ),
inference(resolution,[],[f35,f32]) ).
fof(f70,plain,
! [X0,X1] :
( ~ size(sK0,X1,X0)
| ~ reorganization_free(sK0,X0,sK6)
| ~ organization(sK0,X0)
| ~ greater(X1,sK4)
| ~ greater(sK6,X0) ),
inference(forward_subsumption_resolution,[],[f66,f40]) ).
fof(f88,plain,
( ~ reorganization_free(sK0,sK5,sK6)
| ~ organization(sK0,sK5)
| ~ greater(sK3,sK4)
| ~ greater(sK6,sK5) ),
inference(resolution,[],[f70,f36]) ).
fof(f89,plain,
( ~ reorganization_free(sK0,sK5,sK6)
| ~ greater(sK3,sK4)
| ~ greater(sK6,sK5) ),
inference(forward_subsumption_resolution,[],[f88,f41]) ).
fof(f90,plain,
( ~ reorganization_free(sK0,sK5,sK6)
| ~ greater(sK6,sK5) ),
inference(forward_subsumption_resolution,[],[f89,f42]) ).
fof(f91,plain,
~ greater(sK6,sK5),
inference(global_subsumption,[],[f90,f39]) ).
fof(f119,plain,
! [X0,X1] :
( ~ organization(sK0,X0)
| ~ organization(sK0,sK5)
| ~ reorganization_free(sK0,X0,sK5)
| ~ complexity(sK0,X1,X0)
| ~ greater(X1,sK1)
| ~ greater(sK5,X0) ),
inference(resolution,[],[f33,f38]) ).
fof(f127,plain,
time(sK6),
inference(resolution,[],[f28,f40]) ).
fof(f128,plain,
time(sK5),
inference(resolution,[],[f28,f41]) ).
fof(f132,plain,
reorganization_free(sK0,sK6,sK5),
inference(resolution,[],[f30,f39]) ).
fof(f396,plain,
! [X0] :
( ~ organization(sK0,sK5)
| ~ complexity(sK0,X0,sK5)
| sK1 = X0 ),
inference(resolution,[],[f45,f38]) ).
fof(f397,plain,
! [X0] :
( ~ complexity(sK0,X0,sK5)
| sK1 = X0 ),
inference(forward_subsumption_resolution,[],[f396,f41]) ).
fof(f450,plain,
! [X0,X1] :
( ~ complexity(sK0,X1,X0)
| ~ reorganization_free(sK0,X0,sK5)
| ~ organization(sK0,X0)
| ~ greater(X1,sK1)
| ~ greater(sK5,X0) ),
inference(forward_subsumption_resolution,[],[f119,f41]) ).
fof(f620,plain,
( ~ reorganization_free(sK0,sK6,sK5)
| ~ organization(sK0,sK6)
| ~ greater(sK2,sK1)
| ~ greater(sK5,sK6) ),
inference(resolution,[],[f450,f37]) ).
fof(f622,plain,
( ~ organization(sK0,sK6)
| ~ greater(sK2,sK1)
| ~ greater(sK5,sK6) ),
inference(forward_subsumption_resolution,[],[f620,f132]) ).
fof(f623,plain,
( ~ greater(sK2,sK1)
| ~ greater(sK5,sK6) ),
inference(forward_subsumption_resolution,[],[f622,f40]) ).
fof(f624,plain,
~ greater(sK5,sK6),
inference(forward_subsumption_resolution,[],[f623,f34]) ).
fof(f644,plain,
( greater(sK5,sK6)
| sK5 = sK6
| ~ time(sK5)
| ~ time(sK6) ),
inference(resolution,[],[f91,f29]) ).
fof(f645,plain,
( sK5 = sK6
| ~ time(sK5)
| ~ time(sK6) ),
inference(forward_subsumption_resolution,[],[f644,f624]) ).
fof(f647,plain,
( sK5 = sK6
| ~ time(sK6) ),
inference(forward_subsumption_resolution,[],[f645,f128]) ).
fof(f649,plain,
sK5 = sK6,
inference(forward_subsumption_resolution,[],[f647,f127]) ).
fof(f659,plain,
complexity(sK0,sK2,sK5),
inference(superposition,[],[f37,f649]) ).
fof(f674,plain,
sK1 = sK2,
inference(resolution,[],[f659,f397]) ).
fof(f684,plain,
greater(sK1,sK1),
inference(superposition,[],[f34,f674]) ).
fof(f685,plain,
$false,
inference(forward_subsumption_resolution,[],[f684,f43]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT013+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.40 % Computer : n019.cluster.edu
% 0.12/0.40 % Model : x86_64 x86_64
% 0.12/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.40 % Memory : 8046.5625MB
% 0.12/0.40 % OS : Linux 6.8.0-71-generic
% 0.12/0.40 % CPULimit : 300
% 0.12/0.40 % WCLimit : 300
% 0.12/0.40 % DateTime : Sun Sep 27 17:16:33 UTC 2026
% 0.12/0.40 % CPUTime :
% 0.12/0.40 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.43 Running first-order model finding
% 0.12/0.43 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.18/0.48 % (3283502)Will run a generic schedule for satisfiability detection.
% 0.18/0.48 % (3283513)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4160699939:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.48 % (3283512)% WARNING: option uhcvi not known.
% 0.18/0.48 % (3283513) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3283502-3283513"...
% 0.18/0.48 % (3283511)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2962764105_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.48 % (3283514)dis+10_1_sil=32000:sp=arity:random_seed=4207287579:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.48 % (3283515)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1125105378:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.48 % (3283512)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3463622458:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.48 % (3283513)...printing done.
% 0.18/0.48 % Detected minimum model sizes of [1]
% 0.18/0.48 % Detected maximum model sizes of [7]
% 0.18/0.48 % TRYING [1]
% 0.18/0.48 % (3283513)Refutation found. Thanks to Tanya!
% 0.18/0.48 % SZS status Theorem for theBenchmark
% 0.18/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.48 % (3283513)------------------------------
% 0.18/0.48 % (3283513)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.48 % (3283513)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.48 % (3283513)CaDiCaL version: 2.1.3
% 0.18/0.48 % (3283513)Termination reason: Refutation
% 0.18/0.48 % (3283513)Time elapsed: 0.007 s
% 0.18/0.48 % (3283513)Peak memory usage: 12 MB
% 0.18/0.48 % (3283513)Instructions burned: 16 (million)
% 0.18/0.48 % (3283502)Success in time 0.035 s
% 0.18/0.48 % Vampire exiting
%------------------------------------------------------------------------------