%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : MGT013+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/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 : Theorem 0.98s 1.79s
% Output : Refutation 4.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 13
% Syntax : Number of formulae : 93 ( 22 unt; 5 def)
% Number of atoms : 316 ( 26 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 393 ( 170 ~; 156 |; 54 &)
% ( 5 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 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 : 160 ( 0 sgn 146 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
~ ( greater(X0,X1)
& X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp6_1) ).
fof(f3,axiom,
! [X0,X1] :
( organization(X0,X1)
=> time(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp15) ).
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) ).
fof(f5,axiom,
! [X0,X1,X2] :
( reorganization_free(X0,X1,X2)
=> reorganization_free(X0,X2,X1) ),
file('/export/starexec/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/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] :
( time(X1)
| ~ organization(X0,X1) ),
inference(cnf_transformation,[],[f13]) ).
fof(f29,plain,
! [X0,X1] :
( ~ time(X1)
| X0 = X1
| greater(X1,X0)
| ~ time(X0)
| greater(X0,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f30,plain,
! [X2,X0,X1] :
( reorganization_free(X0,X2,X1)
| ~ reorganization_free(X0,X1,X2) ),
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] :
( ~ organization(X0,X3)
| ~ greater(X1,X2)
| ~ organization(X0,X4)
| ~ reorganization_free(X0,X3,X4)
| ~ size(X0,X1,X3)
| ~ size(X0,X2,X4)
| ~ greater(X4,X3) ),
inference(cnf_transformation,[],[f20]) ).
fof(f33,plain,
! [X2,X3,X0,X1,X4] :
( ~ organization(X0,X3)
| ~ greater(X1,X2)
| ~ organization(X0,X4)
| ~ reorganization_free(X0,X3,X4)
| ~ complexity(X0,X1,X3)
| ~ complexity(X0,X2,X4)
| ~ 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] :
( ~ organization(X0,X4)
| X1 = X2
| ~ complexity(X0,X1,X4)
| ~ complexity(X0,X2,X4) ),
inference(duplicate_literal_removal,[],[f44]) ).
fof(f49,plain,
! [X2,X0,X1] :
( ~ time(X0)
| greater(X1,X0)
| X0 = X1
| greater(X0,X1)
| ~ organization(X2,X1) ),
inference(resolution,[],[f29,f28]) ).
fof(f53,plain,
! [X0,X1] :
( ~ complexity(sK0,X0,sK5)
| X0 = X1
| ~ complexity(sK0,X1,sK5) ),
inference(resolution,[],[f45,f41]) ).
fof(f55,plain,
! [X2,X0,X1] :
( ~ greater(X2,sK5)
| ~ organization(sK0,X2)
| ~ reorganization_free(sK0,sK5,X2)
| ~ size(sK0,X0,sK5)
| ~ size(sK0,X1,X2)
| ~ greater(X0,X1) ),
inference(resolution,[],[f32,f41]) ).
fof(f59,plain,
! [X2,X0,X1] :
( ~ greater(X2,sK6)
| ~ organization(sK0,X2)
| ~ reorganization_free(sK0,sK6,X2)
| ~ complexity(sK0,X0,sK6)
| ~ complexity(sK0,X1,X2)
| ~ greater(X0,X1) ),
inference(resolution,[],[f33,f40]) ).
fof(f63,plain,
! [X0] :
( ~ complexity(sK0,X0,sK5)
| sK1 = X0 ),
inference(resolution,[],[f53,f38]) ).
fof(f74,plain,
! [X2,X3,X0,X1] :
( ~ organization(X3,X1)
| X0 = X1
| greater(X1,X0)
| ~ organization(X2,X0)
| greater(X0,X1) ),
inference(resolution,[],[f49,f28]) ).
fof(f76,plain,
! [X0,X1] :
( ~ organization(X1,X0)
| greater(sK5,X0)
| sK5 = X0
| greater(X0,sK5) ),
inference(resolution,[],[f74,f41]) ).
fof(f83,definition,
( spl7_1
<=> greater(sK5,sK6) ),
introduced(definition,[new_symbols(definition,[spl7_1])],[avatar_definition]) ).
fof(f85,plain,
( greater(sK5,sK6)
| ~ spl7_1 ),
inference(avatar_component_clause,[],[f83]) ).
fof(f87,definition,
( spl7_2
<=> sK5 = sK6 ),
introduced(definition,[new_symbols(definition,[spl7_2])],[avatar_definition]) ).
fof(f89,plain,
( sK5 = sK6
| ~ spl7_2 ),
inference(avatar_component_clause,[],[f87]) ).
fof(f91,definition,
( spl7_3
<=> greater(sK6,sK5) ),
introduced(definition,[new_symbols(definition,[spl7_3])],[avatar_definition]) ).
fof(f93,plain,
( greater(sK6,sK5)
| ~ spl7_3 ),
inference(avatar_component_clause,[],[f91]) ).
fof(f96,plain,
( complexity(sK0,sK2,sK5)
| ~ spl7_2 ),
inference(superposition,[],[f37,f89]) ).
fof(f105,plain,
( greater(sK5,sK6)
| sK5 = sK6
| greater(sK6,sK5) ),
inference(resolution,[],[f76,f40]) ).
fof(f108,plain,
( sK1 = sK2
| ~ spl7_2 ),
inference(resolution,[],[f96,f63]) ).
fof(f113,plain,
( greater(sK1,sK1)
| ~ spl7_2 ),
inference(superposition,[],[f34,f108]) ).
fof(f114,plain,
( $false
| ~ spl7_2 ),
inference(forward_subsumption_resolution,[],[f113,f43]) ).
fof(f115,plain,
~ spl7_2,
inference(avatar_contradiction_clause,[],[f114]) ).
fof(f117,plain,
( spl7_3
| spl7_2
| spl7_1 ),
inference(avatar_split_clause,[],[f105,f83,f87,f91]) ).
fof(f119,plain,
( ! [X0,X1] :
( ~ organization(sK0,sK6)
| ~ reorganization_free(sK0,sK5,sK6)
| ~ size(sK0,X0,sK5)
| ~ size(sK0,X1,sK6)
| ~ greater(X0,X1) )
| ~ spl7_3 ),
inference(resolution,[],[f93,f55]) ).
fof(f122,plain,
( ! [X0,X1] :
( ~ reorganization_free(sK0,sK5,sK6)
| ~ size(sK0,X0,sK5)
| ~ size(sK0,X1,sK6)
| ~ greater(X0,X1) )
| ~ spl7_3 ),
inference(forward_subsumption_resolution,[],[f119,f40]) ).
fof(f124,plain,
( ! [X0,X1] :
( ~ size(sK0,X1,sK6)
| ~ size(sK0,X0,sK5)
| ~ greater(X0,X1) )
| ~ spl7_3 ),
inference(forward_subsumption_resolution,[],[f122,f39]) ).
fof(f126,plain,
( ! [X0] :
( ~ size(sK0,X0,sK5)
| ~ greater(X0,sK4) )
| ~ spl7_3 ),
inference(resolution,[],[f124,f35]) ).
fof(f128,plain,
( ~ greater(sK3,sK4)
| ~ spl7_3 ),
inference(resolution,[],[f126,f36]) ).
fof(f129,plain,
( $false
| ~ spl7_3 ),
inference(forward_subsumption_resolution,[],[f128,f42]) ).
fof(f130,plain,
~ spl7_3,
inference(avatar_contradiction_clause,[],[f129]) ).
fof(f131,plain,
( ! [X0,X1] :
( ~ organization(sK0,sK5)
| ~ reorganization_free(sK0,sK6,sK5)
| ~ complexity(sK0,X0,sK6)
| ~ complexity(sK0,X1,sK5)
| ~ greater(X0,X1) )
| ~ spl7_1 ),
inference(resolution,[],[f85,f59]) ).
fof(f135,plain,
( ! [X0,X1] :
( ~ reorganization_free(sK0,sK6,sK5)
| ~ complexity(sK0,X0,sK6)
| ~ complexity(sK0,X1,sK5)
| ~ greater(X0,X1) )
| ~ spl7_1 ),
inference(forward_subsumption_resolution,[],[f131,f41]) ).
fof(f140,definition,
( spl7_5
<=> reorganization_free(sK0,sK6,sK5) ),
introduced(definition,[new_symbols(definition,[spl7_5])],[avatar_definition]) ).
fof(f142,plain,
( ~ reorganization_free(sK0,sK6,sK5)
| spl7_5 ),
inference(avatar_component_clause,[],[f140]) ).
fof(f145,definition,
( spl7_6
<=> ! [X0,X1] :
( ~ complexity(sK0,X0,sK6)
| ~ greater(X0,X1)
| ~ complexity(sK0,X1,sK5) ) ),
introduced(definition,[new_symbols(definition,[spl7_6])],[avatar_definition]) ).
fof(f146,plain,
( ! [X0,X1] :
( ~ complexity(sK0,X1,sK5)
| ~ greater(X0,X1)
| ~ complexity(sK0,X0,sK6) )
| ~ spl7_6 ),
inference(avatar_component_clause,[],[f145]) ).
fof(f147,plain,
( spl7_6
| ~ spl7_5
| ~ spl7_1 ),
inference(avatar_split_clause,[],[f135,f83,f140,f145]) ).
fof(f148,plain,
( ~ reorganization_free(sK0,sK5,sK6)
| spl7_5 ),
inference(resolution,[],[f142,f30]) ).
fof(f149,plain,
( $false
| spl7_5 ),
inference(forward_subsumption_resolution,[],[f148,f39]) ).
fof(f150,plain,
spl7_5,
inference(avatar_contradiction_clause,[],[f149]) ).
fof(f152,plain,
( ! [X0] :
( ~ complexity(sK0,X0,sK6)
| ~ greater(X0,sK1) )
| ~ spl7_6 ),
inference(resolution,[],[f146,f38]) ).
fof(f153,plain,
( ~ greater(sK2,sK1)
| ~ spl7_6 ),
inference(resolution,[],[f152,f37]) ).
fof(f154,plain,
( $false
| ~ spl7_6 ),
inference(forward_subsumption_resolution,[],[f153,f34]) ).
fof(f155,plain,
~ spl7_6,
inference(avatar_contradiction_clause,[],[f154]) ).
cnf(s2,plain,
~ spl7_2,
inference(sat_conversion,[],[f115]) ).
cnf(s3,plain,
( spl7_1
| spl7_2
| spl7_3 ),
inference(sat_conversion,[],[f117]) ).
cnf(s5,plain,
~ spl7_3,
inference(sat_conversion,[],[f130]) ).
cnf(s8,plain,
( ~ spl7_1
| ~ spl7_5
| spl7_6 ),
inference(sat_conversion,[],[f147]) ).
cnf(s9,plain,
spl7_5,
inference(sat_conversion,[],[f150]) ).
cnf(s10,plain,
~ spl7_6,
inference(sat_conversion,[],[f155]) ).
cnf(s11,plain,
~ spl7_1,
inference(rat,[],[s8,s10,s9]) ).
cnf(s12,plain,
spl7_2,
inference(rat,[],[s3,s5,s11]) ).
cnf(s13,plain,
$false,
inference(rat,[],[s2,s12]) ).
fof(f156,plain,
$false,
inference(avatar_sat_refutation,[],[s13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT013+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.40 % Computer : n008.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:17:09 UTC 2026
% 0.12/0.40 % CPUTime :
% 0.12/0.41 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.46 Running first-order theorem proving
% 0.17/0.46 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
% 0.98/1.79 % (1477044)Detected formulas, will run a generic FOF schedule.
% 0.98/1.79 % (1477051)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=4276314965:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.98/1.79 % (1477049)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=49313500:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.98/1.79 % (1477050)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=1992339748:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.98/1.79 % (1477052)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2786460507:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.98/1.79 % (1477053)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1904198880:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.98/1.79 % (1477053)Refutation not found, incomplete strategy
% 0.98/1.79 % (1477053)------------------------------
% 0.98/1.79 % (1477053)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.98/1.79 % (1477053)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/1.79 % (1477053)CaDiCaL version: 2.1.3
% 0.98/1.79 % (1477053)Termination reason: Refutation not found, incomplete strategy
% 0.98/1.79 % (1477053)Time elapsed: 0.004 s
% 0.98/1.79 % (1477053)Peak memory usage: 88 MB
% 0.98/1.79 % (1477053)Instructions burned: 2 (million)
% 0.98/1.79 % (1477052)Refutation not found, incomplete strategy
% 0.98/1.79 % (1477052)------------------------------
% 0.98/1.79 % (1477052)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.98/1.79 % (1477052)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/1.79 % (1477052)CaDiCaL version: 2.1.3
% 0.98/1.79 % (1477052)Termination reason: Refutation not found, incomplete strategy
% 0.98/1.79 % (1477052)Time elapsed: 0.004 s
% 0.98/1.79 % (1477052)Peak memory usage: 88 MB
% 0.98/1.79 % (1477052)Instructions burned: 2 (million)
% 0.98/1.79 % (1477055)dis-21_1_sil=8000:lcm=predicate:random_seed=2816158482:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 0.98/1.79 % (1477054)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2161931855:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.98/1.79 % (1477055)Refutation not found, incomplete strategy
% 0.98/1.79 % (1477055)------------------------------
% 0.98/1.79 % (1477055)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.98/1.79 % (1477055)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/1.79 % (1477055)CaDiCaL version: 2.1.3
% 0.98/1.79 % (1477055)Termination reason: Refutation not found, incomplete strategy
% 0.98/1.79 % (1477055)Time elapsed: 0.004 s
% 0.98/1.79 % (1477055)Peak memory usage: 88 MB
% 0.98/1.79 % (1477055)Instructions burned: 2 (million)
% 0.98/1.79 % (1477054)First to succeed.
% 0.98/1.79 % (1477054)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1477044"
% 0.98/1.79 % (1477052)------------------------------
% 0.98/1.79 % (1477052)------------------------------
% 0.98/1.79 % (1477053)------------------------------
% 0.98/1.79 % (1477053)------------------------------
% 0.98/1.79 % (1477055)------------------------------
% 0.98/1.79 % (1477055)------------------------------
% 0.98/1.79 % (1477054)Refutation found. Thanks to Tanya!
% 0.98/1.79 % SZS status Theorem for theBenchmark
% 0.98/1.79 % SZS output start Proof for theBenchmark
% See solution above
% 4.85/1.90 % (1477054)------------------------------
% 4.85/1.90 % (1477054)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.85/1.90 % (1477054)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.85/1.90 % (1477054)CaDiCaL version: 2.1.3
% 4.85/1.90 % (1477054)Termination reason: Refutation
% 4.85/1.90 % (1477054)Time elapsed: 0.011 s
% 4.85/1.90 % (1477054)Peak memory usage: 89 MB
% 4.85/1.90 % (1477054)Instructions burned: 7 (million)
% 4.85/1.90 % (1477054)------------------------------
% 4.85/1.90 % (1477054)------------------------------
% 4.85/1.90 % (1477044)Success in time 0.58 s
% 4.85/1.90 % Vampire exiting
%------------------------------------------------------------------------------