TSTP Solution File: NUM835+1 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : NUM835+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s

% Computer : n023.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:06:54 EDT 2022

% Result   : Theorem 0.20s 0.52s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   24 (   6 unt;   0 def)
%            Number of atoms       :   79 (  65 equ)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :   85 (  30   ~;  35   |;  16   &)
%                                         (   2 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   57 (  39   !;  18   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f237,plain,
    $false,
    inference(subsumption_resolution,[],[f236,f156]) ).

fof(f156,plain,
    vd165 != vd151,
    inference(cnf_transformation,[],[f122]) ).

fof(f122,plain,
    ( ! [X0] : vd165 != vplus(vd151,X0)
    & vd165 != vd151
    & ! [X1] : vd151 != vplus(vd165,X1) ),
    inference(rectify,[],[f83]) ).

fof(f83,plain,
    ( ! [X1] : vd165 != vplus(vd151,X1)
    & vd165 != vd151
    & ! [X0] : vd151 != vplus(vd165,X0) ),
    inference(ennf_transformation,[],[f58]) ).

fof(f58,plain,
    ~ ( vd165 = vd151
      | ? [X0] : vd151 = vplus(vd165,X0)
      | ? [X1] : vd165 = vplus(vd151,X1) ),
    inference(rectify,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ ( ? [X1] : vd151 = vplus(vd165,X1)
      | ? [X0] : vd165 = vplus(vd151,X0)
      | vd165 = vd151 ),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    ( ? [X1] : vd151 = vplus(vd165,X1)
    | ? [X0] : vd165 = vplus(vd151,X0)
    | vd165 = vd151 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','dis(case_distinction(conseq(110)))') ).

fof(f236,plain,
    vd165 = vd151,
    inference(subsumption_resolution,[],[f235,f157]) ).

fof(f157,plain,
    ! [X0] : vd165 != vplus(vd151,X0),
    inference(cnf_transformation,[],[f122]) ).

fof(f235,plain,
    ( vd165 = vplus(vd151,sK1(vd151,vd165))
    | vd165 = vd151 ),
    inference(equality_resolution,[],[f230]) ).

fof(f230,plain,
    ! [X1] :
      ( vd151 != X1
      | vd165 = vplus(X1,sK1(X1,vd165))
      | vd165 = X1 ),
    inference(superposition,[],[f155,f228]) ).

fof(f228,plain,
    ! [X2,X1] :
      ( vplus(X2,sK0(X1,X2)) = X1
      | vplus(X1,sK1(X1,X2)) = X2
      | X1 = X2 ),
    inference(resolution,[],[f149,f211]) ).

fof(f211,plain,
    ! [X1] : m(X1),
    inference(equality_resolution,[],[f147]) ).

fof(f147,plain,
    ! [X0,X1,X4] :
      ( m(X1)
      | vplus(X1,X4) != X0 ),
    inference(cnf_transformation,[],[f120]) ).

fof(f120,plain,
    ! [X0,X1] :
      ( ( X0 = X1
        | vplus(X1,sK0(X0,X1)) = X0
        | vplus(X0,sK1(X0,X1)) = X1
        | ~ m(X1) )
      & ( m(X1)
        | ( X0 != X1
          & ! [X4] : vplus(X1,X4) != X0
          & ! [X5] : vplus(X0,X5) != X1 ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f117,f119,f118]) ).

fof(f118,plain,
    ! [X0,X1] :
      ( ? [X2] : vplus(X1,X2) = X0
     => vplus(X1,sK0(X0,X1)) = X0 ),
    introduced(choice_axiom,[]) ).

fof(f119,plain,
    ! [X0,X1] :
      ( ? [X3] : vplus(X0,X3) = X1
     => vplus(X0,sK1(X0,X1)) = X1 ),
    introduced(choice_axiom,[]) ).

fof(f117,plain,
    ! [X0,X1] :
      ( ( X0 = X1
        | ? [X2] : vplus(X1,X2) = X0
        | ? [X3] : vplus(X0,X3) = X1
        | ~ m(X1) )
      & ( m(X1)
        | ( X0 != X1
          & ! [X4] : vplus(X1,X4) != X0
          & ! [X5] : vplus(X0,X5) != X1 ) ) ),
    inference(rectify,[],[f116]) ).

fof(f116,plain,
    ! [X1,X0] :
      ( ( X0 = X1
        | ? [X2] : vplus(X0,X2) = X1
        | ? [X3] : vplus(X1,X3) = X0
        | ~ m(X0) )
      & ( m(X0)
        | ( X0 != X1
          & ! [X2] : vplus(X0,X2) != X1
          & ! [X3] : vplus(X1,X3) != X0 ) ) ),
    inference(flattening,[],[f115]) ).

fof(f115,plain,
    ! [X1,X0] :
      ( ( X0 = X1
        | ? [X2] : vplus(X0,X2) = X1
        | ? [X3] : vplus(X1,X3) = X0
        | ~ m(X0) )
      & ( m(X0)
        | ( X0 != X1
          & ! [X2] : vplus(X0,X2) != X1
          & ! [X3] : vplus(X1,X3) != X0 ) ) ),
    inference(nnf_transformation,[],[f65]) ).

fof(f65,plain,
    ! [X1,X0] :
      ( ( X0 = X1
        | ? [X2] : vplus(X0,X2) = X1
        | ? [X3] : vplus(X1,X3) = X0 )
    <=> m(X0) ),
    inference(rectify,[],[f21]) ).

fof(f21,axiom,
    ! [X5,X4] :
      ( ( ? [X6] : vplus(X5,X6) = X4
        | X4 = X5
        | ? [X7] : vplus(X4,X7) = X5 )
    <=> m(X5) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','def(cond(conseq(105), 0), 1)') ).

fof(f149,plain,
    ! [X0,X1] :
      ( ~ m(X1)
      | vplus(X0,sK1(X0,X1)) = X1
      | vplus(X1,sK0(X0,X1)) = X0
      | X0 = X1 ),
    inference(cnf_transformation,[],[f120]) ).

fof(f155,plain,
    ! [X1] : vd151 != vplus(vd165,X1),
    inference(cnf_transformation,[],[f122]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : NUM835+1 : TPTP v8.1.0. Released v4.1.0.
% 0.12/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.35  % Computer : n023.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   : Tue Aug 30 09:20:50 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.20/0.51  % (22158)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.51  % (22175)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.20/0.51  % (22157)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.51  % (22149)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.20/0.51  % (22166)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.20/0.51  % (22159)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.51  % (22149)First to succeed.
% 0.20/0.52  % (22149)Refutation found. Thanks to Tanya!
% 0.20/0.52  % SZS status Theorem for theBenchmark
% 0.20/0.52  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.52  % (22149)------------------------------
% 0.20/0.52  % (22149)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52  % (22149)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52  % (22149)Termination reason: Refutation
% 0.20/0.52  
% 0.20/0.52  % (22149)Memory used [KB]: 1023
% 0.20/0.52  % (22149)Time elapsed: 0.105 s
% 0.20/0.52  % (22149)Instructions burned: 4 (million)
% 0.20/0.52  % (22149)------------------------------
% 0.20/0.52  % (22149)------------------------------
% 0.20/0.52  % (22144)Success in time 0.16 s
%------------------------------------------------------------------------------