%------------------------------------------------------------------------------
% File : Vampire---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 THM
% 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:29 PM UTC 2026
% Result : Theorem 3.52s 1.49s
% Output : Refutation 5.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 21
% Syntax : Number of formulae : 153 ( 26 unt; 9 def)
% Number of atoms : 549 ( 40 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 642 ( 246 ~; 261 |; 111 &)
% ( 10 <=>; 14 =>; 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 : 14 ( 14 usr; 7 con; 0-3 aty)
% Number of variables : 203 ( 0 sgn 165 !; 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(f67,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(f68,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,[],[f67]) ).
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,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(f70,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,[],[f69]) ).
fof(f71,plain,
! [X0,X1,X2] :
( arboreal(X0)
| ~ min_precedes(X0,X1,X2) ),
inference(ennf_transformation,[],[f47]) ).
fof(f82,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(f87,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(f88,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f89,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(flattening,[],[f88]) ).
fof(f94,plain,
! [X0] :
( ? [X1] :
( activity(X1)
& occurrence_of(X0,X1) )
| ~ activity_occurrence(X0) ),
inference(ennf_transformation,[],[f2]) ).
fof(f95,plain,
! [X0,X1] :
( ( activity(X0)
& activity_occurrence(X1) )
| ~ occurrence_of(X1,X0) ),
inference(ennf_transformation,[],[f1]) ).
fof(f96,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(ennf_transformation,[],[f3]) ).
fof(f97,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(flattening,[],[f96]) ).
fof(f105,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(f106,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,[],[f68,f105]) ).
fof(f110,plain,
( ! [X2,X3] :
( ~ occurrence_of(X2,tptp3)
| ~ next_subocc(sK2,X2,tptp0)
| ( ~ occurrence_of(X3,tptp1)
& ~ occurrence_of(X3,tptp2) )
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf_occ(X3,sK3)
| ( occurrence_of(sK4(X2),tptp2)
& min_precedes(X2,sK4(X2),tptp0)
& occurrence_of(X3,tptp1) )
| sP0(X2,X3) )
& occurrence_of(sK3,tptp0)
& subactivity_occurrence(sK2,sK3)
& arboreal(sK2)
& ~ leaf_occ(sK2,sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4]),skolemize(X0,sK2),skolemize(X1,sK3),skolemize(X4,sK4(X2))],[f106]) ).
fof(f111,plain,
! [X0,X1] :
( ( occurrence_of(sK5(X0),tptp3)
& next_subocc(X0,sK5(X0),tptp0)
& occurrence_of(sK6(X0),tptp4)
& min_precedes(sK5(X0),sK6(X0),tptp0)
& ( occurrence_of(sK7(X0),tptp1)
| occurrence_of(sK7(X0),tptp2) )
& min_precedes(sK6(X0),sK7(X0),tptp0)
& ! [X5] :
( sK6(X0) = X5
| sK7(X0) = X5
| ~ min_precedes(sK5(X0),X5,tptp0) ) )
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK6,sK7]),skolemize(X2,sK5(X0)),skolemize(X3,sK6(X0)),skolemize(X4,sK7(X0))],[f70]) ).
fof(f113,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,[],[f82]) ).
fof(f114,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,[],[f113]) ).
fof(f115,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,[],[f114]) ).
fof(f116,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))],[f115]) ).
fof(f117,plain,
! [X0,X1,X2] :
( ( occurrence_of(sK9(X0,X1,X2),X0)
& subactivity_occurrence(X1,sK9(X0,X1,X2))
& subactivity_occurrence(X2,sK9(X0,X1,X2)) )
| ~ min_precedes(X1,X2,X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9]),skolemize(X3,sK9(X0,X1,X2))],[f87]) ).
fof(f118,plain,
! [X0] :
( ( activity(sK10(X0))
& occurrence_of(X0,sK10(X0)) )
| ~ activity_occurrence(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10]),skolemize(X1,sK10(X0))],[f94]) ).
fof(f125,plain,
~ leaf_occ(sK2,sK3),
inference(cnf_transformation,[],[f110]) ).
fof(f126,plain,
arboreal(sK2),
inference(cnf_transformation,[],[f110]) ).
fof(f127,plain,
subactivity_occurrence(sK2,sK3),
inference(cnf_transformation,[],[f110]) ).
fof(f128,plain,
occurrence_of(sK3,tptp0),
inference(cnf_transformation,[],[f110]) ).
fof(f137,plain,
! [X0,X1,X5] :
( ~ min_precedes(sK5(X0),X5,tptp0)
| sK7(X0) = X5
| sK6(X0) = X5
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f111]) ).
fof(f139,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| occurrence_of(sK7(X0),tptp2)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK7(X0),tptp1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f111]) ).
fof(f140,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| min_precedes(sK5(X0),sK6(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f111]) ).
fof(f141,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK6(X0),tptp4)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f111]) ).
fof(f142,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| next_subocc(X0,sK5(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f111]) ).
fof(f143,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK5(X0),tptp3)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f111]) ).
fof(f144,plain,
tptp3 != tptp2,
inference(cnf_transformation,[],[f61]) ).
fof(f145,plain,
tptp3 != tptp1,
inference(cnf_transformation,[],[f60]) ).
fof(f146,plain,
tptp3 != tptp4,
inference(cnf_transformation,[],[f57]) ).
fof(f153,plain,
! [X2,X0,X1] :
( ~ min_precedes(X0,X1,X2)
| arboreal(X0) ),
inference(cnf_transformation,[],[f71]) ).
fof(f163,plain,
! [X2,X0,X1] :
( ~ next_subocc(X0,X1,X2)
| min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f116]) ).
fof(f169,plain,
! [X2,X0,X1] :
( subactivity_occurrence(X1,sK9(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f170,plain,
! [X2,X0,X1] :
( occurrence_of(sK9(X0,X1,X2),X0)
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f171,plain,
! [X2,X3,X0,X1] :
( ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(cnf_transformation,[],[f89]) ).
fof(f175,plain,
! [X0] :
( occurrence_of(X0,sK10(X0))
| ~ activity_occurrence(X0) ),
inference(cnf_transformation,[],[f118]) ).
fof(f177,plain,
! [X0,X1] :
( ~ occurrence_of(X1,X0)
| activity_occurrence(X1) ),
inference(cnf_transformation,[],[f95]) ).
fof(f179,plain,
! [X2,X0,X1] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f97]) ).
fof(f213,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| sK10(X0) = X1
| ~ activity_occurrence(X0) ),
inference(resolution,[],[f179,f175]) ).
fof(f215,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| sK10(X0) = X1 ),
inference(forward_subsumption_resolution,[],[f213,f177]) ).
fof(f254,plain,
( ~ occurrence_of(sK3,tptp0)
| occurrence_of(sK6(sK2),tptp4)
| ~ arboreal(sK2)
| leaf_occ(sK2,sK3) ),
inference(resolution,[],[f141,f127]) ).
fof(f259,plain,
( occurrence_of(sK6(sK2),tptp4)
| ~ arboreal(sK2)
| leaf_occ(sK2,sK3) ),
inference(forward_subsumption_resolution,[],[f254,f128]) ).
fof(f260,plain,
( occurrence_of(sK6(sK2),tptp4)
| leaf_occ(sK2,sK3) ),
inference(forward_subsumption_resolution,[],[f259,f126]) ).
fof(f261,plain,
occurrence_of(sK6(sK2),tptp4),
inference(forward_subsumption_resolution,[],[f260,f125]) ).
fof(f263,plain,
! [X0] :
( ~ occurrence_of(sK6(sK2),X0)
| tptp4 = X0 ),
inference(resolution,[],[f261,f179]) ).
fof(f271,plain,
! [X2,X0,X1] :
( ~ occurrence_of(sK9(X0,X1,X2),tptp0)
| occurrence_of(sK5(X1),tptp3)
| ~ arboreal(X1)
| leaf_occ(X1,sK9(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(resolution,[],[f143,f169]) ).
fof(f272,plain,
! [X2,X0,X1] :
( ~ occurrence_of(sK9(X0,X1,X2),tptp0)
| occurrence_of(sK5(X1),tptp3)
| leaf_occ(X1,sK9(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(forward_subsumption_resolution,[],[f271,f153]) ).
fof(f295,plain,
( ~ occurrence_of(sK3,tptp0)
| next_subocc(sK2,sK5(sK2),tptp0)
| ~ arboreal(sK2)
| leaf_occ(sK2,sK3) ),
inference(resolution,[],[f142,f127]) ).
fof(f297,plain,
! [X2,X0,X1] :
( ~ occurrence_of(sK9(X0,X1,X2),tptp0)
| next_subocc(X1,sK5(X1),tptp0)
| ~ arboreal(X1)
| leaf_occ(X1,sK9(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(resolution,[],[f142,f169]) ).
fof(f298,plain,
! [X2,X0,X1] :
( ~ occurrence_of(sK9(X0,X1,X2),tptp0)
| next_subocc(X1,sK5(X1),tptp0)
| leaf_occ(X1,sK9(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(forward_subsumption_resolution,[],[f297,f153]) ).
fof(f300,plain,
( next_subocc(sK2,sK5(sK2),tptp0)
| ~ arboreal(sK2)
| leaf_occ(sK2,sK3) ),
inference(forward_subsumption_resolution,[],[f295,f128]) ).
fof(f301,plain,
( next_subocc(sK2,sK5(sK2),tptp0)
| leaf_occ(sK2,sK3) ),
inference(forward_subsumption_resolution,[],[f300,f126]) ).
fof(f302,plain,
next_subocc(sK2,sK5(sK2),tptp0),
inference(forward_subsumption_resolution,[],[f301,f125]) ).
fof(f318,plain,
( ~ occurrence_of(sK3,tptp0)
| min_precedes(sK5(sK2),sK6(sK2),tptp0)
| ~ arboreal(sK2)
| leaf_occ(sK2,sK3) ),
inference(resolution,[],[f140,f127]) ).
fof(f323,plain,
( min_precedes(sK5(sK2),sK6(sK2),tptp0)
| ~ arboreal(sK2)
| leaf_occ(sK2,sK3) ),
inference(forward_subsumption_resolution,[],[f318,f128]) ).
fof(f324,plain,
( min_precedes(sK5(sK2),sK6(sK2),tptp0)
| leaf_occ(sK2,sK3) ),
inference(forward_subsumption_resolution,[],[f323,f126]) ).
fof(f325,plain,
min_precedes(sK5(sK2),sK6(sK2),tptp0),
inference(forward_subsumption_resolution,[],[f324,f125]) ).
fof(f338,plain,
min_precedes(sK2,sK5(sK2),tptp0),
inference(resolution,[],[f302,f163]) ).
fof(f368,plain,
( occurrence_of(sK7(sK2),tptp2)
| ~ occurrence_of(sK3,tptp0)
| occurrence_of(sK7(sK2),tptp1)
| ~ arboreal(sK2)
| leaf_occ(sK2,sK3) ),
inference(resolution,[],[f139,f127]) ).
fof(f373,plain,
( occurrence_of(sK7(sK2),tptp2)
| occurrence_of(sK7(sK2),tptp1)
| ~ arboreal(sK2)
| leaf_occ(sK2,sK3) ),
inference(forward_subsumption_resolution,[],[f368,f128]) ).
fof(f374,plain,
( occurrence_of(sK7(sK2),tptp2)
| occurrence_of(sK7(sK2),tptp1)
| leaf_occ(sK2,sK3) ),
inference(forward_subsumption_resolution,[],[f373,f126]) ).
fof(f375,plain,
( occurrence_of(sK7(sK2),tptp2)
| occurrence_of(sK7(sK2),tptp1) ),
inference(forward_subsumption_resolution,[],[f374,f125]) ).
fof(f377,definition,
( spl15_5
<=> occurrence_of(sK7(sK2),tptp1) ),
introduced(definition,[new_symbols(definition,[spl15_5])],[avatar_definition]) ).
fof(f379,plain,
( occurrence_of(sK7(sK2),tptp1)
| ~ spl15_5 ),
inference(avatar_component_clause,[],[f377]) ).
fof(f381,definition,
( spl15_6
<=> occurrence_of(sK7(sK2),tptp2) ),
introduced(definition,[new_symbols(definition,[spl15_6])],[avatar_definition]) ).
fof(f383,plain,
( occurrence_of(sK7(sK2),tptp2)
| ~ spl15_6 ),
inference(avatar_component_clause,[],[f381]) ).
fof(f384,plain,
( spl15_5
| spl15_6 ),
inference(avatar_split_clause,[],[f375,f381,f377]) ).
fof(f415,plain,
! [X0] :
( ~ leaf_occ(sK5(sK2),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f325,f171]) ).
fof(f423,plain,
! [X0] :
( ~ leaf_occ(sK2,X0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f338,f171]) ).
fof(f547,plain,
! [X0,X1] :
( occurrence_of(sK5(X0),tptp3)
| leaf_occ(X0,sK9(tptp0,X0,X1))
| ~ min_precedes(X0,X1,tptp0)
| ~ min_precedes(X0,X1,tptp0) ),
inference(resolution,[],[f272,f170]) ).
fof(f548,plain,
! [X0,X1] :
( leaf_occ(X0,sK9(tptp0,X0,X1))
| occurrence_of(sK5(X0),tptp3)
| ~ min_precedes(X0,X1,tptp0) ),
inference(duplicate_literal_removal,[],[f547]) ).
fof(f594,plain,
! [X0,X1] :
( next_subocc(X0,sK5(X0),tptp0)
| leaf_occ(X0,sK9(tptp0,X0,X1))
| ~ min_precedes(X0,X1,tptp0)
| ~ min_precedes(X0,X1,tptp0) ),
inference(resolution,[],[f298,f170]) ).
fof(f595,plain,
! [X0,X1] :
( leaf_occ(X0,sK9(tptp0,X0,X1))
| next_subocc(X0,sK5(X0),tptp0)
| ~ min_precedes(X0,X1,tptp0) ),
inference(duplicate_literal_removal,[],[f594]) ).
fof(f774,definition,
( spl15_24
<=> ! [X0] :
( ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK2,X0) ) ),
introduced(definition,[new_symbols(definition,[spl15_24])],[avatar_definition]) ).
fof(f775,plain,
( ! [X0] :
( ~ subactivity_occurrence(sK2,X0)
| ~ occurrence_of(X0,tptp0) )
| ~ spl15_24 ),
inference(avatar_component_clause,[],[f774]) ).
fof(f948,plain,
( ! [X0] :
( ~ occurrence_of(sK7(sK2),X0)
| tptp1 = X0 )
| ~ spl15_5 ),
inference(resolution,[],[f379,f179]) ).
fof(f1236,definition,
( spl15_59
<=> ! [X0] : ~ min_precedes(sK5(sK2),X0,tptp0) ),
introduced(definition,[new_symbols(definition,[spl15_59])],[avatar_definition]) ).
fof(f1237,plain,
( ! [X0] : ~ min_precedes(sK5(sK2),X0,tptp0)
| ~ spl15_59 ),
inference(avatar_component_clause,[],[f1236]) ).
fof(f1270,plain,
! [X0] :
( occurrence_of(sK5(sK5(sK2)),tptp3)
| ~ min_precedes(sK5(sK2),X0,tptp0)
| ~ occurrence_of(sK9(tptp0,sK5(sK2),X0),tptp0) ),
inference(resolution,[],[f548,f415]) ).
fof(f1274,plain,
! [X0] :
( occurrence_of(sK5(sK5(sK2)),tptp3)
| ~ min_precedes(sK5(sK2),X0,tptp0) ),
inference(forward_subsumption_resolution,[],[f1270,f170]) ).
fof(f1292,definition,
( spl15_63
<=> occurrence_of(sK5(sK5(sK2)),tptp3) ),
introduced(definition,[new_symbols(definition,[spl15_63])],[avatar_definition]) ).
fof(f1294,plain,
( occurrence_of(sK5(sK5(sK2)),tptp3)
| ~ spl15_63 ),
inference(avatar_component_clause,[],[f1292]) ).
fof(f1296,plain,
( $false
| ~ spl15_59 ),
inference(resolution,[],[f1237,f325]) ).
fof(f1299,plain,
~ spl15_59,
inference(avatar_contradiction_clause,[],[f1296]) ).
fof(f1300,plain,
( spl15_59
| spl15_63 ),
inference(avatar_split_clause,[],[f1274,f1292,f1236]) ).
fof(f1328,plain,
! [X0] :
( next_subocc(sK5(sK2),sK5(sK5(sK2)),tptp0)
| ~ min_precedes(sK5(sK2),X0,tptp0)
| ~ occurrence_of(sK9(tptp0,sK5(sK2),X0),tptp0) ),
inference(resolution,[],[f595,f415]) ).
fof(f1332,plain,
! [X0] :
( next_subocc(sK5(sK2),sK5(sK5(sK2)),tptp0)
| ~ min_precedes(sK5(sK2),X0,tptp0) ),
inference(forward_subsumption_resolution,[],[f1328,f170]) ).
fof(f1340,definition,
( spl15_65
<=> next_subocc(sK5(sK2),sK5(sK5(sK2)),tptp0) ),
introduced(definition,[new_symbols(definition,[spl15_65])],[avatar_definition]) ).
fof(f1342,plain,
( next_subocc(sK5(sK2),sK5(sK5(sK2)),tptp0)
| ~ spl15_65 ),
inference(avatar_component_clause,[],[f1340]) ).
fof(f1343,plain,
( spl15_59
| spl15_65 ),
inference(avatar_split_clause,[],[f1332,f1340,f1236]) ).
fof(f1388,plain,
( tptp3 = sK10(sK5(sK5(sK2)))
| ~ spl15_63 ),
inference(resolution,[],[f1294,f215]) ).
fof(f1621,plain,
( min_precedes(sK5(sK2),sK5(sK5(sK2)),tptp0)
| ~ spl15_65 ),
inference(resolution,[],[f1342,f163]) ).
fof(f1657,plain,
( ! [X0] :
( sK7(sK2) = sK5(sK5(sK2))
| sK6(sK2) = sK5(sK5(sK2))
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK2,X0)
| ~ arboreal(sK2)
| leaf_occ(sK2,X0) )
| ~ spl15_65 ),
inference(resolution,[],[f1621,f137]) ).
fof(f1700,plain,
( ! [X0] :
( sK7(sK2) = sK5(sK5(sK2))
| sK6(sK2) = sK5(sK5(sK2))
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK2,X0)
| ~ arboreal(sK2) )
| ~ spl15_65 ),
inference(forward_subsumption_resolution,[],[f1657,f423]) ).
fof(f1701,plain,
( ! [X0] :
( sK7(sK2) = sK5(sK5(sK2))
| sK6(sK2) = sK5(sK5(sK2))
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK2,X0) )
| ~ spl15_65 ),
inference(forward_subsumption_resolution,[],[f1700,f126]) ).
fof(f1703,definition,
( spl15_82
<=> sK6(sK2) = sK5(sK5(sK2)) ),
introduced(definition,[new_symbols(definition,[spl15_82])],[avatar_definition]) ).
fof(f1705,plain,
( sK6(sK2) = sK5(sK5(sK2))
| ~ spl15_82 ),
inference(avatar_component_clause,[],[f1703]) ).
fof(f1707,definition,
( spl15_83
<=> sK7(sK2) = sK5(sK5(sK2)) ),
introduced(definition,[new_symbols(definition,[spl15_83])],[avatar_definition]) ).
fof(f1709,plain,
( sK7(sK2) = sK5(sK5(sK2))
| ~ spl15_83 ),
inference(avatar_component_clause,[],[f1707]) ).
fof(f1710,plain,
( spl15_24
| spl15_82
| spl15_83
| ~ spl15_65 ),
inference(avatar_split_clause,[],[f1701,f1340,f1707,f1703,f774]) ).
fof(f1717,plain,
( occurrence_of(sK6(sK2),tptp3)
| ~ spl15_63
| ~ spl15_82 ),
inference(superposition,[],[f1294,f1705]) ).
fof(f1745,plain,
( tptp3 = tptp4
| ~ spl15_63
| ~ spl15_82 ),
inference(resolution,[],[f1717,f263]) ).
fof(f1753,plain,
( $false
| ~ spl15_63
| ~ spl15_82 ),
inference(forward_subsumption_resolution,[],[f1745,f146]) ).
fof(f1754,plain,
( ~ spl15_63
| ~ spl15_82 ),
inference(avatar_contradiction_clause,[],[f1753]) ).
fof(f1755,plain,
( ~ occurrence_of(sK3,tptp0)
| ~ spl15_24 ),
inference(resolution,[],[f775,f127]) ).
fof(f1760,plain,
( $false
| ~ spl15_24 ),
inference(forward_subsumption_resolution,[],[f1755,f128]) ).
fof(f1761,plain,
~ spl15_24,
inference(avatar_contradiction_clause,[],[f1760]) ).
fof(f1769,plain,
( occurrence_of(sK7(sK2),tptp3)
| ~ spl15_63
| ~ spl15_83 ),
inference(superposition,[],[f1294,f1709]) ).
fof(f1772,plain,
( tptp3 = sK10(sK7(sK2))
| ~ spl15_63
| ~ spl15_83 ),
inference(superposition,[],[f1388,f1709]) ).
fof(f1787,plain,
( tptp3 = tptp1
| ~ spl15_5
| ~ spl15_63
| ~ spl15_83 ),
inference(resolution,[],[f1769,f948]) ).
fof(f1795,plain,
( $false
| ~ spl15_5
| ~ spl15_63
| ~ spl15_83 ),
inference(forward_subsumption_resolution,[],[f1787,f145]) ).
fof(f1796,plain,
( ~ spl15_5
| ~ spl15_63
| ~ spl15_83 ),
inference(avatar_contradiction_clause,[],[f1795]) ).
fof(f1802,plain,
( tptp2 = sK10(sK7(sK2))
| ~ spl15_6 ),
inference(resolution,[],[f383,f215]) ).
fof(f1804,plain,
( tptp3 = tptp2
| ~ spl15_6
| ~ spl15_63
| ~ spl15_83 ),
inference(forward_demodulation,[],[f1802,f1772]) ).
fof(f1805,plain,
( $false
| ~ spl15_6
| ~ spl15_63
| ~ spl15_83 ),
inference(forward_subsumption_resolution,[],[f1804,f144]) ).
fof(f1806,plain,
( ~ spl15_6
| ~ spl15_63
| ~ spl15_83 ),
inference(avatar_contradiction_clause,[],[f1805]) ).
cnf(s5,plain,
( spl15_5
| spl15_6 ),
inference(sat_conversion,[],[f384]) ).
cnf(s53,plain,
~ spl15_59,
inference(sat_conversion,[],[f1299]) ).
cnf(s54,plain,
( spl15_59
| spl15_63 ),
inference(sat_conversion,[],[f1300]) ).
cnf(s56,plain,
( spl15_59
| spl15_65 ),
inference(sat_conversion,[],[f1343]) ).
cnf(s69,plain,
( spl15_24
| ~ spl15_65
| spl15_82
| spl15_83 ),
inference(sat_conversion,[],[f1710]) ).
cnf(s72,plain,
( ~ spl15_63
| ~ spl15_82 ),
inference(sat_conversion,[],[f1754]) ).
cnf(s73,plain,
~ spl15_24,
inference(sat_conversion,[],[f1761]) ).
cnf(s74,plain,
( ~ spl15_5
| ~ spl15_63
| ~ spl15_83 ),
inference(sat_conversion,[],[f1796]) ).
cnf(s75,plain,
( ~ spl15_6
| ~ spl15_63
| ~ spl15_83 ),
inference(sat_conversion,[],[f1806]) ).
cnf(s76,plain,
( ~ spl15_65
| spl15_82
| spl15_83 ),
inference(rat,[],[s69,s73]) ).
cnf(s79,plain,
spl15_65,
inference(rat,[],[s56,s53]) ).
cnf(s80,plain,
spl15_63,
inference(rat,[],[s54,s53]) ).
cnf(s81,plain,
~ spl15_82,
inference(rat,[],[s72,s80]) ).
cnf(s82,plain,
spl15_83,
inference(rat,[],[s76,s79,s81]) ).
cnf(s83,plain,
~ spl15_6,
inference(rat,[],[s75,s80,s82]) ).
cnf(s84,plain,
~ spl15_5,
inference(rat,[],[s74,s80,s82]) ).
cnf(s92,plain,
$false,
inference(rat,[],[s5,s83,s84]) ).
fof(f1807,plain,
$false,
inference(avatar_sat_refutation,[],[s92]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PRO018+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n009.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 22:25:15 UTC 2026
% 0.04/0.38 % CPUTime :
% 0.04/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.40 Running first-order theorem proving
% 0.04/0.40 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
% 3.52/1.49 % (2466650)Detected formulas, will run a generic FOF schedule.
% 3.52/1.49 % (2466656)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=727090956:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.52/1.49 % (2466661)dis-21_1_sil=8000:lcm=predicate:random_seed=1953092697: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)
% 3.52/1.49 % (2466659)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=699337284:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.52/1.49 % (2466658)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1776886419:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.52/1.49 % (2466660)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1516547976:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.52/1.49 % (2466655)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=1988664535:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.52/1.49 % (2466657)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=2526808734:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.52/1.49 % (2466658)Instruction limit reached!
% 3.52/1.49 % (2466658)------------------------------
% 3.52/1.49 % (2466658)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.52/1.49 % (2466658)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.52/1.49 % (2466658)CaDiCaL version: 2.1.3
% 3.52/1.49 % (2466658)Termination reason: Instruction limit
% 3.52/1.49 % (2466658)Termination phase: Saturation
% 3.52/1.49 % (2466658)Time elapsed: 0.062 s
% 3.52/1.49 % (2466658)Peak memory usage: 89 MB
% 3.52/1.49 % (2466658)Instructions burned: 113 (million)
% 3.52/1.49 % (2466659)Instruction limit reached!
% 3.52/1.49 % (2466659)------------------------------
% 3.52/1.49 % (2466659)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.52/1.49 % (2466659)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.52/1.49 % (2466659)CaDiCaL version: 2.1.3
% 3.52/1.49 % (2466659)Termination reason: Instruction limit
% 3.52/1.49 % (2466659)Termination phase: Saturation
% 3.52/1.49 % (2466659)Time elapsed: 0.065 s
% 3.52/1.49 % (2466659)Peak memory usage: 88 MB
% 3.52/1.49 % (2466659)Instructions burned: 119 (million)
% 3.52/1.49 % (2466661)Instruction limit reached!
% 3.52/1.49 % (2466661)------------------------------
% 3.52/1.49 % (2466661)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.52/1.49 % (2466661)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.52/1.49 % (2466661)CaDiCaL version: 2.1.3
% 3.52/1.49 % (2466661)Termination reason: Instruction limit
% 3.52/1.49 % (2466661)Termination phase: Saturation
% 3.52/1.49 % (2466661)Time elapsed: 0.073 s
% 3.52/1.49 % (2466661)Peak memory usage: 88 MB
% 3.52/1.49 % (2466661)Instructions burned: 130 (million)
% 3.52/1.49 % (2466660)Instruction limit reached!
% 3.52/1.49 % (2466660)------------------------------
% 3.52/1.49 % (2466660)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.52/1.49 % (2466660)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.52/1.49 % (2466660)CaDiCaL version: 2.1.3
% 3.52/1.49 % (2466660)Termination reason: Instruction limit
% 3.52/1.49 % (2466660)Termination phase: Saturation
% 3.52/1.49 % (2466660)Time elapsed: 0.103 s
% 3.52/1.49 % (2466660)Peak memory usage: 89 MB
% 3.52/1.49 % (2466660)Instructions burned: 139 (million)
% 3.52/1.49 % (2466671)lrs+1011_1_sil=32000:sp=occurrence:random_seed=1960504818:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 3.52/1.49 % (2466670)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2742447542:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.52/1.49 % (2466669)lrs+10_1_sil=8000:sp=occurrence:random_seed=1120633900:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.52/1.49 % (2466672)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=1935362545:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 3.52/1.49 % (2466669)First to succeed.
% 3.52/1.49 % (2466669)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2466650"
% 3.52/1.49 % (2466670)Instruction limit reached!
% 3.52/1.49 % (2466670)------------------------------
% 3.52/1.49 % (2466670)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.52/1.49 % (2466670)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.52/1.49 % (2466670)CaDiCaL version: 2.1.3
% 3.52/1.49 % (2466670)Termination reason: Instruction limit
% 3.52/1.49 % (2466670)Termination phase: Saturation
% 3.52/1.49 % (2466670)Time elapsed: 0.082 s
% 3.52/1.49 % (2466670)Peak memory usage: 89 MB
% 3.52/1.49 % (2466670)Instructions burned: 159 (million)
% 3.52/1.49 % (2466656)Also succeeded, but the first one will report.
% 3.52/1.49 % (2466672)Instruction limit reached!
% 3.52/1.49 % (2466672)------------------------------
% 3.52/1.49 % (2466672)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.52/1.49 % (2466672)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.52/1.49 % (2466672)CaDiCaL version: 2.1.3
% 3.52/1.49 % (2466672)Termination reason: Instruction limit
% 3.52/1.49 % (2466672)Termination phase: Saturation
% 3.52/1.49 % (2466672)Time elapsed: 0.130 s
% 3.52/1.49 % (2466672)Peak memory usage: 89 MB
% 3.52/1.49 % (2466672)Instructions burned: 248 (million)
% 3.52/1.49 % (2466671)Instruction limit reached!
% 3.52/1.49 % (2466671)------------------------------
% 3.52/1.49 % (2466671)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.52/1.49 % (2466671)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.52/1.49 % (2466671)CaDiCaL version: 2.1.3
% 3.52/1.49 % (2466671)Termination reason: Instruction limit
% 3.52/1.49 % (2466671)Termination phase: Saturation
% 3.52/1.49 % (2466671)Time elapsed: 0.217 s
% 3.52/1.49 % (2466671)Peak memory usage: 91 MB
% 3.52/1.49 % (2466671)Instructions burned: 325 (million)
% 3.52/1.49 % (2466677)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=328673074:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 3.52/1.49 % (2466669)Refutation found. Thanks to Tanya!
% 3.52/1.49 % SZS status Theorem for theBenchmark
% 3.52/1.49 % SZS output start Proof for theBenchmark
% See solution above
% 5.14/1.68 % (2466669)------------------------------
% 5.14/1.68 % (2466669)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.14/1.68 % (2466669)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.14/1.68 % (2466669)CaDiCaL version: 2.1.3
% 5.14/1.68 % (2466669)Termination reason: Refutation
% 5.14/1.68 % (2466669)Time elapsed: 0.052 s
% 5.14/1.68 % (2466669)Peak memory usage: 90 MB
% 5.14/1.68 % (2466669)Instructions burned: 75 (million)
% 5.14/1.68 % (2466669)------------------------------
% 5.14/1.68 % (2466669)------------------------------
% 5.14/1.68 % (2466650)Success in time 0.65 s
% 5.14/1.68 % Vampire exiting
%------------------------------------------------------------------------------