TSTP Solution File: SWW581_2 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SWW581_2 : TPTP v8.1.2. Released v6.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n028.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sun May  5 11:41:25 EDT 2024

% Result   : Theorem 0.21s 0.42s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   24
%            Number of leaves      :   39
% Syntax   : Number of formulae    :   89 (  30 unt;  25 typ;   0 def)
%            Number of atoms       :  248 (  85 equ)
%            Maximal formula atoms :   26 (   3 avg)
%            Number of connectives :  279 (  95   ~;  49   |; 104   &)
%                                         (   0 <=>;  31  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   4 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number arithmetic     :  448 ( 162 atm;  85 fun; 113 num;  88 var)
%            Number of types       :    6 (   4 usr;   1 ari)
%            Number of type conns  :   13 (   7   >;   6   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   27 (  20 usr;  17 con; 0-4 aty)
%            Number of variables   :   88 (  52   !;  36   ?;  88   :)

% Comments : 
%------------------------------------------------------------------------------
tff(type_def_5,type,
    uni: $tType ).

tff(type_def_6,type,
    ty: $tType ).

tff(type_def_7,type,
    bool: $tType ).

tff(type_def_8,type,
    tuple0: $tType ).

tff(func_def_0,type,
    witness: ty > uni ).

tff(func_def_1,type,
    int: ty ).

tff(func_def_2,type,
    real: ty ).

tff(func_def_3,type,
    bool1: ty ).

tff(func_def_4,type,
    true: bool ).

tff(func_def_5,type,
    false: bool ).

tff(func_def_6,type,
    match_bool: ( ty * bool * uni * uni ) > uni ).

tff(func_def_7,type,
    tuple01: ty ).

tff(func_def_8,type,
    tuple02: tuple0 ).

tff(func_def_9,type,
    qtmark: ty ).

tff(func_def_12,type,
    fact: $int > $int ).

tff(func_def_15,type,
    ref: ty > ty ).

tff(func_def_16,type,
    mk_ref: ( ty * uni ) > uni ).

tff(func_def_17,type,
    contents: ( ty * uni ) > uni ).

tff(func_def_20,type,
    sK0: $int ).

tff(func_def_21,type,
    sK1: $int ).

tff(func_def_22,type,
    sK2: $int ).

tff(func_def_23,type,
    sK3: $int ).

tff(func_def_24,type,
    sK4: $int ).

tff(func_def_25,type,
    sK5: $int ).

tff(pred_def_1,type,
    sort: ( ty * uni ) > $o ).

tff(f1571,plain,
    $false,
    inference(resolution,[],[f1560,f65]) ).

tff(f65,plain,
    $less(sK2,sK0),
    inference(cnf_transformation,[],[f60]) ).

tff(f60,plain,
    ( ( ( sK4 != fact(sK5) )
      | $less(sK0,sK5)
      | $less(sK5,0) )
    & ( $sum(sK2,1) = sK5 )
    & $less(sK2,sK3)
    & ( sK4 = $product(sK3,fact(sK2)) )
    & ~ $less($sum(sK2,1),sK3)
    & ~ $less(sK3,1)
    & $less(sK2,sK0)
    & ( sK1 = fact(sK2) )
    & ~ $less(sK0,sK2)
    & ~ $less(sK2,0)
    & ~ $less(sK0,0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f48,f59,f58,f57,f56]) ).

tff(f56,plain,
    ( ? [X0: $int] :
        ( ? [X1: $int,X2: $int] :
            ( ? [X3: $int,X4: $int] :
                ( ? [X5: $int] :
                    ( ( ( fact(X5) != X4 )
                      | $less(X0,X5)
                      | $less(X5,0) )
                    & ( $sum(X2,1) = X5 ) )
                & $less(X2,X3)
                & ( $product(X3,fact(X2)) = X4 )
                & ~ $less($sum(X2,1),X3)
                & ~ $less(X3,1) )
            & $less(X2,X0)
            & ( fact(X2) = X1 )
            & ~ $less(X0,X2)
            & ~ $less(X2,0) )
        & ~ $less(X0,0) )
   => ( ? [X2: $int,X1: $int] :
          ( ? [X4: $int,X3: $int] :
              ( ? [X5: $int] :
                  ( ( ( fact(X5) != X4 )
                    | $less(sK0,X5)
                    | $less(X5,0) )
                  & ( $sum(X2,1) = X5 ) )
              & $less(X2,X3)
              & ( $product(X3,fact(X2)) = X4 )
              & ~ $less($sum(X2,1),X3)
              & ~ $less(X3,1) )
          & $less(X2,sK0)
          & ( fact(X2) = X1 )
          & ~ $less(sK0,X2)
          & ~ $less(X2,0) )
      & ~ $less(sK0,0) ) ),
    introduced(choice_axiom,[]) ).

tff(f57,plain,
    ( ? [X2: $int,X1: $int] :
        ( ? [X4: $int,X3: $int] :
            ( ? [X5: $int] :
                ( ( ( fact(X5) != X4 )
                  | $less(sK0,X5)
                  | $less(X5,0) )
                & ( $sum(X2,1) = X5 ) )
            & $less(X2,X3)
            & ( $product(X3,fact(X2)) = X4 )
            & ~ $less($sum(X2,1),X3)
            & ~ $less(X3,1) )
        & $less(X2,sK0)
        & ( fact(X2) = X1 )
        & ~ $less(sK0,X2)
        & ~ $less(X2,0) )
   => ( ? [X4: $int,X3: $int] :
          ( ? [X5: $int] :
              ( ( ( fact(X5) != X4 )
                | $less(sK0,X5)
                | $less(X5,0) )
              & ( $sum(sK2,1) = X5 ) )
          & $less(sK2,X3)
          & ( $product(X3,fact(sK2)) = X4 )
          & ~ $less($sum(sK2,1),X3)
          & ~ $less(X3,1) )
      & $less(sK2,sK0)
      & ( sK1 = fact(sK2) )
      & ~ $less(sK0,sK2)
      & ~ $less(sK2,0) ) ),
    introduced(choice_axiom,[]) ).

tff(f58,plain,
    ( ? [X4: $int,X3: $int] :
        ( ? [X5: $int] :
            ( ( ( fact(X5) != X4 )
              | $less(sK0,X5)
              | $less(X5,0) )
            & ( $sum(sK2,1) = X5 ) )
        & $less(sK2,X3)
        & ( $product(X3,fact(sK2)) = X4 )
        & ~ $less($sum(sK2,1),X3)
        & ~ $less(X3,1) )
   => ( ? [X5: $int] :
          ( ( ( fact(X5) != sK4 )
            | $less(sK0,X5)
            | $less(X5,0) )
          & ( $sum(sK2,1) = X5 ) )
      & $less(sK2,sK3)
      & ( sK4 = $product(sK3,fact(sK2)) )
      & ~ $less($sum(sK2,1),sK3)
      & ~ $less(sK3,1) ) ),
    introduced(choice_axiom,[]) ).

tff(f59,plain,
    ( ? [X5: $int] :
        ( ( ( fact(X5) != sK4 )
          | $less(sK0,X5)
          | $less(X5,0) )
        & ( $sum(sK2,1) = X5 ) )
   => ( ( ( sK4 != fact(sK5) )
        | $less(sK0,sK5)
        | $less(sK5,0) )
      & ( $sum(sK2,1) = sK5 ) ) ),
    introduced(choice_axiom,[]) ).

tff(f48,plain,
    ? [X0: $int] :
      ( ? [X1: $int,X2: $int] :
          ( ? [X3: $int,X4: $int] :
              ( ? [X5: $int] :
                  ( ( ( fact(X5) != X4 )
                    | $less(X0,X5)
                    | $less(X5,0) )
                  & ( $sum(X2,1) = X5 ) )
              & $less(X2,X3)
              & ( $product(X3,fact(X2)) = X4 )
              & ~ $less($sum(X2,1),X3)
              & ~ $less(X3,1) )
          & $less(X2,X0)
          & ( fact(X2) = X1 )
          & ~ $less(X0,X2)
          & ~ $less(X2,0) )
      & ~ $less(X0,0) ),
    inference(flattening,[],[f47]) ).

tff(f47,plain,
    ? [X0: $int] :
      ( ? [X1: $int,X2: $int] :
          ( ? [X3: $int,X4: $int] :
              ( ? [X5: $int] :
                  ( ( ( fact(X5) != X4 )
                    | $less(X0,X5)
                    | $less(X5,0) )
                  & ( $sum(X2,1) = X5 ) )
              & $less(X2,X3)
              & ( $product(X3,fact(X2)) = X4 )
              & ~ $less($sum(X2,1),X3)
              & ~ $less(X3,1) )
          & $less(X2,X0)
          & ( fact(X2) = X1 )
          & ~ $less(X0,X2)
          & ~ $less(X2,0) )
      & ~ $less(X0,0) ),
    inference(ennf_transformation,[],[f38]) ).

tff(f38,plain,
    ~ ! [X0: $int] :
        ( ~ $less(X0,0)
       => ! [X1: $int,X2: $int] :
            ( ( ( fact(X2) = X1 )
              & ~ $less(X0,X2)
              & ~ $less(X2,0) )
           => ( $less(X2,X0)
             => ! [X3: $int,X4: $int] :
                  ( ( ( $product(X3,fact(X2)) = X4 )
                    & ~ $less($sum(X2,1),X3)
                    & ~ $less(X3,1) )
                 => ( $less(X2,X3)
                   => ! [X5: $int] :
                        ( ( $sum(X2,1) = X5 )
                       => ( ( fact(X5) = X4 )
                          & ~ $less(X0,X5)
                          & ~ $less(X5,0) ) ) ) ) ) ) ),
    inference(rectify,[],[f17]) ).

tff(f17,plain,
    ~ ! [X8: $int] :
        ( ~ $less(X8,0)
       => ! [X6: $int,X9: $int] :
            ( ( ( fact(X9) = X6 )
              & ~ $less(X8,X9)
              & ~ $less(X9,0) )
           => ( $less(X9,X8)
             => ! [X10: $int,X11: $int] :
                  ( ( ( $product(X10,fact(X9)) = X11 )
                    & ~ $less($sum(X9,1),X10)
                    & ~ $less(X10,1) )
                 => ( $less(X9,X10)
                   => ! [X12: $int] :
                        ( ( $sum(X9,1) = X12 )
                       => ( ( fact(X12) = X11 )
                          & ~ $less(X8,X12)
                          & ~ $less(X12,0) ) ) ) ) ) ) ),
    inference(theory_normalization,[],[f16]) ).

tff(f16,negated_conjecture,
    ~ ! [X8: $int] :
        ( $lesseq(0,X8)
       => ! [X6: $int,X9: $int] :
            ( ( ( fact(X9) = X6 )
              & $lesseq(X9,X8)
              & $lesseq(0,X9) )
           => ( $less(X9,X8)
             => ! [X10: $int,X11: $int] :
                  ( ( ( $product(X10,fact(X9)) = X11 )
                    & $lesseq(X10,$sum(X9,1))
                    & $lesseq(1,X10) )
                 => ( ~ $lesseq(X10,X9)
                   => ! [X12: $int] :
                        ( ( $sum(X9,1) = X12 )
                       => ( ( fact(X12) = X11 )
                          & $lesseq(X12,X8)
                          & $lesseq(0,X12) ) ) ) ) ) ) ),
    inference(negated_conjecture,[],[f15]) ).

tff(f15,conjecture,
    ! [X8: $int] :
      ( $lesseq(0,X8)
     => ! [X6: $int,X9: $int] :
          ( ( ( fact(X9) = X6 )
            & $lesseq(X9,X8)
            & $lesseq(0,X9) )
         => ( $less(X9,X8)
           => ! [X10: $int,X11: $int] :
                ( ( ( $product(X10,fact(X9)) = X11 )
                  & $lesseq(X10,$sum(X9,1))
                  & $lesseq(1,X10) )
               => ( ~ $lesseq(X10,X9)
                 => ! [X12: $int] :
                      ( ( $sum(X9,1) = X12 )
                     => ( ( fact(X12) = X11 )
                        & $lesseq(X12,X8)
                        & $lesseq(0,X12) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',wP_parameter_routine) ).

tff(f1560,plain,
    ~ $less(sK2,sK0),
    inference(resolution,[],[f1538,f308]) ).

tff(f308,plain,
    ! [X0: $int] :
      ( ~ $less(X0,sK3)
      | ~ $less(sK2,X0) ),
    inference(backward_demodulation,[],[f141,f296]) ).

tff(f296,plain,
    sK3 = sK5,
    inference(resolution,[],[f294,f69]) ).

tff(f69,plain,
    $less(sK2,sK3),
    inference(cnf_transformation,[],[f60]) ).

tff(f294,plain,
    ( ~ $less(sK2,sK3)
    | ( sK3 = sK5 ) ),
    inference(resolution,[],[f289,f141]) ).

tff(f289,plain,
    ( $less(sK3,sK5)
    | ( sK3 = sK5 ) ),
    inference(resolution,[],[f27,f110]) ).

tff(f110,plain,
    ~ $less(sK5,sK3),
    inference(backward_demodulation,[],[f88,f98]) ).

tff(f98,plain,
    sK5 = $sum(1,sK2),
    inference(superposition,[],[f20,f70]) ).

tff(f70,plain,
    $sum(sK2,1) = sK5,
    inference(cnf_transformation,[],[f60]) ).

tff(f20,plain,
    ! [X0: $int,X1: $int] : ( $sum(X0,X1) = $sum(X1,X0) ),
    introduced(theory_axiom_135,[]) ).

tff(f88,plain,
    ~ $less($sum(1,sK2),sK3),
    inference(forward_demodulation,[],[f67,f20]) ).

tff(f67,plain,
    ~ $less($sum(sK2,1),sK3),
    inference(cnf_transformation,[],[f60]) ).

tff(f27,plain,
    ! [X0: $int,X1: $int] :
      ( $less(X1,X0)
      | $less(X0,X1)
      | ( X0 = X1 ) ),
    introduced(theory_axiom_144,[]) ).

tff(f141,plain,
    ! [X0: $int] :
      ( ~ $less(X0,sK5)
      | ~ $less(sK2,X0) ),
    inference(superposition,[],[f37,f70]) ).

tff(f37,plain,
    ! [X0: $int,X1: $int] :
      ( ~ $less(X1,$sum(X0,1))
      | ~ $less(X0,X1) ),
    introduced(theory_axiom_161,[]) ).

tff(f1538,plain,
    $less(sK0,sK3),
    inference(resolution,[],[f1519,f315]) ).

tff(f315,plain,
    ~ $less(sK3,0),
    inference(backward_demodulation,[],[f249,f296]) ).

tff(f249,plain,
    ~ $less(sK5,0),
    inference(resolution,[],[f214,f25]) ).

tff(f25,plain,
    ! [X0: $int] : ~ $less(X0,X0),
    introduced(theory_axiom_142,[]) ).

tff(f214,plain,
    ! [X0: $int] :
      ( $less(X0,sK5)
      | ~ $less(X0,0) ),
    inference(resolution,[],[f196,f127]) ).

tff(f127,plain,
    ! [X0: $int] :
      ( $less(sK2,X0)
      | $less(X0,sK5) ),
    inference(superposition,[],[f29,f70]) ).

tff(f29,plain,
    ! [X0: $int,X1: $int] :
      ( $less(X1,$sum(X0,1))
      | $less(X0,X1) ),
    introduced(theory_axiom_147,[]) ).

tff(f196,plain,
    ! [X0: $int] :
      ( ~ $less(X0,0)
      | ~ $less(sK2,X0) ),
    inference(resolution,[],[f26,f62]) ).

tff(f62,plain,
    ~ $less(sK2,0),
    inference(cnf_transformation,[],[f60]) ).

tff(f26,plain,
    ! [X2: $int,X0: $int,X1: $int] :
      ( $less(X0,X2)
      | ~ $less(X1,X2)
      | ~ $less(X0,X1) ),
    introduced(theory_axiom_143,[]) ).

tff(f1519,plain,
    ( $less(sK3,0)
    | $less(sK0,sK3) ),
    inference(trivial_inequality_removal,[],[f1518]) ).

tff(f1518,plain,
    ( ( sK4 != sK4 )
    | $less(sK0,sK3)
    | $less(sK3,0) ),
    inference(backward_demodulation,[],[f324,f1517]) ).

tff(f1517,plain,
    sK4 = fact(sK3),
    inference(forward_demodulation,[],[f1516,f89]) ).

tff(f89,plain,
    sK4 = $product(sK3,sK1),
    inference(backward_demodulation,[],[f68,f64]) ).

tff(f64,plain,
    sK1 = fact(sK2),
    inference(cnf_transformation,[],[f60]) ).

tff(f68,plain,
    sK4 = $product(sK3,fact(sK2)),
    inference(cnf_transformation,[],[f60]) ).

tff(f1516,plain,
    $product(sK3,sK1) = fact(sK3),
    inference(forward_demodulation,[],[f1515,f64]) ).

tff(f1515,plain,
    $product(sK3,fact(sK2)) = fact(sK3),
    inference(forward_demodulation,[],[f1484,f1313]) ).

tff(f1313,plain,
    sK2 = $sum(sK3,-1),
    inference(evaluation,[],[f1304]) ).

tff(f1304,plain,
    $sum(sK2,0) = $sum(sK3,$uminus(1)),
    inference(superposition,[],[f1230,f24]) ).

tff(f24,plain,
    ! [X0: $int] : ( 0 = $sum(X0,$uminus(X0)) ),
    introduced(theory_axiom_140,[]) ).

tff(f1230,plain,
    ! [X0: $int] : ( $sum(sK3,X0) = $sum(sK2,$sum(1,X0)) ),
    inference(superposition,[],[f21,f300]) ).

tff(f300,plain,
    $sum(sK2,1) = sK3,
    inference(backward_demodulation,[],[f70,f296]) ).

tff(f21,plain,
    ! [X2: $int,X0: $int,X1: $int] : ( $sum(X0,$sum(X1,X2)) = $sum($sum(X0,X1),X2) ),
    introduced(theory_axiom_136,[]) ).

tff(f1484,plain,
    fact(sK3) = $product(sK3,fact($sum(sK3,-1))),
    inference(resolution,[],[f87,f66]) ).

tff(f66,plain,
    ~ $less(sK3,1),
    inference(cnf_transformation,[],[f60]) ).

tff(f87,plain,
    ! [X0: $int] :
      ( $less(X0,1)
      | ( fact(X0) = $product(X0,fact($sum(X0,-1))) ) ),
    inference(evaluation,[],[f77]) ).

tff(f77,plain,
    ! [X0: $int] :
      ( ( fact(X0) = $product(X0,fact($sum(X0,$uminus(1)))) )
      | $less(X0,1) ),
    inference(cnf_transformation,[],[f49]) ).

tff(f49,plain,
    ! [X0: $int] :
      ( ( fact(X0) = $product(X0,fact($sum(X0,$uminus(1)))) )
      | $less(X0,1) ),
    inference(ennf_transformation,[],[f41]) ).

tff(f41,plain,
    ! [X0: $int] :
      ( ~ $less(X0,1)
     => ( fact(X0) = $product(X0,fact($sum(X0,$uminus(1)))) ) ),
    inference(rectify,[],[f18]) ).

tff(f18,plain,
    ! [X8: $int] :
      ( ~ $less(X8,1)
     => ( fact(X8) = $product(X8,fact($sum(X8,$uminus(1)))) ) ),
    inference(theory_normalization,[],[f10]) ).

tff(f10,axiom,
    ! [X8: $int] :
      ( $lesseq(1,X8)
     => ( fact(X8) = $product(X8,fact($difference(X8,1))) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',factn) ).

tff(f324,plain,
    ( ( sK4 != fact(sK3) )
    | $less(sK0,sK3)
    | $less(sK3,0) ),
    inference(forward_demodulation,[],[f323,f296]) ).

tff(f323,plain,
    ( $less(sK0,sK3)
    | ( sK4 != fact(sK3) )
    | $less(sK5,0) ),
    inference(forward_demodulation,[],[f301,f296]) ).

tff(f301,plain,
    ( ( sK4 != fact(sK3) )
    | $less(sK0,sK5)
    | $less(sK5,0) ),
    inference(backward_demodulation,[],[f71,f296]) ).

tff(f71,plain,
    ( ( sK4 != fact(sK5) )
    | $less(sK0,sK5)
    | $less(sK5,0) ),
    inference(cnf_transformation,[],[f60]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : SWW581_2 : TPTP v8.1.2. Released v6.1.0.
% 0.13/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.35  % Computer : n028.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Fri May  3 19:23:08 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.36  % (12922)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.37  % (12925)WARNING: value z3 for option sas not known
% 0.21/0.38  % (12923)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.21/0.38  % (12924)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.21/0.38  % (12926)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.21/0.38  % (12927)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.21/0.38  % (12925)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.21/0.38  % (12928)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.21/0.38  % (12929)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.21/0.38  % (12926)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.21/0.38  % (12923)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.21/0.38  % (12924)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.21/0.38  % (12926)Terminated due to inappropriate strategy.
% 0.21/0.38  % (12926)------------------------------
% 0.21/0.38  % (12926)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.21/0.38  % (12923)Terminated due to inappropriate strategy.
% 0.21/0.38  % (12923)------------------------------
% 0.21/0.38  % (12923)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.21/0.38  % (12924)Terminated due to inappropriate strategy.
% 0.21/0.38  % (12924)------------------------------
% 0.21/0.38  % (12924)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.21/0.38  % (12926)Termination reason: Inappropriate
% 0.21/0.38  % (12923)Termination reason: Inappropriate
% 0.21/0.38  % (12924)Termination reason: Inappropriate
% 0.21/0.38  
% 0.21/0.38  
% 0.21/0.38  
% 0.21/0.38  % (12923)Memory used [KB]: 804
% 0.21/0.38  % (12926)Memory used [KB]: 804
% 0.21/0.38  % (12924)Memory used [KB]: 805
% 0.21/0.38  % (12923)Time elapsed: 0.003 s
% 0.21/0.38  % (12926)Time elapsed: 0.003 s
% 0.21/0.38  % (12924)Time elapsed: 0.003 s
% 0.21/0.38  % (12923)Instructions burned: 3 (million)
% 0.21/0.38  % (12924)Instructions burned: 3 (million)
% 0.21/0.38  % (12926)Instructions burned: 3 (million)
% 0.21/0.38  % (12926)------------------------------
% 0.21/0.38  % (12926)------------------------------
% 0.21/0.38  % (12924)------------------------------
% 0.21/0.38  % (12924)------------------------------
% 0.21/0.38  % (12923)------------------------------
% 0.21/0.38  % (12923)------------------------------
% 0.21/0.39  % (12930)fmb+10_1_fmbas=expand:fmbsr=1.1:gsp=on:nm=4_411 on theBenchmark for (411ds/0Mi)
% 0.21/0.39  % (12931)ott+1_9_av=off:bd=off:bs=on:gsp=on:lcm=predicate:nm=4:sp=weighted_frequency:urr=on_382 on theBenchmark for (382ds/0Mi)
% 0.21/0.40  % (12932)lrs-11_2:5_fsd=off:fde=none:nm=4:nwc=5.0:sims=off:sp=reverse_weighted_frequency:stl=62_367 on theBenchmark for (367ds/0Mi)
% 0.21/0.40  % (12930)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.21/0.40  % (12930)Terminated due to inappropriate strategy.
% 0.21/0.40  % (12930)------------------------------
% 0.21/0.40  % (12930)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.21/0.40  % (12930)Termination reason: Inappropriate
% 0.21/0.40  
% 0.21/0.40  % (12930)Memory used [KB]: 804
% 0.21/0.40  % (12930)Time elapsed: 0.003 s
% 0.21/0.40  % (12930)Instructions burned: 3 (million)
% 0.21/0.40  % (12930)------------------------------
% 0.21/0.40  % (12930)------------------------------
% 0.21/0.41  % (12933)ott+4_64_acc=on:anc=none:bs=on:bsr=on:fsd=off:gs=on:gsem=off:irw=on:msp=off:nwc=2.5:nicw=on:sims=off_354 on theBenchmark for (354ds/0Mi)
% 0.21/0.42  % (12928)First to succeed.
% 0.21/0.42  % (12928)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-12922"
% 0.21/0.42  % (12928)Refutation found. Thanks to Tanya!
% 0.21/0.42  % SZS status Theorem for theBenchmark
% 0.21/0.42  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.42  % (12928)------------------------------
% 0.21/0.42  % (12928)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.21/0.42  % (12928)Termination reason: Refutation
% 0.21/0.42  
% 0.21/0.42  % (12928)Memory used [KB]: 1158
% 0.21/0.42  % (12928)Time elapsed: 0.043 s
% 0.21/0.42  % (12928)Instructions burned: 66 (million)
% 0.21/0.42  % (12922)Success in time 0.058 s
%------------------------------------------------------------------------------