%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : PRO018+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n009.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:41 PM UTC 2026
% Result : Theorem 2.90s 0.93s
% Output : Refutation 2.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 22
% Syntax : Number of formulae : 157 ( 28 unt; 10 def)
% Number of atoms : 550 ( 41 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 637 ( 244 ~; 257 |; 111 &)
% ( 11 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 20 ( 18 usr; 10 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-3 aty)
% Number of variables : 201 ( 0 sgn 163 !; 38 ?)
% 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,tptp1)
| occurrence_of(X4,tptp2) )
& 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 != tptp1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_59) ).
fof(f61,axiom,
tptp3 != tptp2,
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,tptp1)
| occurrence_of(X3,tptp2) )
& min_precedes(X2,X3,tptp0)
& leaf_occ(X3,X1)
& ( occurrence_of(X3,tptp1)
=> ~ ? [X4] :
( occurrence_of(X4,tptp2)
& min_precedes(X2,X4,tptp0) ) )
& ( occurrence_of(X3,tptp2)
=> ~ ? [X5] :
( occurrence_of(X5,tptp1)
& min_precedes(X2,X5,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,tptp1)
| occurrence_of(X3,tptp2) )
& min_precedes(X2,X3,tptp0)
& leaf_occ(X3,X1)
& ( occurrence_of(X3,tptp1)
=> ~ ? [X4] :
( occurrence_of(X4,tptp2)
& min_precedes(X2,X4,tptp0) ) )
& ( occurrence_of(X3,tptp2)
=> ~ ? [X5] :
( occurrence_of(X5,tptp1)
& min_precedes(X2,X5,tptp0) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f63]) ).
fof(f66,plain,
! [X0,X1] :
( ( activity(X0)
& activity_occurrence(X1) )
| ~ occurrence_of(X1,X0) ),
inference(ennf_transformation,[],[f1]) ).
fof(f67,plain,
! [X0] :
( ? [X1] :
( activity(X1)
& occurrence_of(X0,X1) )
| ~ activity_occurrence(X0) ),
inference(ennf_transformation,[],[f2]) ).
fof(f68,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(ennf_transformation,[],[f3]) ).
fof(f69,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(flattening,[],[f68]) ).
fof(f94,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(f96,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(f116,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f117,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(flattening,[],[f116]) ).
fof(f133,plain,
! [X0,X1,X2] :
( arboreal(X0)
| ~ min_precedes(X0,X1,X2) ),
inference(ennf_transformation,[],[f47]) ).
fof(f138,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,tptp1)
| occurrence_of(X4,tptp2) )
& 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(f139,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,tptp1)
| occurrence_of(X4,tptp2) )
& 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,[],[f138]) ).
fof(f140,plain,
? [X0,X1] :
( ! [X2,X3] :
( ~ occurrence_of(X2,tptp3)
| ~ next_subocc(X0,X2,tptp0)
| ( ~ occurrence_of(X3,tptp1)
& ~ occurrence_of(X3,tptp2) )
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf_occ(X3,X1)
| ( ? [X4] :
( occurrence_of(X4,tptp2)
& min_precedes(X2,X4,tptp0) )
& occurrence_of(X3,tptp1) )
| ( ? [X5] :
( occurrence_of(X5,tptp1)
& min_precedes(X2,X5,tptp0) )
& occurrence_of(X3,tptp2) ) )
& occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) ),
inference(ennf_transformation,[],[f64]) ).
fof(f141,plain,
? [X0,X1] :
( ! [X2,X3] :
( ~ occurrence_of(X2,tptp3)
| ~ next_subocc(X0,X2,tptp0)
| ( ~ occurrence_of(X3,tptp1)
& ~ occurrence_of(X3,tptp2) )
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf_occ(X3,X1)
| ( ? [X4] :
( occurrence_of(X4,tptp2)
& min_precedes(X2,X4,tptp0) )
& occurrence_of(X3,tptp1) )
| ( ? [X5] :
( occurrence_of(X5,tptp1)
& min_precedes(X2,X5,tptp0) )
& occurrence_of(X3,tptp2) ) )
& occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) ),
inference(flattening,[],[f140]) ).
fof(f142,definition,
! [X2,X3] :
( ( ? [X5] :
( occurrence_of(X5,tptp1)
& min_precedes(X2,X5,tptp0) )
& occurrence_of(X3,tptp2) )
| ~ sP0(X2,X3) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f143,plain,
? [X0,X1] :
( ! [X2,X3] :
( ~ occurrence_of(X2,tptp3)
| ~ next_subocc(X0,X2,tptp0)
| ( ~ occurrence_of(X3,tptp1)
& ~ occurrence_of(X3,tptp2) )
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf_occ(X3,X1)
| ( ? [X4] :
( occurrence_of(X4,tptp2)
& min_precedes(X2,X4,tptp0) )
& occurrence_of(X3,tptp1) )
| sP0(X2,X3) )
& occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) ),
inference(definition_folding,[],[f141,f142]) ).
fof(f144,plain,
! [X0] :
( ( activity(sK1(X0))
& occurrence_of(X0,sK1(X0)) )
| ~ activity_occurrence(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X1,sK1(X0))],[f67]) ).
fof(f155,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,[],[f94]) ).
fof(f156,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,[],[f155]) ).
fof(f157,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,[],[f156]) ).
fof(f158,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X1,X2)
| ~ min_precedes(X0,X1,X2)
| ( min_precedes(X0,sK8(X0,X1,X2),X2)
& min_precedes(sK8(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,[sK8]),skolemize(X3,sK8(X0,X1,X2))],[f157]) ).
fof(f162,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))],[f96]) ).
fof(f170,plain,
! [X0,X1] :
( ( occurrence_of(sK16(X0),tptp3)
& next_subocc(X0,sK16(X0),tptp0)
& occurrence_of(sK17(X0),tptp4)
& min_precedes(sK16(X0),sK17(X0),tptp0)
& ( occurrence_of(sK18(X0),tptp1)
| occurrence_of(sK18(X0),tptp2) )
& min_precedes(sK17(X0),sK18(X0),tptp0)
& ! [X5] :
( sK17(X0) = X5
| sK18(X0) = X5
| ~ min_precedes(sK16(X0),X5,tptp0) ) )
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK16,sK17,sK18]),skolemize(X2,sK16(X0)),skolemize(X3,sK17(X0)),skolemize(X4,sK18(X0))],[f139]) ).
fof(f174,plain,
( ! [X2,X3] :
( ~ occurrence_of(X2,tptp3)
| ~ next_subocc(sK20,X2,tptp0)
| ( ~ occurrence_of(X3,tptp1)
& ~ occurrence_of(X3,tptp2) )
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf_occ(X3,sK21)
| ( occurrence_of(sK22(X2),tptp2)
& min_precedes(X2,sK22(X2),tptp0)
& occurrence_of(X3,tptp1) )
| sP0(X2,X3) )
& occurrence_of(sK21,tptp0)
& subactivity_occurrence(sK20,sK21)
& arboreal(sK20)
& ~ leaf_occ(sK20,sK21) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK20,sK21,sK22]),skolemize(X0,sK20),skolemize(X1,sK21),skolemize(X4,sK22(X2))],[f143]) ).
fof(f175,plain,
! [X0,X1] :
( ~ occurrence_of(X1,X0)
| activity_occurrence(X1) ),
inference(cnf_transformation,[],[f66]) ).
fof(f177,plain,
! [X0] :
( occurrence_of(X0,sK1(X0))
| ~ activity_occurrence(X0) ),
inference(cnf_transformation,[],[f144]) ).
fof(f179,plain,
! [X2,X0,X1] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f69]) ).
fof(f211,plain,
! [X2,X0,X1] :
( ~ next_subocc(X0,X1,X2)
| min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f158]) ).
fof(f221,plain,
! [X2,X0,X1] :
( subactivity_occurrence(X1,sK10(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f162]) ).
fof(f222,plain,
! [X2,X0,X1] :
( occurrence_of(sK10(X0,X1,X2),X0)
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f162]) ).
fof(f240,plain,
! [X2,X3,X0,X1] :
( ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f251,plain,
! [X2,X0,X1] :
( ~ min_precedes(X0,X1,X2)
| arboreal(X0) ),
inference(cnf_transformation,[],[f133]) ).
fof(f254,plain,
! [X0,X1,X5] :
( ~ min_precedes(sK16(X0),X5,tptp0)
| sK18(X0) = X5
| sK17(X0) = X5
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f170]) ).
fof(f256,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| occurrence_of(sK18(X0),tptp2)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK18(X0),tptp1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f170]) ).
fof(f257,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| min_precedes(sK16(X0),sK17(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f170]) ).
fof(f258,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK17(X0),tptp4)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f170]) ).
fof(f259,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| next_subocc(X0,sK16(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f170]) ).
fof(f260,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK16(X0),tptp3)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f170]) ).
fof(f267,plain,
tptp3 != tptp4,
inference(cnf_transformation,[],[f57]) ).
fof(f270,plain,
tptp3 != tptp1,
inference(cnf_transformation,[],[f60]) ).
fof(f271,plain,
tptp3 != tptp2,
inference(cnf_transformation,[],[f61]) ).
fof(f276,plain,
~ leaf_occ(sK20,sK21),
inference(cnf_transformation,[],[f174]) ).
fof(f277,plain,
arboreal(sK20),
inference(cnf_transformation,[],[f174]) ).
fof(f278,plain,
subactivity_occurrence(sK20,sK21),
inference(cnf_transformation,[],[f174]) ).
fof(f279,plain,
occurrence_of(sK21,tptp0),
inference(cnf_transformation,[],[f174]) ).
fof(f327,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| sK1(X0) = X1
| ~ activity_occurrence(X0) ),
inference(resolution,[],[f179,f177]) ).
fof(f330,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| sK1(X0) = X1 ),
inference(forward_subsumption_resolution,[],[f327,f175]) ).
fof(f550,plain,
( ~ occurrence_of(sK21,tptp0)
| occurrence_of(sK17(sK20),tptp4)
| ~ arboreal(sK20)
| leaf_occ(sK20,sK21) ),
inference(resolution,[],[f258,f278]) ).
fof(f558,plain,
( occurrence_of(sK17(sK20),tptp4)
| ~ arboreal(sK20)
| leaf_occ(sK20,sK21) ),
inference(forward_subsumption_resolution,[],[f550,f279]) ).
fof(f559,plain,
( occurrence_of(sK17(sK20),tptp4)
| leaf_occ(sK20,sK21) ),
inference(forward_subsumption_resolution,[],[f558,f277]) ).
fof(f560,plain,
occurrence_of(sK17(sK20),tptp4),
inference(forward_subsumption_resolution,[],[f559,f276]) ).
fof(f567,plain,
tptp4 = sK1(sK17(sK20)),
inference(resolution,[],[f560,f330]) ).
fof(f571,plain,
! [X2,X0,X1] :
( ~ occurrence_of(sK10(X0,X1,X2),tptp0)
| occurrence_of(sK16(X1),tptp3)
| ~ arboreal(X1)
| leaf_occ(X1,sK10(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(resolution,[],[f260,f221]) ).
fof(f576,plain,
! [X2,X0,X1] :
( ~ occurrence_of(sK10(X0,X1,X2),tptp0)
| occurrence_of(sK16(X1),tptp3)
| leaf_occ(X1,sK10(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(forward_subsumption_resolution,[],[f571,f251]) ).
fof(f582,plain,
( ~ occurrence_of(sK21,tptp0)
| next_subocc(sK20,sK16(sK20),tptp0)
| ~ arboreal(sK20)
| leaf_occ(sK20,sK21) ),
inference(resolution,[],[f259,f278]) ).
fof(f584,plain,
! [X2,X0,X1] :
( ~ occurrence_of(sK10(X0,X1,X2),tptp0)
| next_subocc(X1,sK16(X1),tptp0)
| ~ arboreal(X1)
| leaf_occ(X1,sK10(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(resolution,[],[f259,f221]) ).
fof(f589,plain,
! [X2,X0,X1] :
( ~ occurrence_of(sK10(X0,X1,X2),tptp0)
| next_subocc(X1,sK16(X1),tptp0)
| leaf_occ(X1,sK10(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(forward_subsumption_resolution,[],[f584,f251]) ).
fof(f590,plain,
( next_subocc(sK20,sK16(sK20),tptp0)
| ~ arboreal(sK20)
| leaf_occ(sK20,sK21) ),
inference(forward_subsumption_resolution,[],[f582,f279]) ).
fof(f591,plain,
( next_subocc(sK20,sK16(sK20),tptp0)
| leaf_occ(sK20,sK21) ),
inference(forward_subsumption_resolution,[],[f590,f277]) ).
fof(f592,plain,
next_subocc(sK20,sK16(sK20),tptp0),
inference(forward_subsumption_resolution,[],[f591,f276]) ).
fof(f638,plain,
( ~ occurrence_of(sK21,tptp0)
| min_precedes(sK16(sK20),sK17(sK20),tptp0)
| ~ arboreal(sK20)
| leaf_occ(sK20,sK21) ),
inference(resolution,[],[f257,f278]) ).
fof(f639,plain,
( min_precedes(sK16(sK20),sK17(sK20),tptp0)
| ~ arboreal(sK20)
| leaf_occ(sK20,sK21) ),
inference(forward_subsumption_resolution,[],[f638,f279]) ).
fof(f642,plain,
( min_precedes(sK16(sK20),sK17(sK20),tptp0)
| leaf_occ(sK20,sK21) ),
inference(forward_subsumption_resolution,[],[f639,f277]) ).
fof(f643,plain,
min_precedes(sK16(sK20),sK17(sK20),tptp0),
inference(forward_subsumption_resolution,[],[f642,f276]) ).
fof(f656,plain,
( occurrence_of(sK18(sK20),tptp2)
| ~ occurrence_of(sK21,tptp0)
| occurrence_of(sK18(sK20),tptp1)
| ~ arboreal(sK20)
| leaf_occ(sK20,sK21) ),
inference(resolution,[],[f256,f278]) ).
fof(f657,plain,
( occurrence_of(sK18(sK20),tptp2)
| occurrence_of(sK18(sK20),tptp1)
| ~ arboreal(sK20)
| leaf_occ(sK20,sK21) ),
inference(forward_subsumption_resolution,[],[f656,f279]) ).
fof(f660,plain,
( occurrence_of(sK18(sK20),tptp2)
| occurrence_of(sK18(sK20),tptp1)
| leaf_occ(sK20,sK21) ),
inference(forward_subsumption_resolution,[],[f657,f277]) ).
fof(f661,plain,
( occurrence_of(sK18(sK20),tptp2)
| occurrence_of(sK18(sK20),tptp1) ),
inference(forward_subsumption_resolution,[],[f660,f276]) ).
fof(f663,definition,
( spl23_7
<=> occurrence_of(sK18(sK20),tptp1) ),
introduced(definition,[new_symbols(definition,[spl23_7])],[avatar_definition]) ).
fof(f665,plain,
( occurrence_of(sK18(sK20),tptp1)
| ~ spl23_7 ),
inference(avatar_component_clause,[],[f663]) ).
fof(f667,definition,
( spl23_8
<=> occurrence_of(sK18(sK20),tptp2) ),
introduced(definition,[new_symbols(definition,[spl23_8])],[avatar_definition]) ).
fof(f669,plain,
( occurrence_of(sK18(sK20),tptp2)
| ~ spl23_8 ),
inference(avatar_component_clause,[],[f667]) ).
fof(f670,plain,
( spl23_7
| spl23_8 ),
inference(avatar_split_clause,[],[f661,f667,f663]) ).
fof(f699,plain,
min_precedes(sK20,sK16(sK20),tptp0),
inference(resolution,[],[f592,f211]) ).
fof(f823,plain,
! [X0] :
( ~ leaf_occ(sK16(sK20),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f643,f240]) ).
fof(f872,plain,
! [X0] :
( ~ leaf_occ(sK20,X0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f699,f240]) ).
fof(f1909,definition,
( spl23_79
<=> ! [X0] :
( ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK20,X0) ) ),
introduced(definition,[new_symbols(definition,[spl23_79])],[avatar_definition]) ).
fof(f1910,plain,
( ! [X0] :
( ~ subactivity_occurrence(sK20,X0)
| ~ occurrence_of(X0,tptp0) )
| ~ spl23_79 ),
inference(avatar_component_clause,[],[f1909]) ).
fof(f1991,plain,
! [X0,X1] :
( occurrence_of(sK16(X0),tptp3)
| leaf_occ(X0,sK10(tptp0,X0,X1))
| ~ min_precedes(X0,X1,tptp0)
| ~ min_precedes(X0,X1,tptp0) ),
inference(resolution,[],[f576,f222]) ).
fof(f1992,plain,
! [X0,X1] :
( leaf_occ(X0,sK10(tptp0,X0,X1))
| occurrence_of(sK16(X0),tptp3)
| ~ min_precedes(X0,X1,tptp0) ),
inference(duplicate_literal_removal,[],[f1991]) ).
fof(f2093,plain,
! [X0,X1] :
( next_subocc(X0,sK16(X0),tptp0)
| leaf_occ(X0,sK10(tptp0,X0,X1))
| ~ min_precedes(X0,X1,tptp0)
| ~ min_precedes(X0,X1,tptp0) ),
inference(resolution,[],[f589,f222]) ).
fof(f2094,plain,
! [X0,X1] :
( leaf_occ(X0,sK10(tptp0,X0,X1))
| next_subocc(X0,sK16(X0),tptp0)
| ~ min_precedes(X0,X1,tptp0) ),
inference(duplicate_literal_removal,[],[f2093]) ).
fof(f3941,plain,
( ~ occurrence_of(sK21,tptp0)
| ~ spl23_79 ),
inference(resolution,[],[f1910,f278]) ).
fof(f3949,plain,
( $false
| ~ spl23_79 ),
inference(forward_subsumption_resolution,[],[f3941,f279]) ).
fof(f3950,plain,
~ spl23_79,
inference(avatar_contradiction_clause,[],[f3949]) ).
fof(f5043,definition,
( spl23_284
<=> ! [X0] : ~ min_precedes(sK16(sK20),X0,tptp0) ),
introduced(definition,[new_symbols(definition,[spl23_284])],[avatar_definition]) ).
fof(f5044,plain,
( ! [X0] : ~ min_precedes(sK16(sK20),X0,tptp0)
| ~ spl23_284 ),
inference(avatar_component_clause,[],[f5043]) ).
fof(f5115,plain,
! [X0] :
( occurrence_of(sK16(sK16(sK20)),tptp3)
| ~ min_precedes(sK16(sK20),X0,tptp0)
| ~ occurrence_of(sK10(tptp0,sK16(sK20),X0),tptp0) ),
inference(resolution,[],[f1992,f823]) ).
fof(f5193,plain,
( $false
| ~ spl23_284 ),
inference(resolution,[],[f5044,f643]) ).
fof(f5200,plain,
~ spl23_284,
inference(avatar_contradiction_clause,[],[f5193]) ).
fof(f5202,plain,
! [X0] :
( occurrence_of(sK16(sK16(sK20)),tptp3)
| ~ min_precedes(sK16(sK20),X0,tptp0) ),
inference(forward_subsumption_resolution,[],[f5115,f222]) ).
fof(f5204,definition,
( spl23_287
<=> occurrence_of(sK16(sK16(sK20)),tptp3) ),
introduced(definition,[new_symbols(definition,[spl23_287])],[avatar_definition]) ).
fof(f5206,plain,
( occurrence_of(sK16(sK16(sK20)),tptp3)
| ~ spl23_287 ),
inference(avatar_component_clause,[],[f5204]) ).
fof(f5207,plain,
( spl23_284
| spl23_287 ),
inference(avatar_split_clause,[],[f5202,f5204,f5043]) ).
fof(f5266,plain,
! [X0] :
( next_subocc(sK16(sK20),sK16(sK16(sK20)),tptp0)
| ~ min_precedes(sK16(sK20),X0,tptp0)
| ~ occurrence_of(sK10(tptp0,sK16(sK20),X0),tptp0) ),
inference(resolution,[],[f2094,f823]) ).
fof(f5276,plain,
! [X0] :
( next_subocc(sK16(sK20),sK16(sK16(sK20)),tptp0)
| ~ min_precedes(sK16(sK20),X0,tptp0) ),
inference(forward_subsumption_resolution,[],[f5266,f222]) ).
fof(f5286,definition,
( spl23_289
<=> next_subocc(sK16(sK20),sK16(sK16(sK20)),tptp0) ),
introduced(definition,[new_symbols(definition,[spl23_289])],[avatar_definition]) ).
fof(f5288,plain,
( next_subocc(sK16(sK20),sK16(sK16(sK20)),tptp0)
| ~ spl23_289 ),
inference(avatar_component_clause,[],[f5286]) ).
fof(f5289,plain,
( spl23_284
| spl23_289 ),
inference(avatar_split_clause,[],[f5276,f5286,f5043]) ).
fof(f5383,plain,
( tptp3 = sK1(sK16(sK16(sK20)))
| ~ spl23_287 ),
inference(resolution,[],[f5206,f330]) ).
fof(f6041,plain,
( tptp1 = sK1(sK18(sK20))
| ~ spl23_7 ),
inference(resolution,[],[f665,f330]) ).
fof(f6453,plain,
( min_precedes(sK16(sK20),sK16(sK16(sK20)),tptp0)
| ~ spl23_289 ),
inference(resolution,[],[f5288,f211]) ).
fof(f6964,plain,
( ! [X0] :
( sK18(sK20) = sK16(sK16(sK20))
| sK17(sK20) = sK16(sK16(sK20))
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK20,X0)
| ~ arboreal(sK20)
| leaf_occ(sK20,X0) )
| ~ spl23_289 ),
inference(resolution,[],[f6453,f254]) ).
fof(f7020,plain,
( ! [X0] :
( sK18(sK20) = sK16(sK16(sK20))
| sK17(sK20) = sK16(sK16(sK20))
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK20,X0)
| ~ arboreal(sK20) )
| ~ spl23_289 ),
inference(forward_subsumption_resolution,[],[f6964,f872]) ).
fof(f7031,definition,
( spl23_356
<=> occurrence_of(sK16(sK16(sK20)),tptp2) ),
introduced(definition,[new_symbols(definition,[spl23_356])],[avatar_definition]) ).
fof(f7032,plain,
( occurrence_of(sK16(sK16(sK20)),tptp2)
| ~ spl23_356 ),
inference(avatar_component_clause,[],[f7031]) ).
fof(f7049,plain,
( ! [X0] :
( sK18(sK20) = sK16(sK16(sK20))
| sK17(sK20) = sK16(sK16(sK20))
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK20,X0) )
| ~ spl23_289 ),
inference(forward_subsumption_resolution,[],[f7020,f277]) ).
fof(f7051,definition,
( spl23_360
<=> sK17(sK20) = sK16(sK16(sK20)) ),
introduced(definition,[new_symbols(definition,[spl23_360])],[avatar_definition]) ).
fof(f7053,plain,
( sK17(sK20) = sK16(sK16(sK20))
| ~ spl23_360 ),
inference(avatar_component_clause,[],[f7051]) ).
fof(f7055,definition,
( spl23_361
<=> sK18(sK20) = sK16(sK16(sK20)) ),
introduced(definition,[new_symbols(definition,[spl23_361])],[avatar_definition]) ).
fof(f7057,plain,
( sK18(sK20) = sK16(sK16(sK20))
| ~ spl23_361 ),
inference(avatar_component_clause,[],[f7055]) ).
fof(f7058,plain,
( spl23_79
| spl23_360
| spl23_361
| ~ spl23_289 ),
inference(avatar_split_clause,[],[f7049,f5286,f7055,f7051,f1909]) ).
fof(f7653,plain,
( tptp4 = sK1(sK16(sK16(sK20)))
| ~ spl23_360 ),
inference(superposition,[],[f567,f7053]) ).
fof(f8141,plain,
( tptp3 = tptp4
| ~ spl23_287
| ~ spl23_360 ),
inference(superposition,[],[f7653,f5383]) ).
fof(f8154,plain,
( $false
| ~ spl23_287
| ~ spl23_360 ),
inference(forward_subsumption_resolution,[],[f8141,f267]) ).
fof(f8155,plain,
( ~ spl23_287
| ~ spl23_360 ),
inference(avatar_contradiction_clause,[],[f8154]) ).
fof(f8485,plain,
( tptp1 = sK1(sK16(sK16(sK20)))
| ~ spl23_7
| ~ spl23_361 ),
inference(superposition,[],[f6041,f7057]) ).
fof(f8499,plain,
( tptp3 = tptp1
| ~ spl23_7
| ~ spl23_287
| ~ spl23_361 ),
inference(forward_demodulation,[],[f8485,f5383]) ).
fof(f8508,plain,
( $false
| ~ spl23_7
| ~ spl23_287
| ~ spl23_361 ),
inference(forward_subsumption_resolution,[],[f8499,f270]) ).
fof(f8509,plain,
( ~ spl23_7
| ~ spl23_287
| ~ spl23_361 ),
inference(avatar_contradiction_clause,[],[f8508]) ).
fof(f8511,plain,
( occurrence_of(sK16(sK16(sK20)),tptp2)
| ~ spl23_8
| ~ spl23_361 ),
inference(forward_demodulation,[],[f669,f7057]) ).
fof(f8523,plain,
( spl23_356
| ~ spl23_8
| ~ spl23_361 ),
inference(avatar_split_clause,[],[f8511,f7055,f667,f7031]) ).
fof(f8616,plain,
( tptp2 = sK1(sK16(sK16(sK20)))
| ~ spl23_356 ),
inference(resolution,[],[f7032,f330]) ).
fof(f8619,plain,
( tptp3 = tptp2
| ~ spl23_287
| ~ spl23_356 ),
inference(forward_demodulation,[],[f8616,f5383]) ).
fof(f8620,plain,
( $false
| ~ spl23_287
| ~ spl23_356 ),
inference(forward_subsumption_resolution,[],[f8619,f271]) ).
fof(f8621,plain,
( ~ spl23_287
| ~ spl23_356 ),
inference(avatar_contradiction_clause,[],[f8620]) ).
cnf(s4,plain,
( spl23_7
| spl23_8 ),
inference(sat_conversion,[],[f670]) ).
cnf(s178,plain,
~ spl23_79,
inference(sat_conversion,[],[f3950]) ).
cnf(s232,plain,
~ spl23_284,
inference(sat_conversion,[],[f5200]) ).
cnf(s234,plain,
( spl23_284
| spl23_287 ),
inference(sat_conversion,[],[f5207]) ).
cnf(s236,plain,
( spl23_284
| spl23_289 ),
inference(sat_conversion,[],[f5289]) ).
cnf(s299,plain,
( spl23_79
| ~ spl23_289
| spl23_360
| spl23_361 ),
inference(sat_conversion,[],[f7058]) ).
cnf(s330,plain,
( ~ spl23_287
| ~ spl23_360 ),
inference(sat_conversion,[],[f8155]) ).
cnf(s342,plain,
( ~ spl23_7
| ~ spl23_287
| ~ spl23_361 ),
inference(sat_conversion,[],[f8509]) ).
cnf(s344,plain,
( ~ spl23_8
| spl23_356
| ~ spl23_361 ),
inference(sat_conversion,[],[f8523]) ).
cnf(s347,plain,
( ~ spl23_287
| ~ spl23_356 ),
inference(sat_conversion,[],[f8621]) ).
cnf(s350,plain,
spl23_289,
inference(rat,[],[s236,s232]) ).
cnf(s351,plain,
spl23_287,
inference(rat,[],[s234,s232]) ).
cnf(s353,plain,
~ spl23_356,
inference(rat,[],[s347,s351]) ).
cnf(s354,plain,
~ spl23_360,
inference(rat,[],[s330,s351]) ).
cnf(s366,plain,
spl23_361,
inference(rat,[],[s299,s354,s350,s178]) ).
cnf(s367,plain,
~ spl23_7,
inference(rat,[],[s342,s351,s366]) ).
cnf(s368,plain,
~ spl23_8,
inference(rat,[],[s344,s353,s366]) ).
cnf(s382,plain,
$false,
inference(rat,[],[s4,s368,s367]) ).
fof(f8622,plain,
$false,
inference(avatar_sat_refutation,[],[s382]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO018+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.37 % Computer : n009.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Sun Sep 27 22:25:30 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.15/0.40 Running first-order model finding
% 0.15/0.40 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.90/0.92 % (2467075)Will run a generic schedule for satisfiability detection.
% 2.90/0.92 % (2467084)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3733723365:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.90/0.92 % (2467081)% WARNING: option uhcvi not known.
% 2.90/0.92 % (2467080)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3583320954_2999 on theBenchmark for (2999ds/0Mi)
% 2.90/0.92 % (2467081)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2903750285:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.90/0.92 % (2467082)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2333205721:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.90/0.92 % (2467083)dis+10_1_sil=32000:sp=arity:random_seed=1743910682:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.90/0.92 % (2467085)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1649771105:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.90/0.92 % (2467086)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1848128211:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.90/0.92 % Detected minimum model sizes of [4]
% 2.90/0.92 % Detected maximum model sizes of [max]
% 2.90/0.92 % TRYING [4]
% 2.90/0.92 % TRYING [5]
% 2.90/0.92 % (2467084)Instruction limit reached!
% 2.90/0.92 % (2467084)------------------------------
% 2.90/0.92 % (2467084)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.90/0.92 % (2467084)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/0.92 % (2467084)CaDiCaL version: 2.1.3
% 2.90/0.92 % (2467084)Termination reason: Instruction limit
% 2.90/0.92 % (2467084)Termination phase: Saturation
% 2.90/0.92 % (2467084)Time elapsed: 0.035 s
% 2.90/0.92 % (2467084)Peak memory usage: 12 MB
% 2.90/0.92 % (2467084)Instructions burned: 118 (million)
% 2.90/0.92 % (2467094)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3103968277:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.90/0.92 % Detected minimum model sizes of [4]
% 2.90/0.92 % Detected maximum model sizes of [max]
% 2.90/0.92 % TRYING [4]
% 2.90/0.92 % TRYING [5]
% 2.90/0.92 % TRYING [6]
% 2.90/0.92 % (2467083)Instruction limit reached!
% 2.90/0.92 % (2467083)------------------------------
% 2.90/0.92 % (2467083)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.90/0.92 % (2467083)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/0.92 % (2467083)CaDiCaL version: 2.1.3
% 2.90/0.92 % (2467083)Termination reason: Instruction limit
% 2.90/0.92 % (2467083)Termination phase: Saturation
% 2.90/0.92 % (2467083)Time elapsed: 0.068 s
% 2.90/0.92 % (2467083)Peak memory usage: 12 MB
% 2.90/0.92 % (2467083)Instructions burned: 103 (million)
% 2.90/0.92 % TRYING [6]
% 2.90/0.92 % (2467096)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=918708706:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 2.90/0.92 % (2467085)Instruction limit reached!
% 2.90/0.92 % (2467085)------------------------------
% 2.90/0.92 % (2467085)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.90/0.92 % (2467085)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/0.92 % (2467085)CaDiCaL version: 2.1.3
% 2.90/0.92 % (2467085)Termination reason: Instruction limit
% 2.90/0.92 % (2467085)Termination phase: Saturation
% 2.90/0.92 % (2467085)Time elapsed: 0.089 s
% 2.90/0.93 % (2467085)Peak memory usage: 13 MB
% 2.90/0.93 % (2467085)Instructions burned: 132 (million)
% 2.90/0.93 % (2467086)Instruction limit reached!
% 2.90/0.93 % (2467086)------------------------------
% 2.90/0.93 % (2467086)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.90/0.93 % (2467086)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/0.93 % (2467086)CaDiCaL version: 2.1.3
% 2.90/0.93 % (2467086)Termination reason: Instruction limit
% 2.90/0.93 % (2467086)Termination phase: Saturation
% 2.90/0.93 % (2467086)Time elapsed: 0.101 s
% 2.90/0.93 % (2467086)Peak memory usage: 14 MB
% 2.90/0.93 % (2467086)Instructions burned: 159 (million)
% 2.90/0.93 % (2467098)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=2531532987:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.90/0.93 % TRYING [7]
% 2.90/0.93 % (2467099)ott-21_1_sil=16000:fs=off:random_seed=1624017062:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.90/0.93 % TRYING [7]
% 2.90/0.93 % (2467096)Instruction limit reached!
% 2.90/0.93 % (2467096)------------------------------
% 2.90/0.93 % (2467096)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.90/0.93 % (2467096)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/0.93 % (2467096)CaDiCaL version: 2.1.3
% 2.90/0.93 % (2467096)Termination reason: Instruction limit
% 2.90/0.93 % (2467096)Termination phase: Saturation
% 2.90/0.93 % (2467096)Time elapsed: 0.091 s
% 2.90/0.93 % (2467096)Peak memory usage: 13 MB
% 2.90/0.93 % (2467096)Instructions burned: 132 (million)
% 2.90/0.93 % (2467094)Instruction limit reached!
% 2.90/0.93 % (2467094)------------------------------
% 2.90/0.93 % (2467094)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.90/0.93 % (2467094)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/0.93 % (2467094)CaDiCaL version: 2.1.3
% 2.90/0.93 % (2467094)Termination reason: Instruction limit
% 2.90/0.93 % (2467094)Termination phase: Finite model building SAT solving
% 2.90/0.93 % (2467094)Time elapsed: 0.156 s
% 2.90/0.93 % (2467094)Peak memory usage: 32 MB
% 2.90/0.93 % (2467094)Instructions burned: 714 (million)
% 2.90/0.93 % (2467102)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=725646065:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 2.90/0.93 % (2467103)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2895289391:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.90/0.93 % Detected minimum model sizes of [4]
% 2.90/0.93 % Detected maximum model sizes of [max]
% 2.90/0.93 % TRYING [4]
% 2.90/0.93 % (2467099)Instruction limit reached!
% 2.90/0.93 % (2467099)------------------------------
% 2.90/0.93 % (2467099)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.90/0.93 % (2467099)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/0.93 % (2467099)CaDiCaL version: 2.1.3
% 2.90/0.93 % (2467099)Termination reason: Instruction limit
% 2.90/0.93 % (2467099)Termination phase: Saturation
% 2.90/0.93 % (2467099)Time elapsed: 0.096 s
% 2.90/0.93 % (2467099)Peak memory usage: 13 MB
% 2.90/0.93 % (2467099)Instructions burned: 180 (million)
% 2.90/0.93 % TRYING [5]
% 2.90/0.93 % (2467106)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1779143765:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 2.90/0.93 % TRYING [6]
% 2.90/0.93 % TRYING [8]
% 2.90/0.93 % TRYING [7]
% 2.90/0.93 % (2467103)Instruction limit reached!
% 2.90/0.93 % (2467103)------------------------------
% 2.90/0.93 % (2467103)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.90/0.93 % (2467103)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/0.93 % (2467103)CaDiCaL version: 2.1.3
% 2.90/0.93 % (2467103)Termination reason: Instruction limit
% 2.90/0.93 % (2467103)Termination phase: Finite model building constraint generation
% 2.90/0.93 % (2467103)Time elapsed: 0.173 s
% 2.90/0.93 % (2467103)Peak memory usage: 24 MB
% 2.90/0.93 % (2467103)Instructions burned: 865 (million)
% 2.90/0.93 % (2467108)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=2299615305:i=889:ins=1_2995 on theBenchmark for (2995ds/889Mi)
% 2.90/0.93 % TRYING [14]
% 2.90/0.93 % (2467106) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2467075-2467106"...
% 2.90/0.93 % (2467106)...printing done.
% 2.90/0.93 % (2467106)Refutation found. Thanks to Tanya!
% 2.90/0.93 % SZS status Theorem for theBenchmark
% 2.90/0.93 % SZS output start Proof for theBenchmark
% See solution above
% 2.90/0.93 % (2467106)------------------------------
% 2.90/0.93 % (2467106)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.90/0.93 % (2467106)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.90/0.93 % (2467106)CaDiCaL version: 2.1.3
% 2.90/0.93 % (2467106)Termination reason: Refutation
% 2.90/0.93 % (2467106)Time elapsed: 0.238 s
% 2.90/0.93 % (2467106)Peak memory usage: 17 MB
% 2.90/0.93 % (2467106)Instructions burned: 362 (million)
% 2.90/0.93 % (2467075)Success in time 0.515 s
% 2.90/0.93 % Vampire exiting
%------------------------------------------------------------------------------