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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SWV048+1 : TPTP v8.1.0. Bugfixed v3.3.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 : n003.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:55:21 EDT 2022

% Result   : Theorem 0.20s 0.59s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   31 (  23 unt;   0 def)
%            Number of atoms       :   77 (  43 equ)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :   77 (  31   ~;  18   |;  22   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   2 prp; 0-2 aty)
%            Number of functors    :   19 (  19 usr;  11 con; 0-3 aty)
%            Number of variables   :   11 (  11   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f618,plain,
    $false,
    inference(trivial_inequality_removal,[],[f615]) ).

fof(f615,plain,
    n0 != n0,
    inference(superposition,[],[f443,f523]) ).

fof(f523,plain,
    ! [X0] : n0 = sum(n0,minus(n0,n1),X0),
    inference(backward_demodulation,[],[f332,f481]) ).

fof(f481,plain,
    tptp_minus_1 = minus(n0,n1),
    inference(superposition,[],[f425,f414]) ).

fof(f414,plain,
    n0 = plus(tptp_minus_1,n1),
    inference(definition_unfolding,[],[f298,f306]) ).

fof(f306,plain,
    ! [X0] : succ(X0) = plus(X0,n1),
    inference(cnf_transformation,[],[f29]) ).

fof(f29,axiom,
    ! [X0] : succ(X0) = plus(X0,n1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',succ_plus_1_r) ).

fof(f298,plain,
    n0 = succ(tptp_minus_1),
    inference(cnf_transformation,[],[f28]) ).

fof(f28,axiom,
    n0 = succ(tptp_minus_1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',succ_tptp_minus_1) ).

fof(f425,plain,
    ! [X0] : minus(plus(X0,n1),n1) = X0,
    inference(definition_unfolding,[],[f352,f313,f306]) ).

fof(f313,plain,
    ! [X0] : minus(X0,n1) = pred(X0),
    inference(cnf_transformation,[],[f39]) ).

fof(f39,axiom,
    ! [X0] : minus(X0,n1) = pred(X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pred_minus_1) ).

fof(f352,plain,
    ! [X0] : pred(succ(X0)) = X0,
    inference(cnf_transformation,[],[f40]) ).

fof(f40,axiom,
    ! [X0] : pred(succ(X0)) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pred_succ) ).

fof(f332,plain,
    ! [X0] : n0 = sum(n0,tptp_minus_1,X0),
    inference(cnf_transformation,[],[f106]) ).

fof(f106,plain,
    ! [X0] : n0 = sum(n0,tptp_minus_1,X0),
    inference(rectify,[],[f26]) ).

fof(f26,axiom,
    ! [X22] : n0 = sum(n0,tptp_minus_1,X22),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_plus_base) ).

fof(f443,plain,
    n0 != sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))),
    inference(resolution,[],[f340,f439]) ).

fof(f439,plain,
    ( ~ true
    | n0 != sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) ),
    inference(subsumption_resolution,[],[f438,f401]) ).

fof(f401,plain,
    leq(pv35,minus(n5,n1)),
    inference(cnf_transformation,[],[f174]) ).

fof(f174,plain,
    ( pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
    & leq(pv35,minus(n5,n1))
    & leq(n0,pv35)
    & ( ( n0 = pv78
        & ~ true )
      | ( n0 != pv78
        & ( ~ leq(n0,pv35)
          | n0 != sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
          | ~ leq(pv35,minus(n5,n1))
          | pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) ) ) ) ),
    inference(flattening,[],[f173]) ).

fof(f173,plain,
    ( ( ( n0 = pv78
        & ~ true )
      | ( n0 != pv78
        & ( ~ leq(n0,pv35)
          | n0 != sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
          | ~ leq(pv35,minus(n5,n1))
          | pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) ) ) )
    & leq(pv35,minus(n5,n1))
    & leq(n0,pv35)
    & pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) ),
    inference(ennf_transformation,[],[f54]) ).

fof(f54,negated_conjecture,
    ~ ( ( leq(pv35,minus(n5,n1))
        & leq(n0,pv35)
        & pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) )
     => ( ( n0 = pv78
         => true )
        & ( n0 != pv78
         => ( n0 = sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
            & leq(pv35,minus(n5,n1))
            & pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
            & leq(n0,pv35) ) ) ) ),
    inference(negated_conjecture,[],[f53]) ).

fof(f53,conjecture,
    ( ( leq(pv35,minus(n5,n1))
      & leq(n0,pv35)
      & pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) )
   => ( ( n0 = pv78
       => true )
      & ( n0 != pv78
       => ( n0 = sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
          & leq(pv35,minus(n5,n1))
          & pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
          & leq(n0,pv35) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_norm_0016) ).

fof(f438,plain,
    ( n0 != sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
    | ~ leq(pv35,minus(n5,n1))
    | ~ true ),
    inference(subsumption_resolution,[],[f437,f400]) ).

fof(f400,plain,
    leq(n0,pv35),
    inference(cnf_transformation,[],[f174]) ).

fof(f437,plain,
    ( ~ true
    | ~ leq(n0,pv35)
    | n0 != sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
    | ~ leq(pv35,minus(n5,n1)) ),
    inference(subsumption_resolution,[],[f396,f402]) ).

fof(f402,plain,
    pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)),
    inference(cnf_transformation,[],[f174]) ).

fof(f396,plain,
    ( ~ true
    | pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
    | ~ leq(pv35,minus(n5,n1))
    | ~ leq(n0,pv35)
    | n0 != sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) ),
    inference(cnf_transformation,[],[f174]) ).

fof(f340,plain,
    true,
    inference(cnf_transformation,[],[f51]) ).

fof(f51,axiom,
    true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ttrue) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SWV048+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.07/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.34  % Computer : n003.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 18:57:53 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.20/0.54  % (32391)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.55  % (32392)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.55  % (32407)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.20/0.55  % (32392)Instruction limit reached!
% 0.20/0.55  % (32392)------------------------------
% 0.20/0.55  % (32392)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.55  % (32408)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.20/0.55  % (32400)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.20/0.55  % (32392)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.55  % (32392)Termination reason: Unknown
% 0.20/0.55  % (32392)Termination phase: Function definition elimination
% 0.20/0.55  
% 0.20/0.55  % (32392)Memory used [KB]: 1151
% 0.20/0.55  % (32392)Time elapsed: 0.006 s
% 0.20/0.55  % (32392)Instructions burned: 7 (million)
% 0.20/0.55  % (32392)------------------------------
% 0.20/0.55  % (32392)------------------------------
% 0.20/0.56  % (32399)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.58  % (32389)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.58  % (32407)First to succeed.
% 0.20/0.58  % (32385)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.20/0.59  % (32400)Also succeeded, but the first one will report.
% 0.20/0.59  % (32407)Refutation found. Thanks to Tanya!
% 0.20/0.59  % SZS status Theorem for theBenchmark
% 0.20/0.59  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.59  % (32407)------------------------------
% 0.20/0.59  % (32407)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.59  % (32407)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.59  % (32407)Termination reason: Refutation
% 0.20/0.59  
% 0.20/0.59  % (32407)Memory used [KB]: 1279
% 0.20/0.59  % (32407)Time elapsed: 0.149 s
% 0.20/0.59  % (32407)Instructions burned: 18 (million)
% 0.20/0.59  % (32407)------------------------------
% 0.20/0.59  % (32407)------------------------------
% 0.20/0.59  % (32384)Success in time 0.241 s
%------------------------------------------------------------------------------