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

View Problem - Process Solution

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

% Computer : n022.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 : Mon May 20 18:50:44 EDT 2024

% Result   : Theorem 0.13s 0.38s
% Output   : Refutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   23 (   8 unt;   1 typ;   0 def)
%            Number of atoms       :   40 (  16 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   30 (  12   ~;  15   |;   2   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number arithmetic     :   88 (  23 atm;   9 fun;  27 num;  29 var)
%            Number of types       :    1 (   0 usr;   1 ari)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   1 usr;   3 con; 0-2 aty)
%            Number of variables   :   29 (  25   !;   4   ?;  29   :)

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

tff(f163,plain,
    $false,
    inference(evaluation,[],[f157]) ).

tff(f157,plain,
    1 = $sum(1,1),
    inference(resolution,[],[f126,f8]) ).

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

tff(f126,plain,
    ! [X0: $int] :
      ( $less(X0,1)
      | ( 1 = $sum(X0,1) ) ),
    inference(resolution,[],[f121,f31]) ).

tff(f31,plain,
    ! [X0: $int] : $less(X0,$sum(X0,1)),
    inference(resolution,[],[f12,f8]) ).

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

tff(f121,plain,
    ! [X0: $int,X1: $int] :
      ( ~ $less(X0,X1)
      | $less(X0,1)
      | ( 1 = X1 ) ),
    inference(resolution,[],[f9,f85]) ).

tff(f85,plain,
    ! [X0: $int] :
      ( $less(X0,1)
      | ( 1 = X0 ) ),
    inference(forward_demodulation,[],[f81,f41]) ).

tff(f41,plain,
    1 = sK0,
    inference(evaluation,[],[f37]) ).

tff(f37,plain,
    sK0 = $sum(0,1),
    inference(resolution,[],[f31,f18]) ).

tff(f18,plain,
    ! [X1: $int] :
      ( ~ $less(0,X1)
      | ( sK0 = X1 ) ),
    inference(cnf_transformation,[],[f17]) ).

tff(f17,plain,
    ! [X1: $int] :
      ( ( sK0 = X1 )
      | ~ $less(0,X1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f15,f16]) ).

tff(f16,plain,
    ( ? [X0: $int] :
      ! [X1: $int] :
        ( ( X0 = X1 )
        | ~ $less(0,X1) )
   => ! [X1: $int] :
        ( ( sK0 = X1 )
        | ~ $less(0,X1) ) ),
    introduced(choice_axiom,[]) ).

tff(f15,plain,
    ? [X0: $int] :
    ! [X1: $int] :
      ( ( X0 = X1 )
      | ~ $less(0,X1) ),
    inference(ennf_transformation,[],[f2]) ).

tff(f2,negated_conjecture,
    ~ ! [X0: $int] :
      ? [X1: $int] :
        ( ( X0 != X1 )
        & $less(0,X1) ),
    inference(negated_conjecture,[],[f1]) ).

tff(f1,conjecture,
    ! [X0: $int] :
    ? [X1: $int] :
      ( ( X0 != X1 )
      & $less(0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',exists_pos_X_noteq_Y) ).

tff(f81,plain,
    ! [X0: $int] :
      ( $less(X0,1)
      | ( sK0 = X0 ) ),
    inference(resolution,[],[f72,f18]) ).

tff(f72,plain,
    ! [X0: $int] :
      ( $less(X0,1)
      | $less(0,X0) ),
    inference(superposition,[],[f33,f5]) ).

tff(f5,plain,
    ! [X0: $int] : ( $sum(X0,0) = X0 ),
    introduced(theory_axiom_137,[]) ).

tff(f33,plain,
    ! [X0: $int,X1: $int] :
      ( $less(X1,$sum(1,X0))
      | $less(X0,X1) ),
    inference(superposition,[],[f12,f3]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : ARI590_1 : TPTP v8.2.0. Released v5.1.0.
% 0.11/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.35  % Computer : n022.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Sun May 19 13:21:38 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.13/0.35  % (1487)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.37  % (1490)WARNING: value z3 for option sas not known
% 0.13/0.37  % (1490)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.38  % (1490)First to succeed.
% 0.13/0.38  % (1490)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1487"
% 0.13/0.38  % (1490)Refutation found. Thanks to Tanya!
% 0.13/0.38  % SZS status Theorem for theBenchmark
% 0.13/0.38  % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.38  % (1490)------------------------------
% 0.13/0.38  % (1490)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.13/0.38  % (1490)Termination reason: Refutation
% 0.13/0.38  
% 0.13/0.38  % (1490)Memory used [KB]: 767
% 0.13/0.38  % (1490)Time elapsed: 0.009 s
% 0.13/0.38  % (1490)Instructions burned: 8 (million)
% 0.13/0.38  % (1487)Success in time 0.023 s
%------------------------------------------------------------------------------