%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : MGT002+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n012.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:01:56 PM UTC 2026
% Result : Theorem 0.26s 0.83s
% Output : Refutation 2.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 10
% Syntax : Number of formulae : 71 ( 14 unt; 5 def)
% Number of atoms : 286 ( 0 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 383 ( 168 ~; 158 |; 43 &)
% ( 8 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 191 ( 179 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( organization(X0,X1)
=> ? [X2] : reproducibility(X0,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp3) ).
fof(f2,axiom,
! [X0,X1,X2] :
( reorganization_free(X0,X1,X2)
=> ( reorganization_free(X0,X1,X1)
& reorganization_free(X0,X2,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp4) ).
fof(f3,axiom,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ( organization(X0,X2)
& organization(X1,X3)
& reorganization_free(X0,X2,X2)
& reorganization_free(X1,X3,X3)
& reproducibility(X0,X4,X2)
& reproducibility(X1,X5,X3)
& inertia(X0,X6,X2)
& inertia(X1,X7,X3) )
=> ( greater(X5,X4)
<=> greater(X7,X6) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a3_FOL) ).
fof(f4,axiom,
! [X0,X1,X2,X3,X4] :
( ( organization(X0,X3)
& organization(X0,X4)
& reorganization_free(X0,X3,X4)
& reproducibility(X0,X1,X3)
& reproducibility(X0,X2,X4)
& greater(X4,X3) )
=> greater(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a4_FOL) ).
fof(f5,conjecture,
! [X0,X1,X2,X3,X4] :
( ( organization(X0,X3)
& organization(X0,X4)
& reorganization_free(X0,X3,X4)
& inertia(X0,X1,X3)
& inertia(X0,X2,X4)
& greater(X4,X3) )
=> greater(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_FOL) ).
fof(f6,negated_conjecture,
~ ! [X0,X1,X2,X3,X4] :
( ( organization(X0,X3)
& organization(X0,X4)
& reorganization_free(X0,X3,X4)
& inertia(X0,X1,X3)
& inertia(X0,X2,X4)
& greater(X4,X3) )
=> greater(X2,X1) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
fof(f7,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ( greater(X5,X4)
<=> greater(X7,X6) )
| ~ organization(X0,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X0,X2,X2)
| ~ reorganization_free(X1,X3,X3)
| ~ reproducibility(X0,X4,X2)
| ~ reproducibility(X1,X5,X3)
| ~ inertia(X0,X6,X2)
| ~ inertia(X1,X7,X3) ),
inference(ennf_transformation,[],[f3]) ).
fof(f8,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ( greater(X5,X4)
<=> greater(X7,X6) )
| ~ organization(X0,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X0,X2,X2)
| ~ reorganization_free(X1,X3,X3)
| ~ reproducibility(X0,X4,X2)
| ~ reproducibility(X1,X5,X3)
| ~ inertia(X0,X6,X2)
| ~ inertia(X1,X7,X3) ),
inference(flattening,[],[f7]) ).
fof(f9,plain,
! [X0,X1,X2,X3,X4] :
( greater(X2,X1)
| ~ organization(X0,X3)
| ~ organization(X0,X4)
| ~ reorganization_free(X0,X3,X4)
| ~ reproducibility(X0,X1,X3)
| ~ reproducibility(X0,X2,X4)
| ~ greater(X4,X3) ),
inference(ennf_transformation,[],[f4]) ).
fof(f10,plain,
! [X0,X1,X2,X3,X4] :
( greater(X2,X1)
| ~ organization(X0,X3)
| ~ organization(X0,X4)
| ~ reorganization_free(X0,X3,X4)
| ~ reproducibility(X0,X1,X3)
| ~ reproducibility(X0,X2,X4)
| ~ greater(X4,X3) ),
inference(flattening,[],[f9]) ).
fof(f11,plain,
? [X0,X1,X2,X3,X4] :
( ~ greater(X2,X1)
& organization(X0,X3)
& organization(X0,X4)
& reorganization_free(X0,X3,X4)
& inertia(X0,X1,X3)
& inertia(X0,X2,X4)
& greater(X4,X3) ),
inference(ennf_transformation,[],[f6]) ).
fof(f12,plain,
? [X0,X1,X2,X3,X4] :
( ~ greater(X2,X1)
& organization(X0,X3)
& organization(X0,X4)
& reorganization_free(X0,X3,X4)
& inertia(X0,X1,X3)
& inertia(X0,X2,X4)
& greater(X4,X3) ),
inference(flattening,[],[f11]) ).
fof(f13,plain,
! [X0,X1] :
( ? [X2] : reproducibility(X0,X2,X1)
| ~ organization(X0,X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f14,plain,
! [X0,X1,X2] :
( ( reorganization_free(X0,X1,X1)
& reorganization_free(X0,X2,X2) )
| ~ reorganization_free(X0,X1,X2) ),
inference(ennf_transformation,[],[f2]) ).
fof(f15,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ( ( greater(X5,X4)
| ~ greater(X7,X6) )
& ( greater(X7,X6)
| ~ greater(X5,X4) ) )
| ~ organization(X0,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X0,X2,X2)
| ~ reorganization_free(X1,X3,X3)
| ~ reproducibility(X0,X4,X2)
| ~ reproducibility(X1,X5,X3)
| ~ inertia(X0,X6,X2)
| ~ inertia(X1,X7,X3) ),
inference(nnf_transformation,[],[f8]) ).
fof(f16,plain,
( ~ greater(sK2,sK1)
& organization(sK0,sK3)
& organization(sK0,sK4)
& reorganization_free(sK0,sK3,sK4)
& inertia(sK0,sK1,sK3)
& inertia(sK0,sK2,sK4)
& greater(sK4,sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4)],[f12]) ).
fof(f17,plain,
! [X0,X1] :
( reproducibility(X0,sK5(X0,X1),X1)
| ~ organization(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(X2,sK5(X0,X1))],[f13]) ).
fof(f18,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( greater(X7,X6)
| ~ greater(X5,X4)
| ~ organization(X0,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X0,X2,X2)
| ~ reorganization_free(X1,X3,X3)
| ~ reproducibility(X0,X4,X2)
| ~ reproducibility(X1,X5,X3)
| ~ inertia(X0,X6,X2)
| ~ inertia(X1,X7,X3) ),
inference(cnf_transformation,[],[f15]) ).
fof(f20,plain,
! [X2,X3,X0,X1,X4] :
( greater(X2,X1)
| ~ organization(X0,X3)
| ~ organization(X0,X4)
| ~ reorganization_free(X0,X3,X4)
| ~ reproducibility(X0,X1,X3)
| ~ reproducibility(X0,X2,X4)
| ~ greater(X4,X3) ),
inference(cnf_transformation,[],[f10]) ).
fof(f21,plain,
greater(sK4,sK3),
inference(cnf_transformation,[],[f16]) ).
fof(f22,plain,
inertia(sK0,sK2,sK4),
inference(cnf_transformation,[],[f16]) ).
fof(f23,plain,
inertia(sK0,sK1,sK3),
inference(cnf_transformation,[],[f16]) ).
fof(f24,plain,
reorganization_free(sK0,sK3,sK4),
inference(cnf_transformation,[],[f16]) ).
fof(f25,plain,
organization(sK0,sK4),
inference(cnf_transformation,[],[f16]) ).
fof(f26,plain,
organization(sK0,sK3),
inference(cnf_transformation,[],[f16]) ).
fof(f27,plain,
~ greater(sK2,sK1),
inference(cnf_transformation,[],[f16]) ).
fof(f28,plain,
! [X0,X1] :
( reproducibility(X0,sK5(X0,X1),X1)
| ~ organization(X0,X1) ),
inference(cnf_transformation,[],[f17]) ).
fof(f29,plain,
! [X2,X0,X1] :
( ~ reorganization_free(X0,X1,X2)
| reorganization_free(X0,X2,X2) ),
inference(cnf_transformation,[],[f14]) ).
fof(f30,plain,
! [X2,X0,X1] :
( ~ reorganization_free(X0,X1,X2)
| reorganization_free(X0,X1,X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f39,plain,
! [X2,X0,X6,X4] :
( ~ inertia(X0,X6,X2)
| ~ reorganization_free(X0,X2,X2)
| ~ reproducibility(X0,X4,X2)
| ~ organization(X0,X2)
| sP10(X4,X0,X6) ),
inference(cnf_transformation,[],[f39_D]) ).
fof(f39_D,definition,
! [X6,X0,X4] :
( ! [X2] :
( ~ inertia(X0,X6,X2)
| ~ reorganization_free(X0,X2,X2)
| ~ reproducibility(X0,X4,X2)
| ~ organization(X0,X2) )
<=> ~ sP10(X4,X0,X6) ),
introduced(definition,[new_symbols(definition,[sP10])],[general_splitting_component_introduction]) ).
fof(f40,plain,
! [X3,X0,X1,X6,X7,X4,X5] :
( greater(X7,X6)
| ~ greater(X5,X4)
| ~ organization(X1,X3)
| ~ reorganization_free(X1,X3,X3)
| ~ reproducibility(X1,X5,X3)
| ~ inertia(X1,X7,X3)
| ~ sP10(X4,X0,X6) ),
inference(general_splitting,[],[f18,f39_D]) ).
fof(f41,plain,
! [X0,X6,X4] :
( ~ sP10(X4,X0,X6)
| sP11(X4,X6) ),
inference(cnf_transformation,[],[f41_D]) ).
fof(f41_D,definition,
! [X6,X4] :
( ! [X0] : ~ sP10(X4,X0,X6)
<=> ~ sP11(X4,X6) ),
introduced(definition,[new_symbols(definition,[sP11])],[general_splitting_component_introduction]) ).
fof(f42,plain,
! [X3,X1,X6,X7,X4,X5] :
( greater(X7,X6)
| ~ greater(X5,X4)
| ~ organization(X1,X3)
| ~ reorganization_free(X1,X3,X3)
| ~ reproducibility(X1,X5,X3)
| ~ inertia(X1,X7,X3)
| ~ sP11(X4,X6) ),
inference(general_splitting,[],[f40,f41_D]) ).
fof(f43,plain,
! [X6,X7,X4] :
( ~ sP11(X4,X6)
| greater(X7,X6)
| sP12(X4,X7) ),
inference(cnf_transformation,[],[f43_D]) ).
fof(f43_D,definition,
! [X7,X4] :
( ! [X6] :
( ~ sP11(X4,X6)
| greater(X7,X6) )
<=> ~ sP12(X4,X7) ),
introduced(definition,[new_symbols(definition,[sP12])],[general_splitting_component_introduction]) ).
fof(f44,plain,
! [X3,X1,X7,X4,X5] :
( ~ greater(X5,X4)
| ~ organization(X1,X3)
| ~ reorganization_free(X1,X3,X3)
| ~ reproducibility(X1,X5,X3)
| ~ inertia(X1,X7,X3)
| ~ sP12(X4,X7) ),
inference(general_splitting,[],[f42,f43_D]) ).
fof(f45,plain,
! [X7,X4,X5] :
( ~ sP12(X4,X7)
| ~ greater(X5,X4)
| sP13(X7,X5) ),
inference(cnf_transformation,[],[f45_D]) ).
fof(f45_D,definition,
! [X5,X7] :
( ! [X4] :
( ~ sP12(X4,X7)
| ~ greater(X5,X4) )
<=> ~ sP13(X7,X5) ),
introduced(definition,[new_symbols(definition,[sP13])],[general_splitting_component_introduction]) ).
fof(f46,plain,
! [X3,X1,X7,X5] :
( ~ inertia(X1,X7,X3)
| ~ reorganization_free(X1,X3,X3)
| ~ reproducibility(X1,X5,X3)
| ~ organization(X1,X3)
| ~ sP13(X7,X5) ),
inference(general_splitting,[],[f44,f45_D]) ).
fof(f47,plain,
! [X2,X0,X1,X4] :
( ~ reproducibility(X0,X2,X4)
| greater(X2,X1)
| sP14(X4,X0,X1) ),
inference(cnf_transformation,[],[f47_D]) ).
fof(f47_D,definition,
! [X1,X0,X4] :
( ! [X2] :
( ~ reproducibility(X0,X2,X4)
| greater(X2,X1) )
<=> ~ sP14(X4,X0,X1) ),
introduced(definition,[new_symbols(definition,[sP14])],[general_splitting_component_introduction]) ).
fof(f48,plain,
! [X3,X0,X1,X4] :
( ~ sP14(X4,X0,X1)
| ~ organization(X0,X4)
| ~ reorganization_free(X0,X3,X4)
| ~ reproducibility(X0,X1,X3)
| ~ greater(X4,X3)
| ~ organization(X0,X3) ),
inference(general_splitting,[],[f20,f47_D]) ).
fof(f49,plain,
reorganization_free(sK0,sK4,sK4),
inference(resolution,[],[f24,f29]) ).
fof(f50,plain,
reorganization_free(sK0,sK3,sK3),
inference(resolution,[],[f24,f30]) ).
fof(f55,plain,
! [X2,X0,X1] :
( greater(sK5(X0,X1),X2)
| sP14(X1,X0,X2)
| ~ organization(X0,X1) ),
inference(resolution,[],[f47,f28]) ).
fof(f64,plain,
! [X0] :
( ~ reorganization_free(sK0,sK4,sK4)
| ~ reproducibility(sK0,X0,sK4)
| ~ organization(sK0,sK4)
| ~ sP13(sK2,X0) ),
inference(resolution,[],[f46,f22]) ).
fof(f67,plain,
! [X0] :
( ~ reproducibility(sK0,X0,sK4)
| ~ organization(sK0,sK4)
| ~ sP13(sK2,X0) ),
inference(forward_subsumption_resolution,[],[f64,f49]) ).
fof(f69,plain,
! [X0] :
( ~ reproducibility(sK0,X0,sK4)
| ~ sP13(sK2,X0) ),
inference(forward_subsumption_resolution,[],[f67,f25]) ).
fof(f79,plain,
! [X0] :
( ~ reorganization_free(sK0,sK3,sK3)
| ~ reproducibility(sK0,X0,sK3)
| ~ organization(sK0,sK3)
| sP10(X0,sK0,sK1) ),
inference(resolution,[],[f39,f23]) ).
fof(f80,plain,
! [X0] :
( ~ reproducibility(sK0,X0,sK3)
| ~ organization(sK0,sK3)
| sP10(X0,sK0,sK1) ),
inference(forward_subsumption_resolution,[],[f79,f50]) ).
fof(f82,plain,
! [X0] :
( ~ reproducibility(sK0,X0,sK3)
| sP10(X0,sK0,sK1) ),
inference(forward_subsumption_resolution,[],[f80,f26]) ).
fof(f86,plain,
( ~ sP13(sK2,sK5(sK0,sK4))
| ~ organization(sK0,sK4) ),
inference(resolution,[],[f69,f28]) ).
fof(f87,plain,
~ sP13(sK2,sK5(sK0,sK4)),
inference(forward_subsumption_resolution,[],[f86,f25]) ).
fof(f93,plain,
( sP10(sK5(sK0,sK3),sK0,sK1)
| ~ organization(sK0,sK3) ),
inference(resolution,[],[f82,f28]) ).
fof(f94,plain,
sP10(sK5(sK0,sK3),sK0,sK1),
inference(forward_subsumption_resolution,[],[f93,f26]) ).
fof(f99,plain,
sP11(sK5(sK0,sK3),sK1),
inference(resolution,[],[f94,f41]) ).
fof(f102,plain,
! [X0] :
( sP12(sK5(sK0,sK3),X0)
| greater(X0,sK1) ),
inference(resolution,[],[f99,f43]) ).
fof(f106,plain,
! [X0,X1] :
( ~ greater(X1,sK5(sK0,sK3))
| greater(X0,sK1)
| sP13(X0,X1) ),
inference(resolution,[],[f102,f45]) ).
fof(f108,plain,
! [X2,X0,X1] :
( sP14(X2,X1,sK5(sK0,sK3))
| sP13(X0,sK5(X1,X2))
| greater(X0,sK1)
| ~ organization(X1,X2) ),
inference(resolution,[],[f106,f55]) ).
fof(f114,plain,
! [X2,X3,X0,X1] :
( sP13(X0,sK5(X1,X2))
| greater(X0,sK1)
| ~ organization(X1,X2)
| ~ organization(X1,X2)
| ~ reorganization_free(X1,X3,X2)
| ~ reproducibility(X1,sK5(sK0,sK3),X3)
| ~ greater(X2,X3)
| ~ organization(X1,X3) ),
inference(resolution,[],[f108,f48]) ).
fof(f115,plain,
! [X2,X3,X0,X1] :
( ~ reproducibility(X1,sK5(sK0,sK3),X3)
| greater(X0,sK1)
| ~ organization(X1,X2)
| ~ reorganization_free(X1,X3,X2)
| sP13(X0,sK5(X1,X2))
| ~ greater(X2,X3)
| ~ organization(X1,X3) ),
inference(duplicate_literal_removal,[],[f114]) ).
fof(f118,plain,
! [X0,X1] :
( greater(X0,sK1)
| ~ organization(sK0,X1)
| ~ reorganization_free(sK0,sK3,X1)
| sP13(X0,sK5(sK0,X1))
| ~ greater(X1,sK3)
| ~ organization(sK0,sK3)
| ~ organization(sK0,sK3) ),
inference(resolution,[],[f115,f28]) ).
fof(f119,plain,
! [X0,X1] :
( greater(X0,sK1)
| ~ organization(sK0,X1)
| ~ reorganization_free(sK0,sK3,X1)
| sP13(X0,sK5(sK0,X1))
| ~ greater(X1,sK3)
| ~ organization(sK0,sK3) ),
inference(duplicate_literal_removal,[],[f118]) ).
fof(f120,plain,
! [X0,X1] :
( sP13(X0,sK5(sK0,X1))
| ~ organization(sK0,X1)
| ~ reorganization_free(sK0,sK3,X1)
| greater(X0,sK1)
| ~ greater(X1,sK3) ),
inference(forward_subsumption_resolution,[],[f119,f26]) ).
fof(f125,plain,
( ~ organization(sK0,sK4)
| ~ reorganization_free(sK0,sK3,sK4)
| greater(sK2,sK1)
| ~ greater(sK4,sK3) ),
inference(resolution,[],[f120,f87]) ).
fof(f126,plain,
( ~ reorganization_free(sK0,sK3,sK4)
| greater(sK2,sK1)
| ~ greater(sK4,sK3) ),
inference(forward_subsumption_resolution,[],[f125,f25]) ).
fof(f128,plain,
( greater(sK2,sK1)
| ~ greater(sK4,sK3) ),
inference(forward_subsumption_resolution,[],[f126,f24]) ).
fof(f130,plain,
~ greater(sK4,sK3),
inference(forward_subsumption_resolution,[],[f128,f27]) ).
fof(f140,plain,
$false,
inference(forward_subsumption_resolution,[],[f130,f21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : MGT002+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.35 % Computer : n012.cluster.edu
% 0.04/0.35 % Model : x86_64 x86_64
% 0.04/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.35 % Memory : 8046.5625MB
% 0.04/0.35 % OS : Linux 6.8.0-71-generic
% 0.04/0.35 % CPULimit : 300
% 0.04/0.35 % WCLimit : 300
% 0.04/0.35 % DateTime : Sun Sep 27 17:15:05 UTC 2026
% 0.04/0.36 % CPUTime :
% 0.04/0.36 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.37 Running first-order theorem proving
% 0.04/0.37 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
% 0.26/0.83 % (2607090)Detected formulas, will run a generic FOF schedule.
% 0.26/0.83 % (2607095)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=299842884:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.26/0.83 % (2607098)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1002318574:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.26/0.83 % (2607096)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=885630466:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.26/0.83 % (2607100)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=324691456:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.26/0.83 % (2607101)dis-21_1_sil=8000:lcm=predicate:random_seed=3439318350: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.26/0.83 % (2607097)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=1447851870:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.26/0.83 % (2607099)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2437925178:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.26/0.83 % (2607098)First to succeed.
% 0.26/0.83 % (2607100)Also succeeded, but the first one will report.
% 0.26/0.83 % (2607099)Also succeeded, but the first one will report.
% 0.26/0.83 % (2607101)Also succeeded, but the first one will report.
% 0.26/0.83 % (2607098)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2607090"
% 0.26/0.83 % (2607098)Refutation found. Thanks to Tanya!
% 0.26/0.83 % SZS status Theorem for theBenchmark
% 0.26/0.83 % SZS output start Proof for theBenchmark
% See solution above
% 2.06/0.93 % (2607098)------------------------------
% 2.06/0.93 % (2607098)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.06/0.93 % (2607098)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.06/0.93 % (2607098)CaDiCaL version: 2.1.3
% 2.06/0.93 % (2607098)Termination reason: Refutation
% 2.06/0.93 % (2607098)Time elapsed: 0.003 s
% 2.06/0.93 % (2607098)Peak memory usage: 88 MB
% 2.06/0.93 % (2607098)Instructions burned: 6 (million)
% 2.06/0.93 % (2607098)------------------------------
% 2.06/0.93 % (2607098)------------------------------
% 2.06/0.93 % (2607090)Success in time 0.262 s
% 2.06/0.93 % Vampire exiting
%------------------------------------------------------------------------------