TSTP Solution File: NUM913_1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : NUM913_1 : TPTP v8.2.0. Released v5.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n011.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 01:46:49 EDT 2024

% Result   : Theorem 0.56s 0.75s
% Output   : Refutation 0.56s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   38 (   2 unt;   2 typ;   0 def)
%            Number of atoms       :  107 (  21 equ)
%            Maximal formula atoms :   12 (   2 avg)
%            Number of connectives :  117 (  46   ~;  53   |;  10   &)
%                                         (   6 <=>;   1  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number arithmetic     :   67 (  47 atm;   0 fun;   0 num;  20 var)
%            Number of types       :    1 (   0 usr;   1 ari)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    7 (   3 usr;   4 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   20 (  12   !;   8   ?;  20   :)

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

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

tff(f72,plain,
    $false,
    inference(avatar_sat_refutation,[],[f31,f36,f37,f60,f64,f71]) ).

tff(f71,plain,
    ( ~ spl2_1
    | ~ spl2_3 ),
    inference(avatar_contradiction_clause,[],[f70]) ).

tff(f70,plain,
    ( $false
    | ~ spl2_1
    | ~ spl2_3 ),
    inference(subsumption_resolution,[],[f65,f34]) ).

tff(f34,plain,
    ( $less(sK0,sK1)
    | ~ spl2_3 ),
    inference(avatar_component_clause,[],[f33]) ).

tff(f33,plain,
    ( spl2_3
  <=> $less(sK0,sK1) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).

tff(f65,plain,
    ( ~ $less(sK0,sK1)
    | ~ spl2_1 ),
    inference(unit_resulting_resolution,[],[f9,f26,f10]) ).

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

tff(f26,plain,
    ( $less(sK1,sK0)
    | ~ spl2_1 ),
    inference(avatar_component_clause,[],[f24]) ).

tff(f24,plain,
    ( spl2_1
  <=> $less(sK1,sK0) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).

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

tff(f64,plain,
    ( ~ spl2_1
    | ~ spl2_2 ),
    inference(avatar_contradiction_clause,[],[f63]) ).

tff(f63,plain,
    ( $false
    | ~ spl2_1
    | ~ spl2_2 ),
    inference(subsumption_resolution,[],[f62,f9]) ).

tff(f62,plain,
    ( $less(sK0,sK0)
    | ~ spl2_1
    | ~ spl2_2 ),
    inference(forward_demodulation,[],[f26,f29]) ).

tff(f29,plain,
    ( ( sK0 = sK1 )
    | ~ spl2_2 ),
    inference(avatar_component_clause,[],[f28]) ).

tff(f28,plain,
    ( spl2_2
  <=> ( sK0 = sK1 ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).

tff(f60,plain,
    ( spl2_1
    | spl2_2
    | spl2_3 ),
    inference(avatar_contradiction_clause,[],[f59]) ).

tff(f59,plain,
    ( $false
    | spl2_1
    | spl2_2
    | spl2_3 ),
    inference(subsumption_resolution,[],[f38,f30]) ).

tff(f30,plain,
    ( ( sK0 != sK1 )
    | spl2_2 ),
    inference(avatar_component_clause,[],[f28]) ).

tff(f38,plain,
    ( ( sK0 = sK1 )
    | spl2_1
    | spl2_3 ),
    inference(unit_resulting_resolution,[],[f35,f25,f11]) ).

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

tff(f25,plain,
    ( ~ $less(sK1,sK0)
    | spl2_1 ),
    inference(avatar_component_clause,[],[f24]) ).

tff(f35,plain,
    ( ~ $less(sK0,sK1)
    | spl2_3 ),
    inference(avatar_component_clause,[],[f33]) ).

tff(f37,plain,
    ( ~ spl2_1
    | spl2_3
    | spl2_2 ),
    inference(avatar_split_clause,[],[f20,f28,f33,f24]) ).

tff(f20,plain,
    ( ( sK0 = sK1 )
    | $less(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(f36,plain,
    ( spl2_1
    | ~ spl2_3 ),
    inference(avatar_split_clause,[],[f21,f33,f24]) ).

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

tff(f31,plain,
    ( spl2_1
    | ~ spl2_2 ),
    inference(avatar_split_clause,[],[f22,f28,f24]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : NUM913_1 : TPTP v8.2.0. Released v5.0.0.
% 0.14/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.35  % Computer : n011.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Mon May 20 06:50:23 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.14/0.35  This is a TF0_THM_EQU_ARI problem
% 0.14/0.35  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.56/0.75  % (1906)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.56/0.75  % (1906)Refutation not found, incomplete strategy% (1906)------------------------------
% 0.56/0.75  % (1906)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.75  % (1906)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.75  
% 0.56/0.75  % (1906)Memory used [KB]: 968
% 0.56/0.75  % (1906)Time elapsed: 0.002 s
% 0.56/0.75  % (1906)Instructions burned: 2 (million)
% 0.56/0.75  % (1899)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2996ds/34Mi)
% 0.56/0.75  % (1901)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.56/0.75  % (1900)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2996ds/51Mi)
% 0.56/0.75  % (1906)------------------------------
% 0.56/0.75  % (1906)------------------------------
% 0.56/0.75  % (1903)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2996ds/34Mi)
% 0.56/0.75  % (1904)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.56/0.75  % (1902)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.56/0.75  % (1905)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2996ds/83Mi)
% 0.56/0.75  % (1904)Refutation not found, incomplete strategy% (1904)------------------------------
% 0.56/0.75  % (1904)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.75  % (1904)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.75  
% 0.56/0.75  % (1904)Memory used [KB]: 977
% 0.56/0.75  % (1904)Time elapsed: 0.003 s
% 0.56/0.75  % (1904)Instructions burned: 2 (million)
% 0.56/0.75  % (1904)------------------------------
% 0.56/0.75  % (1904)------------------------------
% 0.56/0.75  % (1905)Also succeeded, but the first one will report.
% 0.56/0.75  % (1902)First to succeed.
% 0.56/0.75  % (1907)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on theBenchmark for (2996ds/55Mi)
% 0.56/0.75  % (1902)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1882"
% 0.56/0.75  % (1901)Also succeeded, but the first one will report.
% 0.56/0.75  % (1902)Refutation found. Thanks to Tanya!
% 0.56/0.75  % SZS status Theorem for theBenchmark
% 0.56/0.75  % SZS output start Proof for theBenchmark
% See solution above
% 0.56/0.75  % (1902)------------------------------
% 0.56/0.75  % (1902)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.75  % (1902)Termination reason: Refutation
% 0.56/0.75  
% 0.56/0.75  % (1902)Memory used [KB]: 993
% 0.56/0.75  % (1902)Time elapsed: 0.004 s
% 0.56/0.75  % (1902)Instructions burned: 4 (million)
% 0.56/0.75  % (1882)Success in time 0.384 s
% 0.56/0.75  % Vampire---4.8 exiting
%------------------------------------------------------------------------------