↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : PRO012+1 : 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 : n006.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:26 PM UTC 2026

% Result   : Theorem 10.10s 2.41s
% Output   : Refutation 11.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   21
%            Number of leaves      :   24
% Syntax   : Number of formulae    :  172 (  20 unt;  10 def)
%            Number of atoms       :  572 (  37 equ)
%            Maximal formula atoms :   11 (   3 avg)
%            Number of connectives :  669 ( 269   ~; 289   |;  84   &)
%                                         (  14 <=>;  13  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   23 (  21 usr;  11 prp; 0-3 aty)
%            Number of functors    :   15 (  15 usr;   6 con; 0-3 aty)
%            Number of variables   :  237 (   0 sgn 209   !;  28   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] :
      ( occurrence_of(X1,X0)
     => ( activity(X0)
        & activity_occurrence(X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos) ).

fof(f2,axiom,
    ! [X0] :
      ( activity_occurrence(X0)
     => ? [X1] :
          ( activity(X1)
          & occurrence_of(X0,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_01) ).

fof(f3,axiom,
    ! [X0,X1,X2] :
      ( ( occurrence_of(X0,X1)
        & occurrence_of(X0,X2) )
     => X1 = X2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_02) ).

fof(f8,axiom,
    ! [X0,X1] :
      ( occurrence_of(X0,X1)
     => ( arboreal(X0)
      <=> atomic(X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_07) ).

fof(f12,axiom,
    ! [X0,X1,X2] :
      ( min_precedes(X1,X2,X0)
     => ? [X3,X4] :
          ( subactivity(X3,X0)
          & subactivity(X4,X0)
          & atocc(X1,X3)
          & atocc(X2,X4) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_11) ).

fof(f15,axiom,
    ! [X0,X1,X2] :
      ( min_precedes(X0,X1,X2)
     => ~ root(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_14) ).

fof(f24,axiom,
    ! [X0,X1] :
      ( atocc(X0,X1)
    <=> ? [X2] :
          ( subactivity(X1,X2)
          & atomic(X2)
          & occurrence_of(X0,X2) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_23) ).

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/sandbox/benchmark/theBenchmark.p',sos_25) ).

fof(f29,axiom,
    ! [X0,X1,X2,X3] :
      ( ( occurrence_of(X1,X0)
        & arboreal(X2)
        & arboreal(X3)
        & subactivity_occurrence(X2,X1)
        & subactivity_occurrence(X3,X1) )
     => ( min_precedes(X2,X3,X0)
        | min_precedes(X3,X2,X0)
        | X2 = X3 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_28) ).

fof(f30,axiom,
    ! [X0,X1,X2,X3] :
      ( ( min_precedes(X0,X1,X2)
        & occurrence_of(X3,X2)
        & subactivity_occurrence(X1,X3) )
     => subactivity_occurrence(X0,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_29) ).

fof(f34,axiom,
    ! [X0,X1] :
      ( root_occ(X0,X1)
    <=> ? [X2] :
          ( occurrence_of(X1,X2)
          & subactivity_occurrence(X0,X1)
          & root(X0,X2) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_33) ).

fof(f36,axiom,
    ! [X0] :
      ( occurrence_of(X0,tptp0)
     => ? [X1,X2,X3] :
          ( occurrence_of(X1,tptp3)
          & root_occ(X1,X0)
          & occurrence_of(X2,tptp4)
          & min_precedes(X1,X2,tptp0)
          & ( occurrence_of(X3,tptp2)
            | occurrence_of(X3,tptp1) )
          & min_precedes(X2,X3,tptp0)
          & ! [X4] :
              ( min_precedes(X1,X4,tptp0)
             => ( X4 = X2
                | X4 = X3 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_35) ).

fof(f42,axiom,
    atomic(tptp3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_41) ).

fof(f49,conjecture,
    ! [X0] :
      ( occurrence_of(X0,tptp0)
     => ? [X1,X2] :
          ( occurrence_of(X1,tptp3)
          & root_occ(X1,X0)
          & ( occurrence_of(X2,tptp2)
            | occurrence_of(X2,tptp1) )
          & min_precedes(X1,X2,tptp0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

fof(f50,negated_conjecture,
    ~ ! [X0] :
        ( occurrence_of(X0,tptp0)
       => ? [X1,X2] :
            ( occurrence_of(X1,tptp3)
            & root_occ(X1,X0)
            & ( occurrence_of(X2,tptp2)
              | occurrence_of(X2,tptp1) )
            & min_precedes(X1,X2,tptp0) ) ),
    inference(negated_conjecture,[status(cth)],[f49]) ).

fof(f51,plain,
    ! [X0,X1] :
      ( ( activity(X0)
        & activity_occurrence(X1) )
      | ~ occurrence_of(X1,X0) ),
    inference(ennf_transformation,[],[f1]) ).

fof(f52,plain,
    ! [X0] :
      ( ? [X1] :
          ( activity(X1)
          & occurrence_of(X0,X1) )
      | ~ activity_occurrence(X0) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f53,plain,
    ! [X0,X1,X2] :
      ( X1 = X2
      | ~ occurrence_of(X0,X1)
      | ~ occurrence_of(X0,X2) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f54,plain,
    ! [X0,X1,X2] :
      ( X1 = X2
      | ~ occurrence_of(X0,X1)
      | ~ occurrence_of(X0,X2) ),
    inference(flattening,[],[f53]) ).

fof(f61,plain,
    ! [X0,X1] :
      ( ( arboreal(X0)
      <=> atomic(X1) )
      | ~ occurrence_of(X0,X1) ),
    inference(ennf_transformation,[],[f8]) ).

fof(f65,plain,
    ! [X0,X1,X2] :
      ( ? [X3,X4] :
          ( subactivity(X3,X0)
          & subactivity(X4,X0)
          & atocc(X1,X3)
          & atocc(X2,X4) )
      | ~ min_precedes(X1,X2,X0) ),
    inference(ennf_transformation,[],[f12]) ).

fof(f68,plain,
    ! [X0,X1,X2] :
      ( ~ root(X1,X2)
      | ~ min_precedes(X0,X1,X2) ),
    inference(ennf_transformation,[],[f15]) ).

fof(f79,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(f84,plain,
    ! [X0,X1,X2,X3] :
      ( min_precedes(X2,X3,X0)
      | min_precedes(X3,X2,X0)
      | X2 = X3
      | ~ occurrence_of(X1,X0)
      | ~ arboreal(X2)
      | ~ arboreal(X3)
      | ~ subactivity_occurrence(X2,X1)
      | ~ subactivity_occurrence(X3,X1) ),
    inference(ennf_transformation,[],[f29]) ).

fof(f85,plain,
    ! [X0,X1,X2,X3] :
      ( min_precedes(X2,X3,X0)
      | min_precedes(X3,X2,X0)
      | X2 = X3
      | ~ occurrence_of(X1,X0)
      | ~ arboreal(X2)
      | ~ arboreal(X3)
      | ~ subactivity_occurrence(X2,X1)
      | ~ subactivity_occurrence(X3,X1) ),
    inference(flattening,[],[f84]) ).

fof(f86,plain,
    ! [X0,X1,X2,X3] :
      ( subactivity_occurrence(X0,X3)
      | ~ min_precedes(X0,X1,X2)
      | ~ occurrence_of(X3,X2)
      | ~ subactivity_occurrence(X1,X3) ),
    inference(ennf_transformation,[],[f30]) ).

fof(f87,plain,
    ! [X0,X1,X2,X3] :
      ( subactivity_occurrence(X0,X3)
      | ~ min_precedes(X0,X1,X2)
      | ~ occurrence_of(X3,X2)
      | ~ subactivity_occurrence(X1,X3) ),
    inference(flattening,[],[f86]) ).

fof(f94,plain,
    ! [X0] :
      ( ? [X1,X2,X3] :
          ( occurrence_of(X1,tptp3)
          & root_occ(X1,X0)
          & occurrence_of(X2,tptp4)
          & min_precedes(X1,X2,tptp0)
          & ( occurrence_of(X3,tptp2)
            | occurrence_of(X3,tptp1) )
          & min_precedes(X2,X3,tptp0)
          & ! [X4] :
              ( X4 = X2
              | X4 = X3
              | ~ min_precedes(X1,X4,tptp0) ) )
      | ~ occurrence_of(X0,tptp0) ),
    inference(ennf_transformation,[],[f36]) ).

fof(f95,plain,
    ! [X0] :
      ( ? [X1,X2,X3] :
          ( occurrence_of(X1,tptp3)
          & root_occ(X1,X0)
          & occurrence_of(X2,tptp4)
          & min_precedes(X1,X2,tptp0)
          & ( occurrence_of(X3,tptp2)
            | occurrence_of(X3,tptp1) )
          & min_precedes(X2,X3,tptp0)
          & ! [X4] :
              ( X4 = X2
              | X4 = X3
              | ~ min_precedes(X1,X4,tptp0) ) )
      | ~ occurrence_of(X0,tptp0) ),
    inference(flattening,[],[f94]) ).

fof(f96,plain,
    ? [X0] :
      ( ! [X1,X2] :
          ( ~ occurrence_of(X1,tptp3)
          | ~ root_occ(X1,X0)
          | ( ~ occurrence_of(X2,tptp2)
            & ~ occurrence_of(X2,tptp1) )
          | ~ min_precedes(X1,X2,tptp0) )
      & occurrence_of(X0,tptp0) ),
    inference(ennf_transformation,[],[f50]) ).

fof(f97,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))],[f52]) ).

fof(f98,plain,
    ! [X0,X1] :
      ( ( ( arboreal(X0)
          | ~ atomic(X1) )
        & ( atomic(X1)
          | ~ arboreal(X0) ) )
      | ~ occurrence_of(X0,X1) ),
    inference(nnf_transformation,[],[f61]) ).

fof(f101,plain,
    ! [X0,X1,X2] :
      ( ( subactivity(sK1(X0,X1,X2),X0)
        & subactivity(sK2(X0,X1,X2),X0)
        & atocc(X1,sK1(X0,X1,X2))
        & atocc(X2,sK2(X0,X1,X2)) )
      | ~ min_precedes(X1,X2,X0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X3,sK1(X0,X1,X2)),skolemize(X4,sK2(X0,X1,X2))],[f65]) ).

fof(f104,plain,
    ! [X0,X1] :
      ( ( atocc(X0,X1)
        | ! [X2] :
            ( ~ subactivity(X1,X2)
            | ~ atomic(X2)
            | ~ occurrence_of(X0,X2) ) )
      & ( ? [X2] :
            ( subactivity(X1,X2)
            & atomic(X2)
            & occurrence_of(X0,X2) )
        | ~ atocc(X0,X1) ) ),
    inference(nnf_transformation,[],[f24]) ).

fof(f105,plain,
    ! [X0,X1] :
      ( ( atocc(X0,X1)
        | ! [X2] :
            ( ~ subactivity(X1,X2)
            | ~ atomic(X2)
            | ~ occurrence_of(X0,X2) ) )
      & ( ? [X3] :
            ( subactivity(X1,X3)
            & atomic(X3)
            & occurrence_of(X0,X3) )
        | ~ atocc(X0,X1) ) ),
    inference(rectify,[],[f104]) ).

fof(f106,plain,
    ! [X0,X1] :
      ( ( atocc(X0,X1)
        | ! [X2] :
            ( ~ subactivity(X1,X2)
            | ~ atomic(X2)
            | ~ occurrence_of(X0,X2) ) )
      & ( ( subactivity(X1,sK5(X0,X1))
          & atomic(sK5(X0,X1))
          & occurrence_of(X0,sK5(X0,X1)) )
        | ~ atocc(X0,X1) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(X3,sK5(X0,X1))],[f105]) ).

fof(f107,plain,
    ! [X0,X1,X2] :
      ( ( occurrence_of(sK6(X0,X1,X2),X0)
        & subactivity_occurrence(X1,sK6(X0,X1,X2))
        & subactivity_occurrence(X2,sK6(X0,X1,X2)) )
      | ~ min_precedes(X1,X2,X0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(X3,sK6(X0,X1,X2))],[f79]) ).

fof(f111,plain,
    ! [X0,X1] :
      ( ( root_occ(X0,X1)
        | ! [X2] :
            ( ~ occurrence_of(X1,X2)
            | ~ subactivity_occurrence(X0,X1)
            | ~ root(X0,X2) ) )
      & ( ? [X2] :
            ( occurrence_of(X1,X2)
            & subactivity_occurrence(X0,X1)
            & root(X0,X2) )
        | ~ root_occ(X0,X1) ) ),
    inference(nnf_transformation,[],[f34]) ).

fof(f112,plain,
    ! [X0,X1] :
      ( ( root_occ(X0,X1)
        | ! [X2] :
            ( ~ occurrence_of(X1,X2)
            | ~ subactivity_occurrence(X0,X1)
            | ~ root(X0,X2) ) )
      & ( ? [X3] :
            ( occurrence_of(X1,X3)
            & subactivity_occurrence(X0,X1)
            & root(X0,X3) )
        | ~ root_occ(X0,X1) ) ),
    inference(rectify,[],[f111]) ).

fof(f113,plain,
    ! [X0,X1] :
      ( ( root_occ(X0,X1)
        | ! [X2] :
            ( ~ occurrence_of(X1,X2)
            | ~ subactivity_occurrence(X0,X1)
            | ~ root(X0,X2) ) )
      & ( ( occurrence_of(X1,sK10(X0,X1))
          & subactivity_occurrence(X0,X1)
          & root(X0,sK10(X0,X1)) )
        | ~ root_occ(X0,X1) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK10]),skolemize(X3,sK10(X0,X1))],[f112]) ).

fof(f114,plain,
    ! [X0] :
      ( ( occurrence_of(sK11(X0),tptp3)
        & root_occ(sK11(X0),X0)
        & occurrence_of(sK12(X0),tptp4)
        & min_precedes(sK11(X0),sK12(X0),tptp0)
        & ( occurrence_of(sK13(X0),tptp2)
          | occurrence_of(sK13(X0),tptp1) )
        & min_precedes(sK12(X0),sK13(X0),tptp0)
        & ! [X4] :
            ( sK12(X0) = X4
            | sK13(X0) = X4
            | ~ min_precedes(sK11(X0),X4,tptp0) ) )
      | ~ occurrence_of(X0,tptp0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK11,sK12,sK13]),skolemize(X1,sK11(X0)),skolemize(X2,sK12(X0)),skolemize(X3,sK13(X0))],[f95]) ).

fof(f115,plain,
    ( ! [X1,X2] :
        ( ~ occurrence_of(X1,tptp3)
        | ~ root_occ(X1,sK14)
        | ( ~ occurrence_of(X2,tptp2)
          & ~ occurrence_of(X2,tptp1) )
        | ~ min_precedes(X1,X2,tptp0) )
    & occurrence_of(sK14,tptp0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK14]),skolemize(X0,sK14)],[f96]) ).

fof(f116,plain,
    ! [X0,X1] :
      ( ~ occurrence_of(X1,X0)
      | activity_occurrence(X1) ),
    inference(cnf_transformation,[],[f51]) ).

fof(f118,plain,
    ! [X0] :
      ( occurrence_of(X0,sK0(X0))
      | ~ activity_occurrence(X0) ),
    inference(cnf_transformation,[],[f97]) ).

fof(f120,plain,
    ! [X2,X0,X1] :
      ( ~ occurrence_of(X0,X2)
      | ~ occurrence_of(X0,X1)
      | X1 = X2 ),
    inference(cnf_transformation,[],[f54]) ).

fof(f126,plain,
    ! [X0,X1] :
      ( ~ occurrence_of(X0,X1)
      | ~ atomic(X1)
      | arboreal(X0) ),
    inference(cnf_transformation,[],[f98]) ).

fof(f132,plain,
    ! [X2,X0,X1] :
      ( atocc(X2,sK2(X0,X1,X2))
      | ~ min_precedes(X1,X2,X0) ),
    inference(cnf_transformation,[],[f101]) ).

fof(f140,plain,
    ! [X2,X0,X1] :
      ( ~ min_precedes(X0,X1,X2)
      | ~ root(X1,X2) ),
    inference(cnf_transformation,[],[f68]) ).

fof(f147,plain,
    ! [X0,X1] :
      ( occurrence_of(X0,sK5(X0,X1))
      | ~ atocc(X0,X1) ),
    inference(cnf_transformation,[],[f106]) ).

fof(f148,plain,
    ! [X0,X1] :
      ( atomic(sK5(X0,X1))
      | ~ atocc(X0,X1) ),
    inference(cnf_transformation,[],[f106]) ).

fof(f153,plain,
    ! [X2,X0,X1] :
      ( subactivity_occurrence(X2,sK6(X0,X1,X2))
      | ~ min_precedes(X1,X2,X0) ),
    inference(cnf_transformation,[],[f107]) ).

fof(f154,plain,
    ! [X2,X0,X1] :
      ( subactivity_occurrence(X1,sK6(X0,X1,X2))
      | ~ min_precedes(X1,X2,X0) ),
    inference(cnf_transformation,[],[f107]) ).

fof(f155,plain,
    ! [X2,X0,X1] :
      ( occurrence_of(sK6(X0,X1,X2),X0)
      | ~ min_precedes(X1,X2,X0) ),
    inference(cnf_transformation,[],[f107]) ).

fof(f160,plain,
    ! [X2,X3,X0,X1] :
      ( ~ subactivity_occurrence(X3,X1)
      | min_precedes(X3,X2,X0)
      | X2 = X3
      | ~ occurrence_of(X1,X0)
      | ~ arboreal(X2)
      | ~ arboreal(X3)
      | ~ subactivity_occurrence(X2,X1)
      | min_precedes(X2,X3,X0) ),
    inference(cnf_transformation,[],[f85]) ).

fof(f161,plain,
    ! [X2,X3,X0,X1] :
      ( ~ min_precedes(X0,X1,X2)
      | subactivity_occurrence(X0,X3)
      | ~ occurrence_of(X3,X2)
      | ~ subactivity_occurrence(X1,X3) ),
    inference(cnf_transformation,[],[f87]) ).

fof(f166,plain,
    ! [X0,X1] :
      ( root(X0,sK10(X0,X1))
      | ~ root_occ(X0,X1) ),
    inference(cnf_transformation,[],[f113]) ).

fof(f168,plain,
    ! [X0,X1] :
      ( occurrence_of(X1,sK10(X0,X1))
      | ~ root_occ(X0,X1) ),
    inference(cnf_transformation,[],[f113]) ).

fof(f171,plain,
    ! [X0] :
      ( min_precedes(sK12(X0),sK13(X0),tptp0)
      | ~ occurrence_of(X0,tptp0) ),
    inference(cnf_transformation,[],[f114]) ).

fof(f172,plain,
    ! [X0] :
      ( occurrence_of(sK13(X0),tptp1)
      | occurrence_of(sK13(X0),tptp2)
      | ~ occurrence_of(X0,tptp0) ),
    inference(cnf_transformation,[],[f114]) ).

fof(f173,plain,
    ! [X0] :
      ( min_precedes(sK11(X0),sK12(X0),tptp0)
      | ~ occurrence_of(X0,tptp0) ),
    inference(cnf_transformation,[],[f114]) ).

fof(f175,plain,
    ! [X0] :
      ( root_occ(sK11(X0),X0)
      | ~ occurrence_of(X0,tptp0) ),
    inference(cnf_transformation,[],[f114]) ).

fof(f176,plain,
    ! [X0] :
      ( occurrence_of(sK11(X0),tptp3)
      | ~ occurrence_of(X0,tptp0) ),
    inference(cnf_transformation,[],[f114]) ).

fof(f182,plain,
    atomic(tptp3),
    inference(cnf_transformation,[],[f42]) ).

fof(f189,plain,
    occurrence_of(sK14,tptp0),
    inference(cnf_transformation,[],[f115]) ).

fof(f190,plain,
    ! [X2,X1] :
      ( ~ min_precedes(X1,X2,tptp0)
      | ~ root_occ(X1,sK14)
      | ~ occurrence_of(X2,tptp1)
      | ~ occurrence_of(X1,tptp3) ),
    inference(cnf_transformation,[],[f115]) ).

fof(f191,plain,
    ! [X2,X1] :
      ( ~ min_precedes(X1,X2,tptp0)
      | ~ root_occ(X1,sK14)
      | ~ occurrence_of(X2,tptp2)
      | ~ occurrence_of(X1,tptp3) ),
    inference(cnf_transformation,[],[f115]) ).

fof(f209,plain,
    ! [X0] :
      ( ~ occurrence_of(sK14,X0)
      | tptp0 = X0 ),
    inference(resolution,[],[f120,f189]) ).

fof(f212,plain,
    ! [X0] :
      ( ~ root_occ(X0,sK14)
      | tptp0 = sK10(X0,sK14) ),
    inference(resolution,[],[f168,f209]) ).

fof(f223,plain,
    ! [X0] :
      ( ~ atomic(tptp3)
      | arboreal(sK11(X0))
      | ~ occurrence_of(X0,tptp0) ),
    inference(resolution,[],[f126,f176]) ).

fof(f229,plain,
    ! [X0] :
      ( ~ occurrence_of(X0,tptp0)
      | arboreal(sK11(X0)) ),
    inference(forward_subsumption_resolution,[],[f223,f182]) ).

fof(f237,plain,
    ! [X0,X1] :
      ( ~ activity_occurrence(X0)
      | ~ occurrence_of(X0,X1)
      | sK0(X0) = X1 ),
    inference(resolution,[],[f118,f120]) ).

fof(f249,plain,
    ! [X0,X1] :
      ( ~ occurrence_of(X0,X1)
      | sK0(X0) = X1 ),
    inference(forward_subsumption_resolution,[],[f237,f116]) ).

fof(f252,plain,
    ! [X2,X0,X1] :
      ( ~ min_precedes(X1,X2,X0)
      | sK0(sK6(X0,X1,X2)) = X0 ),
    inference(resolution,[],[f249,f155]) ).

fof(f260,plain,
    ! [X0] :
      ( ~ occurrence_of(X0,tptp0)
      | tptp0 = sK0(sK6(tptp0,sK12(X0),sK13(X0))) ),
    inference(resolution,[],[f252,f171]) ).

fof(f272,plain,
    ! [X0] :
      ( ~ root(sK13(X0),tptp0)
      | ~ occurrence_of(X0,tptp0) ),
    inference(resolution,[],[f140,f171]) ).

fof(f273,plain,
    ( tptp0 = sK10(sK11(sK14),sK14)
    | ~ occurrence_of(sK14,tptp0) ),
    inference(resolution,[],[f212,f175]) ).

fof(f274,plain,
    tptp0 = sK10(sK11(sK14),sK14),
    inference(forward_subsumption_resolution,[],[f273,f189]) ).

fof(f275,plain,
    ( root(sK11(sK14),tptp0)
    | ~ root_occ(sK11(sK14),sK14) ),
    inference(superposition,[],[f166,f274]) ).

fof(f278,definition,
    ( spl15_3
  <=> root_occ(sK11(sK14),sK14) ),
    introduced(definition,[new_symbols(definition,[spl15_3])],[avatar_definition]) ).

fof(f279,plain,
    ( root_occ(sK11(sK14),sK14)
    | ~ spl15_3 ),
    inference(avatar_component_clause,[],[f278]) ).

fof(f280,plain,
    ( ~ root_occ(sK11(sK14),sK14)
    | spl15_3 ),
    inference(avatar_component_clause,[],[f278]) ).

fof(f282,definition,
    ( spl15_4
  <=> root(sK11(sK14),tptp0) ),
    introduced(definition,[new_symbols(definition,[spl15_4])],[avatar_definition]) ).

fof(f284,plain,
    ( root(sK11(sK14),tptp0)
    | ~ spl15_4 ),
    inference(avatar_component_clause,[],[f282]) ).

fof(f285,plain,
    ( ~ spl15_3
    | spl15_4 ),
    inference(avatar_split_clause,[],[f275,f282,f278]) ).

fof(f286,plain,
    ( ~ occurrence_of(sK14,tptp0)
    | spl15_3 ),
    inference(resolution,[],[f280,f175]) ).

fof(f287,plain,
    ( $false
    | spl15_3 ),
    inference(forward_subsumption_resolution,[],[f286,f189]) ).

fof(f288,plain,
    spl15_3,
    inference(avatar_contradiction_clause,[],[f287]) ).

fof(f295,plain,
    ! [X2,X0,X1] :
      ( activity_occurrence(sK6(X0,X1,X2))
      | ~ min_precedes(X1,X2,X0) ),
    inference(resolution,[],[f116,f155]) ).

fof(f379,definition,
    ( spl15_15
  <=> occurrence_of(sK11(sK14),tptp3) ),
    introduced(definition,[new_symbols(definition,[spl15_15])],[avatar_definition]) ).

fof(f380,plain,
    ( ~ occurrence_of(sK11(sK14),tptp3)
    | spl15_15 ),
    inference(avatar_component_clause,[],[f379]) ).

fof(f381,plain,
    ( occurrence_of(sK11(sK14),tptp3)
    | ~ spl15_15 ),
    inference(avatar_component_clause,[],[f379]) ).

fof(f383,plain,
    ! [X2,X3,X0,X1,X4] :
      ( ~ subactivity_occurrence(X1,sK6(X3,X4,X0))
      | X0 = X1
      | ~ occurrence_of(sK6(X3,X4,X0),X2)
      | ~ arboreal(X1)
      | ~ arboreal(X0)
      | min_precedes(X0,X1,X2)
      | min_precedes(X1,X0,X2)
      | ~ min_precedes(X4,X0,X3) ),
    inference(resolution,[],[f160,f153]) ).

fof(f614,plain,
    ! [X0,X1] :
      ( ~ atocc(X0,X1)
      | ~ atomic(sK5(X0,X1))
      | arboreal(X0) ),
    inference(resolution,[],[f147,f126]) ).

fof(f621,plain,
    ! [X0,X1] :
      ( ~ atocc(X0,X1)
      | arboreal(X0) ),
    inference(forward_subsumption_resolution,[],[f614,f148]) ).

fof(f987,plain,
    ! [X2,X0,X1] :
      ( ~ min_precedes(X0,X1,X2)
      | arboreal(X1) ),
    inference(resolution,[],[f132,f621]) ).

fof(f1107,plain,
    ! [X0,X1] :
      ( ~ subactivity_occurrence(sK12(X0),X1)
      | ~ occurrence_of(X1,tptp0)
      | subactivity_occurrence(sK11(X0),X1)
      | ~ occurrence_of(X0,tptp0) ),
    inference(resolution,[],[f161,f173]) ).

fof(f1131,plain,
    ! [X2,X0,X1] :
      ( subactivity_occurrence(sK11(X1),sK6(X0,sK12(X1),X2))
      | ~ occurrence_of(sK6(X0,sK12(X1),X2),tptp0)
      | ~ occurrence_of(X1,tptp0)
      | ~ min_precedes(sK12(X1),X2,X0) ),
    inference(resolution,[],[f1107,f154]) ).

fof(f1614,plain,
    tptp0 = sK0(sK6(tptp0,sK12(sK14),sK13(sK14))),
    inference(resolution,[],[f260,f189]) ).

fof(f1617,plain,
    ( occurrence_of(sK6(tptp0,sK12(sK14),sK13(sK14)),tptp0)
    | ~ activity_occurrence(sK6(tptp0,sK12(sK14),sK13(sK14))) ),
    inference(superposition,[],[f118,f1614]) ).

fof(f1619,definition,
    ( spl15_23
  <=> activity_occurrence(sK6(tptp0,sK12(sK14),sK13(sK14))) ),
    introduced(definition,[new_symbols(definition,[spl15_23])],[avatar_definition]) ).

fof(f1621,plain,
    ( ~ activity_occurrence(sK6(tptp0,sK12(sK14),sK13(sK14)))
    | spl15_23 ),
    inference(avatar_component_clause,[],[f1619]) ).

fof(f1623,definition,
    ( spl15_24
  <=> occurrence_of(sK6(tptp0,sK12(sK14),sK13(sK14)),tptp0) ),
    introduced(definition,[new_symbols(definition,[spl15_24])],[avatar_definition]) ).

fof(f1625,plain,
    ( occurrence_of(sK6(tptp0,sK12(sK14),sK13(sK14)),tptp0)
    | ~ spl15_24 ),
    inference(avatar_component_clause,[],[f1623]) ).

fof(f1626,plain,
    ( ~ spl15_23
    | spl15_24 ),
    inference(avatar_split_clause,[],[f1617,f1623,f1619]) ).

fof(f1627,plain,
    ( ~ min_precedes(sK12(sK14),sK13(sK14),tptp0)
    | spl15_23 ),
    inference(resolution,[],[f1621,f295]) ).

fof(f1628,plain,
    ( ~ occurrence_of(sK14,tptp0)
    | spl15_23 ),
    inference(resolution,[],[f1627,f171]) ).

fof(f1629,plain,
    ( $false
    | spl15_23 ),
    inference(forward_subsumption_resolution,[],[f1628,f189]) ).

fof(f1630,plain,
    spl15_23,
    inference(avatar_contradiction_clause,[],[f1629]) ).

fof(f1747,definition,
    ( spl15_37
  <=> occurrence_of(sK13(sK14),tptp1) ),
    introduced(definition,[new_symbols(definition,[spl15_37])],[avatar_definition]) ).

fof(f1749,plain,
    ( ~ occurrence_of(sK13(sK14),tptp1)
    | spl15_37 ),
    inference(avatar_component_clause,[],[f1747]) ).

fof(f4418,plain,
    ! [X2,X3,X0,X1] :
      ( ~ occurrence_of(sK6(X0,sK12(X1),X2),tptp0)
      | ~ occurrence_of(X1,tptp0)
      | ~ min_precedes(sK12(X1),X2,X0)
      | sK11(X1) = X2
      | ~ occurrence_of(sK6(X0,sK12(X1),X2),X3)
      | ~ arboreal(sK11(X1))
      | ~ arboreal(X2)
      | min_precedes(X2,sK11(X1),X3)
      | min_precedes(sK11(X1),X2,X3)
      | ~ min_precedes(sK12(X1),X2,X0) ),
    inference(resolution,[],[f1131,f383]) ).

fof(f4423,plain,
    ! [X2,X3,X0,X1] :
      ( ~ occurrence_of(sK6(X0,sK12(X1),X2),tptp0)
      | ~ occurrence_of(X1,tptp0)
      | ~ min_precedes(sK12(X1),X2,X0)
      | sK11(X1) = X2
      | ~ occurrence_of(sK6(X0,sK12(X1),X2),X3)
      | ~ arboreal(sK11(X1))
      | ~ arboreal(X2)
      | min_precedes(X2,sK11(X1),X3)
      | min_precedes(sK11(X1),X2,X3) ),
    inference(duplicate_literal_removal,[],[f4418]) ).

fof(f4427,plain,
    ! [X2,X3,X0,X1] :
      ( ~ occurrence_of(sK6(X0,sK12(X1),X2),tptp0)
      | ~ occurrence_of(X1,tptp0)
      | ~ min_precedes(sK12(X1),X2,X0)
      | sK11(X1) = X2
      | ~ occurrence_of(sK6(X0,sK12(X1),X2),X3)
      | ~ arboreal(X2)
      | min_precedes(X2,sK11(X1),X3)
      | min_precedes(sK11(X1),X2,X3) ),
    inference(forward_subsumption_resolution,[],[f4423,f229]) ).

fof(f4429,plain,
    ! [X2,X3,X0,X1] :
      ( ~ occurrence_of(sK6(X0,sK12(X1),X2),tptp0)
      | ~ occurrence_of(X1,tptp0)
      | ~ min_precedes(sK12(X1),X2,X0)
      | sK11(X1) = X2
      | ~ occurrence_of(sK6(X0,sK12(X1),X2),X3)
      | min_precedes(X2,sK11(X1),X3)
      | min_precedes(sK11(X1),X2,X3) ),
    inference(forward_subsumption_resolution,[],[f4427,f987]) ).

fof(f4438,plain,
    ! [X2,X0,X1] :
      ( ~ occurrence_of(X0,tptp0)
      | ~ min_precedes(sK12(X0),X1,tptp0)
      | sK11(X0) = X1
      | ~ occurrence_of(sK6(tptp0,sK12(X0),X1),X2)
      | min_precedes(X1,sK11(X0),X2)
      | min_precedes(sK11(X0),X1,X2)
      | ~ min_precedes(sK12(X0),X1,tptp0) ),
    inference(resolution,[],[f4429,f155]) ).

fof(f4440,plain,
    ! [X2,X0,X1] :
      ( ~ occurrence_of(sK6(tptp0,sK12(X0),X1),X2)
      | ~ min_precedes(sK12(X0),X1,tptp0)
      | sK11(X0) = X1
      | ~ occurrence_of(X0,tptp0)
      | min_precedes(X1,sK11(X0),X2)
      | min_precedes(sK11(X0),X1,X2) ),
    inference(duplicate_literal_removal,[],[f4438]) ).

fof(f4443,plain,
    ( ~ min_precedes(sK12(sK14),sK13(sK14),tptp0)
    | sK11(sK14) = sK13(sK14)
    | ~ occurrence_of(sK14,tptp0)
    | min_precedes(sK13(sK14),sK11(sK14),tptp0)
    | min_precedes(sK11(sK14),sK13(sK14),tptp0)
    | ~ spl15_24 ),
    inference(resolution,[],[f4440,f1625]) ).

fof(f4451,plain,
    ( sK11(sK14) = sK13(sK14)
    | ~ occurrence_of(sK14,tptp0)
    | min_precedes(sK13(sK14),sK11(sK14),tptp0)
    | min_precedes(sK11(sK14),sK13(sK14),tptp0)
    | ~ spl15_24 ),
    inference(forward_subsumption_resolution,[],[f4443,f171]) ).

fof(f4452,plain,
    ( sK11(sK14) = sK13(sK14)
    | min_precedes(sK13(sK14),sK11(sK14),tptp0)
    | min_precedes(sK11(sK14),sK13(sK14),tptp0)
    | ~ spl15_24 ),
    inference(forward_subsumption_resolution,[],[f4451,f189]) ).

fof(f4454,definition,
    ( spl15_198
  <=> min_precedes(sK11(sK14),sK13(sK14),tptp0) ),
    introduced(definition,[new_symbols(definition,[spl15_198])],[avatar_definition]) ).

fof(f4456,plain,
    ( min_precedes(sK11(sK14),sK13(sK14),tptp0)
    | ~ spl15_198 ),
    inference(avatar_component_clause,[],[f4454]) ).

fof(f4458,definition,
    ( spl15_199
  <=> min_precedes(sK13(sK14),sK11(sK14),tptp0) ),
    introduced(definition,[new_symbols(definition,[spl15_199])],[avatar_definition]) ).

fof(f4460,plain,
    ( min_precedes(sK13(sK14),sK11(sK14),tptp0)
    | ~ spl15_199 ),
    inference(avatar_component_clause,[],[f4458]) ).

fof(f4462,definition,
    ( spl15_200
  <=> sK11(sK14) = sK13(sK14) ),
    introduced(definition,[new_symbols(definition,[spl15_200])],[avatar_definition]) ).

fof(f4464,plain,
    ( sK11(sK14) = sK13(sK14)
    | ~ spl15_200 ),
    inference(avatar_component_clause,[],[f4462]) ).

fof(f4465,plain,
    ( spl15_198
    | spl15_199
    | spl15_200
    | ~ spl15_24 ),
    inference(avatar_split_clause,[],[f4452,f1623,f4462,f4458,f4454]) ).

fof(f4541,plain,
    ( ~ root(sK11(sK14),tptp0)
    | ~ occurrence_of(sK14,tptp0)
    | ~ spl15_200 ),
    inference(superposition,[],[f272,f4464]) ).

fof(f4610,plain,
    ( ~ occurrence_of(sK14,tptp0)
    | ~ spl15_4
    | ~ spl15_200 ),
    inference(forward_subsumption_resolution,[],[f4541,f284]) ).

fof(f4639,plain,
    ( $false
    | ~ spl15_4
    | ~ spl15_200 ),
    inference(forward_subsumption_resolution,[],[f4610,f189]) ).

fof(f4640,plain,
    ( ~ spl15_4
    | ~ spl15_200 ),
    inference(avatar_contradiction_clause,[],[f4639]) ).

fof(f4657,plain,
    ( ~ root_occ(sK11(sK14),sK14)
    | ~ occurrence_of(sK13(sK14),tptp1)
    | ~ occurrence_of(sK11(sK14),tptp3)
    | ~ spl15_198 ),
    inference(resolution,[],[f4456,f190]) ).

fof(f4669,plain,
    ( ~ occurrence_of(sK13(sK14),tptp1)
    | ~ occurrence_of(sK11(sK14),tptp3)
    | ~ spl15_3
    | ~ spl15_198 ),
    inference(forward_subsumption_resolution,[],[f4657,f279]) ).

fof(f4680,plain,
    ( ~ spl15_15
    | ~ spl15_37
    | ~ spl15_3
    | ~ spl15_198 ),
    inference(avatar_split_clause,[],[f4669,f4454,f278,f1747,f379]) ).

fof(f4789,plain,
    ( ~ occurrence_of(sK14,tptp0)
    | spl15_15 ),
    inference(resolution,[],[f380,f176]) ).

fof(f4790,plain,
    ( $false
    | spl15_15 ),
    inference(forward_subsumption_resolution,[],[f4789,f189]) ).

fof(f4791,plain,
    spl15_15,
    inference(avatar_contradiction_clause,[],[f4790]) ).

fof(f4799,plain,
    ( ~ root(sK11(sK14),tptp0)
    | ~ spl15_199 ),
    inference(resolution,[],[f4460,f140]) ).

fof(f4809,plain,
    ( $false
    | ~ spl15_4
    | ~ spl15_199 ),
    inference(forward_subsumption_resolution,[],[f4799,f284]) ).

fof(f4810,plain,
    ( ~ spl15_4
    | ~ spl15_199 ),
    inference(avatar_contradiction_clause,[],[f4809]) ).

fof(f4840,definition,
    ( spl15_205
  <=> occurrence_of(sK13(sK14),tptp2) ),
    introduced(definition,[new_symbols(definition,[spl15_205])],[avatar_definition]) ).

fof(f4841,plain,
    ( ~ occurrence_of(sK13(sK14),tptp2)
    | spl15_205 ),
    inference(avatar_component_clause,[],[f4840]) ).

fof(f4842,plain,
    ( occurrence_of(sK13(sK14),tptp2)
    | ~ spl15_205 ),
    inference(avatar_component_clause,[],[f4840]) ).

fof(f4858,plain,
    ( ~ root_occ(sK11(sK14),sK14)
    | ~ occurrence_of(sK13(sK14),tptp2)
    | ~ occurrence_of(sK11(sK14),tptp3)
    | ~ spl15_198 ),
    inference(resolution,[],[f4456,f191]) ).

fof(f4871,plain,
    ( ~ occurrence_of(sK13(sK14),tptp2)
    | ~ occurrence_of(sK11(sK14),tptp3)
    | ~ spl15_3
    | ~ spl15_198 ),
    inference(forward_subsumption_resolution,[],[f4858,f279]) ).

fof(f4872,plain,
    ( ~ occurrence_of(sK11(sK14),tptp3)
    | ~ spl15_3
    | ~ spl15_198
    | ~ spl15_205 ),
    inference(forward_subsumption_resolution,[],[f4871,f4842]) ).

fof(f4873,plain,
    ( $false
    | ~ spl15_3
    | ~ spl15_15
    | ~ spl15_198
    | ~ spl15_205 ),
    inference(forward_subsumption_resolution,[],[f4872,f381]) ).

fof(f4874,plain,
    ( ~ spl15_3
    | ~ spl15_15
    | ~ spl15_198
    | ~ spl15_205 ),
    inference(avatar_contradiction_clause,[],[f4873]) ).

fof(f5001,plain,
    ( occurrence_of(sK13(sK14),tptp2)
    | ~ occurrence_of(sK14,tptp0)
    | spl15_37 ),
    inference(resolution,[],[f1749,f172]) ).

fof(f5002,plain,
    ( occurrence_of(sK13(sK14),tptp2)
    | spl15_37 ),
    inference(forward_subsumption_resolution,[],[f5001,f189]) ).

fof(f5042,plain,
    ( $false
    | spl15_37
    | spl15_205 ),
    inference(forward_subsumption_resolution,[],[f5002,f4841]) ).

fof(f5043,plain,
    ( spl15_37
    | spl15_205 ),
    inference(avatar_contradiction_clause,[],[f5042]) ).

cnf(s3,plain,
    ( ~ spl15_3
    | spl15_4 ),
    inference(sat_conversion,[],[f285]) ).

cnf(s4,plain,
    spl15_3,
    inference(sat_conversion,[],[f288]) ).

cnf(s20,plain,
    ( ~ spl15_23
    | spl15_24 ),
    inference(sat_conversion,[],[f1626]) ).

cnf(s21,plain,
    spl15_23,
    inference(sat_conversion,[],[f1630]) ).

cnf(s216,plain,
    ( ~ spl15_24
    | spl15_198
    | spl15_199
    | spl15_200 ),
    inference(sat_conversion,[],[f4465]) ).

cnf(s222,plain,
    ( ~ spl15_4
    | ~ spl15_200 ),
    inference(sat_conversion,[],[f4640]) ).

cnf(s227,plain,
    ( ~ spl15_3
    | ~ spl15_15
    | ~ spl15_37
    | ~ spl15_198 ),
    inference(sat_conversion,[],[f4680]) ).

cnf(s229,plain,
    spl15_15,
    inference(sat_conversion,[],[f4791]) ).

cnf(s230,plain,
    ( ~ spl15_4
    | ~ spl15_199 ),
    inference(sat_conversion,[],[f4810]) ).

cnf(s236,plain,
    ( ~ spl15_3
    | ~ spl15_15
    | ~ spl15_198
    | ~ spl15_205 ),
    inference(sat_conversion,[],[f4874]) ).

cnf(s251,plain,
    ( spl15_37
    | spl15_205 ),
    inference(sat_conversion,[],[f5043]) ).

cnf(s257,plain,
    ( ~ spl15_3
    | ~ spl15_37
    | ~ spl15_198 ),
    inference(rat,[],[s227,s229]) ).

cnf(s260,plain,
    spl15_24,
    inference(rat,[],[s20,s21]) ).

cnf(s270,plain,
    spl15_4,
    inference(rat,[],[s3,s4]) ).

cnf(s271,plain,
    ~ spl15_199,
    inference(rat,[],[s230,s270]) ).

cnf(s272,plain,
    ~ spl15_200,
    inference(rat,[],[s222,s270]) ).

cnf(s273,plain,
    spl15_198,
    inference(rat,[],[s216,s272,s260,s271]) ).

cnf(s274,plain,
    ~ spl15_205,
    inference(rat,[],[s236,s4,s229,s273]) ).

cnf(s276,plain,
    ~ spl15_37,
    inference(rat,[],[s257,s4,s273]) ).

cnf(s277,plain,
    $false,
    inference(rat,[],[s251,s274,s276]) ).

fof(f5060,plain,
    $false,
    inference(avatar_sat_refutation,[],[s277]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : PRO012+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.39  % Computer : n006.cluster.edu
% 0.13/0.39  % Model    : x86_64 x86_64
% 0.13/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39  % Memory   : 8046.5625MB
% 0.13/0.39  % OS       : Linux 6.8.0-71-generic
% 0.13/0.39  % CPULimit : 300
% 0.13/0.39  % WCLimit  : 300
% 0.13/0.39  % DateTime : Sun Sep 27 22:21:10 UTC 2026
% 0.13/0.39  % CPUTime  : 
% 0.13/0.39  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.43  Running first-order theorem proving
% 0.13/0.43  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
% 10.10/2.41  % (3383737)Detected formulas, will run a generic FOF schedule.
% 10.10/2.41  % (3383742)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=380603323:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 10.10/2.41  % (3383745)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=216142075:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 10.10/2.41  % (3383748)dis-21_1_sil=8000:lcm=predicate:random_seed=2582781931: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)
% 10.10/2.41  % (3383743)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=649860579:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 10.10/2.41  % (3383746)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1096116907:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 10.10/2.41  % (3383744)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=1762952259:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 10.10/2.41  % (3383747)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=874152939:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 10.10/2.41  % (3383745)Refutation not found, incomplete strategy
% 10.10/2.41  % (3383745)------------------------------
% 10.10/2.41  % (3383745)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.10/2.41  % (3383745)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.10/2.41  % (3383745)CaDiCaL version: 2.1.3
% 10.10/2.41  % (3383745)Termination reason: Refutation not found, incomplete strategy
% 10.10/2.41  % (3383745)Time elapsed: 0.002 s
% 10.10/2.41  % (3383745)Peak memory usage: 88 MB
% 10.10/2.41  % (3383745)Instructions burned: 1 (million)
% 10.10/2.41  % (3383746)Instruction limit reached! 
% 10.10/2.41  % (3383746)------------------------------
% 10.10/2.41  % (3383746)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.10/2.41  % (3383746)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.10/2.41  % (3383746)CaDiCaL version: 2.1.3
% 10.10/2.41  % (3383746)Termination reason: Instruction limit
% 10.10/2.41  % (3383746)Termination phase: Saturation
% 10.10/2.41  % (3383746)Time elapsed: 0.069 s
% 10.10/2.41  % (3383746)Peak memory usage: 88 MB
% 10.10/2.41  % (3383746)Instructions burned: 120 (million)
% 10.10/2.41  % (3383748)Instruction limit reached! 
% 10.10/2.41  % (3383748)------------------------------
% 10.10/2.41  % (3383748)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.10/2.41  % (3383748)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.10/2.41  % (3383748)CaDiCaL version: 2.1.3
% 10.10/2.41  % (3383748)Termination reason: Instruction limit
% 10.10/2.41  % (3383748)Termination phase: Saturation
% 10.10/2.41  % (3383748)Time elapsed: 0.081 s
% 10.10/2.41  % (3383748)Peak memory usage: 89 MB
% 10.10/2.41  % (3383748)Instructions burned: 130 (million)
% 10.10/2.41  % (3383747)Instruction limit reached! 
% 10.10/2.41  % (3383747)------------------------------
% 10.10/2.41  % (3383747)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.10/2.41  % (3383747)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.10/2.41  % (3383747)CaDiCaL version: 2.1.3
% 10.10/2.41  % (3383747)Termination reason: Instruction limit
% 10.10/2.41  % (3383747)Termination phase: Saturation
% 10.10/2.41  % (3383747)Time elapsed: 0.093 s
% 10.10/2.41  % (3383747)Peak memory usage: 89 MB
% 10.10/2.41  % (3383747)Instructions burned: 139 (million)
% 10.10/2.41  % (3383756)lrs+10_1_sil=8000:sp=occurrence:random_seed=2419156197:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 10.10/2.41  % (3383757)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1934412698:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 10.10/2.41  % (3383745)------------------------------
% 10.10/2.41  % (3383745)------------------------------
% 10.10/2.41  % (3383757)Refutation not found, incomplete strategy
% 10.10/2.41  % (3383757)------------------------------
% 10.10/2.41  % (3383757)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.10/2.41  % (3383757)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.10/2.41  % (3383757)CaDiCaL version: 2.1.3
% 10.10/2.41  % (3383757)Termination reason: Refutation not found, incomplete strategy
% 10.10/2.41  % (3383757)Time elapsed: 0.003 s
% 10.10/2.41  % (3383757)Peak memory usage: 88 MB
% 10.10/2.41  % (3383757)Instructions burned: 2 (million)
% 10.10/2.41  % (3383758)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2351739620:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 10.10/2.41  % (3383762)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=2383405141:s2a=on:i=248:s2at=1.23:gtg=position_2995 on theBenchmark for (2995ds/248Mi)
% 10.10/2.41  % (3383756)Instruction limit reached! 
% 10.10/2.41  % (3383756)------------------------------
% 10.10/2.41  % (3383756)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.10/2.41  % (3383756)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.10/2.41  % (3383756)CaDiCaL version: 2.1.3
% 10.10/2.41  % (3383756)Termination reason: Instruction limit
% 10.10/2.41  % (3383756)Termination phase: Saturation
% 10.10/2.41  % (3383756)Time elapsed: 0.192 s
% 10.10/2.41  % (3383756)Peak memory usage: 92 MB
% 10.10/2.41  % (3383756)Instructions burned: 285 (million)
% 10.10/2.41  % (3383762)Instruction limit reached! 
% 10.10/2.41  % (3383762)------------------------------
% 10.10/2.41  % (3383762)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.10/2.41  % (3383762)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.10/2.41  % (3383762)CaDiCaL version: 2.1.3
% 10.10/2.41  % (3383762)Termination reason: Instruction limit
% 10.10/2.41  % (3383762)Termination phase: Saturation
% 10.10/2.41  % (3383762)Time elapsed: 0.079 s
% 10.10/2.41  % (3383762)Peak memory usage: 91 MB
% 10.10/2.41  % (3383762)Instructions burned: 249 (million)
% 10.10/2.41  % (3383758)Instruction limit reached! 
% 10.10/2.41  % (3383758)------------------------------
% 10.10/2.41  % (3383758)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.10/2.41  % (3383758)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.10/2.41  % (3383758)CaDiCaL version: 2.1.3
% 10.10/2.41  % (3383758)Termination reason: Instruction limit
% 10.10/2.41  % (3383758)Termination phase: Saturation
% 10.10/2.41  % (3383758)Time elapsed: 0.211 s
% 10.10/2.41  % (3383758)Peak memory usage: 92 MB
% 10.10/2.41  % (3383758)Instructions burned: 325 (million)
% 10.10/2.41  % (3383757)------------------------------
% 10.10/2.41  % (3383757)------------------------------
% 10.10/2.41  % (3383764)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=2644355215:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2994 on theBenchmark for (2994ds/294Mi)
% 10.10/2.41  % (3383765)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=2069637716:i=2350_2993 on theBenchmark for (2993ds/2350Mi)
% 10.10/2.41  % (3383766)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=4105534030:cts=off:i=113:fsr=off:ss=included:sgt=4_2993 on theBenchmark for (2993ds/113Mi)
% 10.10/2.41  % (3383767)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=1772719545:i=127:av=off:fsr=off:sup=off_2993 on theBenchmark for (2993ds/127Mi)
% 10.10/2.41  % (3383766)Instruction limit reached! 
% 10.10/2.41  % (3383766)------------------------------
% 10.10/2.41  % (3383766)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.10/2.41  % (3383766)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.10/2.41  % (3383766)CaDiCaL version: 2.1.3
% 10.10/2.41  % (3383766)Termination reason: Instruction limit
% 10.10/2.41  % (3383766)Termination phase: Saturation
% 10.10/2.41  % (3383766)Time elapsed: 0.082 s
% 10.10/2.41  % (3383766)Peak memory usage: 90 MB
% 10.10/2.41  % (3383766)Instructions burned: 114 (million)
% 10.10/2.41  % (3383764)Instruction limit reached! 
% 10.10/2.41  % (3383764)------------------------------
% 10.10/2.41  % (3383764)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.10/2.41  % (3383764)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.10/2.41  % (3383764)CaDiCaL version: 2.1.3
% 10.10/2.41  % (3383764)Termination reason: Instruction limit
% 10.10/2.41  % (3383764)Termination phase: Saturation
% 10.10/2.41  % (3383764)Time elapsed: 0.140 s
% 10.10/2.41  % (3383764)Peak memory usage: 88 MB
% 10.10/2.41  % (3383764)Instructions burned: 295 (million)
% 10.10/2.41  % (3383767)Instruction limit reached! 
% 10.10/2.41  % (3383767)------------------------------
% 10.10/2.41  % (3383767)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.10/2.41  % (3383767)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.10/2.41  % (3383767)CaDiCaL version: 2.1.3
% 10.10/2.41  % (3383767)Termination reason: Instruction limit
% 10.10/2.41  % (3383767)Termination phase: Saturation
% 10.10/2.41  % (3383767)Time elapsed: 0.068 s
% 10.10/2.41  % (3383767)Peak memory usage: 89 MB
% 10.10/2.41  % (3383767)Instructions burned: 127 (million)
% 10.10/2.41  % (3383773)lrs+10_1_sil=8000:sp=occurrence:random_seed=3001229865:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2991 on theBenchmark for (2991ds/907Mi)
% 10.10/2.41  % (3383772)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=1620843563:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2991 on theBenchmark for (2991ds/114Mi)
% 10.10/2.41  % (3383774)dis-1010_1_sil=16000:fde=unused:sp=occurrence:sos=on:random_seed=4050580339:i=437:sd=1:aac=none:ss=included_2990 on theBenchmark for (2990ds/437Mi)
% 10.10/2.41  % (3383772)Instruction limit reached! 
% 10.10/2.41  % (3383772)------------------------------
% 10.10/2.41  % (3383772)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.10/2.41  % (3383772)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.10/2.41  % (3383772)CaDiCaL version: 2.1.3
% 10.10/2.41  % (3383772)Termination reason: Instruction limit
% 10.10/2.41  % (3383772)Termination phase: Saturation
% 10.10/2.41  % (3383772)Time elapsed: 0.060 s
% 10.10/2.41  % (3383772)Peak memory usage: 89 MB
% 10.10/2.41  % (3383772)Instructions burned: 114 (million)
% 10.10/2.41  % (3383778)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=3472175985:i=5202:ss=axioms:sgt=16_2989 on theBenchmark for (2989ds/5202Mi)
% 10.10/2.41  % (3383774)Instruction limit reached! 
% 10.10/2.41  % (3383774)------------------------------
% 10.10/2.41  % (3383774)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.10/2.41  % (3383774)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.10/2.41  % (3383774)CaDiCaL version: 2.1.3
% 10.10/2.41  % (3383774)Termination reason: Instruction limit
% 10.10/2.41  % (3383774)Termination phase: Saturation
% 10.10/2.41  % (3383774)Time elapsed: 0.224 s
% 10.10/2.41  % (3383774)Peak memory usage: 89 MB
% 10.10/2.41  % (3383774)Instructions burned: 438 (million)
% 10.10/2.41  % (3383765)First to succeed.
% 10.10/2.41  % (3383765)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3383737"
% 10.10/2.41  % (3383780)dis+10_3:1_sil=8000:acc=on:urr=on:br=off:sac=on:newcnf=on:random_seed=1873596805:i=134:sd=2:doe=on:nm=16:sup=off:ss=included_2987 on theBenchmark for (2987ds/134Mi)
% 10.10/2.41  % (3383743)Also succeeded, but the first one will report.
% 10.10/2.41  % (3383780)Instruction limit reached! 
% 10.10/2.41  % (3383780)------------------------------
% 10.10/2.41  % (3383780)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.10/2.41  % (3383780)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.10/2.41  % (3383780)CaDiCaL version: 2.1.3
% 10.10/2.41  % (3383780)Termination reason: Instruction limit
% 10.10/2.41  % (3383780)Termination phase: Saturation
% 10.10/2.41  % (3383780)Time elapsed: 0.079 s
% 10.10/2.41  % (3383780)Peak memory usage: 90 MB
% 10.10/2.41  % (3383780)Instructions burned: 135 (million)
% 10.10/2.41  % (3383765)Refutation found. Thanks to Tanya!
% 10.10/2.41  % SZS status Theorem for theBenchmark
% 10.10/2.41  % SZS output start Proof for theBenchmark
% See solution above
% 11.57/2.61  % (3383765)------------------------------
% 11.57/2.61  % (3383765)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.57/2.61  % (3383765)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.57/2.61  % (3383765)CaDiCaL version: 2.1.3
% 11.57/2.61  % (3383765)Termination reason: Refutation
% 11.57/2.61  % (3383765)Time elapsed: 0.628 s
% 11.57/2.61  % (3383765)Peak memory usage: 135 MB
% 11.57/2.61  % (3383765)Instructions burned: 1793 (million)
% 11.57/2.61  % (3383765)------------------------------
% 11.57/2.61  % (3383765)------------------------------
% 11.57/2.61  % (3383737)Success in time 1.542 s
% 11.57/2.61  % Vampire exiting
%------------------------------------------------------------------------------