%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : MGT013-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 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:00 PM UTC 2026
% Result : Unsatisfiable 2.53s 1.32s
% Output : Refutation 2.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 21
% Syntax : Number of formulae : 70 ( 22 unt; 5 def)
% Number of atoms : 184 ( 15 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 232 ( 118 ~; 109 |; 0 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 6 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 67 ( 0 sgn 67 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ~ greater(X0,X1)
| X0 != X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp6_1_18) ).
fof(f3,axiom,
! [X0,X1] :
( time(X1)
| ~ organization(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp15_20) ).
fof(f4,axiom,
! [X0,X1] :
( ~ time(X0)
| ~ time(X1)
| greater(X0,X1)
| X0 = X1
| greater(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp16_21) ).
fof(f5,axiom,
! [X2,X0,X1] :
( reorganization_free(X0,X2,X1)
| ~ reorganization_free(X0,X1,X2) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',mp18_23) ).
fof(f7,axiom,
! [X2,X3,X0,X1,X4] :
( ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ reorganization_free(X0,X1,X2)
| ~ size(X0,X3,X1)
| ~ size(X0,X4,X2)
| ~ greater(X2,X1)
| ~ greater(X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t11_FOL_24) ).
fof(f8,axiom,
! [X2,X3,X0,X1,X4] :
( ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ reorganization_free(X0,X1,X2)
| ~ complexity(X0,X3,X1)
| ~ complexity(X0,X4,X2)
| ~ greater(X2,X1)
| ~ greater(X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_FOL_25) ).
fof(f9,negated_conjecture,
organization(sk1,sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t13_FOL_26) ).
fof(f10,negated_conjecture,
organization(sk1,sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t13_FOL_27) ).
fof(f11,negated_conjecture,
reorganization_free(sk1,sk6,sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t13_FOL_28) ).
fof(f12,negated_conjecture,
complexity(sk1,sk2,sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t13_FOL_29) ).
fof(f13,negated_conjecture,
complexity(sk1,sk3,sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t13_FOL_30) ).
fof(f14,negated_conjecture,
size(sk1,sk4,sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t13_FOL_31) ).
fof(f15,negated_conjecture,
size(sk1,sk5,sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t13_FOL_32) ).
fof(f16,negated_conjecture,
greater(sk3,sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t13_FOL_33) ).
fof(f17,negated_conjecture,
greater(sk4,sk5),
file('/export/starexec/sandbox/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] :
( ~ organization(X0,X2)
| ~ complexity(X0,X3,X2)
| ~ complexity(X0,X4,X2)
| X3 = X4 ),
inference(duplicate_literal_removal,[],[f19]) ).
fof(f24,plain,
! [X2,X0,X1] :
( ~ time(X0)
| greater(X1,X0)
| X0 = X1
| greater(X0,X1)
| ~ organization(X2,X1) ),
inference(resolution,[],[f4,f3]) ).
fof(f27,plain,
! [X0,X1] :
( ~ complexity(sk1,X0,sk6)
| ~ complexity(sk1,X1,sk6)
| X0 = X1 ),
inference(resolution,[],[f20,f9]) ).
fof(f29,plain,
! [X2,X0,X1] :
( ~ greater(X0,sk6)
| ~ reorganization_free(sk1,sk6,X0)
| ~ size(sk1,X1,sk6)
| ~ size(sk1,X2,X0)
| ~ organization(sk1,X0)
| ~ greater(X1,X2) ),
inference(resolution,[],[f7,f9]) ).
fof(f32,plain,
! [X0] :
( ~ complexity(sk1,X0,sk6)
| sk2 = X0 ),
inference(resolution,[],[f27,f12]) ).
fof(f35,plain,
! [X2,X0,X1] :
( ~ greater(X0,sk7)
| ~ reorganization_free(sk1,sk7,X0)
| ~ complexity(sk1,X1,sk7)
| ~ complexity(sk1,X2,X0)
| ~ organization(sk1,X0)
| ~ greater(X1,X2) ),
inference(resolution,[],[f8,f10]) ).
fof(f49,plain,
! [X2,X3,X0,X1] :
( ~ organization(X3,X1)
| X0 = X1
| greater(X1,X0)
| ~ organization(X2,X0)
| greater(X0,X1) ),
inference(resolution,[],[f24,f3]) ).
fof(f51,plain,
! [X0,X1] :
( ~ organization(X1,X0)
| greater(sk7,X0)
| sk7 = X0
| greater(X0,sk7) ),
inference(resolution,[],[f49,f10]) ).
fof(f58,definition,
( spl0_1
<=> greater(sk7,sk6) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f60,plain,
( greater(sk7,sk6)
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f58]) ).
fof(f62,definition,
( spl0_2
<=> sk6 = sk7 ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f64,plain,
( sk6 = sk7
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f62]) ).
fof(f66,definition,
( spl0_3
<=> greater(sk6,sk7) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f68,plain,
( greater(sk6,sk7)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f66]) ).
fof(f72,plain,
( complexity(sk1,sk3,sk6)
| ~ spl0_2 ),
inference(superposition,[],[f13,f64]) ).
fof(f83,plain,
( sk2 = sk3
| ~ spl0_2 ),
inference(resolution,[],[f72,f32]) ).
fof(f88,plain,
( greater(sk2,sk2)
| ~ spl0_2 ),
inference(superposition,[],[f16,f83]) ).
fof(f89,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f88,f18]) ).
fof(f90,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f89]) ).
fof(f92,plain,
( greater(sk7,sk6)
| sk6 = sk7
| greater(sk6,sk7) ),
inference(resolution,[],[f51,f9]) ).
fof(f95,plain,
( spl0_3
| spl0_2
| spl0_1 ),
inference(avatar_split_clause,[],[f92,f58,f62,f66]) ).
fof(f96,plain,
( ! [X0,X1] :
( ~ reorganization_free(sk1,sk7,sk6)
| ~ complexity(sk1,X0,sk7)
| ~ complexity(sk1,X1,sk6)
| ~ organization(sk1,sk6)
| ~ greater(X0,X1) )
| ~ spl0_3 ),
inference(resolution,[],[f68,f35]) ).
fof(f101,plain,
( ! [X0,X1] :
( ~ reorganization_free(sk1,sk7,sk6)
| ~ complexity(sk1,X0,sk7)
| ~ complexity(sk1,X1,sk6)
| ~ greater(X0,X1) )
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[],[f96,f9]) ).
fof(f106,definition,
( spl0_5
<=> reorganization_free(sk1,sk7,sk6) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f108,plain,
( ~ reorganization_free(sk1,sk7,sk6)
| spl0_5 ),
inference(avatar_component_clause,[],[f106]) ).
fof(f111,definition,
( spl0_6
<=> ! [X0,X1] :
( ~ complexity(sk1,X0,sk7)
| ~ greater(X0,X1)
| ~ complexity(sk1,X1,sk6) ) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f112,plain,
( ! [X0,X1] :
( ~ complexity(sk1,X1,sk6)
| ~ greater(X0,X1)
| ~ complexity(sk1,X0,sk7) )
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f111]) ).
fof(f113,plain,
( spl0_6
| ~ spl0_5
| ~ spl0_3 ),
inference(avatar_split_clause,[],[f101,f66,f106,f111]) ).
fof(f114,plain,
( ~ reorganization_free(sk1,sk6,sk7)
| spl0_5 ),
inference(resolution,[],[f108,f5]) ).
fof(f115,plain,
( $false
| spl0_5 ),
inference(forward_subsumption_resolution,[],[f114,f11]) ).
fof(f116,plain,
spl0_5,
inference(avatar_contradiction_clause,[],[f115]) ).
fof(f118,plain,
( ! [X0] :
( ~ complexity(sk1,X0,sk7)
| ~ greater(X0,sk2) )
| ~ spl0_6 ),
inference(resolution,[],[f112,f12]) ).
fof(f119,plain,
( ~ greater(sk3,sk2)
| ~ spl0_6 ),
inference(resolution,[],[f118,f13]) ).
fof(f120,plain,
( $false
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f119,f16]) ).
fof(f121,plain,
~ spl0_6,
inference(avatar_contradiction_clause,[],[f120]) ).
fof(f123,plain,
( ! [X0,X1] :
( ~ reorganization_free(sk1,sk6,sk7)
| ~ size(sk1,X0,sk6)
| ~ size(sk1,X1,sk7)
| ~ organization(sk1,sk7)
| ~ greater(X0,X1) )
| ~ spl0_1 ),
inference(resolution,[],[f60,f29]) ).
fof(f125,plain,
( ! [X0,X1] :
( ~ size(sk1,X0,sk6)
| ~ size(sk1,X1,sk7)
| ~ organization(sk1,sk7)
| ~ greater(X0,X1) )
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f123,f11]) ).
fof(f127,plain,
( ! [X0,X1] :
( ~ size(sk1,X1,sk7)
| ~ size(sk1,X0,sk6)
| ~ greater(X0,X1) )
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f125,f10]) ).
fof(f129,plain,
( ! [X0] :
( ~ size(sk1,X0,sk6)
| ~ greater(X0,sk5) )
| ~ spl0_1 ),
inference(resolution,[],[f127,f15]) ).
fof(f130,plain,
( ~ greater(sk4,sk5)
| ~ spl0_1 ),
inference(resolution,[],[f129,f14]) ).
fof(f131,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f130,f17]) ).
fof(f132,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f131]) ).
cnf(s2,plain,
~ spl0_2,
inference(sat_conversion,[],[f90]) ).
cnf(s3,plain,
( spl0_1
| spl0_2
| spl0_3 ),
inference(sat_conversion,[],[f95]) ).
cnf(s6,plain,
( ~ spl0_3
| ~ spl0_5
| spl0_6 ),
inference(sat_conversion,[],[f113]) ).
cnf(s7,plain,
spl0_5,
inference(sat_conversion,[],[f116]) ).
cnf(s8,plain,
~ spl0_6,
inference(sat_conversion,[],[f121]) ).
cnf(s10,plain,
~ spl0_1,
inference(sat_conversion,[],[f132]) ).
cnf(s11,plain,
~ spl0_3,
inference(rat,[],[s6,s8,s7]) ).
cnf(s12,plain,
spl0_2,
inference(rat,[],[s3,s11,s10]) ).
cnf(s13,plain,
$false,
inference(rat,[],[s2,s12]) ).
fof(f133,plain,
$false,
inference(avatar_sat_refutation,[],[s13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT013-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.39 % Computer : n019.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Sun Sep 27 17:16:34 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.53/1.32 % (3283615)Input is clausal, will run a generic CNF schedule.
% 2.53/1.32 % (3283710)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1682861791:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.53/1.32 % (3283710)First to succeed.
% 2.53/1.32 % (3283710)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3283615"
% 2.53/1.32 % (3283709)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=4008111263:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.53/1.32 % (3283709)Also succeeded, but the first one will report.
% 2.53/1.32 % (3283705)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=1769086588:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.53/1.32 % (3283708)lrs+10_1_sil=8000:sp=occurrence:random_seed=160284450:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.53/1.32 % (3283706)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=730793714:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.53/1.32 % (3283707)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1104325239:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.53/1.32 % (3283708)Also succeeded, but the first one will report.
% 2.53/1.32 % (3283711)dis-21_1_sil=8000:lcm=predicate:random_seed=1128038063: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.53/1.32 % (3283711)Refutation not found, incomplete strategy
% 2.53/1.32 % (3283711)------------------------------
% 2.53/1.32 % (3283711)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.53/1.32 % (3283711)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.53/1.32 % (3283711)CaDiCaL version: 2.1.3
% 2.53/1.32 % (3283711)Termination reason: Refutation not found, incomplete strategy
% 2.53/1.32 % (3283711)Time elapsed: 0.002 s
% 2.53/1.32 % (3283711)Peak memory usage: 88 MB
% 2.53/1.32 % (3283711)Instructions burned: 2 (million)
% 2.53/1.32 % (3283710)Refutation found. Thanks to Tanya!
% 2.53/1.32 % SZS status Unsatisfiable for theBenchmark
% 2.53/1.32 % SZS output start Proof for theBenchmark
% See solution above
% 2.53/1.32 % (3283710)------------------------------
% 2.53/1.32 % (3283710)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.53/1.32 % (3283710)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.53/1.32 % (3283710)CaDiCaL version: 2.1.3
% 2.53/1.32 % (3283710)Termination reason: Refutation
% 2.53/1.32 % (3283710)Time elapsed: 0.003 s
% 2.53/1.32 % (3283710)Peak memory usage: 89 MB
% 2.53/1.32 % (3283710)Instructions burned: 6 (million)
% 2.53/1.32 % (3283710)------------------------------
% 2.53/1.32 % (3283710)------------------------------
% 2.53/1.32 % (3283615)Success in time 0.264 s
% 2.53/1.32 % Vampire exiting
%------------------------------------------------------------------------------