TSTP Solution File: SWV009-1 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SWV009-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s

% Computer : n009.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 : Wed Aug 31 18:43:48 EDT 2022

% Result   : Unsatisfiable 1.79s 0.58s
% Output   : Refutation 1.79s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   21 (   8 unt;   0 def)
%            Number of atoms       :   49 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   56 (  28   ~;  28   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-1 aty)
%            Number of variables   :   13 (  13   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f26,plain,
    $false,
    inference(subsumption_resolution,[],[f25,f14]) ).

fof(f14,plain,
    ~ less_or_equal(q,j),
    inference(subsumption_resolution,[],[f13,f3]) ).

fof(f3,axiom,
    less_or_equal(m,p),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).

fof(f13,plain,
    ( ~ less_or_equal(q,j)
    | ~ less_or_equal(m,p) ),
    inference(subsumption_resolution,[],[f11,f9]) ).

fof(f9,axiom,
    ~ less_or_equal(a(p),a(q)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_9) ).

fof(f11,plain,
    ( ~ less_or_equal(q,j)
    | less_or_equal(a(p),a(q))
    | ~ less_or_equal(m,p) ),
    inference(resolution,[],[f7,f4]) ).

fof(f4,axiom,
    less_or_equal(p,q),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).

fof(f7,axiom,
    ! [X0,X1] :
      ( ~ less_or_equal(X0,X1)
      | less_or_equal(a(X0),a(X1))
      | ~ less_or_equal(X1,j)
      | ~ less_or_equal(m,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).

fof(f25,plain,
    less_or_equal(q,j),
    inference(subsumption_resolution,[],[f24,f9]) ).

fof(f24,plain,
    ( less_or_equal(a(p),a(q))
    | less_or_equal(q,j) ),
    inference(resolution,[],[f22,f5]) ).

fof(f5,axiom,
    less_or_equal(q,n),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).

fof(f22,plain,
    ! [X0] :
      ( ~ less_or_equal(X0,n)
      | less_or_equal(X0,j)
      | less_or_equal(a(p),a(X0)) ),
    inference(resolution,[],[f20,f1]) ).

fof(f1,axiom,
    ! [X0,X1] :
      ( less(X1,X0)
      | less_or_equal(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).

fof(f20,plain,
    ! [X0] :
      ( ~ less(j,X0)
      | less_or_equal(a(p),a(X0))
      | ~ less_or_equal(X0,n) ),
    inference(subsumption_resolution,[],[f19,f18]) ).

fof(f18,plain,
    ~ less_or_equal(i,p),
    inference(subsumption_resolution,[],[f17,f9]) ).

fof(f17,plain,
    ( less_or_equal(a(p),a(q))
    | ~ less_or_equal(i,p) ),
    inference(resolution,[],[f15,f4]) ).

fof(f15,plain,
    ! [X0] :
      ( ~ less_or_equal(X0,q)
      | ~ less_or_equal(i,X0)
      | less_or_equal(a(X0),a(q)) ),
    inference(resolution,[],[f8,f5]) ).

fof(f8,axiom,
    ! [X0,X1] :
      ( ~ less_or_equal(X1,n)
      | ~ less_or_equal(X0,X1)
      | less_or_equal(a(X0),a(X1))
      | ~ less_or_equal(i,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_8) ).

fof(f19,plain,
    ! [X0] :
      ( ~ less_or_equal(X0,n)
      | less_or_equal(i,p)
      | less_or_equal(a(p),a(X0))
      | ~ less(j,X0) ),
    inference(resolution,[],[f16,f1]) ).

fof(f16,plain,
    ! [X0] :
      ( ~ less(p,i)
      | ~ less(j,X0)
      | ~ less_or_equal(X0,n)
      | less_or_equal(a(p),a(X0)) ),
    inference(resolution,[],[f6,f3]) ).

fof(f6,axiom,
    ! [X0,X1] :
      ( ~ less_or_equal(m,X0)
      | ~ less(X0,i)
      | ~ less(j,X1)
      | ~ less_or_equal(X1,n)
      | less_or_equal(a(X0),a(X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SWV009-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.34  % Computer : n009.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   : Tue Aug 30 20:29:05 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 1.54/0.56  % (9422)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 1.54/0.57  % (9422)First to succeed.
% 1.79/0.58  % (9422)Refutation found. Thanks to Tanya!
% 1.79/0.58  % SZS status Unsatisfiable for theBenchmark
% 1.79/0.58  % SZS output start Proof for theBenchmark
% See solution above
% 1.79/0.58  % (9422)------------------------------
% 1.79/0.58  % (9422)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.79/0.58  % (9422)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.79/0.58  % (9422)Termination reason: Refutation
% 1.79/0.58  
% 1.79/0.58  % (9422)Memory used [KB]: 1279
% 1.79/0.58  % (9422)Time elapsed: 0.144 s
% 1.79/0.58  % (9422)Instructions burned: 2 (million)
% 1.79/0.58  % (9422)------------------------------
% 1.79/0.58  % (9422)------------------------------
% 1.79/0.58  % (9415)Success in time 0.229 s
%------------------------------------------------------------------------------