TSTP Solution File: GEO498+1 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : GEO498+1 : TPTP v8.1.0. Released v7.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 : n006.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 16:10:36 EDT 2022

% Result   : Theorem 0.19s 0.52s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   18 (  11 unt;   0 def)
%            Number of atoms       :   35 (  34 equ)
%            Maximal formula atoms :    6 (   1 avg)
%            Number of connectives :   31 (  14   ~;   6   |;  10   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   32 (  20   !;  12   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f154,plain,
    $false,
    inference(subsumption_resolution,[],[f153,f139]) ).

fof(f139,plain,
    sK0 != sK3,
    inference(cnf_transformation,[],[f129]) ).

fof(f129,plain,
    ( s(sK2,sK3) = sK1
    & sK1 = s(sK2,sK0)
    & sK0 != sK3 ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f127,f128]) ).

fof(f128,plain,
    ( ? [X0,X1,X2,X3] :
        ( s(X2,X3) = X1
        & s(X2,X0) = X1
        & X0 != X3 )
   => ( s(sK2,sK3) = sK1
      & sK1 = s(sK2,sK0)
      & sK0 != sK3 ) ),
    introduced(choice_axiom,[]) ).

fof(f127,plain,
    ? [X0,X1,X2,X3] :
      ( s(X2,X3) = X1
      & s(X2,X0) = X1
      & X0 != X3 ),
    inference(rectify,[],[f122]) ).

fof(f122,plain,
    ? [X1,X2,X0,X3] :
      ( s(X0,X3) = X2
      & s(X0,X1) = X2
      & X1 != X3 ),
    inference(ennf_transformation,[],[f112]) ).

fof(f112,plain,
    ~ ! [X1,X2,X0,X3] :
        ( X1 = X3
        | s(X0,X1) != X2
        | s(X0,X3) != X2 ),
    inference(rectify,[],[f101]) ).

fof(f101,negated_conjecture,
    ~ ! [X11,X15,X26,X12] :
        ( s(X11,X15) != X26
        | X12 = X15
        | s(X11,X12) != X26 ),
    inference(negated_conjecture,[],[f100]) ).

fof(f100,conjecture,
    ! [X11,X15,X26,X12] :
      ( s(X11,X15) != X26
      | X12 = X15
      | s(X11,X12) != X26 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz7_8) ).

fof(f153,plain,
    sK0 = sK3,
    inference(forward_demodulation,[],[f152,f150]) ).

fof(f150,plain,
    s(sK2,sK1) = sK0,
    inference(superposition,[],[f143,f140]) ).

fof(f140,plain,
    sK1 = s(sK2,sK0),
    inference(cnf_transformation,[],[f129]) ).

fof(f143,plain,
    ! [X0,X1] : s(X1,s(X1,X0)) = X0,
    inference(cnf_transformation,[],[f131]) ).

fof(f131,plain,
    ! [X0,X1] : s(X1,s(X1,X0)) = X0,
    inference(rectify,[],[f120]) ).

fof(f120,plain,
    ! [X1,X0] : s(X0,s(X0,X1)) = X1,
    inference(rectify,[],[f99]) ).

fof(f99,axiom,
    ! [X11,X12] : s(X11,s(X11,X12)) = X12,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz7_7) ).

fof(f152,plain,
    s(sK2,sK1) = sK3,
    inference(superposition,[],[f143,f141]) ).

fof(f141,plain,
    s(sK2,sK3) = sK1,
    inference(cnf_transformation,[],[f129]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem    : GEO498+1 : TPTP v8.1.0. Released v7.0.0.
% 0.04/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.12/0.34  % Computer : n006.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Mon Aug 29 21:53:10 EDT 2022
% 0.12/0.34  % CPUTime    : 
% 0.19/0.50  % (19051)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.51  % (19053)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.19/0.51  % (19068)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 0.19/0.51  % (19051)First to succeed.
% 0.19/0.52  % (19063)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.52  % (19051)Refutation found. Thanks to Tanya!
% 0.19/0.52  % SZS status Theorem for theBenchmark
% 0.19/0.52  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.52  % (19051)------------------------------
% 0.19/0.52  % (19051)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52  % (19051)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52  % (19051)Termination reason: Refutation
% 0.19/0.52  
% 0.19/0.52  % (19051)Memory used [KB]: 6140
% 0.19/0.52  % (19051)Time elapsed: 0.108 s
% 0.19/0.52  % (19051)Instructions burned: 3 (million)
% 0.19/0.52  % (19051)------------------------------
% 0.19/0.52  % (19051)------------------------------
% 0.19/0.52  % (19046)Success in time 0.17 s
%------------------------------------------------------------------------------