%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : PRO017+4 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n016.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 4.84s 1.64s
% Output : Refutation 6.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 21
% Syntax : Number of formulae : 161 ( 30 unt; 8 def)
% Number of atoms : 528 ( 40 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 614 ( 247 ~; 261 |; 82 &)
% ( 12 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 20 ( 18 usr; 9 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-3 aty)
% Number of variables : 186 ( 0 sgn 159 !; 27 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1] :
( occurrence_of(X1,X0)
=> ( activity(X0)
& activity_occurrence(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_03) ).
fof(f7,axiom,
! [X0,X1,X2] :
( min_precedes(X1,X2,X0)
=> ? [X3] :
( occurrence_of(X3,X0)
& subactivity_occurrence(X1,X3)
& subactivity_occurrence(X2,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_06) ).
fof(f9,axiom,
! [X0,X1,X2] :
( ( occurrence_of(X0,X1)
& occurrence_of(X0,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_08) ).
fof(f10,axiom,
! [X0,X1,X2] :
( ( occurrence_of(X0,X2)
& leaf_occ(X1,X0) )
=> ~ ? [X3] : min_precedes(X1,X3,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_09) ).
fof(f13,axiom,
! [X0] :
( activity_occurrence(X0)
=> ? [X1] :
( activity(X1)
& occurrence_of(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_12) ).
fof(f17,axiom,
! [X0,X1] :
( occurrence_of(X0,X1)
=> ( arboreal(X0)
<=> atomic(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_16) ).
fof(f27,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/sandbox/benchmark/theBenchmark.p',sos_26) ).
fof(f33,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/sandbox/benchmark/theBenchmark.p',sos_32) ).
fof(f39,axiom,
atomic(tptp3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_38) ).
fof(f40,axiom,
tptp4 != tptp3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_39) ).
fof(f43,axiom,
tptp3 != tptp2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_42) ).
fof(f44,axiom,
tptp3 != tptp1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_43) ).
fof(f46,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/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f47,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)],[f46]) ).
fof(f52,plain,
! [X0] :
( activity_occurrence(X0)
=> ? [X1] : occurrence_of(X0,X1) ),
inference(pure_predicate_removal,[],[f13]) ).
fof(f53,plain,
! [X0,X1] :
( occurrence_of(X1,X0)
=> activity_occurrence(X1) ),
inference(pure_predicate_removal,[],[f4]) ).
fof(f55,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,[],[f47]) ).
fof(f56,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,[],[f55]) ).
fof(f57,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,[],[f33]) ).
fof(f58,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,[],[f57]) ).
fof(f61,plain,
! [X0,X1,X2] :
( ? [X3] :
( occurrence_of(X3,X0)
& subactivity_occurrence(X1,X3)
& subactivity_occurrence(X2,X3) )
| ~ min_precedes(X1,X2,X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f64,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(ennf_transformation,[],[f10]) ).
fof(f65,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(flattening,[],[f64]) ).
fof(f73,plain,
! [X0,X1] :
( ( arboreal(X0)
<=> atomic(X1) )
| ~ occurrence_of(X0,X1) ),
inference(ennf_transformation,[],[f17]) ).
fof(f78,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,[],[f27]) ).
fof(f79,plain,
! [X0] :
( ? [X1] : occurrence_of(X0,X1)
| ~ activity_occurrence(X0) ),
inference(ennf_transformation,[],[f52]) ).
fof(f80,plain,
! [X0,X1] :
( activity_occurrence(X1)
| ~ occurrence_of(X1,X0) ),
inference(ennf_transformation,[],[f53]) ).
fof(f81,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(ennf_transformation,[],[f9]) ).
fof(f82,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X1)
| ~ occurrence_of(X0,X2) ),
inference(flattening,[],[f81]) ).
fof(f102,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)],[f56]) ).
fof(f103,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))],[f58]) ).
fof(f104,plain,
! [X0,X1,X2] :
( ( occurrence_of(sK5(X0,X1,X2),X0)
& subactivity_occurrence(X1,sK5(X0,X1,X2))
& subactivity_occurrence(X2,sK5(X0,X1,X2)) )
| ~ min_precedes(X1,X2,X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(X3,sK5(X0,X1,X2))],[f61]) ).
fof(f109,plain,
! [X0,X1] :
( ( ( arboreal(X0)
| ~ atomic(X1) )
& ( atomic(X1)
| ~ arboreal(X0) ) )
| ~ occurrence_of(X0,X1) ),
inference(nnf_transformation,[],[f73]) ).
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(nnf_transformation,[],[f78]) ).
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)
& ! [X3] :
( ~ min_precedes(X0,X3,X2)
| ~ min_precedes(X3,X1,X2) ) )
| ~ next_subocc(X0,X1,X2) ) ),
inference(flattening,[],[f114]) ).
fof(f116,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,[],[f115]) ).
fof(f117,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X1,X2)
| ~ min_precedes(X0,X1,X2)
| ( min_precedes(X0,sK10(X0,X1,X2),X2)
& min_precedes(sK10(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,[sK10]),skolemize(X3,sK10(X0,X1,X2))],[f116]) ).
fof(f118,plain,
! [X0] :
( occurrence_of(X0,sK11(X0))
| ~ activity_occurrence(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK11]),skolemize(X1,sK11(X0))],[f79]) ).
fof(f125,plain,
~ leaf_occ(sK0,sK1),
inference(cnf_transformation,[],[f102]) ).
fof(f126,plain,
arboreal(sK0),
inference(cnf_transformation,[],[f102]) ).
fof(f127,plain,
subactivity_occurrence(sK0,sK1),
inference(cnf_transformation,[],[f102]) ).
fof(f128,plain,
occurrence_of(sK1,tptp0),
inference(cnf_transformation,[],[f102]) ).
fof(f132,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,[],[f103]) ).
fof(f134,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,[],[f103]) ).
fof(f135,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,[],[f103]) ).
fof(f136,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,[],[f103]) ).
fof(f137,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,[],[f103]) ).
fof(f138,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,[],[f103]) ).
fof(f139,plain,
tptp3 != tptp1,
inference(cnf_transformation,[],[f44]) ).
fof(f140,plain,
tptp3 != tptp2,
inference(cnf_transformation,[],[f43]) ).
fof(f141,plain,
tptp3 != tptp4,
inference(cnf_transformation,[],[f40]) ).
fof(f142,plain,
atomic(tptp3),
inference(cnf_transformation,[],[f39]) ).
fof(f147,plain,
! [X2,X0,X1] :
( subactivity_occurrence(X2,sK5(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f104]) ).
fof(f149,plain,
! [X2,X0,X1] :
( occurrence_of(sK5(X0,X1,X2),X0)
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f104]) ).
fof(f157,plain,
! [X2,X3,X0,X1] :
( ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(cnf_transformation,[],[f65]) ).
fof(f165,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| ~ atomic(X1)
| arboreal(X0) ),
inference(cnf_transformation,[],[f109]) ).
fof(f173,plain,
! [X2,X0,X1] :
( ~ next_subocc(X0,X1,X2)
| min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f117]) ).
fof(f176,plain,
! [X0] :
( occurrence_of(X0,sK11(X0))
| ~ activity_occurrence(X0) ),
inference(cnf_transformation,[],[f118]) ).
fof(f177,plain,
! [X0,X1] :
( ~ occurrence_of(X1,X0)
| activity_occurrence(X1) ),
inference(cnf_transformation,[],[f80]) ).
fof(f178,plain,
! [X2,X0,X1] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f82]) ).
fof(f216,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| sK11(X0) = X1
| ~ activity_occurrence(X0) ),
inference(resolution,[],[f178,f176]) ).
fof(f218,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| sK11(X0) = X1 ),
inference(forward_subsumption_resolution,[],[f216,f177]) ).
fof(f299,plain,
( ~ occurrence_of(sK1,tptp0)
| occurrence_of(sK3(sK0),tptp4)
| ~ arboreal(sK0)
| leaf_occ(sK0,sK1) ),
inference(resolution,[],[f136,f127]) ).
fof(f305,plain,
( occurrence_of(sK3(sK0),tptp4)
| ~ arboreal(sK0)
| leaf_occ(sK0,sK1) ),
inference(forward_subsumption_resolution,[],[f299,f128]) ).
fof(f306,plain,
( occurrence_of(sK3(sK0),tptp4)
| leaf_occ(sK0,sK1) ),
inference(forward_subsumption_resolution,[],[f305,f126]) ).
fof(f307,plain,
occurrence_of(sK3(sK0),tptp4),
inference(forward_subsumption_resolution,[],[f306,f125]) ).
fof(f309,plain,
! [X0] :
( ~ occurrence_of(sK3(sK0),X0)
| tptp4 = X0 ),
inference(resolution,[],[f307,f178]) ).
fof(f314,plain,
( ~ occurrence_of(sK1,tptp0)
| occurrence_of(sK2(sK0),tptp3)
| ~ arboreal(sK0)
| leaf_occ(sK0,sK1) ),
inference(resolution,[],[f138,f127]) ).
fof(f315,plain,
! [X2,X0,X1] :
( ~ occurrence_of(sK5(X0,X1,X2),tptp0)
| occurrence_of(sK2(X2),tptp3)
| ~ arboreal(X2)
| leaf_occ(X2,sK5(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(resolution,[],[f138,f147]) ).
fof(f320,plain,
( occurrence_of(sK2(sK0),tptp3)
| ~ arboreal(sK0)
| leaf_occ(sK0,sK1) ),
inference(forward_subsumption_resolution,[],[f314,f128]) ).
fof(f321,plain,
( occurrence_of(sK2(sK0),tptp3)
| leaf_occ(sK0,sK1) ),
inference(forward_subsumption_resolution,[],[f320,f126]) ).
fof(f322,plain,
occurrence_of(sK2(sK0),tptp3),
inference(forward_subsumption_resolution,[],[f321,f125]) ).
fof(f348,plain,
( ~ atomic(tptp3)
| arboreal(sK2(sK0)) ),
inference(resolution,[],[f322,f165]) ).
fof(f351,plain,
arboreal(sK2(sK0)),
inference(forward_subsumption_resolution,[],[f348,f142]) ).
fof(f357,plain,
( ~ occurrence_of(sK1,tptp0)
| next_subocc(sK0,sK2(sK0),tptp0)
| ~ arboreal(sK0)
| leaf_occ(sK0,sK1) ),
inference(resolution,[],[f137,f127]) ).
fof(f358,plain,
! [X2,X0,X1] :
( ~ occurrence_of(sK5(X0,X1,X2),tptp0)
| next_subocc(X2,sK2(X2),tptp0)
| ~ arboreal(X2)
| leaf_occ(X2,sK5(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(resolution,[],[f137,f147]) ).
fof(f363,plain,
( next_subocc(sK0,sK2(sK0),tptp0)
| ~ arboreal(sK0)
| leaf_occ(sK0,sK1) ),
inference(forward_subsumption_resolution,[],[f357,f128]) ).
fof(f364,plain,
( next_subocc(sK0,sK2(sK0),tptp0)
| leaf_occ(sK0,sK1) ),
inference(forward_subsumption_resolution,[],[f363,f126]) ).
fof(f365,plain,
next_subocc(sK0,sK2(sK0),tptp0),
inference(forward_subsumption_resolution,[],[f364,f125]) ).
fof(f378,plain,
min_precedes(sK0,sK2(sK0),tptp0),
inference(resolution,[],[f365,f173]) ).
fof(f383,plain,
( ~ occurrence_of(sK1,tptp0)
| min_precedes(sK2(sK0),sK3(sK0),tptp0)
| ~ arboreal(sK0)
| leaf_occ(sK0,sK1) ),
inference(resolution,[],[f135,f127]) ).
fof(f389,plain,
( min_precedes(sK2(sK0),sK3(sK0),tptp0)
| ~ arboreal(sK0)
| leaf_occ(sK0,sK1) ),
inference(forward_subsumption_resolution,[],[f383,f128]) ).
fof(f390,plain,
( min_precedes(sK2(sK0),sK3(sK0),tptp0)
| leaf_occ(sK0,sK1) ),
inference(forward_subsumption_resolution,[],[f389,f126]) ).
fof(f391,plain,
min_precedes(sK2(sK0),sK3(sK0),tptp0),
inference(forward_subsumption_resolution,[],[f390,f125]) ).
fof(f399,plain,
( occurrence_of(sK4(sK0),tptp1)
| ~ occurrence_of(sK1,tptp0)
| occurrence_of(sK4(sK0),tptp2)
| ~ arboreal(sK0)
| leaf_occ(sK0,sK1) ),
inference(resolution,[],[f134,f127]) ).
fof(f405,plain,
( occurrence_of(sK4(sK0),tptp1)
| occurrence_of(sK4(sK0),tptp2)
| ~ arboreal(sK0)
| leaf_occ(sK0,sK1) ),
inference(forward_subsumption_resolution,[],[f399,f128]) ).
fof(f406,plain,
( occurrence_of(sK4(sK0),tptp1)
| occurrence_of(sK4(sK0),tptp2)
| leaf_occ(sK0,sK1) ),
inference(forward_subsumption_resolution,[],[f405,f126]) ).
fof(f407,plain,
( occurrence_of(sK4(sK0),tptp1)
| occurrence_of(sK4(sK0),tptp2) ),
inference(forward_subsumption_resolution,[],[f406,f125]) ).
fof(f409,definition,
( spl16_3
<=> occurrence_of(sK4(sK0),tptp2) ),
introduced(definition,[new_symbols(definition,[spl16_3])],[avatar_definition]) ).
fof(f411,plain,
( occurrence_of(sK4(sK0),tptp2)
| ~ spl16_3 ),
inference(avatar_component_clause,[],[f409]) ).
fof(f413,definition,
( spl16_4
<=> occurrence_of(sK4(sK0),tptp1) ),
introduced(definition,[new_symbols(definition,[spl16_4])],[avatar_definition]) ).
fof(f415,plain,
( occurrence_of(sK4(sK0),tptp1)
| ~ spl16_4 ),
inference(avatar_component_clause,[],[f413]) ).
fof(f416,plain,
( spl16_3
| spl16_4 ),
inference(avatar_split_clause,[],[f407,f413,f409]) ).
fof(f418,plain,
( ! [X0] :
( ~ occurrence_of(sK4(sK0),X0)
| tptp2 = X0 )
| ~ spl16_3 ),
inference(resolution,[],[f411,f178]) ).
fof(f438,plain,
! [X0] :
( ~ leaf_occ(sK0,X0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f378,f157]) ).
fof(f484,plain,
! [X0] :
( ~ leaf_occ(sK2(sK0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f391,f157]) ).
fof(f841,plain,
! [X0,X1] :
( occurrence_of(sK2(X0),tptp3)
| ~ arboreal(X0)
| leaf_occ(X0,sK5(tptp0,X1,X0))
| ~ min_precedes(X1,X0,tptp0)
| ~ min_precedes(X1,X0,tptp0) ),
inference(resolution,[],[f315,f149]) ).
fof(f842,plain,
! [X0,X1] :
( leaf_occ(X0,sK5(tptp0,X1,X0))
| ~ arboreal(X0)
| occurrence_of(sK2(X0),tptp3)
| ~ min_precedes(X1,X0,tptp0) ),
inference(duplicate_literal_removal,[],[f841]) ).
fof(f886,plain,
! [X0,X1] :
( next_subocc(X0,sK2(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,sK5(tptp0,X1,X0))
| ~ min_precedes(X1,X0,tptp0)
| ~ min_precedes(X1,X0,tptp0) ),
inference(resolution,[],[f358,f149]) ).
fof(f887,plain,
! [X0,X1] :
( leaf_occ(X0,sK5(tptp0,X1,X0))
| ~ arboreal(X0)
| next_subocc(X0,sK2(X0),tptp0)
| ~ min_precedes(X1,X0,tptp0) ),
inference(duplicate_literal_removal,[],[f886]) ).
fof(f1115,definition,
( spl16_21
<=> ! [X0] :
( ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK0,X0) ) ),
introduced(definition,[new_symbols(definition,[spl16_21])],[avatar_definition]) ).
fof(f1116,plain,
( ! [X0] :
( ~ subactivity_occurrence(sK0,X0)
| ~ occurrence_of(X0,tptp0) )
| ~ spl16_21 ),
inference(avatar_component_clause,[],[f1115]) ).
fof(f1403,plain,
( ~ occurrence_of(sK1,tptp0)
| ~ spl16_21 ),
inference(resolution,[],[f1116,f127]) ).
fof(f1407,plain,
( $false
| ~ spl16_21 ),
inference(forward_subsumption_resolution,[],[f1403,f128]) ).
fof(f1408,plain,
~ spl16_21,
inference(avatar_contradiction_clause,[],[f1407]) ).
fof(f2326,definition,
( spl16_81
<=> ! [X0] : ~ min_precedes(X0,sK2(sK0),tptp0) ),
introduced(definition,[new_symbols(definition,[spl16_81])],[avatar_definition]) ).
fof(f2327,plain,
( ! [X0] : ~ min_precedes(X0,sK2(sK0),tptp0)
| ~ spl16_81 ),
inference(avatar_component_clause,[],[f2326]) ).
fof(f2406,plain,
! [X0] :
( ~ arboreal(sK2(sK0))
| occurrence_of(sK2(sK2(sK0)),tptp3)
| ~ min_precedes(X0,sK2(sK0),tptp0)
| ~ occurrence_of(sK5(tptp0,X0,sK2(sK0)),tptp0) ),
inference(resolution,[],[f842,f484]) ).
fof(f2421,plain,
! [X0] :
( ~ arboreal(sK2(sK0))
| occurrence_of(sK2(sK2(sK0)),tptp3)
| ~ min_precedes(X0,sK2(sK0),tptp0) ),
inference(forward_subsumption_resolution,[],[f2406,f149]) ).
fof(f2469,definition,
( spl16_89
<=> occurrence_of(sK2(sK2(sK0)),tptp3) ),
introduced(definition,[new_symbols(definition,[spl16_89])],[avatar_definition]) ).
fof(f2471,plain,
( occurrence_of(sK2(sK2(sK0)),tptp3)
| ~ spl16_89 ),
inference(avatar_component_clause,[],[f2469]) ).
fof(f2480,plain,
( $false
| ~ spl16_81 ),
inference(resolution,[],[f2327,f378]) ).
fof(f2491,plain,
~ spl16_81,
inference(avatar_contradiction_clause,[],[f2480]) ).
fof(f2494,plain,
! [X0] :
( occurrence_of(sK2(sK2(sK0)),tptp3)
| ~ min_precedes(X0,sK2(sK0),tptp0) ),
inference(forward_subsumption_resolution,[],[f2421,f351]) ).
fof(f2495,plain,
( spl16_81
| spl16_89 ),
inference(avatar_split_clause,[],[f2494,f2469,f2326]) ).
fof(f2589,plain,
! [X0] :
( ~ arboreal(sK2(sK0))
| next_subocc(sK2(sK0),sK2(sK2(sK0)),tptp0)
| ~ min_precedes(X0,sK2(sK0),tptp0)
| ~ occurrence_of(sK5(tptp0,X0,sK2(sK0)),tptp0) ),
inference(resolution,[],[f887,f484]) ).
fof(f2604,plain,
! [X0] :
( ~ arboreal(sK2(sK0))
| next_subocc(sK2(sK0),sK2(sK2(sK0)),tptp0)
| ~ min_precedes(X0,sK2(sK0),tptp0) ),
inference(forward_subsumption_resolution,[],[f2589,f149]) ).
fof(f2606,plain,
! [X0] :
( next_subocc(sK2(sK0),sK2(sK2(sK0)),tptp0)
| ~ min_precedes(X0,sK2(sK0),tptp0) ),
inference(forward_subsumption_resolution,[],[f2604,f351]) ).
fof(f2613,definition,
( spl16_91
<=> next_subocc(sK2(sK0),sK2(sK2(sK0)),tptp0) ),
introduced(definition,[new_symbols(definition,[spl16_91])],[avatar_definition]) ).
fof(f2615,plain,
( next_subocc(sK2(sK0),sK2(sK2(sK0)),tptp0)
| ~ spl16_91 ),
inference(avatar_component_clause,[],[f2613]) ).
fof(f2616,plain,
( spl16_81
| spl16_91 ),
inference(avatar_split_clause,[],[f2606,f2613,f2326]) ).
fof(f2643,plain,
( tptp3 = sK11(sK2(sK2(sK0)))
| ~ spl16_89 ),
inference(resolution,[],[f2471,f218]) ).
fof(f2757,plain,
( min_precedes(sK2(sK0),sK2(sK2(sK0)),tptp0)
| ~ spl16_91 ),
inference(resolution,[],[f2615,f173]) ).
fof(f3557,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) )
| ~ spl16_91 ),
inference(resolution,[],[f2757,f132]) ).
fof(f3585,plain,
( ! [X0] :
( sK4(sK0) = sK2(sK2(sK0))
| sK3(sK0) = sK2(sK2(sK0))
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK0,X0)
| ~ arboreal(sK0) )
| ~ spl16_91 ),
inference(forward_subsumption_resolution,[],[f3557,f438]) ).
fof(f3605,plain,
( ! [X0] :
( sK4(sK0) = sK2(sK2(sK0))
| sK3(sK0) = sK2(sK2(sK0))
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK0,X0) )
| ~ spl16_91 ),
inference(forward_subsumption_resolution,[],[f3585,f126]) ).
fof(f3607,definition,
( spl16_120
<=> sK3(sK0) = sK2(sK2(sK0)) ),
introduced(definition,[new_symbols(definition,[spl16_120])],[avatar_definition]) ).
fof(f3609,plain,
( sK3(sK0) = sK2(sK2(sK0))
| ~ spl16_120 ),
inference(avatar_component_clause,[],[f3607]) ).
fof(f3611,definition,
( spl16_121
<=> sK4(sK0) = sK2(sK2(sK0)) ),
introduced(definition,[new_symbols(definition,[spl16_121])],[avatar_definition]) ).
fof(f3613,plain,
( sK4(sK0) = sK2(sK2(sK0))
| ~ spl16_121 ),
inference(avatar_component_clause,[],[f3611]) ).
fof(f3614,plain,
( spl16_21
| spl16_120
| spl16_121
| ~ spl16_91 ),
inference(avatar_split_clause,[],[f3605,f2613,f3611,f3607,f1115]) ).
fof(f3692,plain,
( occurrence_of(sK3(sK0),tptp3)
| ~ spl16_89
| ~ spl16_120 ),
inference(superposition,[],[f2471,f3609]) ).
fof(f3780,plain,
( occurrence_of(sK4(sK0),tptp3)
| ~ spl16_89
| ~ spl16_121 ),
inference(superposition,[],[f2471,f3613]) ).
fof(f3782,plain,
( tptp3 = sK11(sK4(sK0))
| ~ spl16_89
| ~ spl16_121 ),
inference(superposition,[],[f2643,f3613]) ).
fof(f3825,plain,
( tptp3 = tptp4
| ~ spl16_89
| ~ spl16_120 ),
inference(resolution,[],[f3692,f309]) ).
fof(f3831,plain,
( $false
| ~ spl16_89
| ~ spl16_120 ),
inference(forward_subsumption_resolution,[],[f3825,f141]) ).
fof(f3832,plain,
( ~ spl16_89
| ~ spl16_120 ),
inference(avatar_contradiction_clause,[],[f3831]) ).
fof(f3836,plain,
( tptp3 = tptp2
| ~ spl16_3
| ~ spl16_89
| ~ spl16_121 ),
inference(resolution,[],[f3780,f418]) ).
fof(f3842,plain,
( $false
| ~ spl16_3
| ~ spl16_89
| ~ spl16_121 ),
inference(forward_subsumption_resolution,[],[f3836,f140]) ).
fof(f3843,plain,
( ~ spl16_3
| ~ spl16_89
| ~ spl16_121 ),
inference(avatar_contradiction_clause,[],[f3842]) ).
fof(f3844,plain,
( tptp1 = sK11(sK4(sK0))
| ~ spl16_4 ),
inference(resolution,[],[f415,f218]) ).
fof(f3849,plain,
( tptp3 = tptp1
| ~ spl16_4
| ~ spl16_89
| ~ spl16_121 ),
inference(forward_demodulation,[],[f3844,f3782]) ).
fof(f3850,plain,
( $false
| ~ spl16_4
| ~ spl16_89
| ~ spl16_121 ),
inference(forward_subsumption_resolution,[],[f3849,f139]) ).
fof(f3851,plain,
( ~ spl16_4
| ~ spl16_89
| ~ spl16_121 ),
inference(avatar_contradiction_clause,[],[f3850]) ).
cnf(s2,plain,
( spl16_3
| spl16_4 ),
inference(sat_conversion,[],[f416]) ).
cnf(s31,plain,
~ spl16_21,
inference(sat_conversion,[],[f1408]) ).
cnf(s64,plain,
~ spl16_81,
inference(sat_conversion,[],[f2491]) ).
cnf(s65,plain,
( spl16_81
| spl16_89 ),
inference(sat_conversion,[],[f2495]) ).
cnf(s69,plain,
( spl16_81
| spl16_91 ),
inference(sat_conversion,[],[f2616]) ).
cnf(s95,plain,
( spl16_21
| ~ spl16_91
| spl16_120
| spl16_121 ),
inference(sat_conversion,[],[f3614]) ).
cnf(s105,plain,
( ~ spl16_89
| ~ spl16_120 ),
inference(sat_conversion,[],[f3832]) ).
cnf(s108,plain,
( ~ spl16_3
| ~ spl16_89
| ~ spl16_121 ),
inference(sat_conversion,[],[f3843]) ).
cnf(s109,plain,
( ~ spl16_4
| ~ spl16_89
| ~ spl16_121 ),
inference(sat_conversion,[],[f3851]) ).
cnf(s118,plain,
spl16_91,
inference(rat,[],[s69,s64]) ).
cnf(s119,plain,
spl16_89,
inference(rat,[],[s65,s64]) ).
cnf(s120,plain,
~ spl16_120,
inference(rat,[],[s105,s119]) ).
cnf(s137,plain,
spl16_121,
inference(rat,[],[s95,s120,s118,s31]) ).
cnf(s138,plain,
~ spl16_4,
inference(rat,[],[s109,s119,s137]) ).
cnf(s139,plain,
~ spl16_3,
inference(rat,[],[s108,s119,s137]) ).
cnf(s148,plain,
$false,
inference(rat,[],[s2,s138,s139]) ).
fof(f3852,plain,
$false,
inference(avatar_sat_refutation,[],[s148]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PRO017+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n016.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:29:47 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.84/1.64 % (3055111)Detected formulas, will run a generic FOF schedule.
% 4.84/1.64 % (3055118)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=3314707325:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 4.84/1.64 % (3055116)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=2456565555:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 4.84/1.64 % (3055117)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=3441525261:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 4.84/1.64 % (3055120)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1567573202:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 4.84/1.64 % (3055119)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2349206747:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 4.84/1.64 % (3055122)dis-21_1_sil=8000:lcm=predicate:random_seed=2975735746:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 4.84/1.64 % (3055121)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2289416465:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 4.84/1.64 % (3055119)Refutation not found, incomplete strategy
% 4.84/1.64 % (3055119)------------------------------
% 4.84/1.64 % (3055119)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.84/1.64 % (3055119)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.84/1.64 % (3055119)CaDiCaL version: 2.1.3
% 4.84/1.64 % (3055119)Termination reason: Refutation not found, incomplete strategy
% 4.84/1.64 % (3055119)Time elapsed: 0.004 s
% 4.84/1.64 % (3055119)Peak memory usage: 88 MB
% 4.84/1.64 % (3055119)Instructions burned: 5 (million)
% 4.84/1.64 % (3055122)Instruction limit reached!
% 4.84/1.64 % (3055122)------------------------------
% 4.84/1.64 % (3055122)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.84/1.64 % (3055122)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.84/1.64 % (3055122)CaDiCaL version: 2.1.3
% 4.84/1.64 % (3055122)Termination reason: Instruction limit
% 4.84/1.64 % (3055122)Termination phase: Saturation
% 4.84/1.64 % (3055122)Time elapsed: 0.068 s
% 4.84/1.64 % (3055122)Peak memory usage: 88 MB
% 4.84/1.64 % (3055122)Instructions burned: 130 (million)
% 4.84/1.64 % (3055120)Instruction limit reached!
% 4.84/1.64 % (3055120)------------------------------
% 4.84/1.64 % (3055120)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.84/1.64 % (3055120)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.84/1.64 % (3055120)CaDiCaL version: 2.1.3
% 4.84/1.64 % (3055120)Termination reason: Instruction limit
% 4.84/1.64 % (3055120)Termination phase: Saturation
% 4.84/1.64 % (3055120)Time elapsed: 0.072 s
% 4.84/1.64 % (3055120)Peak memory usage: 88 MB
% 4.84/1.64 % (3055120)Instructions burned: 119 (million)
% 4.84/1.64 % (3055121)Instruction limit reached!
% 4.84/1.64 % (3055121)------------------------------
% 4.84/1.64 % (3055121)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.84/1.64 % (3055121)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.84/1.64 % (3055121)CaDiCaL version: 2.1.3
% 4.84/1.64 % (3055121)Termination reason: Instruction limit
% 4.84/1.64 % (3055121)Termination phase: Saturation
% 4.84/1.64 % (3055121)Time elapsed: 0.101 s
% 4.84/1.64 % (3055121)Peak memory usage: 90 MB
% 4.84/1.64 % (3055121)Instructions burned: 139 (million)
% 4.84/1.64 % (3055130)lrs+10_1_sil=8000:sp=occurrence:random_seed=2275768690:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 4.84/1.64 % (3055131)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2262285326:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 4.84/1.64 % (3055119)------------------------------
% 4.84/1.64 % (3055119)------------------------------
% 4.84/1.64 % (3055132)lrs+1011_1_sil=32000:sp=occurrence:random_seed=3623562984:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 4.84/1.64 % (3055131)Instruction limit reached!
% 4.84/1.64 % (3055131)------------------------------
% 4.84/1.64 % (3055131)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.84/1.64 % (3055131)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.84/1.64 % (3055131)CaDiCaL version: 2.1.3
% 4.84/1.64 % (3055131)Termination reason: Instruction limit
% 4.84/1.64 % (3055131)Termination phase: Saturation
% 4.84/1.64 % (3055131)Time elapsed: 0.082 s
% 4.84/1.64 % (3055131)Peak memory usage: 89 MB
% 4.84/1.64 % (3055131)Instructions burned: 159 (million)
% 4.84/1.64 % (3055130)First to succeed.
% 4.84/1.64 % (3055130)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3055111"
% 4.84/1.64 % (3055136)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=3573344431:s2a=on:i=248:s2at=1.23:gtg=position_2995 on theBenchmark for (2995ds/248Mi)
% 4.84/1.64 % (3055137)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=2463603476:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 4.84/1.64 % (3055132)Instruction limit reached!
% 4.84/1.64 % (3055132)------------------------------
% 4.84/1.64 % (3055132)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.84/1.64 % (3055132)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.84/1.64 % (3055132)CaDiCaL version: 2.1.3
% 4.84/1.64 % (3055132)Termination reason: Instruction limit
% 4.84/1.64 % (3055132)Termination phase: Saturation
% 4.84/1.64 % (3055132)Time elapsed: 0.218 s
% 4.84/1.64 % (3055132)Peak memory usage: 92 MB
% 4.84/1.64 % (3055132)Instructions burned: 326 (million)
% 4.84/1.64 % (3055137)Refutation not found, incomplete strategy
% 4.84/1.64 % (3055137)------------------------------
% 4.84/1.64 % (3055137)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.84/1.64 % (3055137)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.84/1.64 % (3055137)CaDiCaL version: 2.1.3
% 4.84/1.64 % (3055137)Termination reason: Refutation not found, incomplete strategy
% 4.84/1.64 % (3055137)Time elapsed: 0.043 s
% 4.84/1.64 % (3055137)Peak memory usage: 89 MB
% 4.84/1.64 % (3055137)Instructions burned: 67 (million)
% 4.84/1.64 % (3055118)Also succeeded, but the first one will report.
% 4.84/1.64 % (3055136)Instruction limit reached!
% 4.84/1.64 % (3055136)------------------------------
% 4.84/1.64 % (3055136)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.84/1.64 % (3055136)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.84/1.64 % (3055136)CaDiCaL version: 2.1.3
% 4.84/1.64 % (3055136)Termination reason: Instruction limit
% 4.84/1.64 % (3055136)Termination phase: Saturation
% 4.84/1.64 % (3055136)Time elapsed: 0.139 s
% 4.84/1.64 % (3055136)Peak memory usage: 89 MB
% 4.84/1.64 % (3055136)Instructions burned: 248 (million)
% 4.84/1.64 % (3055130)Refutation found. Thanks to Tanya!
% 4.84/1.64 % SZS status Theorem for theBenchmark
% 4.84/1.64 % SZS output start Proof for theBenchmark
% See solution above
% 6.16/1.84 % (3055130)------------------------------
% 6.16/1.84 % (3055130)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.16/1.84 % (3055130)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.16/1.84 % (3055130)CaDiCaL version: 2.1.3
% 6.16/1.84 % (3055130)Termination reason: Refutation
% 6.16/1.84 % (3055130)Time elapsed: 0.132 s
% 6.16/1.84 % (3055130)Peak memory usage: 91 MB
% 6.16/1.84 % (3055130)Instructions burned: 206 (million)
% 6.16/1.84 % (3055130)------------------------------
% 6.16/1.84 % (3055130)------------------------------
% 6.16/1.84 % (3055111)Success in time 0.785 s
% 6.16/1.84 % Vampire exiting
%------------------------------------------------------------------------------