%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : PRO017+3 : 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 : 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:30:28 PM UTC 2026
% Result : Theorem 1.03s 0.99s
% Output : Refutation 3.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 20
% Syntax : Number of formulae : 150 ( 26 unt; 8 def)
% Number of atoms : 500 ( 40 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 585 ( 235 ~; 246 |; 84 &)
% ( 10 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 19 ( 17 usr; 9 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-3 aty)
% Number of variables : 187 ( 0 sgn 161 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( occurrence_of(X1,X0)
=> ( activity(X0)
& activity_occurrence(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos) ).
fof(f2,axiom,
! [X0] :
( activity_occurrence(X0)
=> ? [X1] :
( activity(X1)
& occurrence_of(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_01) ).
fof(f3,axiom,
! [X0,X1,X2] :
( ( occurrence_of(X0,X1)
& occurrence_of(X0,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_02) ).
fof(f23,axiom,
! [X0,X1,X2] :
( next_subocc(X0,X1,X2)
<=> ( min_precedes(X0,X1,X2)
& ~ ? [X3] :
( min_precedes(X0,X3,X2)
& min_precedes(X3,X1,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_22) ).
fof(f26,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_25) ).
fof(f38,axiom,
! [X0,X1,X2] :
( ( occurrence_of(X0,X2)
& leaf_occ(X1,X0) )
=> ~ ? [X3] : min_precedes(X1,X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_37) ).
fof(f47,axiom,
! [X0,X1,X2] :
( min_precedes(X0,X1,X2)
=> arboreal(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_46) ).
fof(f50,axiom,
! [X0,X1] :
( ( occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) )
=> ? [X2,X3,X4] :
( occurrence_of(X2,tptp3)
& next_subocc(X0,X2,tptp0)
& occurrence_of(X3,tptp4)
& min_precedes(X2,X3,tptp0)
& ( occurrence_of(X4,tptp2)
| occurrence_of(X4,tptp1) )
& min_precedes(X3,X4,tptp0)
& ! [X5] :
( min_precedes(X2,X5,tptp0)
=> ( X5 = X3
| X5 = X4 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_49) ).
fof(f57,axiom,
tptp4 != tptp3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_56) ).
fof(f60,axiom,
tptp3 != tptp2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_59) ).
fof(f61,axiom,
tptp3 != tptp1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_60) ).
fof(f63,conjecture,
! [X0,X1] :
( ( occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) )
=> ? [X2,X3] :
( occurrence_of(X2,tptp3)
& next_subocc(X0,X2,tptp0)
& ( occurrence_of(X3,tptp2)
| occurrence_of(X3,tptp1) )
& min_precedes(X2,X3,tptp0)
& leaf(X3,tptp0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f64,negated_conjecture,
~ ! [X0,X1] :
( ( occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) )
=> ? [X2,X3] :
( occurrence_of(X2,tptp3)
& next_subocc(X0,X2,tptp0)
& ( occurrence_of(X3,tptp2)
| occurrence_of(X3,tptp1) )
& min_precedes(X2,X3,tptp0)
& leaf(X3,tptp0) ) ),
inference(negated_conjecture,[status(cth)],[f63]) ).
fof(f66,plain,
? [X0,X1] :
( ! [X2,X3] :
( ~ occurrence_of(X2,tptp3)
| ~ next_subocc(X0,X2,tptp0)
| ( ~ occurrence_of(X3,tptp2)
& ~ occurrence_of(X3,tptp1) )
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf(X3,tptp0) )
& occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) ),
inference(ennf_transformation,[],[f64]) ).
fof(f67,plain,
? [X0,X1] :
( ! [X2,X3] :
( ~ occurrence_of(X2,tptp3)
| ~ next_subocc(X0,X2,tptp0)
| ( ~ occurrence_of(X3,tptp2)
& ~ occurrence_of(X3,tptp1) )
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf(X3,tptp0) )
& occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) ),
inference(flattening,[],[f66]) ).
fof(f68,plain,
! [X0,X1] :
( ? [X2,X3,X4] :
( occurrence_of(X2,tptp3)
& next_subocc(X0,X2,tptp0)
& occurrence_of(X3,tptp4)
& min_precedes(X2,X3,tptp0)
& ( occurrence_of(X4,tptp2)
| occurrence_of(X4,tptp1) )
& min_precedes(X3,X4,tptp0)
& ! [X5] :
( X5 = X3
| X5 = X4
| ~ min_precedes(X2,X5,tptp0) ) )
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(ennf_transformation,[],[f50]) ).
fof(f69,plain,
! [X0,X1] :
( ? [X2,X3,X4] :
( occurrence_of(X2,tptp3)
& next_subocc(X0,X2,tptp0)
& occurrence_of(X3,tptp4)
& min_precedes(X2,X3,tptp0)
& ( occurrence_of(X4,tptp2)
| occurrence_of(X4,tptp1) )
& min_precedes(X3,X4,tptp0)
& ! [X5] :
( X5 = X3
| X5 = X4
| ~ min_precedes(X2,X5,tptp0) ) )
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(flattening,[],[f68]) ).
fof(f70,plain,
! [X0,X1,X2] :
( arboreal(X0)
| ~ min_precedes(X0,X1,X2) ),
inference(ennf_transformation,[],[f47]) ).
fof(f84,plain,
! [X0,X1,X2] :
( next_subocc(X0,X1,X2)
<=> ( min_precedes(X0,X1,X2)
& ! [X3] :
( ~ min_precedes(X0,X3,X2)
| ~ min_precedes(X3,X1,X2) ) ) ),
inference(ennf_transformation,[],[f23]) ).
fof(f89,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,[],[f26]) ).
fof(f90,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f91,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(flattening,[],[f90]) ).
fof(f96,plain,
! [X0] :
( ? [X1] :
( activity(X1)
& occurrence_of(X0,X1) )
| ~ activity_occurrence(X0) ),
inference(ennf_transformation,[],[f2]) ).
fof(f97,plain,
! [X0,X1] :
( ( activity(X0)
& activity_occurrence(X1) )
| ~ occurrence_of(X1,X0) ),
inference(ennf_transformation,[],[f1]) ).
fof(f98,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(ennf_transformation,[],[f3]) ).
fof(f99,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(flattening,[],[f98]) ).
fof(f114,plain,
( ! [X2,X3] :
( ~ occurrence_of(X2,tptp3)
| ~ next_subocc(sK0,X2,tptp0)
| ( ~ occurrence_of(X3,tptp2)
& ~ occurrence_of(X3,tptp1) )
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf(X3,tptp0) )
& occurrence_of(sK1,tptp0)
& subactivity_occurrence(sK0,sK1)
& arboreal(sK0)
& ~ leaf_occ(sK0,sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f67]) ).
fof(f115,plain,
! [X0,X1] :
( ( occurrence_of(sK2(X0),tptp3)
& next_subocc(X0,sK2(X0),tptp0)
& occurrence_of(sK3(X0),tptp4)
& min_precedes(sK2(X0),sK3(X0),tptp0)
& ( occurrence_of(sK4(X0),tptp2)
| occurrence_of(sK4(X0),tptp1) )
& min_precedes(sK3(X0),sK4(X0),tptp0)
& ! [X5] :
( sK3(X0) = X5
| sK4(X0) = X5
| ~ min_precedes(sK2(X0),X5,tptp0) ) )
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4]),skolemize(X2,sK2(X0)),skolemize(X3,sK3(X0)),skolemize(X4,sK4(X0))],[f69]) ).
fof(f125,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X1,X2)
| ~ min_precedes(X0,X1,X2)
| ? [X3] :
( min_precedes(X0,X3,X2)
& min_precedes(X3,X1,X2) ) )
& ( ( min_precedes(X0,X1,X2)
& ! [X3] :
( ~ min_precedes(X0,X3,X2)
| ~ min_precedes(X3,X1,X2) ) )
| ~ next_subocc(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f84]) ).
fof(f126,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X1,X2)
| ~ min_precedes(X0,X1,X2)
| ? [X3] :
( min_precedes(X0,X3,X2)
& min_precedes(X3,X1,X2) ) )
& ( ( min_precedes(X0,X1,X2)
& ! [X3] :
( ~ min_precedes(X0,X3,X2)
| ~ min_precedes(X3,X1,X2) ) )
| ~ next_subocc(X0,X1,X2) ) ),
inference(flattening,[],[f125]) ).
fof(f127,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X1,X2)
| ~ min_precedes(X0,X1,X2)
| ? [X3] :
( min_precedes(X0,X3,X2)
& min_precedes(X3,X1,X2) ) )
& ( ( min_precedes(X0,X1,X2)
& ! [X4] :
( ~ min_precedes(X0,X4,X2)
| ~ min_precedes(X4,X1,X2) ) )
| ~ next_subocc(X0,X1,X2) ) ),
inference(rectify,[],[f126]) ).
fof(f128,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X1,X2)
| ~ min_precedes(X0,X1,X2)
| ( min_precedes(X0,sK9(X0,X1,X2),X2)
& min_precedes(sK9(X0,X1,X2),X1,X2) ) )
& ( ( min_precedes(X0,X1,X2)
& ! [X4] :
( ~ min_precedes(X0,X4,X2)
| ~ min_precedes(X4,X1,X2) ) )
| ~ next_subocc(X0,X1,X2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9]),skolemize(X3,sK9(X0,X1,X2))],[f127]) ).
fof(f129,plain,
! [X0,X1,X2] :
( ( occurrence_of(sK10(X0,X1,X2),X0)
& subactivity_occurrence(X1,sK10(X0,X1,X2))
& subactivity_occurrence(X2,sK10(X0,X1,X2)) )
| ~ min_precedes(X1,X2,X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10]),skolemize(X3,sK10(X0,X1,X2))],[f89]) ).
fof(f130,plain,
! [X0] :
( ( activity(sK11(X0))
& occurrence_of(X0,sK11(X0)) )
| ~ activity_occurrence(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK11]),skolemize(X1,sK11(X0))],[f96]) ).
fof(f138,plain,
~ leaf_occ(sK0,sK1),
inference(cnf_transformation,[],[f114]) ).
fof(f139,plain,
arboreal(sK0),
inference(cnf_transformation,[],[f114]) ).
fof(f140,plain,
subactivity_occurrence(sK0,sK1),
inference(cnf_transformation,[],[f114]) ).
fof(f141,plain,
occurrence_of(sK1,tptp0),
inference(cnf_transformation,[],[f114]) ).
fof(f146,plain,
! [X0,X1,X5] :
( ~ min_precedes(sK2(X0),X5,tptp0)
| sK4(X0) = X5
| sK3(X0) = X5
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f115]) ).
fof(f148,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| occurrence_of(sK4(X0),tptp1)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK4(X0),tptp2)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f115]) ).
fof(f149,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| min_precedes(sK2(X0),sK3(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f115]) ).
fof(f150,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK3(X0),tptp4)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f115]) ).
fof(f151,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| next_subocc(X0,sK2(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f115]) ).
fof(f152,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK2(X0),tptp3)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f115]) ).
fof(f153,plain,
tptp3 != tptp1,
inference(cnf_transformation,[],[f61]) ).
fof(f154,plain,
tptp3 != tptp2,
inference(cnf_transformation,[],[f60]) ).
fof(f155,plain,
tptp3 != tptp4,
inference(cnf_transformation,[],[f57]) ).
fof(f162,plain,
! [X2,X0,X1] :
( ~ min_precedes(X0,X1,X2)
| arboreal(X0) ),
inference(cnf_transformation,[],[f70]) ).
fof(f182,plain,
! [X2,X0,X1] :
( ~ next_subocc(X0,X1,X2)
| min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f128]) ).
fof(f188,plain,
! [X2,X0,X1] :
( subactivity_occurrence(X1,sK10(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f129]) ).
fof(f189,plain,
! [X2,X0,X1] :
( occurrence_of(sK10(X0,X1,X2),X0)
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f129]) ).
fof(f190,plain,
! [X2,X3,X0,X1] :
( ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(cnf_transformation,[],[f91]) ).
fof(f194,plain,
! [X0] :
( occurrence_of(X0,sK11(X0))
| ~ activity_occurrence(X0) ),
inference(cnf_transformation,[],[f130]) ).
fof(f196,plain,
! [X0,X1] :
( ~ occurrence_of(X1,X0)
| activity_occurrence(X1) ),
inference(cnf_transformation,[],[f97]) ).
fof(f198,plain,
! [X2,X0,X1] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f99]) ).
fof(f247,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| sK11(X0) = X1
| ~ activity_occurrence(X0) ),
inference(resolution,[],[f198,f194]) ).
fof(f250,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| sK11(X0) = X1 ),
inference(forward_subsumption_resolution,[],[f247,f196]) ).
fof(f383,plain,
( ~ occurrence_of(sK1,tptp0)
| occurrence_of(sK3(sK0),tptp4)
| ~ arboreal(sK0)
| leaf_occ(sK0,sK1) ),
inference(resolution,[],[f150,f140]) ).
fof(f400,plain,
( occurrence_of(sK3(sK0),tptp4)
| ~ arboreal(sK0)
| leaf_occ(sK0,sK1) ),
inference(forward_subsumption_resolution,[],[f383,f141]) ).
fof(f405,plain,
( occurrence_of(sK3(sK0),tptp4)
| leaf_occ(sK0,sK1) ),
inference(forward_subsumption_resolution,[],[f400,f139]) ).
fof(f406,plain,
occurrence_of(sK3(sK0),tptp4),
inference(forward_subsumption_resolution,[],[f405,f138]) ).
fof(f407,plain,
! [X0] :
( ~ occurrence_of(sK3(sK0),X0)
| tptp4 = X0 ),
inference(resolution,[],[f406,f198]) ).
fof(f415,plain,
! [X2,X0,X1] :
( ~ occurrence_of(sK10(X0,X1,X2),tptp0)
| occurrence_of(sK2(X1),tptp3)
| ~ arboreal(X1)
| leaf_occ(X1,sK10(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(resolution,[],[f152,f188]) ).
fof(f428,plain,
! [X2,X0,X1] :
( ~ occurrence_of(sK10(X0,X1,X2),tptp0)
| occurrence_of(sK2(X1),tptp3)
| leaf_occ(X1,sK10(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(forward_subsumption_resolution,[],[f415,f162]) ).
fof(f464,plain,
( ~ occurrence_of(sK1,tptp0)
| next_subocc(sK0,sK2(sK0),tptp0)
| ~ arboreal(sK0)
| leaf_occ(sK0,sK1) ),
inference(resolution,[],[f151,f140]) ).
fof(f466,plain,
! [X2,X0,X1] :
( ~ occurrence_of(sK10(X0,X1,X2),tptp0)
| next_subocc(X1,sK2(X1),tptp0)
| ~ arboreal(X1)
| leaf_occ(X1,sK10(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(resolution,[],[f151,f188]) ).
fof(f479,plain,
! [X2,X0,X1] :
( ~ occurrence_of(sK10(X0,X1,X2),tptp0)
| next_subocc(X1,sK2(X1),tptp0)
| leaf_occ(X1,sK10(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(forward_subsumption_resolution,[],[f466,f162]) ).
fof(f481,plain,
( next_subocc(sK0,sK2(sK0),tptp0)
| ~ arboreal(sK0)
| leaf_occ(sK0,sK1) ),
inference(forward_subsumption_resolution,[],[f464,f141]) ).
fof(f486,plain,
( next_subocc(sK0,sK2(sK0),tptp0)
| leaf_occ(sK0,sK1) ),
inference(forward_subsumption_resolution,[],[f481,f139]) ).
fof(f487,plain,
next_subocc(sK0,sK2(sK0),tptp0),
inference(forward_subsumption_resolution,[],[f486,f138]) ).
fof(f518,plain,
( ~ occurrence_of(sK1,tptp0)
| min_precedes(sK2(sK0),sK3(sK0),tptp0)
| ~ arboreal(sK0)
| leaf_occ(sK0,sK1) ),
inference(resolution,[],[f149,f140]) ).
fof(f535,plain,
( min_precedes(sK2(sK0),sK3(sK0),tptp0)
| ~ arboreal(sK0)
| leaf_occ(sK0,sK1) ),
inference(forward_subsumption_resolution,[],[f518,f141]) ).
fof(f540,plain,
( min_precedes(sK2(sK0),sK3(sK0),tptp0)
| leaf_occ(sK0,sK1) ),
inference(forward_subsumption_resolution,[],[f535,f139]) ).
fof(f541,plain,
min_precedes(sK2(sK0),sK3(sK0),tptp0),
inference(forward_subsumption_resolution,[],[f540,f138]) ).
fof(f552,plain,
min_precedes(sK0,sK2(sK0),tptp0),
inference(resolution,[],[f487,f182]) ).
fof(f562,plain,
! [X0] :
( ~ leaf_occ(sK0,X0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f552,f190]) ).
fof(f579,plain,
( occurrence_of(sK4(sK0),tptp1)
| ~ occurrence_of(sK1,tptp0)
| occurrence_of(sK4(sK0),tptp2)
| ~ arboreal(sK0)
| leaf_occ(sK0,sK1) ),
inference(resolution,[],[f148,f140]) ).
fof(f596,plain,
( occurrence_of(sK4(sK0),tptp1)
| ~ occurrence_of(sK1,tptp0)
| occurrence_of(sK4(sK0),tptp2)
| ~ arboreal(sK0) ),
inference(forward_subsumption_resolution,[],[f579,f562]) ).
fof(f601,plain,
( occurrence_of(sK4(sK0),tptp1)
| occurrence_of(sK4(sK0),tptp2)
| ~ arboreal(sK0) ),
inference(forward_subsumption_resolution,[],[f596,f141]) ).
fof(f602,plain,
( occurrence_of(sK4(sK0),tptp1)
| occurrence_of(sK4(sK0),tptp2) ),
inference(forward_subsumption_resolution,[],[f601,f139]) ).
fof(f604,definition,
( spl20_3
<=> occurrence_of(sK4(sK0),tptp2) ),
introduced(definition,[new_symbols(definition,[spl20_3])],[avatar_definition]) ).
fof(f606,plain,
( occurrence_of(sK4(sK0),tptp2)
| ~ spl20_3 ),
inference(avatar_component_clause,[],[f604]) ).
fof(f608,definition,
( spl20_4
<=> occurrence_of(sK4(sK0),tptp1) ),
introduced(definition,[new_symbols(definition,[spl20_4])],[avatar_definition]) ).
fof(f610,plain,
( occurrence_of(sK4(sK0),tptp1)
| ~ spl20_4 ),
inference(avatar_component_clause,[],[f608]) ).
fof(f611,plain,
( spl20_3
| spl20_4 ),
inference(avatar_split_clause,[],[f602,f608,f604]) ).
fof(f665,plain,
! [X0] :
( ~ leaf_occ(sK2(sK0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f541,f190]) ).
fof(f1066,definition,
( spl20_17
<=> ! [X0] :
( ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK0,X0) ) ),
introduced(definition,[new_symbols(definition,[spl20_17])],[avatar_definition]) ).
fof(f1067,plain,
( ! [X0] :
( ~ subactivity_occurrence(sK0,X0)
| ~ occurrence_of(X0,tptp0) )
| ~ spl20_17 ),
inference(avatar_component_clause,[],[f1066]) ).
fof(f1085,plain,
( ~ occurrence_of(sK1,tptp0)
| ~ spl20_17 ),
inference(resolution,[],[f1067,f140]) ).
fof(f1093,plain,
( $false
| ~ spl20_17 ),
inference(forward_subsumption_resolution,[],[f1085,f141]) ).
fof(f1094,plain,
~ spl20_17,
inference(avatar_contradiction_clause,[],[f1093]) ).
fof(f1217,plain,
! [X0,X1] :
( occurrence_of(sK2(X0),tptp3)
| leaf_occ(X0,sK10(tptp0,X0,X1))
| ~ min_precedes(X0,X1,tptp0)
| ~ min_precedes(X0,X1,tptp0) ),
inference(resolution,[],[f428,f189]) ).
fof(f1218,plain,
! [X0,X1] :
( leaf_occ(X0,sK10(tptp0,X0,X1))
| occurrence_of(sK2(X0),tptp3)
| ~ min_precedes(X0,X1,tptp0) ),
inference(duplicate_literal_removal,[],[f1217]) ).
fof(f1352,plain,
! [X0,X1] :
( next_subocc(X0,sK2(X0),tptp0)
| leaf_occ(X0,sK10(tptp0,X0,X1))
| ~ min_precedes(X0,X1,tptp0)
| ~ min_precedes(X0,X1,tptp0) ),
inference(resolution,[],[f479,f189]) ).
fof(f1353,plain,
! [X0,X1] :
( leaf_occ(X0,sK10(tptp0,X0,X1))
| next_subocc(X0,sK2(X0),tptp0)
| ~ min_precedes(X0,X1,tptp0) ),
inference(duplicate_literal_removal,[],[f1352]) ).
fof(f1869,plain,
( ! [X0] :
( ~ occurrence_of(sK4(sK0),X0)
| tptp2 = X0 )
| ~ spl20_3 ),
inference(resolution,[],[f606,f198]) ).
fof(f3077,definition,
( spl20_79
<=> ! [X0] : ~ min_precedes(sK2(sK0),X0,tptp0) ),
introduced(definition,[new_symbols(definition,[spl20_79])],[avatar_definition]) ).
fof(f3078,plain,
( ! [X0] : ~ min_precedes(sK2(sK0),X0,tptp0)
| ~ spl20_79 ),
inference(avatar_component_clause,[],[f3077]) ).
fof(f3129,plain,
! [X0] :
( occurrence_of(sK2(sK2(sK0)),tptp3)
| ~ min_precedes(sK2(sK0),X0,tptp0)
| ~ occurrence_of(sK10(tptp0,sK2(sK0),X0),tptp0) ),
inference(resolution,[],[f1218,f665]) ).
fof(f3140,plain,
! [X0] :
( occurrence_of(sK2(sK2(sK0)),tptp3)
| ~ min_precedes(sK2(sK0),X0,tptp0) ),
inference(forward_subsumption_resolution,[],[f3129,f189]) ).
fof(f3158,definition,
( spl20_84
<=> occurrence_of(sK2(sK2(sK0)),tptp3) ),
introduced(definition,[new_symbols(definition,[spl20_84])],[avatar_definition]) ).
fof(f3160,plain,
( occurrence_of(sK2(sK2(sK0)),tptp3)
| ~ spl20_84 ),
inference(avatar_component_clause,[],[f3158]) ).
fof(f3161,plain,
( spl20_79
| spl20_84 ),
inference(avatar_split_clause,[],[f3140,f3158,f3077]) ).
fof(f3319,plain,
( tptp3 = sK11(sK2(sK2(sK0)))
| ~ spl20_84 ),
inference(resolution,[],[f3160,f250]) ).
fof(f3338,plain,
! [X0] :
( next_subocc(sK2(sK0),sK2(sK2(sK0)),tptp0)
| ~ min_precedes(sK2(sK0),X0,tptp0)
| ~ occurrence_of(sK10(tptp0,sK2(sK0),X0),tptp0) ),
inference(resolution,[],[f1353,f665]) ).
fof(f3349,plain,
! [X0] :
( next_subocc(sK2(sK0),sK2(sK2(sK0)),tptp0)
| ~ min_precedes(sK2(sK0),X0,tptp0) ),
inference(forward_subsumption_resolution,[],[f3338,f189]) ).
fof(f3362,definition,
( spl20_88
<=> next_subocc(sK2(sK0),sK2(sK2(sK0)),tptp0) ),
introduced(definition,[new_symbols(definition,[spl20_88])],[avatar_definition]) ).
fof(f3364,plain,
( next_subocc(sK2(sK0),sK2(sK2(sK0)),tptp0)
| ~ spl20_88 ),
inference(avatar_component_clause,[],[f3362]) ).
fof(f3365,plain,
( spl20_79
| spl20_88 ),
inference(avatar_split_clause,[],[f3349,f3362,f3077]) ).
fof(f3581,plain,
( min_precedes(sK2(sK0),sK2(sK2(sK0)),tptp0)
| ~ spl20_88 ),
inference(resolution,[],[f3364,f182]) ).
fof(f3806,plain,
( ! [X0] :
( sK4(sK0) = sK2(sK2(sK0))
| sK3(sK0) = sK2(sK2(sK0))
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK0,X0)
| ~ arboreal(sK0)
| leaf_occ(sK0,X0) )
| ~ spl20_88 ),
inference(resolution,[],[f3581,f146]) ).
fof(f3849,plain,
( ! [X0] :
( sK4(sK0) = sK2(sK2(sK0))
| sK3(sK0) = sK2(sK2(sK0))
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK0,X0)
| ~ arboreal(sK0) )
| ~ spl20_88 ),
inference(forward_subsumption_resolution,[],[f3806,f562]) ).
fof(f3850,plain,
( ! [X0] :
( sK4(sK0) = sK2(sK2(sK0))
| sK3(sK0) = sK2(sK2(sK0))
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK0,X0) )
| ~ spl20_88 ),
inference(forward_subsumption_resolution,[],[f3849,f139]) ).
fof(f3852,definition,
( spl20_109
<=> sK3(sK0) = sK2(sK2(sK0)) ),
introduced(definition,[new_symbols(definition,[spl20_109])],[avatar_definition]) ).
fof(f3854,plain,
( sK3(sK0) = sK2(sK2(sK0))
| ~ spl20_109 ),
inference(avatar_component_clause,[],[f3852]) ).
fof(f3856,definition,
( spl20_110
<=> sK4(sK0) = sK2(sK2(sK0)) ),
introduced(definition,[new_symbols(definition,[spl20_110])],[avatar_definition]) ).
fof(f3858,plain,
( sK4(sK0) = sK2(sK2(sK0))
| ~ spl20_110 ),
inference(avatar_component_clause,[],[f3856]) ).
fof(f3859,plain,
( spl20_17
| spl20_109
| spl20_110
| ~ spl20_88 ),
inference(avatar_split_clause,[],[f3850,f3362,f3856,f3852,f1066]) ).
fof(f3907,plain,
( $false
| ~ spl20_79 ),
inference(resolution,[],[f3078,f541]) ).
fof(f3916,plain,
~ spl20_79,
inference(avatar_contradiction_clause,[],[f3907]) ).
fof(f3943,plain,
( occurrence_of(sK3(sK0),tptp3)
| ~ spl20_84
| ~ spl20_109 ),
inference(superposition,[],[f3160,f3854]) ).
fof(f3972,plain,
( tptp3 = tptp4
| ~ spl20_84
| ~ spl20_109 ),
inference(resolution,[],[f3943,f407]) ).
fof(f3980,plain,
( $false
| ~ spl20_84
| ~ spl20_109 ),
inference(forward_subsumption_resolution,[],[f3972,f155]) ).
fof(f3981,plain,
( ~ spl20_84
| ~ spl20_109 ),
inference(avatar_contradiction_clause,[],[f3980]) ).
fof(f3984,plain,
( occurrence_of(sK4(sK0),tptp3)
| ~ spl20_84
| ~ spl20_110 ),
inference(superposition,[],[f3160,f3858]) ).
fof(f3986,plain,
( tptp3 = sK11(sK4(sK0))
| ~ spl20_84
| ~ spl20_110 ),
inference(superposition,[],[f3319,f3858]) ).
fof(f3998,plain,
( tptp3 = tptp2
| ~ spl20_3
| ~ spl20_84
| ~ spl20_110 ),
inference(resolution,[],[f3984,f1869]) ).
fof(f4006,plain,
( $false
| ~ spl20_3
| ~ spl20_84
| ~ spl20_110 ),
inference(forward_subsumption_resolution,[],[f3998,f154]) ).
fof(f4007,plain,
( ~ spl20_3
| ~ spl20_84
| ~ spl20_110 ),
inference(avatar_contradiction_clause,[],[f4006]) ).
fof(f4014,plain,
( tptp1 = sK11(sK4(sK0))
| ~ spl20_4 ),
inference(resolution,[],[f610,f250]) ).
fof(f4016,plain,
( tptp3 = tptp1
| ~ spl20_4
| ~ spl20_84
| ~ spl20_110 ),
inference(forward_demodulation,[],[f4014,f3986]) ).
fof(f4017,plain,
( $false
| ~ spl20_4
| ~ spl20_84
| ~ spl20_110 ),
inference(forward_subsumption_resolution,[],[f4016,f153]) ).
fof(f4018,plain,
( ~ spl20_4
| ~ spl20_84
| ~ spl20_110 ),
inference(avatar_contradiction_clause,[],[f4017]) ).
cnf(s2,plain,
( spl20_3
| spl20_4 ),
inference(sat_conversion,[],[f611]) ).
cnf(s13,plain,
~ spl20_17,
inference(sat_conversion,[],[f1094]) ).
cnf(s62,plain,
( spl20_79
| spl20_84 ),
inference(sat_conversion,[],[f3161]) ).
cnf(s66,plain,
( spl20_79
| spl20_88 ),
inference(sat_conversion,[],[f3365]) ).
cnf(s83,plain,
( spl20_17
| ~ spl20_88
| spl20_109
| spl20_110 ),
inference(sat_conversion,[],[f3859]) ).
cnf(s85,plain,
~ spl20_79,
inference(sat_conversion,[],[f3916]) ).
cnf(s88,plain,
( ~ spl20_84
| ~ spl20_109 ),
inference(sat_conversion,[],[f3981]) ).
cnf(s91,plain,
( ~ spl20_3
| ~ spl20_84
| ~ spl20_110 ),
inference(sat_conversion,[],[f4007]) ).
cnf(s92,plain,
( ~ spl20_4
| ~ spl20_84
| ~ spl20_110 ),
inference(sat_conversion,[],[f4018]) ).
cnf(s95,plain,
spl20_88,
inference(rat,[],[s66,s85]) ).
cnf(s96,plain,
spl20_84,
inference(rat,[],[s62,s85]) ).
cnf(s97,plain,
~ spl20_109,
inference(rat,[],[s88,s96]) ).
cnf(s107,plain,
spl20_110,
inference(rat,[],[s83,s97,s95,s13]) ).
cnf(s108,plain,
~ spl20_4,
inference(rat,[],[s92,s96,s107]) ).
cnf(s109,plain,
~ spl20_3,
inference(rat,[],[s91,s96,s107]) ).
cnf(s111,plain,
$false,
inference(rat,[],[s2,s108,s109]) ).
fof(f4019,plain,
$false,
inference(avatar_sat_refutation,[],[s111]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : PRO017+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.02 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Sun Sep 27 22:24:35 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.30 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.06/0.32 Running first-order theorem proving
% 0.06/0.32 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
% 1.03/0.99 % (2814773)Detected formulas, will run a generic FOF schedule.
% 1.03/0.99 % (2814782)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1697150963:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 1.03/0.99 % (2814781)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2056796223:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 1.03/0.99 % (2814778)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=2541307425:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 1.03/0.99 % (2814780)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=1963322650:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 1.03/0.99 % (2814779)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=3038017530:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 1.03/0.99 % (2814781)Refutation not found, incomplete strategy
% 1.03/0.99 % (2814781)------------------------------
% 1.03/0.99 % (2814781)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.03/0.99 % (2814781)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.03/0.99 % (2814781)CaDiCaL version: 2.1.3
% 1.03/0.99 % (2814781)Termination reason: Refutation not found, incomplete strategy
% 1.03/0.99 % (2814781)Time elapsed: 0.003 s
% 1.03/0.99 % (2814781)Peak memory usage: 88 MB
% 1.03/0.99 % (2814781)Instructions burned: 5 (million)
% 1.03/0.99 % (2814783)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1192458739:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 1.03/0.99 % (2814784)dis-21_1_sil=8000:lcm=predicate:random_seed=376496161: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)
% 1.03/0.99 % (2814782)Instruction limit reached!
% 1.03/0.99 % (2814782)------------------------------
% 1.03/0.99 % (2814782)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.03/0.99 % (2814782)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.03/0.99 % (2814782)CaDiCaL version: 2.1.3
% 1.03/0.99 % (2814782)Termination reason: Instruction limit
% 1.03/0.99 % (2814782)Termination phase: Saturation
% 1.03/0.99 % (2814782)Time elapsed: 0.038 s
% 1.03/0.99 % (2814782)Peak memory usage: 88 MB
% 1.03/0.99 % (2814782)Instructions burned: 120 (million)
% 1.03/0.99 % (2814784)Instruction limit reached!
% 1.03/0.99 % (2814784)------------------------------
% 1.03/0.99 % (2814784)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.03/0.99 % (2814784)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.03/0.99 % (2814784)CaDiCaL version: 2.1.3
% 1.03/0.99 % (2814784)Termination reason: Instruction limit
% 1.03/0.99 % (2814784)Termination phase: Saturation
% 1.03/0.99 % (2814784)Time elapsed: 0.038 s
% 1.03/0.99 % (2814784)Peak memory usage: 88 MB
% 1.03/0.99 % (2814784)Instructions burned: 130 (million)
% 1.03/0.99 % (2814783)Instruction limit reached!
% 1.03/0.99 % (2814783)------------------------------
% 1.03/0.99 % (2814783)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.03/0.99 % (2814783)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.03/0.99 % (2814783)CaDiCaL version: 2.1.3
% 1.03/0.99 % (2814783)Termination reason: Instruction limit
% 1.03/0.99 % (2814783)Termination phase: Saturation
% 1.03/0.99 % (2814783)Time elapsed: 0.052 s
% 1.03/0.99 % (2814783)Peak memory usage: 89 MB
% 1.03/0.99 % (2814783)Instructions burned: 139 (million)
% 1.03/0.99 % (2814792)lrs+10_1_sil=8000:sp=occurrence:random_seed=96383640:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 1.03/0.99 % (2814793)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3829326229:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/157Mi)
% 1.03/0.99 % (2814781)------------------------------
% 1.03/0.99 % (2814781)------------------------------
% 1.03/0.99 % (2814794)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2746274986:i=325:sd=1:ss=axioms:sgt=32_2998 on theBenchmark for (2998ds/325Mi)
% 1.03/0.99 % (2814793)Instruction limit reached!
% 1.03/0.99 % (2814793)------------------------------
% 1.03/0.99 % (2814793)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.03/0.99 % (2814793)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.03/0.99 % (2814793)CaDiCaL version: 2.1.3
% 1.03/0.99 % (2814793)Termination reason: Instruction limit
% 1.03/0.99 % (2814793)Termination phase: Saturation
% 1.03/0.99 % (2814793)Time elapsed: 0.045 s
% 1.03/0.99 % (2814793)Peak memory usage: 89 MB
% 1.03/0.99 % (2814793)Instructions burned: 160 (million)
% 1.03/0.99 % (2814792)First to succeed.
% 1.03/0.99 % (2814792)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2814773"
% 1.03/0.99 % (2814798)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=1800127254:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 1.03/0.99 % (2814794)Instruction limit reached!
% 1.03/0.99 % (2814794)------------------------------
% 1.03/0.99 % (2814794)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.03/0.99 % (2814794)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.03/0.99 % (2814794)CaDiCaL version: 2.1.3
% 1.03/0.99 % (2814794)Termination reason: Instruction limit
% 1.03/0.99 % (2814794)Termination phase: Saturation
% 1.03/0.99 % (2814794)Time elapsed: 0.123 s
% 1.03/0.99 % (2814794)Peak memory usage: 92 MB
% 1.03/0.99 % (2814794)Instructions burned: 326 (million)
% 1.03/0.99 % (2814799)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=1933393123:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2997 on theBenchmark for (2997ds/294Mi)
% 1.03/0.99 % (2814798)Instruction limit reached!
% 1.03/0.99 % (2814798)------------------------------
% 1.03/0.99 % (2814798)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.03/0.99 % (2814798)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.03/0.99 % (2814798)CaDiCaL version: 2.1.3
% 1.03/0.99 % (2814798)Termination reason: Instruction limit
% 1.03/0.99 % (2814798)Termination phase: Saturation
% 1.03/0.99 % (2814798)Time elapsed: 0.073 s
% 1.03/0.99 % (2814798)Peak memory usage: 89 MB
% 1.03/0.99 % (2814798)Instructions burned: 249 (million)
% 1.03/0.99 % (2814778)Also succeeded, but the first one will report.
% 1.03/0.99 % (2814792)Refutation found. Thanks to Tanya!
% 1.03/0.99 % SZS status Theorem for theBenchmark
% 1.03/0.99 % SZS output start Proof for theBenchmark
% See solution above
% 3.48/1.09 % (2814792)------------------------------
% 3.48/1.09 % (2814792)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.48/1.09 % (2814792)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.48/1.09 % (2814792)CaDiCaL version: 2.1.3
% 3.48/1.09 % (2814792)Termination reason: Refutation
% 3.48/1.09 % (2814792)Time elapsed: 0.074 s
% 3.48/1.09 % (2814792)Peak memory usage: 92 MB
% 3.48/1.09 % (2814792)Instructions burned: 206 (million)
% 3.48/1.09 % (2814792)------------------------------
% 3.48/1.09 % (2814792)------------------------------
% 3.48/1.09 % (2814773)Success in time 0.472 s
% 3.48/1.09 % Vampire exiting
%------------------------------------------------------------------------------