%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : PRO017+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n001.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.84s 0.91s
% Output : Refutation 2.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 21
% Syntax : Number of formulae : 158 ( 28 unt; 9 def)
% Number of atoms : 513 ( 41 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 591 ( 236 ~; 250 |; 84 &)
% ( 11 <=>; 10 =>; 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 : 13 ( 13 usr; 7 con; 0-3 aty)
% Number of variables : 185 ( 0 sgn 159 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( occurrence_of(X1,X0)
=> ( activity(X0)
& activity_occurrence(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos) ).
fof(f2,axiom,
! [X0] :
( activity_occurrence(X0)
=> ? [X1] :
( activity(X1)
& occurrence_of(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_01) ).
fof(f3,axiom,
! [X0,X1,X2] :
( ( occurrence_of(X0,X1)
& occurrence_of(X0,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_02) ).
fof(f23,axiom,
! [X0,X1,X2] :
( next_subocc(X0,X1,X2)
<=> ( min_precedes(X0,X1,X2)
& ~ ? [X3] :
( min_precedes(X0,X3,X2)
& min_precedes(X3,X1,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_22) ).
fof(f26,axiom,
! [X0,X1,X2] :
( min_precedes(X1,X2,X0)
=> ? [X3] :
( occurrence_of(X3,X0)
& subactivity_occurrence(X1,X3)
& subactivity_occurrence(X2,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_25) ).
fof(f38,axiom,
! [X0,X1,X2] :
( ( occurrence_of(X0,X2)
& leaf_occ(X1,X0) )
=> ~ ? [X3] : min_precedes(X1,X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_37) ).
fof(f47,axiom,
! [X0,X1,X2] :
( min_precedes(X0,X1,X2)
=> arboreal(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_46) ).
fof(f50,axiom,
! [X0,X1] :
( ( occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) )
=> ? [X2,X3,X4] :
( occurrence_of(X2,tptp3)
& next_subocc(X0,X2,tptp0)
& occurrence_of(X3,tptp4)
& min_precedes(X2,X3,tptp0)
& ( occurrence_of(X4,tptp2)
| occurrence_of(X4,tptp1) )
& min_precedes(X3,X4,tptp0)
& ! [X5] :
( min_precedes(X2,X5,tptp0)
=> ( X5 = X3
| X5 = X4 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_49) ).
fof(f57,axiom,
tptp4 != tptp3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_56) ).
fof(f60,axiom,
tptp3 != tptp2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_59) ).
fof(f61,axiom,
tptp3 != tptp1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_60) ).
fof(f63,conjecture,
! [X0,X1] :
( ( occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) )
=> ? [X2,X3] :
( occurrence_of(X2,tptp3)
& next_subocc(X0,X2,tptp0)
& ( occurrence_of(X3,tptp2)
| occurrence_of(X3,tptp1) )
& min_precedes(X2,X3,tptp0)
& leaf(X3,tptp0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f64,negated_conjecture,
~ ! [X0,X1] :
( ( occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) )
=> ? [X2,X3] :
( occurrence_of(X2,tptp3)
& next_subocc(X0,X2,tptp0)
& ( occurrence_of(X3,tptp2)
| occurrence_of(X3,tptp1) )
& min_precedes(X2,X3,tptp0)
& leaf(X3,tptp0) ) ),
inference(negated_conjecture,[status(cth)],[f63]) ).
fof(f66,plain,
! [X0,X1] :
( ( 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,tptp2)
| occurrence_of(X4,tptp1) )
& min_precedes(X3,X4,tptp0)
& ! [X5] :
( X5 = X3
| X5 = X4
| ~ min_precedes(X2,X5,tptp0) ) )
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(ennf_transformation,[],[f50]) ).
fof(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,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,[],[f138]) ).
fof(f140,plain,
? [X0,X1] :
( ! [X2,X3] :
( ~ occurrence_of(X2,tptp3)
| ~ next_subocc(X0,X2,tptp0)
| ( ~ occurrence_of(X3,tptp2)
& ~ occurrence_of(X3,tptp1) )
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf(X3,tptp0) )
& occurrence_of(X1,tptp0)
& subactivity_occurrence(X0,X1)
& arboreal(X0)
& ~ leaf_occ(X0,X1) ),
inference(ennf_transformation,[],[f64]) ).
fof(f141,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,[],[f140]) ).
fof(f142,plain,
! [X0] :
( ( activity(sK0(X0))
& occurrence_of(X0,sK0(X0)) )
| ~ activity_occurrence(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X1,sK0(X0))],[f67]) ).
fof(f153,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(f154,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,[],[f153]) ).
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)
& ! [X4] :
( ~ min_precedes(X0,X4,X2)
| ~ min_precedes(X4,X1,X2) ) )
| ~ next_subocc(X0,X1,X2) ) ),
inference(rectify,[],[f154]) ).
fof(f156,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X1,X2)
| ~ min_precedes(X0,X1,X2)
| ( min_precedes(X0,sK7(X0,X1,X2),X2)
& min_precedes(sK7(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,[sK7]),skolemize(X3,sK7(X0,X1,X2))],[f155]) ).
fof(f160,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))],[f96]) ).
fof(f168,plain,
! [X0,X1] :
( ( occurrence_of(sK15(X0),tptp3)
& next_subocc(X0,sK15(X0),tptp0)
& occurrence_of(sK16(X0),tptp4)
& min_precedes(sK15(X0),sK16(X0),tptp0)
& ( occurrence_of(sK17(X0),tptp2)
| occurrence_of(sK17(X0),tptp1) )
& min_precedes(sK16(X0),sK17(X0),tptp0)
& ! [X5] :
( sK16(X0) = X5
| sK17(X0) = X5
| ~ min_precedes(sK15(X0),X5,tptp0) ) )
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK15,sK16,sK17]),skolemize(X2,sK15(X0)),skolemize(X3,sK16(X0)),skolemize(X4,sK17(X0))],[f139]) ).
fof(f169,plain,
( ! [X2,X3] :
( ~ occurrence_of(X2,tptp3)
| ~ next_subocc(sK18,X2,tptp0)
| ( ~ occurrence_of(X3,tptp2)
& ~ occurrence_of(X3,tptp1) )
| ~ min_precedes(X2,X3,tptp0)
| ~ leaf(X3,tptp0) )
& occurrence_of(sK19,tptp0)
& subactivity_occurrence(sK18,sK19)
& arboreal(sK18)
& ~ leaf_occ(sK18,sK19) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK18,sK19]),skolemize(X0,sK18),skolemize(X1,sK19)],[f141]) ).
fof(f170,plain,
! [X0,X1] :
( ~ occurrence_of(X1,X0)
| activity_occurrence(X1) ),
inference(cnf_transformation,[],[f66]) ).
fof(f172,plain,
! [X0] :
( occurrence_of(X0,sK0(X0))
| ~ activity_occurrence(X0) ),
inference(cnf_transformation,[],[f142]) ).
fof(f174,plain,
! [X2,X0,X1] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f69]) ).
fof(f206,plain,
! [X2,X0,X1] :
( ~ next_subocc(X0,X1,X2)
| min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f156]) ).
fof(f216,plain,
! [X2,X0,X1] :
( subactivity_occurrence(X1,sK9(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f160]) ).
fof(f217,plain,
! [X2,X0,X1] :
( occurrence_of(sK9(X0,X1,X2),X0)
| ~ min_precedes(X1,X2,X0) ),
inference(cnf_transformation,[],[f160]) ).
fof(f235,plain,
! [X2,X3,X0,X1] :
( ~ min_precedes(X1,X3,X2)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f246,plain,
! [X2,X0,X1] :
( ~ min_precedes(X0,X1,X2)
| arboreal(X0) ),
inference(cnf_transformation,[],[f133]) ).
fof(f249,plain,
! [X0,X1,X5] :
( ~ min_precedes(sK15(X0),X5,tptp0)
| sK17(X0) = X5
| sK16(X0) = X5
| ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(X0,X1)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f168]) ).
fof(f251,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| occurrence_of(sK17(X0),tptp1)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK17(X0),tptp2)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f168]) ).
fof(f252,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| min_precedes(sK15(X0),sK16(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f168]) ).
fof(f253,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK16(X0),tptp4)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f168]) ).
fof(f254,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| next_subocc(X0,sK15(X0),tptp0)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f168]) ).
fof(f255,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0)
| occurrence_of(sK15(X0),tptp3)
| ~ arboreal(X0)
| leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f168]) ).
fof(f262,plain,
tptp3 != tptp4,
inference(cnf_transformation,[],[f57]) ).
fof(f265,plain,
tptp3 != tptp2,
inference(cnf_transformation,[],[f60]) ).
fof(f266,plain,
tptp3 != tptp1,
inference(cnf_transformation,[],[f61]) ).
fof(f268,plain,
~ leaf_occ(sK18,sK19),
inference(cnf_transformation,[],[f169]) ).
fof(f269,plain,
arboreal(sK18),
inference(cnf_transformation,[],[f169]) ).
fof(f270,plain,
subactivity_occurrence(sK18,sK19),
inference(cnf_transformation,[],[f169]) ).
fof(f271,plain,
occurrence_of(sK19,tptp0),
inference(cnf_transformation,[],[f169]) ).
fof(f297,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| sK0(X0) = X1
| ~ activity_occurrence(X0) ),
inference(resolution,[],[f174,f172]) ).
fof(f299,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| sK0(X0) = X1 ),
inference(forward_subsumption_resolution,[],[f297,f170]) ).
fof(f513,plain,
( ~ occurrence_of(sK19,tptp0)
| occurrence_of(sK16(sK18),tptp4)
| ~ arboreal(sK18)
| leaf_occ(sK18,sK19) ),
inference(resolution,[],[f253,f270]) ).
fof(f521,plain,
( occurrence_of(sK16(sK18),tptp4)
| ~ arboreal(sK18)
| leaf_occ(sK18,sK19) ),
inference(forward_subsumption_resolution,[],[f513,f271]) ).
fof(f522,plain,
( occurrence_of(sK16(sK18),tptp4)
| leaf_occ(sK18,sK19) ),
inference(forward_subsumption_resolution,[],[f521,f269]) ).
fof(f523,plain,
occurrence_of(sK16(sK18),tptp4),
inference(forward_subsumption_resolution,[],[f522,f268]) ).
fof(f530,plain,
tptp4 = sK0(sK16(sK18)),
inference(resolution,[],[f523,f299]) ).
fof(f534,plain,
! [X2,X0,X1] :
( ~ occurrence_of(sK9(X0,X1,X2),tptp0)
| occurrence_of(sK15(X1),tptp3)
| ~ arboreal(X1)
| leaf_occ(X1,sK9(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(resolution,[],[f255,f216]) ).
fof(f539,plain,
! [X2,X0,X1] :
( ~ occurrence_of(sK9(X0,X1,X2),tptp0)
| occurrence_of(sK15(X1),tptp3)
| leaf_occ(X1,sK9(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(forward_subsumption_resolution,[],[f534,f246]) ).
fof(f545,plain,
( ~ occurrence_of(sK19,tptp0)
| next_subocc(sK18,sK15(sK18),tptp0)
| ~ arboreal(sK18)
| leaf_occ(sK18,sK19) ),
inference(resolution,[],[f254,f270]) ).
fof(f547,plain,
! [X2,X0,X1] :
( ~ occurrence_of(sK9(X0,X1,X2),tptp0)
| next_subocc(X1,sK15(X1),tptp0)
| ~ arboreal(X1)
| leaf_occ(X1,sK9(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(resolution,[],[f254,f216]) ).
fof(f552,plain,
! [X2,X0,X1] :
( ~ occurrence_of(sK9(X0,X1,X2),tptp0)
| next_subocc(X1,sK15(X1),tptp0)
| leaf_occ(X1,sK9(X0,X1,X2))
| ~ min_precedes(X1,X2,X0) ),
inference(forward_subsumption_resolution,[],[f547,f246]) ).
fof(f553,plain,
( next_subocc(sK18,sK15(sK18),tptp0)
| ~ arboreal(sK18)
| leaf_occ(sK18,sK19) ),
inference(forward_subsumption_resolution,[],[f545,f271]) ).
fof(f554,plain,
( next_subocc(sK18,sK15(sK18),tptp0)
| leaf_occ(sK18,sK19) ),
inference(forward_subsumption_resolution,[],[f553,f269]) ).
fof(f555,plain,
next_subocc(sK18,sK15(sK18),tptp0),
inference(forward_subsumption_resolution,[],[f554,f268]) ).
fof(f601,plain,
( ~ occurrence_of(sK19,tptp0)
| min_precedes(sK15(sK18),sK16(sK18),tptp0)
| ~ arboreal(sK18)
| leaf_occ(sK18,sK19) ),
inference(resolution,[],[f252,f270]) ).
fof(f602,plain,
( min_precedes(sK15(sK18),sK16(sK18),tptp0)
| ~ arboreal(sK18)
| leaf_occ(sK18,sK19) ),
inference(forward_subsumption_resolution,[],[f601,f271]) ).
fof(f605,plain,
( min_precedes(sK15(sK18),sK16(sK18),tptp0)
| leaf_occ(sK18,sK19) ),
inference(forward_subsumption_resolution,[],[f602,f269]) ).
fof(f606,plain,
min_precedes(sK15(sK18),sK16(sK18),tptp0),
inference(forward_subsumption_resolution,[],[f605,f268]) ).
fof(f619,plain,
( occurrence_of(sK17(sK18),tptp1)
| ~ occurrence_of(sK19,tptp0)
| occurrence_of(sK17(sK18),tptp2)
| ~ arboreal(sK18)
| leaf_occ(sK18,sK19) ),
inference(resolution,[],[f251,f270]) ).
fof(f620,plain,
( occurrence_of(sK17(sK18),tptp1)
| occurrence_of(sK17(sK18),tptp2)
| ~ arboreal(sK18)
| leaf_occ(sK18,sK19) ),
inference(forward_subsumption_resolution,[],[f619,f271]) ).
fof(f623,plain,
( occurrence_of(sK17(sK18),tptp1)
| occurrence_of(sK17(sK18),tptp2)
| leaf_occ(sK18,sK19) ),
inference(forward_subsumption_resolution,[],[f620,f269]) ).
fof(f624,plain,
( occurrence_of(sK17(sK18),tptp1)
| occurrence_of(sK17(sK18),tptp2) ),
inference(forward_subsumption_resolution,[],[f623,f268]) ).
fof(f626,definition,
( spl20_9
<=> occurrence_of(sK17(sK18),tptp2) ),
introduced(definition,[new_symbols(definition,[spl20_9])],[avatar_definition]) ).
fof(f628,plain,
( occurrence_of(sK17(sK18),tptp2)
| ~ spl20_9 ),
inference(avatar_component_clause,[],[f626]) ).
fof(f630,definition,
( spl20_10
<=> occurrence_of(sK17(sK18),tptp1) ),
introduced(definition,[new_symbols(definition,[spl20_10])],[avatar_definition]) ).
fof(f632,plain,
( occurrence_of(sK17(sK18),tptp1)
| ~ spl20_10 ),
inference(avatar_component_clause,[],[f630]) ).
fof(f633,plain,
( spl20_9
| spl20_10 ),
inference(avatar_split_clause,[],[f624,f630,f626]) ).
fof(f669,plain,
min_precedes(sK18,sK15(sK18),tptp0),
inference(resolution,[],[f555,f206]) ).
fof(f738,plain,
! [X0] :
( ~ leaf_occ(sK15(sK18),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f606,f235]) ).
fof(f810,plain,
! [X0] :
( ~ leaf_occ(sK18,X0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[],[f669,f235]) ).
fof(f1762,plain,
! [X0,X1] :
( occurrence_of(sK15(X0),tptp3)
| leaf_occ(X0,sK9(tptp0,X0,X1))
| ~ min_precedes(X0,X1,tptp0)
| ~ min_precedes(X0,X1,tptp0) ),
inference(resolution,[],[f539,f217]) ).
fof(f1763,plain,
! [X0,X1] :
( leaf_occ(X0,sK9(tptp0,X0,X1))
| occurrence_of(sK15(X0),tptp3)
| ~ min_precedes(X0,X1,tptp0) ),
inference(duplicate_literal_removal,[],[f1762]) ).
fof(f1871,plain,
! [X0,X1] :
( next_subocc(X0,sK15(X0),tptp0)
| leaf_occ(X0,sK9(tptp0,X0,X1))
| ~ min_precedes(X0,X1,tptp0)
| ~ min_precedes(X0,X1,tptp0) ),
inference(resolution,[],[f552,f217]) ).
fof(f1872,plain,
! [X0,X1] :
( leaf_occ(X0,sK9(tptp0,X0,X1))
| next_subocc(X0,sK15(X0),tptp0)
| ~ min_precedes(X0,X1,tptp0) ),
inference(duplicate_literal_removal,[],[f1871]) ).
fof(f4330,plain,
( tptp1 = sK0(sK17(sK18))
| ~ spl20_10 ),
inference(resolution,[],[f632,f299]) ).
fof(f4705,definition,
( spl20_254
<=> ! [X0] : ~ min_precedes(sK15(sK18),X0,tptp0) ),
introduced(definition,[new_symbols(definition,[spl20_254])],[avatar_definition]) ).
fof(f4706,plain,
( ! [X0] : ~ min_precedes(sK15(sK18),X0,tptp0)
| ~ spl20_254 ),
inference(avatar_component_clause,[],[f4705]) ).
fof(f4769,plain,
! [X0] :
( occurrence_of(sK15(sK15(sK18)),tptp3)
| ~ min_precedes(sK15(sK18),X0,tptp0)
| ~ occurrence_of(sK9(tptp0,sK15(sK18),X0),tptp0) ),
inference(resolution,[],[f1763,f738]) ).
fof(f4775,plain,
! [X0] :
( occurrence_of(sK15(sK15(sK18)),tptp3)
| ~ min_precedes(sK15(sK18),X0,tptp0) ),
inference(forward_subsumption_resolution,[],[f4769,f217]) ).
fof(f4844,plain,
( $false
| ~ spl20_254 ),
inference(resolution,[],[f4706,f606]) ).
fof(f4847,plain,
~ spl20_254,
inference(avatar_contradiction_clause,[],[f4844]) ).
fof(f4849,definition,
( spl20_257
<=> occurrence_of(sK15(sK15(sK18)),tptp3) ),
introduced(definition,[new_symbols(definition,[spl20_257])],[avatar_definition]) ).
fof(f4851,plain,
( occurrence_of(sK15(sK15(sK18)),tptp3)
| ~ spl20_257 ),
inference(avatar_component_clause,[],[f4849]) ).
fof(f4852,plain,
( spl20_254
| spl20_257 ),
inference(avatar_split_clause,[],[f4775,f4849,f4705]) ).
fof(f4895,plain,
! [X0] :
( next_subocc(sK15(sK18),sK15(sK15(sK18)),tptp0)
| ~ min_precedes(sK15(sK18),X0,tptp0)
| ~ occurrence_of(sK9(tptp0,sK15(sK18),X0),tptp0) ),
inference(resolution,[],[f1872,f738]) ).
fof(f4901,plain,
! [X0] :
( next_subocc(sK15(sK18),sK15(sK15(sK18)),tptp0)
| ~ min_precedes(sK15(sK18),X0,tptp0) ),
inference(forward_subsumption_resolution,[],[f4895,f217]) ).
fof(f4909,definition,
( spl20_259
<=> next_subocc(sK15(sK18),sK15(sK15(sK18)),tptp0) ),
introduced(definition,[new_symbols(definition,[spl20_259])],[avatar_definition]) ).
fof(f4911,plain,
( next_subocc(sK15(sK18),sK15(sK15(sK18)),tptp0)
| ~ spl20_259 ),
inference(avatar_component_clause,[],[f4909]) ).
fof(f4912,plain,
( spl20_254
| spl20_259 ),
inference(avatar_split_clause,[],[f4901,f4909,f4705]) ).
fof(f5039,plain,
( tptp3 = sK0(sK15(sK15(sK18)))
| ~ spl20_257 ),
inference(resolution,[],[f4851,f299]) ).
fof(f5800,plain,
( min_precedes(sK15(sK18),sK15(sK15(sK18)),tptp0)
| ~ spl20_259 ),
inference(resolution,[],[f4911,f206]) ).
fof(f7138,plain,
( ! [X0] :
( sK17(sK18) = sK15(sK15(sK18))
| sK16(sK18) = sK15(sK15(sK18))
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK18,X0)
| ~ arboreal(sK18)
| leaf_occ(sK18,X0) )
| ~ spl20_259 ),
inference(resolution,[],[f5800,f249]) ).
fof(f7184,plain,
( ! [X0] :
( sK17(sK18) = sK15(sK15(sK18))
| sK16(sK18) = sK15(sK15(sK18))
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK18,X0)
| ~ arboreal(sK18) )
| ~ spl20_259 ),
inference(forward_subsumption_resolution,[],[f7138,f810]) ).
fof(f7191,definition,
( spl20_328
<=> occurrence_of(sK15(sK15(sK18)),tptp2) ),
introduced(definition,[new_symbols(definition,[spl20_328])],[avatar_definition]) ).
fof(f7192,plain,
( occurrence_of(sK15(sK15(sK18)),tptp2)
| ~ spl20_328 ),
inference(avatar_component_clause,[],[f7191]) ).
fof(f7193,plain,
( ~ occurrence_of(sK15(sK15(sK18)),tptp2)
| spl20_328 ),
inference(avatar_component_clause,[],[f7191]) ).
fof(f7204,plain,
( ! [X0] :
( sK17(sK18) = sK15(sK15(sK18))
| sK16(sK18) = sK15(sK15(sK18))
| ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK18,X0) )
| ~ spl20_259 ),
inference(forward_subsumption_resolution,[],[f7184,f269]) ).
fof(f7206,definition,
( spl20_331
<=> ! [X0] :
( ~ occurrence_of(X0,tptp0)
| ~ subactivity_occurrence(sK18,X0) ) ),
introduced(definition,[new_symbols(definition,[spl20_331])],[avatar_definition]) ).
fof(f7207,plain,
( ! [X0] :
( ~ subactivity_occurrence(sK18,X0)
| ~ occurrence_of(X0,tptp0) )
| ~ spl20_331 ),
inference(avatar_component_clause,[],[f7206]) ).
fof(f7209,definition,
( spl20_332
<=> sK16(sK18) = sK15(sK15(sK18)) ),
introduced(definition,[new_symbols(definition,[spl20_332])],[avatar_definition]) ).
fof(f7211,plain,
( sK16(sK18) = sK15(sK15(sK18))
| ~ spl20_332 ),
inference(avatar_component_clause,[],[f7209]) ).
fof(f7213,definition,
( spl20_333
<=> sK17(sK18) = sK15(sK15(sK18)) ),
introduced(definition,[new_symbols(definition,[spl20_333])],[avatar_definition]) ).
fof(f7215,plain,
( sK17(sK18) = sK15(sK15(sK18))
| ~ spl20_333 ),
inference(avatar_component_clause,[],[f7213]) ).
fof(f7216,plain,
( spl20_331
| spl20_332
| spl20_333
| ~ spl20_259 ),
inference(avatar_split_clause,[],[f7204,f4909,f7213,f7209,f7206]) ).
fof(f7426,plain,
( ~ occurrence_of(sK19,tptp0)
| ~ spl20_331 ),
inference(resolution,[],[f7207,f270]) ).
fof(f7435,plain,
( $false
| ~ spl20_331 ),
inference(forward_subsumption_resolution,[],[f7426,f271]) ).
fof(f7436,plain,
~ spl20_331,
inference(avatar_contradiction_clause,[],[f7435]) ).
fof(f7440,plain,
( tptp4 = sK0(sK15(sK15(sK18)))
| ~ spl20_332 ),
inference(superposition,[],[f530,f7211]) ).
fof(f7897,plain,
( tptp3 = tptp4
| ~ spl20_257
| ~ spl20_332 ),
inference(superposition,[],[f7440,f5039]) ).
fof(f7910,plain,
( $false
| ~ spl20_257
| ~ spl20_332 ),
inference(forward_subsumption_resolution,[],[f7897,f262]) ).
fof(f7911,plain,
( ~ spl20_257
| ~ spl20_332 ),
inference(avatar_contradiction_clause,[],[f7910]) ).
fof(f7994,plain,
( tptp1 = sK0(sK15(sK15(sK18)))
| ~ spl20_10
| ~ spl20_333 ),
inference(superposition,[],[f4330,f7215]) ).
fof(f8020,plain,
( tptp3 = tptp1
| ~ spl20_10
| ~ spl20_257
| ~ spl20_333 ),
inference(forward_demodulation,[],[f7994,f5039]) ).
fof(f8029,plain,
( $false
| ~ spl20_10
| ~ spl20_257
| ~ spl20_333 ),
inference(forward_subsumption_resolution,[],[f8020,f266]) ).
fof(f8030,plain,
( ~ spl20_10
| ~ spl20_257
| ~ spl20_333 ),
inference(avatar_contradiction_clause,[],[f8029]) ).
fof(f8031,plain,
( occurrence_of(sK15(sK15(sK18)),tptp2)
| ~ spl20_9
| ~ spl20_333 ),
inference(forward_demodulation,[],[f628,f7215]) ).
fof(f8048,plain,
( $false
| ~ spl20_9
| spl20_328
| ~ spl20_333 ),
inference(forward_subsumption_resolution,[],[f8031,f7193]) ).
fof(f8049,plain,
( ~ spl20_9
| spl20_328
| ~ spl20_333 ),
inference(avatar_contradiction_clause,[],[f8048]) ).
fof(f8179,plain,
( tptp2 = sK0(sK15(sK15(sK18)))
| ~ spl20_328 ),
inference(resolution,[],[f7192,f299]) ).
fof(f8182,plain,
( tptp3 = tptp2
| ~ spl20_257
| ~ spl20_328 ),
inference(forward_demodulation,[],[f8179,f5039]) ).
fof(f8183,plain,
( $false
| ~ spl20_257
| ~ spl20_328 ),
inference(forward_subsumption_resolution,[],[f8182,f265]) ).
fof(f8184,plain,
( ~ spl20_257
| ~ spl20_328 ),
inference(avatar_contradiction_clause,[],[f8183]) ).
cnf(s5,plain,
( spl20_9
| spl20_10 ),
inference(sat_conversion,[],[f633]) ).
cnf(s237,plain,
~ spl20_254,
inference(sat_conversion,[],[f4847]) ).
cnf(s238,plain,
( spl20_254
| spl20_257 ),
inference(sat_conversion,[],[f4852]) ).
cnf(s240,plain,
( spl20_254
| spl20_259 ),
inference(sat_conversion,[],[f4912]) ).
cnf(s298,plain,
( ~ spl20_259
| spl20_331
| spl20_332
| spl20_333 ),
inference(sat_conversion,[],[f7216]) ).
cnf(s318,plain,
~ spl20_331,
inference(sat_conversion,[],[f7436]) ).
cnf(s322,plain,
( ~ spl20_257
| ~ spl20_332 ),
inference(sat_conversion,[],[f7911]) ).
cnf(s327,plain,
( ~ spl20_10
| ~ spl20_257
| ~ spl20_333 ),
inference(sat_conversion,[],[f8030]) ).
cnf(s328,plain,
( ~ spl20_9
| spl20_328
| ~ spl20_333 ),
inference(sat_conversion,[],[f8049]) ).
cnf(s332,plain,
( ~ spl20_257
| ~ spl20_328 ),
inference(sat_conversion,[],[f8184]) ).
cnf(s333,plain,
( ~ spl20_259
| spl20_332
| spl20_333 ),
inference(rat,[],[s298,s318]) ).
cnf(s336,plain,
spl20_259,
inference(rat,[],[s240,s237]) ).
cnf(s337,plain,
spl20_257,
inference(rat,[],[s238,s237]) ).
cnf(s339,plain,
~ spl20_328,
inference(rat,[],[s332,s337]) ).
cnf(s340,plain,
~ spl20_332,
inference(rat,[],[s322,s337]) ).
cnf(s342,plain,
spl20_333,
inference(rat,[],[s333,s336,s340]) ).
cnf(s344,plain,
~ spl20_10,
inference(rat,[],[s327,s337,s342]) ).
cnf(s345,plain,
~ spl20_9,
inference(rat,[],[s328,s339,s342]) ).
cnf(s360,plain,
$false,
inference(rat,[],[s5,s344,s345]) ).
fof(f8185,plain,
$false,
inference(avatar_sat_refutation,[],[s360]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PRO017+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n001.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 27 22:30:47 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/0.41 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.84/0.91 % (4026443)Will run a generic schedule for satisfiability detection.
% 2.84/0.91 % (4026451)dis+10_1_sil=32000:sp=arity:random_seed=3559915509:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.84/0.91 % (4026449)% WARNING: option uhcvi not known.
% 2.84/0.91 % (4026448)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4039578888_2999 on theBenchmark for (2999ds/0Mi)
% 2.84/0.91 % (4026449)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1151239826:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.84/0.91 % (4026450)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1276861421:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.84/0.91 % (4026453)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1829176000:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.84/0.91 % (4026452)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=675459651:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.84/0.91 % (4026454)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=725353508:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.84/0.91 % Detected minimum model sizes of [4]
% 2.84/0.91 % Detected maximum model sizes of [max]
% 2.84/0.91 % TRYING [4]
% 2.84/0.91 % TRYING [5]
% 2.84/0.91 % (4026451)Instruction limit reached!
% 2.84/0.91 % (4026451)------------------------------
% 2.84/0.91 % (4026451)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.84/0.91 % (4026451)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.84/0.91 % (4026451)CaDiCaL version: 2.1.3
% 2.84/0.91 % (4026451)Termination reason: Instruction limit
% 2.84/0.91 % (4026451)Termination phase: Saturation
% 2.84/0.91 % (4026451)Time elapsed: 0.039 s
% 2.84/0.91 % (4026451)Peak memory usage: 12 MB
% 2.84/0.91 % (4026451)Instructions burned: 105 (million)
% 2.84/0.91 % (4026462)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2399348518:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.84/0.91 % Detected minimum model sizes of [4]
% 2.84/0.91 % Detected maximum model sizes of [max]
% 2.84/0.91 % TRYING [4]
% 2.84/0.91 % TRYING [5]
% 2.84/0.91 % TRYING [6]
% 2.84/0.91 % (4026452)Instruction limit reached!
% 2.84/0.91 % (4026452)------------------------------
% 2.84/0.91 % (4026452)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.84/0.91 % (4026452)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.84/0.91 % (4026452)CaDiCaL version: 2.1.3
% 2.84/0.91 % (4026452)Termination reason: Instruction limit
% 2.84/0.91 % (4026452)Termination phase: Saturation
% 2.84/0.91 % (4026452)Time elapsed: 0.066 s
% 2.84/0.91 % (4026452)Peak memory usage: 12 MB
% 2.84/0.91 % (4026452)Instructions burned: 118 (million)
% 2.84/0.91 % (4026454)Instruction limit reached!
% 2.84/0.91 % (4026454)------------------------------
% 2.84/0.91 % (4026454)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.84/0.91 % (4026454)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.84/0.91 % (4026454)CaDiCaL version: 2.1.3
% 2.84/0.91 % (4026454)Termination reason: Instruction limit
% 2.84/0.91 % (4026454)Termination phase: Saturation
% 2.84/0.91 % (4026454)Time elapsed: 0.066 s
% 2.84/0.91 % (4026454)Peak memory usage: 12 MB
% 2.84/0.91 % (4026454)Instructions burned: 159 (million)
% 2.84/0.91 % TRYING [6]
% 2.84/0.91 % (4026465)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=4108298615:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.84/0.91 % (4026464)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3304630564:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 2.84/0.91 % (4026453)Instruction limit reached!
% 2.84/0.91 % (4026453)------------------------------
% 2.84/0.91 % (4026453)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.84/0.91 % (4026453)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.84/0.91 % (4026453)CaDiCaL version: 2.1.3
% 2.84/0.91 % (4026453)Termination reason: Instruction limit
% 2.84/0.91 % (4026453)Termination phase: Saturation
% 2.84/0.91 % (4026453)Time elapsed: 0.089 s
% 2.84/0.91 % (4026453)Peak memory usage: 13 MB
% 2.84/0.91 % (4026453)Instructions burned: 132 (million)
% 2.84/0.91 % (4026468)ott-21_1_sil=16000:fs=off:random_seed=2900528529:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.84/0.91 % TRYING [7]
% 2.84/0.91 % TRYING [7]
% 2.84/0.91 % (4026464)Instruction limit reached!
% 2.84/0.91 % (4026464)------------------------------
% 2.84/0.91 % (4026464)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.84/0.91 % (4026464)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.84/0.91 % (4026464)CaDiCaL version: 2.1.3
% 2.84/0.91 % (4026464)Termination reason: Instruction limit
% 2.84/0.91 % (4026464)Termination phase: Saturation
% 2.84/0.91 % (4026464)Time elapsed: 0.094 s
% 2.84/0.91 % (4026464)Peak memory usage: 13 MB
% 2.84/0.91 % (4026464)Instructions burned: 131 (million)
% 2.84/0.91 % (4026462)Instruction limit reached!
% 2.84/0.91 % (4026462)------------------------------
% 2.84/0.91 % (4026462)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.84/0.91 % (4026462)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.84/0.91 % (4026462)CaDiCaL version: 2.1.3
% 2.84/0.91 % (4026462)Termination reason: Instruction limit
% 2.84/0.91 % (4026462)Termination phase: Finite model building constraint generation
% 2.84/0.91 % (4026462)Time elapsed: 0.159 s
% 2.84/0.91 % (4026462)Peak memory usage: 33 MB
% 2.84/0.91 % (4026462)Instructions burned: 718 (million)
% 2.84/0.91 % (4026470)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=585036111:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 2.84/0.91 % (4026468)Instruction limit reached!
% 2.84/0.91 % (4026468)------------------------------
% 2.84/0.91 % (4026468)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.84/0.91 % (4026468)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.84/0.91 % (4026468)CaDiCaL version: 2.1.3
% 2.84/0.91 % (4026468)Termination reason: Instruction limit
% 2.84/0.91 % (4026468)Termination phase: Saturation
% 2.84/0.91 % (4026468)Time elapsed: 0.100 s
% 2.84/0.91 % (4026468)Peak memory usage: 13 MB
% 2.84/0.91 % (4026468)Instructions burned: 180 (million)
% 2.84/0.91 % (4026472)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1063311005:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.84/0.91 % Detected minimum model sizes of [4]
% 2.84/0.91 % Detected maximum model sizes of [max]
% 2.84/0.91 % (4026473)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3483999070:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 2.84/0.91 % TRYING [4]
% 2.84/0.91 % TRYING [5]
% 2.84/0.91 % TRYING [6]
% 2.84/0.91 % TRYING [8]
% 2.84/0.91 % TRYING [7]
% 2.84/0.91 % (4026472)Instruction limit reached!
% 2.84/0.91 % (4026472)------------------------------
% 2.84/0.91 % (4026472)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.84/0.91 % (4026472)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.84/0.91 % (4026472)CaDiCaL version: 2.1.3
% 2.84/0.91 % (4026472)Termination reason: Instruction limit
% 2.84/0.91 % (4026472)Termination phase: Finite model building constraint generation
% 2.84/0.91 % (4026472)Time elapsed: 0.186 s
% 2.84/0.91 % (4026472)Peak memory usage: 25 MB
% 2.84/0.91 % (4026472)Instructions burned: 865 (million)
% 2.84/0.91 % (4026476)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3669964149:i=889:ins=1_2995 on theBenchmark for (2995ds/889Mi)
% 2.84/0.91 % (4026473) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4026443-4026473"...
% 2.84/0.91 % (4026473)...printing done.
% 2.84/0.91 % (4026473)Refutation found. Thanks to Tanya!
% 2.84/0.91 % SZS status Theorem for theBenchmark
% 2.84/0.91 % SZS output start Proof for theBenchmark
% See solution above
% 2.84/0.91 % (4026473)------------------------------
% 2.84/0.91 % (4026473)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.84/0.91 % (4026473)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.84/0.91 % (4026473)CaDiCaL version: 2.1.3
% 2.84/0.91 % (4026473)Termination reason: Refutation
% 2.84/0.91 % (4026473)Time elapsed: 0.214 s
% 2.84/0.91 % (4026473)Peak memory usage: 16 MB
% 2.84/0.91 % (4026473)Instructions burned: 332 (million)
% 2.84/0.91 % (4026443)Success in time 0.488 s
% 2.84/0.91 % Vampire exiting
%------------------------------------------------------------------------------