%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : PRO012+4 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n013.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:30:26 PM UTC 2026
% Result : Theorem 4.16s 1.55s
% Output : Refutation 5.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 11
% Syntax : Number of formulae : 76 ( 24 unt; 0 def)
% Number of atoms : 250 ( 13 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 273 ( 99 ~; 100 |; 61 &)
% ( 1 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-3 aty)
% Number of variables : 158 ( 136 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0,X1,X2,X3] :
( ( occurrence_of(X1,X0)
& arboreal(X2)
& arboreal(X3)
& subactivity_occurrence(X2,X1)
& subactivity_occurrence(X3,X1) )
=> ( min_precedes(X2,X3,X0)
| min_precedes(X3,X2,X0)
| X2 = X3 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_04) ).
fof(f7,axiom,
! [X0,X1,X2] :
( min_precedes(X1,X2,X0)
=> ? [X3] :
( occurrence_of(X3,X0)
& subactivity_occurrence(X1,X3)
& subactivity_occurrence(X2,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_06) ).
fof(f11,axiom,
! [X0,X1,X2] :
( ( occurrence_of(X0,X2)
& root_occ(X1,X0) )
=> ~ ? [X3] : min_precedes(X3,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_10) ).
fof(f14,axiom,
! [X0] :
( legal(X0)
=> arboreal(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_13) ).
fof(f18,axiom,
! [X0,X1] :
( root(X0,X1)
=> legal(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_17) ).
fof(f20,axiom,
! [X0,X1] :
( root_occ(X0,X1)
<=> ? [X2] :
( occurrence_of(X1,X2)
& subactivity_occurrence(X0,X1)
& root(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_19) ).
fof(f23,axiom,
! [X0,X1,X2] :
( min_precedes(X0,X1,X2)
=> ~ root(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_22) ).
fof(f24,axiom,
! [X0,X1,X2] :
( min_precedes(X0,X1,X2)
=> ? [X3] :
( root(X3,X2)
& min_precedes(X3,X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_23) ).
fof(f28,axiom,
! [X0,X1,X2,X3] :
( ( min_precedes(X0,X1,X2)
& occurrence_of(X3,X2)
& subactivity_occurrence(X1,X3) )
=> subactivity_occurrence(X0,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_27) ).
fof(f33,axiom,
! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2,X3] :
( occurrence_of(X1,tptp3)
& root_occ(X1,X0)
& occurrence_of(X2,tptp4)
& min_precedes(X1,X2,tptp0)
& ( occurrence_of(X3,tptp2)
| occurrence_of(X3,tptp1) )
& min_precedes(X2,X3,tptp0)
& ! [X4] :
( min_precedes(X1,X4,tptp0)
=> ( X4 = X2
| X4 = X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32) ).
fof(f46,conjecture,
! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2] :
( occurrence_of(X1,tptp3)
& root_occ(X1,X0)
& ( occurrence_of(X2,tptp2)
| occurrence_of(X2,tptp1) )
& min_precedes(X1,X2,tptp0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f47,negated_conjecture,
~ ! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2] :
( occurrence_of(X1,tptp3)
& root_occ(X1,X0)
& ( occurrence_of(X2,tptp2)
| occurrence_of(X2,tptp1) )
& min_precedes(X1,X2,tptp0) ) ),
inference(negated_conjecture,[status(cth)],[f46]) ).
fof(f62,plain,
! [X0,X1,X2,X3] :
( min_precedes(X2,X3,X0)
| min_precedes(X3,X2,X0)
| X2 = X3
| ~ occurrence_of(X1,X0)
| ~ arboreal(X2)
| ~ arboreal(X3)
| ~ subactivity_occurrence(X2,X1)
| ~ subactivity_occurrence(X3,X1) ),
inference(ennf_transformation,[],[f5]) ).
fof(f63,plain,
! [X0,X1,X2,X3] :
( min_precedes(X2,X3,X0)
| min_precedes(X3,X2,X0)
| X2 = X3
| ~ occurrence_of(X1,X0)
| ~ arboreal(X2)
| ~ arboreal(X3)
| ~ subactivity_occurrence(X2,X1)
| ~ subactivity_occurrence(X3,X1) ),
inference(flattening,[],[f62]) ).
fof(f65,plain,
! [X0,X1,X2] :
( ? [X3] :
( occurrence_of(X3,X0)
& subactivity_occurrence(X1,X3)
& subactivity_occurrence(X2,X3) )
| ~ min_precedes(X1,X2,X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f72,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X3,X1,X2)
| ~ occurrence_of(X0,X2)
| ~ root_occ(X1,X0) ),
inference(ennf_transformation,[],[f11]) ).
fof(f73,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X3,X1,X2)
| ~ occurrence_of(X0,X2)
| ~ root_occ(X1,X0) ),
inference(flattening,[],[f72]) ).
fof(f76,plain,
! [X0] :
( arboreal(X0)
| ~ legal(X0) ),
inference(ennf_transformation,[],[f14]) ).
fof(f80,plain,
! [X0,X1] :
( legal(X0)
| ~ root(X0,X1) ),
inference(ennf_transformation,[],[f18]) ).
fof(f82,plain,
! [X0,X1,X2] :
( ~ root(X1,X2)
| ~ min_precedes(X0,X1,X2) ),
inference(ennf_transformation,[],[f23]) ).
fof(f83,plain,
! [X0,X1,X2] :
( ? [X3] :
( root(X3,X2)
& min_precedes(X3,X1,X2) )
| ~ min_precedes(X0,X1,X2) ),
inference(ennf_transformation,[],[f24]) ).
fof(f88,plain,
! [X0,X1,X2,X3] :
( subactivity_occurrence(X0,X3)
| ~ min_precedes(X0,X1,X2)
| ~ occurrence_of(X3,X2)
| ~ subactivity_occurrence(X1,X3) ),
inference(ennf_transformation,[],[f28]) ).
fof(f89,plain,
! [X0,X1,X2,X3] :
( subactivity_occurrence(X0,X3)
| ~ min_precedes(X0,X1,X2)
| ~ occurrence_of(X3,X2)
| ~ subactivity_occurrence(X1,X3) ),
inference(flattening,[],[f88]) ).
fof(f98,plain,
! [X0] :
( ? [X1,X2,X3] :
( occurrence_of(X1,tptp3)
& root_occ(X1,X0)
& occurrence_of(X2,tptp4)
& min_precedes(X1,X2,tptp0)
& ( occurrence_of(X3,tptp2)
| occurrence_of(X3,tptp1) )
& min_precedes(X2,X3,tptp0)
& ! [X4] :
( X4 = X2
| X4 = X3
| ~ min_precedes(X1,X4,tptp0) ) )
| ~ occurrence_of(X0,tptp0) ),
inference(ennf_transformation,[],[f33]) ).
fof(f99,plain,
! [X0] :
( ? [X1,X2,X3] :
( occurrence_of(X1,tptp3)
& root_occ(X1,X0)
& occurrence_of(X2,tptp4)
& min_precedes(X1,X2,tptp0)
& ( occurrence_of(X3,tptp2)
| occurrence_of(X3,tptp1) )
& min_precedes(X2,X3,tptp0)
& ! [X4] :
( X4 = X2
| X4 = X3
| ~ min_precedes(X1,X4,tptp0) ) )
| ~ occurrence_of(X0,tptp0) ),
inference(flattening,[],[f98]) ).
fof(f100,plain,
? [X0] :
( ! [X1,X2] :
( ~ occurrence_of(X1,tptp3)
| ~ root_occ(X1,X0)
| ( ~ occurrence_of(X2,tptp2)
& ~ occurrence_of(X2,tptp1) )
| ~ min_precedes(X1,X2,tptp0) )
& occurrence_of(X0,tptp0) ),
inference(ennf_transformation,[],[f47]) ).
fof(f103,plain,
! [X0,X1,X2] :
( ( occurrence_of(sK2(X0,X1,X2),X0)
& subactivity_occurrence(X1,sK2(X0,X1,X2))
& subactivity_occurrence(X2,sK2(X0,X1,X2)) )
| ~ min_precedes(X1,X2,X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X3,sK2(X0,X1,X2))],[f65]) ).
fof(f115,plain,
! [X0,X1] :
( ( root_occ(X0,X1)
| ! [X2] :
( ~ occurrence_of(X1,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ root(X0,X2) ) )
& ( ? [X2] :
( occurrence_of(X1,X2)
& subactivity_occurrence(X0,X1)
& root(X0,X2) )
| ~ root_occ(X0,X1) ) ),
inference(nnf_transformation,[],[f20]) ).
fof(f116,plain,
! [X0,X1] :
( ( root_occ(X0,X1)
| ! [X2] :
( ~ occurrence_of(X1,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ root(X0,X2) ) )
& ( ? [X3] :
( occurrence_of(X1,X3)
& subactivity_occurrence(X0,X1)
& root(X0,X3) )
| ~ root_occ(X0,X1) ) ),
inference(rectify,[],[f115]) ).
fof(f117,plain,
! [X0,X1] :
( ( root_occ(X0,X1)
| ! [X2] :
( ~ occurrence_of(X1,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ root(X0,X2) ) )
& ( ( occurrence_of(X1,sK9(X0,X1))
& subactivity_occurrence(X0,X1)
& root(X0,sK9(X0,X1)) )
| ~ root_occ(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9]),skolemize(X3,sK9(X0,X1))],[f116]) ).
fof(f120,plain,
! [X0,X1,X2] :
( ( root(sK10(X1,X2),X2)
& min_precedes(sK10(X1,X2),X1,X2) )
| ~ min_precedes(X0,X1,X2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10]),skolemize(X3,sK10(X1,X2))],[f83]) ).
fof(f122,plain,
! [X0] :
( ( occurrence_of(sK12(X0),tptp3)
& root_occ(sK12(X0),X0)
& occurrence_of(sK13(X0),tptp4)
& min_precedes(sK12(X0),sK13(X0),tptp0)
& ( occurrence_of(sK14(X0),tptp2)
| occurrence_of(sK14(X0),tptp1) )
& min_precedes(sK13(X0),sK14(X0),tptp0)
& ! [X4] :
( sK13(X0) = X4
| sK14(X0) = X4
| ~ min_precedes(sK12(X0),X4,tptp0) ) )
| ~ occurrence_of(X0,tptp0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK12,sK13,sK14]),skolemize(X1,sK12(X0)),skolemize(X2,sK13(X0)),skolemize(X3,sK14(X0))],[f99]) ).
fof(f123,plain,
( ! [X1,X2] :
( ~ occurrence_of(X1,tptp3)
| ~ root_occ(X1,sK15)
| ( ~ occurrence_of(X2,tptp2)
& ~ occurrence_of(X2,tptp1) )
| ~ min_precedes(X1,X2,tptp0) )
& occurrence_of(sK15,tptp0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK15]),skolemize(X0,sK15)],[f100]) ).
fof(f129,plain,
! [X2,X3,X0,X1] :
( ~ subactivity_occurrence(X3,X1)
| min_precedes(X3,X2,X0)
| X2 = X3
| ~ occurrence_of(X1,X0)
| ~ arboreal(X2)
| ~ arboreal(X3)
| ~ subactivity_occurrence(X2,X1)
| min_precedes(X2,X3,X0) ),
inference(cnf_transformation,[],[f63]) ).
fof(f131,plain,
! [X2,X0,X1] :
( subactivity_occurrence(X2,sK2(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f103]) ).
fof(f132,plain,
! [X2,X0,X1] :
( subactivity_occurrence(X1,sK2(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f103]) ).
fof(f133,plain,
! [X2,X0,X1] :
( occurrence_of(sK2(X0,X1,X2),X0)
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f103]) ).
fof(f138,plain,
! [X2,X3,X0,X1] :
( ~ min_precedes(X3,X1,X2)
| ~ occurrence_of(X0,X2)
| ~ root_occ(X1,X0) ),
inference(cnf_transformation,[],[f73]) ).
fof(f142,plain,
! [X0] :
( ~ legal(X0)
| arboreal(X0) ),
inference(cnf_transformation,[],[f76]) ).
fof(f151,plain,
! [X0,X1] :
( ~ root(X0,X1)
| legal(X0) ),
inference(cnf_transformation,[],[f80]) ).
fof(f156,plain,
! [X0,X1] :
( root(X0,sK9(X0,X1))
| ~ root_occ(X0,X1) ),
inference(cnf_transformation,[],[f117]) ).
fof(f164,plain,
! [X2,X0,X1] :
( ~ min_precedes(X0,X1,X2)
| ~ root(X1,X2) ),
inference(cnf_transformation,[],[f82]) ).
fof(f165,plain,
! [X2,X0,X1] :
( ~ min_precedes(X0,X1,X2)
| min_precedes(sK10(X1,X2),X1,X2) ),
inference(cnf_transformation,[],[f120]) ).
fof(f166,plain,
! [X2,X0,X1] :
( ~ min_precedes(X0,X1,X2)
| root(sK10(X1,X2),X2) ),
inference(cnf_transformation,[],[f120]) ).
fof(f172,plain,
! [X2,X3,X0,X1] :
( ~ min_precedes(X0,X1,X2)
| subactivity_occurrence(X0,X3)
| ~ occurrence_of(X3,X2)
| ~ subactivity_occurrence(X1,X3) ),
inference(cnf_transformation,[],[f89]) ).
fof(f178,plain,
! [X0] :
( min_precedes(sK13(X0),sK14(X0),tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f122]) ).
fof(f179,plain,
! [X0] :
( occurrence_of(sK14(X0),tptp1)
| occurrence_of(sK14(X0),tptp2)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f122]) ).
fof(f180,plain,
! [X0] :
( min_precedes(sK12(X0),sK13(X0),tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f122]) ).
fof(f182,plain,
! [X0] :
( root_occ(sK12(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f122]) ).
fof(f183,plain,
! [X0] :
( occurrence_of(sK12(X0),tptp3)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f122]) ).
fof(f195,plain,
occurrence_of(sK15,tptp0),
inference(cnf_transformation,[],[f123]) ).
fof(f196,plain,
! [X2,X1] :
( ~ min_precedes(X1,X2,tptp0)
| ~ root_occ(X1,sK15)
| ~ occurrence_of(X2,tptp1)
| ~ occurrence_of(X1,tptp3) ),
inference(cnf_transformation,[],[f123]) ).
fof(f197,plain,
! [X2,X1] :
( ~ min_precedes(X1,X2,tptp0)
| ~ root_occ(X1,sK15)
| ~ occurrence_of(X2,tptp2)
| ~ occurrence_of(X1,tptp3) ),
inference(cnf_transformation,[],[f123]) ).
fof(f199,plain,
root_occ(sK12(sK15),sK15),
inference(unit_resulting_resolution,[],[f182,f195]) ).
fof(f200,plain,
occurrence_of(sK12(sK15),tptp3),
inference(unit_resulting_resolution,[],[f183,f195]) ).
fof(f201,plain,
root(sK12(sK15),sK9(sK12(sK15),sK15)),
inference(unit_resulting_resolution,[],[f156,f199]) ).
fof(f204,plain,
min_precedes(sK13(sK15),sK14(sK15),tptp0),
inference(unit_resulting_resolution,[],[f178,f195]) ).
fof(f205,plain,
min_precedes(sK12(sK15),sK13(sK15),tptp0),
inference(unit_resulting_resolution,[],[f180,f195]) ).
fof(f206,plain,
! [X0] : ~ min_precedes(X0,sK12(sK15),tptp0),
inference(unit_resulting_resolution,[],[f138,f199,f195]) ).
fof(f237,plain,
root(sK10(sK14(sK15),tptp0),tptp0),
inference(unit_resulting_resolution,[],[f166,f204]) ).
fof(f241,plain,
subactivity_occurrence(sK14(sK15),sK2(tptp0,sK13(sK15),sK14(sK15))),
inference(unit_resulting_resolution,[],[f131,f204]) ).
fof(f243,plain,
subactivity_occurrence(sK13(sK15),sK2(tptp0,sK13(sK15),sK14(sK15))),
inference(unit_resulting_resolution,[],[f132,f204]) ).
fof(f245,plain,
occurrence_of(sK2(tptp0,sK13(sK15),sK14(sK15)),tptp0),
inference(unit_resulting_resolution,[],[f133,f204]) ).
fof(f249,plain,
min_precedes(sK10(sK14(sK15),tptp0),sK14(sK15),tptp0),
inference(unit_resulting_resolution,[],[f165,f204]) ).
fof(f276,plain,
! [X0] : ~ min_precedes(X0,sK10(sK14(sK15),tptp0),tptp0),
inference(unit_resulting_resolution,[],[f164,f237]) ).
fof(f278,plain,
legal(sK10(sK14(sK15),tptp0)),
inference(unit_resulting_resolution,[],[f151,f237]) ).
fof(f284,plain,
legal(sK12(sK15)),
inference(unit_resulting_resolution,[],[f151,f201]) ).
fof(f327,plain,
arboreal(sK12(sK15)),
inference(unit_resulting_resolution,[],[f142,f284]) ).
fof(f343,plain,
subactivity_occurrence(sK10(sK14(sK15),tptp0),sK2(tptp0,sK13(sK15),sK14(sK15))),
inference(unit_resulting_resolution,[],[f172,f249,f245,f241]) ).
fof(f346,plain,
subactivity_occurrence(sK12(sK15),sK2(tptp0,sK13(sK15),sK14(sK15))),
inference(unit_resulting_resolution,[],[f172,f205,f245,f243]) ).
fof(f404,plain,
arboreal(sK10(sK14(sK15),tptp0)),
inference(unit_resulting_resolution,[],[f142,f278]) ).
fof(f736,plain,
sK12(sK15) = sK10(sK14(sK15),tptp0),
inference(unit_resulting_resolution,[],[f129,f327,f245,f346,f343,f276,f206,f404]) ).
fof(f1917,plain,
min_precedes(sK12(sK15),sK14(sK15),tptp0),
inference(superposition,[],[f249,f736]) ).
fof(f2089,plain,
~ occurrence_of(sK14(sK15),tptp2),
inference(unit_resulting_resolution,[],[f197,f200,f199,f1917]) ).
fof(f2090,plain,
~ occurrence_of(sK14(sK15),tptp1),
inference(unit_resulting_resolution,[],[f196,f200,f199,f1917]) ).
fof(f2180,plain,
$false,
inference(unit_resulting_resolution,[],[f179,f195,f2089,f2090]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PRO012+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.35 % Computer : n013.cluster.edu
% 0.11/0.35 % Model : x86_64 x86_64
% 0.11/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.35 % Memory : 8046.5625MB
% 0.11/0.35 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Sun Sep 27 22:21:21 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.36 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/0.39 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
% 4.16/1.55 % (609016)Detected formulas, will run a generic FOF schedule.
% 4.16/1.55 % (609025)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3061797970:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 4.16/1.55 % (609025)Instruction limit reached!
% 4.16/1.55 % (609025)------------------------------
% 4.16/1.55 % (609025)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.16/1.55 % (609025)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.16/1.55 % (609025)CaDiCaL version: 2.1.3
% 4.16/1.55 % (609025)Termination reason: Instruction limit
% 4.16/1.55 % (609025)Termination phase: Saturation
% 4.16/1.55 % (609025)Time elapsed: 0.035 s
% 4.16/1.55 % (609025)Peak memory usage: 88 MB
% 4.16/1.55 % (609025)Instructions burned: 121 (million)
% 4.16/1.55 % (609023)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=50618404:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 4.16/1.55 % (609022)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=3363630619:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 4.16/1.55 % (609024)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2555367146:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 4.16/1.55 % (609021)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=3980884502:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 4.16/1.55 % (609026)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4085104419:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 4.16/1.55 % (609024)Refutation not found, incomplete strategy
% 4.16/1.55 % (609024)------------------------------
% 4.16/1.55 % (609024)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.16/1.55 % (609024)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.16/1.55 % (609024)CaDiCaL version: 2.1.3
% 4.16/1.55 % (609024)Termination reason: Refutation not found, incomplete strategy
% 4.16/1.55 % (609024)Time elapsed: 0.002 s
% 4.16/1.55 % (609024)Peak memory usage: 88 MB
% 4.16/1.55 % (609024)Instructions burned: 2 (million)
% 4.16/1.55 % (609027)dis-21_1_sil=8000:lcm=predicate:random_seed=4104186580: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)
% 4.16/1.55 % (609027)Instruction limit reached!
% 4.16/1.55 % (609027)------------------------------
% 4.16/1.55 % (609027)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.16/1.55 % (609027)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.16/1.55 % (609027)CaDiCaL version: 2.1.3
% 4.16/1.55 % (609027)Termination reason: Instruction limit
% 4.16/1.55 % (609027)Termination phase: Saturation
% 4.16/1.55 % (609027)Time elapsed: 0.081 s
% 4.16/1.55 % (609027)Peak memory usage: 89 MB
% 4.16/1.55 % (609027)Instructions burned: 130 (million)
% 4.16/1.55 % (609026)Instruction limit reached!
% 4.16/1.55 % (609026)------------------------------
% 4.16/1.55 % (609026)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.16/1.55 % (609026)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.16/1.55 % (609026)CaDiCaL version: 2.1.3
% 4.16/1.55 % (609026)Termination reason: Instruction limit
% 4.16/1.55 % (609026)Termination phase: Saturation
% 4.16/1.55 % (609026)Time elapsed: 0.102 s
% 4.16/1.55 % (609026)Peak memory usage: 90 MB
% 4.16/1.55 % (609026)Instructions burned: 140 (million)
% 4.16/1.55 % (609029)lrs+10_1_sil=8000:sp=occurrence:random_seed=3481891900:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 4.16/1.55 % (609029)Instruction limit reached!
% 4.16/1.55 % (609029)------------------------------
% 4.16/1.55 % (609029)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.16/1.55 % (609029)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.16/1.55 % (609029)CaDiCaL version: 2.1.3
% 4.16/1.55 % (609029)Termination reason: Instruction limit
% 4.16/1.55 % (609029)Termination phase: Saturation
% 4.16/1.55 % (609029)Time elapsed: 0.097 s
% 4.16/1.55 % (609029)Peak memory usage: 91 MB
% 4.16/1.55 % (609029)Instructions burned: 287 (million)
% 4.16/1.55 % (609024)------------------------------
% 4.16/1.55 % (609024)------------------------------
% 4.16/1.55 % (609037)lrs+1011_1_sil=32000:sp=occurrence:random_seed=355862205:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 4.16/1.55 % (609036)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2784747891:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 4.16/1.55 % (609036)Refutation not found, incomplete strategy
% 4.16/1.55 % (609036)------------------------------
% 4.16/1.55 % (609036)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.16/1.55 % (609036)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.16/1.55 % (609036)CaDiCaL version: 2.1.3
% 4.16/1.55 % (609036)Termination reason: Refutation not found, incomplete strategy
% 4.16/1.55 % (609036)Time elapsed: 0.003 s
% 4.16/1.55 % (609036)Peak memory usage: 88 MB
% 4.16/1.55 % (609036)Instructions burned: 3 (million)
% 4.16/1.55 % (609039)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=104576705:s2a=on:i=248:s2at=1.23:gtg=position_2996 on theBenchmark for (2996ds/248Mi)
% 4.16/1.55 % (609039)First to succeed.
% 4.16/1.55 % (609039)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-609016"
% 4.16/1.55 % (609042)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=3123141043:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 4.16/1.55 % (609037)Instruction limit reached!
% 4.16/1.55 % (609037)------------------------------
% 4.16/1.55 % (609037)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.16/1.55 % (609037)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.16/1.55 % (609037)CaDiCaL version: 2.1.3
% 4.16/1.55 % (609037)Termination reason: Instruction limit
% 4.16/1.55 % (609037)Termination phase: Saturation
% 4.16/1.55 % (609037)Time elapsed: 0.222 s
% 4.16/1.55 % (609037)Peak memory usage: 92 MB
% 4.16/1.55 % (609037)Instructions burned: 326 (million)
% 4.16/1.55 % (609036)------------------------------
% 4.16/1.55 % (609036)------------------------------
% 4.16/1.55 % (609039)Refutation found. Thanks to Tanya!
% 4.16/1.55 % SZS status Theorem for theBenchmark
% 4.16/1.55 % SZS output start Proof for theBenchmark
% See solution above
% 5.58/1.75 % (609039)------------------------------
% 5.58/1.75 % (609039)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.58/1.75 % (609039)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.58/1.75 % (609039)CaDiCaL version: 2.1.3
% 5.58/1.75 % (609039)Termination reason: Refutation
% 5.58/1.75 % (609039)Time elapsed: 0.042 s
% 5.58/1.75 % (609039)Peak memory usage: 90 MB
% 5.58/1.75 % (609039)Instructions burned: 132 (million)
% 5.58/1.75 % (609039)------------------------------
% 5.58/1.75 % (609039)------------------------------
% 5.58/1.75 % (609016)Success in time 0.71 s
% 5.58/1.75 % Vampire exiting
%------------------------------------------------------------------------------