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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : NUM913_1 : TPTP v8.2.0. Released v5.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n029.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 : Tue May 21 02:14:17 EDT 2024

% Result   : Theorem 0.13s 0.37s
% Output   : Refutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   27 (   5 unt;   2 typ;   0 def)
%            Number of atoms       :   74 (  24 equ)
%            Maximal formula atoms :   12 (   2 avg)
%            Number of connectives :   82 (  33   ~;  34   |;  10   &)
%                                         (   3 <=>;   1  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number arithmetic     :   71 (  49 atm;   0 fun;   0 num;  22 var)
%            Number of types       :    1 (   0 usr;   1 ari)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   22 (  14   !;   8   ?;  22   :)

% Comments : 
%------------------------------------------------------------------------------
tff(func_def_4,type,
    sK0: $real ).

tff(func_def_5,type,
    sK1: $real ).

tff(f125,plain,
    $false,
    inference(resolution,[],[f124,f9]) ).

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

tff(f124,plain,
    $less(sK0,sK0),
    inference(trivial_inequality_removal,[],[f111]) ).

tff(f111,plain,
    ( ( sK0 != sK0 )
    | $less(sK0,sK0) ),
    inference(backward_demodulation,[],[f23,f110]) ).

tff(f110,plain,
    sK0 = sK1,
    inference(duplicate_literal_removal,[],[f102]) ).

tff(f102,plain,
    ( ( sK0 = sK1 )
    | ( sK0 = sK1 ) ),
    inference(resolution,[],[f96,f64]) ).

tff(f64,plain,
    ( ~ $less(sK1,sK0)
    | ( sK0 = sK1 ) ),
    inference(resolution,[],[f63,f20]) ).

tff(f20,plain,
    ( $less(sK0,sK1)
    | ( sK0 = sK1 )
    | ~ $less(sK1,sK0) ),
    inference(cnf_transformation,[],[f19]) ).

tff(f19,plain,
    ( ( ( ( sK0 != sK1 )
        & ~ $less(sK0,sK1) )
      | $less(sK1,sK0) )
    & ( ( sK0 = sK1 )
      | $less(sK0,sK1)
      | ~ $less(sK1,sK0) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f17,f18]) ).

tff(f18,plain,
    ( ? [X0: $real,X1: $real] :
        ( ( ( ( X0 != X1 )
            & ~ $less(X0,X1) )
          | $less(X1,X0) )
        & ( ( X0 = X1 )
          | $less(X0,X1)
          | ~ $less(X1,X0) ) )
   => ( ( ( ( sK0 != sK1 )
          & ~ $less(sK0,sK1) )
        | $less(sK1,sK0) )
      & ( ( sK0 = sK1 )
        | $less(sK0,sK1)
        | ~ $less(sK1,sK0) ) ) ),
    introduced(choice_axiom,[]) ).

tff(f17,plain,
    ? [X0: $real,X1: $real] :
      ( ( ( ( X0 != X1 )
          & ~ $less(X0,X1) )
        | $less(X1,X0) )
      & ( ( X0 = X1 )
        | $less(X0,X1)
        | ~ $less(X1,X0) ) ),
    inference(flattening,[],[f16]) ).

tff(f16,plain,
    ? [X0: $real,X1: $real] :
      ( ( ( ( X0 != X1 )
          & ~ $less(X0,X1) )
        | $less(X1,X0) )
      & ( ( X0 = X1 )
        | $less(X0,X1)
        | ~ $less(X1,X0) ) ),
    inference(nnf_transformation,[],[f15]) ).

tff(f15,plain,
    ? [X0: $real,X1: $real] :
      ( ~ $less(X1,X0)
    <~> ( ( X0 = X1 )
        | $less(X0,X1) ) ),
    inference(ennf_transformation,[],[f3]) ).

tff(f3,plain,
    ~ ! [X0: $real,X1: $real] :
        ( ~ $less(X1,X0)
      <=> ( ( X0 = X1 )
          | $less(X0,X1) ) ),
    inference(theory_normalization,[],[f2]) ).

tff(f2,negated_conjecture,
    ~ ! [X0: $real,X1: $real] :
        ( $lesseq(X0,X1)
      <=> ( ( X0 = X1 )
          | $less(X0,X1) ) ),
    inference(negated_conjecture,[],[f1]) ).

tff(f1,conjecture,
    ! [X0: $real,X1: $real] :
      ( $lesseq(X0,X1)
    <=> ( ( X0 = X1 )
        | $less(X0,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',real_combined_problem_1) ).

tff(f63,plain,
    ~ $less(sK0,sK1),
    inference(duplicate_literal_removal,[],[f49]) ).

tff(f49,plain,
    ( ~ $less(sK0,sK1)
    | ~ $less(sK0,sK1) ),
    inference(resolution,[],[f41,f21]) ).

tff(f21,plain,
    ( $less(sK1,sK0)
    | ~ $less(sK0,sK1) ),
    inference(cnf_transformation,[],[f19]) ).

tff(f41,plain,
    ! [X0: $real,X1: $real] :
      ( ~ $less(X0,X1)
      | ~ $less(X1,X0) ),
    inference(resolution,[],[f10,f9]) ).

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

tff(f96,plain,
    ( $less(sK1,sK0)
    | ( sK0 = sK1 ) ),
    inference(resolution,[],[f11,f63]) ).

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

tff(f23,plain,
    ( ( sK0 != sK1 )
    | $less(sK0,sK0) ),
    inference(inner_rewriting,[],[f22]) ).

tff(f22,plain,
    ( ( sK0 != sK1 )
    | $less(sK1,sK0) ),
    inference(cnf_transformation,[],[f19]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : NUM913_1 : TPTP v8.2.0. Released v5.0.0.
% 0.06/0.13  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.34  % Computer : n029.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Mon May 20 06:23:53 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.13/0.35  % (29645)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.36  % (29648)WARNING: value z3 for option sas not known
% 0.13/0.37  % (29646)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.13/0.37  % (29649)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.13/0.37  % (29647)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.13/0.37  % (29650)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.13/0.37  % (29648)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.13/0.37  % (29652)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.13/0.37  % (29651)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.13/0.37  % (29649)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.13/0.37  % (29646)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.13/0.37  % (29647)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.13/0.37  % (29646)Terminated due to inappropriate strategy.
% 0.13/0.37  % (29646)------------------------------
% 0.13/0.37  % (29646)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.13/0.37  % (29647)Terminated due to inappropriate strategy.
% 0.13/0.37  % (29647)------------------------------
% 0.13/0.37  % (29647)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.13/0.37  % (29646)Termination reason: Inappropriate
% 0.13/0.37  % (29647)Termination reason: Inappropriate
% 0.13/0.37  
% 0.13/0.37  
% 0.13/0.37  % (29646)Memory used [KB]: 723
% 0.13/0.37  % (29647)Memory used [KB]: 724
% 0.13/0.37  % (29646)Time elapsed: 0.002 s
% 0.13/0.37  % (29647)Time elapsed: 0.002 s
% 0.13/0.37  % (29646)Instructions burned: 2 (million)
% 0.13/0.37  % (29647)Instructions burned: 2 (million)
% 0.13/0.37  % (29649)Terminated due to inappropriate strategy.
% 0.13/0.37  % (29649)------------------------------
% 0.13/0.37  % (29649)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.13/0.37  % (29649)Termination reason: Inappropriate
% 0.13/0.37  
% 0.13/0.37  % (29649)Memory used [KB]: 723
% 0.13/0.37  % (29649)Time elapsed: 0.002 s
% 0.13/0.37  % (29649)Instructions burned: 2 (million)
% 0.13/0.37  % (29646)------------------------------
% 0.13/0.37  % (29646)------------------------------
% 0.13/0.37  % (29647)------------------------------
% 0.13/0.37  % (29647)------------------------------
% 0.13/0.37  % (29649)------------------------------
% 0.13/0.37  % (29649)------------------------------
% 0.13/0.37  % (29651)First to succeed.
% 0.13/0.37  % (29651)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-29645"
% 0.13/0.37  % (29648)Also succeeded, but the first one will report.
% 0.13/0.37  % (29651)Refutation found. Thanks to Tanya!
% 0.13/0.37  % SZS status Theorem for theBenchmark
% 0.13/0.37  % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.37  % (29651)------------------------------
% 0.13/0.37  % (29651)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.13/0.37  % (29651)Termination reason: Refutation
% 0.13/0.37  
% 0.13/0.37  % (29651)Memory used [KB]: 778
% 0.13/0.37  % (29651)Time elapsed: 0.007 s
% 0.13/0.37  % (29651)Instructions burned: 7 (million)
% 0.13/0.37  % (29645)Success in time 0.009 s
%------------------------------------------------------------------------------