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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SWV041+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 : n017.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:19 EDT 2022

% Result   : Theorem 0.17s 0.56s
% Output   : Refutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   49 (  25 unt;   3 typ;   0 def)
%            Number of atoms       :  117 (  23 equ)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :   99 (  28   ~;  14   |;  42   &)
%                                         (   2 <=>;  13  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of types       :    4 (   0 usr;   3 ari)
%            Number of type conns  :    6 (   3   >;   3   *;   0   +;   0  <<)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :   18 (  18 usr;  11 con; 0-3 aty)
%            Number of variables   :   57 (  49   !;   8   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(pred_def_11,type,
    sQ34_eqProxy: ( $int * $int ) > $o ).

tff(pred_def_12,type,
    sQ35_eqProxy: ( $rat * $rat ) > $o ).

tff(pred_def_13,type,
    sQ36_eqProxy: ( $real * $real ) > $o ).

fof(f1254,plain,
    $false,
    inference(subsumption_resolution,[],[f1250,f1159]) ).

fof(f1159,plain,
    leq(n0,tptp_minus_1),
    inference(resolution,[],[f1123,f526]) ).

fof(f526,plain,
    leq(n0,sK5),
    inference(literal_reordering,[],[f277]) ).

fof(f277,plain,
    leq(n0,sK5),
    inference(cnf_transformation,[],[f199]) ).

fof(f199,plain,
    ( geq(minus(n330,n1),n0)
    & leq(n0,sK4)
    & leq(n0,sK5)
    & leq(sK5,minus(n0,n1))
    & init != a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),sK5,sK4)
    & leq(sK4,n2)
    & geq(minus(n410,n1),n0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5])],[f167,f198,f197]) ).

fof(f197,plain,
    ( ? [X0] :
        ( leq(n0,X0)
        & ? [X1] :
            ( leq(n0,X1)
            & leq(X1,minus(n0,n1))
            & init != a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X1,X0) )
        & leq(X0,n2) )
   => ( leq(n0,sK4)
      & ? [X1] :
          ( leq(n0,X1)
          & leq(X1,minus(n0,n1))
          & init != a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X1,sK4) )
      & leq(sK4,n2) ) ),
    introduced(choice_axiom,[]) ).

fof(f198,plain,
    ( ? [X1] :
        ( leq(n0,X1)
        & leq(X1,minus(n0,n1))
        & init != a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X1,sK4) )
   => ( leq(n0,sK5)
      & leq(sK5,minus(n0,n1))
      & init != a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),sK5,sK4) ) ),
    introduced(choice_axiom,[]) ).

fof(f167,plain,
    ( geq(minus(n330,n1),n0)
    & ? [X0] :
        ( leq(n0,X0)
        & ? [X1] :
            ( leq(n0,X1)
            & leq(X1,minus(n0,n1))
            & init != a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X1,X0) )
        & leq(X0,n2) )
    & geq(minus(n410,n1),n0) ),
    inference(flattening,[],[f166]) ).

fof(f166,plain,
    ( ? [X0] :
        ( ? [X1] :
            ( init != a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X1,X0)
            & leq(X1,minus(n0,n1))
            & leq(n0,X1) )
        & leq(X0,n2)
        & leq(n0,X0) )
    & geq(minus(n330,n1),n0)
    & geq(minus(n410,n1),n0) ),
    inference(ennf_transformation,[],[f110]) ).

fof(f110,plain,
    ~ ( ( geq(minus(n330,n1),n0)
        & geq(minus(n410,n1),n0) )
     => ! [X0] :
          ( ( leq(X0,n2)
            & leq(n0,X0) )
         => ! [X1] :
              ( ( leq(X1,minus(n0,n1))
                & leq(n0,X1) )
             => init = a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X1,X0) ) ) ),
    inference(rectify,[],[f54]) ).

fof(f54,negated_conjecture,
    ~ ( ( geq(minus(n330,n1),n0)
        & geq(minus(n410,n1),n0) )
     => ! [X13] :
          ( ( leq(X13,n2)
            & leq(n0,X13) )
         => ! [X17] :
              ( ( leq(X17,minus(n0,n1))
                & leq(n0,X17) )
             => a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X17,X13) = init ) ) ),
    inference(negated_conjecture,[],[f53]) ).

fof(f53,conjecture,
    ( ( geq(minus(n330,n1),n0)
      & geq(minus(n410,n1),n0) )
   => ! [X13] :
        ( ( leq(X13,n2)
          & leq(n0,X13) )
       => ! [X17] :
            ( ( leq(X17,minus(n0,n1))
              & leq(n0,X17) )
           => a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X17,X13) = init ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',gauss_init_0077) ).

fof(f1123,plain,
    ! [X0] :
      ( ~ leq(X0,sK5)
      | leq(X0,tptp_minus_1) ),
    inference(resolution,[],[f1118,f602]) ).

fof(f602,plain,
    ! [X2,X0,X1] :
      ( ~ leq(X2,X1)
      | ~ leq(X0,X2)
      | leq(X0,X1) ),
    inference(literal_reordering,[],[f340]) ).

fof(f340,plain,
    ! [X2,X0,X1] :
      ( leq(X0,X1)
      | ~ leq(X0,X2)
      | ~ leq(X2,X1) ),
    inference(cnf_transformation,[],[f161]) ).

fof(f161,plain,
    ! [X0,X1,X2] :
      ( ~ leq(X0,X2)
      | leq(X0,X1)
      | ~ leq(X2,X1) ),
    inference(flattening,[],[f160]) ).

fof(f160,plain,
    ! [X1,X2,X0] :
      ( leq(X0,X1)
      | ~ leq(X2,X1)
      | ~ leq(X0,X2) ),
    inference(ennf_transformation,[],[f108]) ).

fof(f108,plain,
    ! [X1,X2,X0] :
      ( ( leq(X2,X1)
        & leq(X0,X2) )
     => leq(X0,X1) ),
    inference(rectify,[],[f5]) ).

fof(f5,axiom,
    ! [X0,X2,X1] :
      ( ( leq(X0,X1)
        & leq(X1,X2) )
     => leq(X0,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_leq) ).

fof(f1118,plain,
    leq(sK5,tptp_minus_1),
    inference(backward_demodulation,[],[f559,f852]) ).

fof(f852,plain,
    tptp_minus_1 = minus(n0,n1),
    inference(superposition,[],[f545,f501]) ).

fof(f501,plain,
    n0 = plus(tptp_minus_1,n1),
    inference(literal_reordering,[],[f449]) ).

fof(f449,plain,
    n0 = plus(tptp_minus_1,n1),
    inference(definition_unfolding,[],[f422,f339]) ).

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

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

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

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

fof(f545,plain,
    ! [X0] : minus(plus(X0,n1),n1) = X0,
    inference(literal_reordering,[],[f437]) ).

fof(f437,plain,
    ! [X0] : minus(plus(X0,n1),n1) = X0,
    inference(definition_unfolding,[],[f367,f393,f339]) ).

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

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

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

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

fof(f559,plain,
    leq(sK5,minus(n0,n1)),
    inference(literal_reordering,[],[f276]) ).

fof(f276,plain,
    leq(sK5,minus(n0,n1)),
    inference(cnf_transformation,[],[f199]) ).

fof(f1250,plain,
    ~ leq(n0,tptp_minus_1),
    inference(superposition,[],[f864,f501]) ).

fof(f864,plain,
    ! [X0] : ~ leq(plus(X0,n1),X0),
    inference(resolution,[],[f530,f523]) ).

fof(f523,plain,
    ! [X0] : ~ gt(X0,X0),
    inference(literal_reordering,[],[f334]) ).

fof(f334,plain,
    ! [X0] : ~ gt(X0,X0),
    inference(cnf_transformation,[],[f3]) ).

fof(f3,axiom,
    ! [X0] : ~ gt(X0,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',irreflexivity_gt) ).

fof(f530,plain,
    ! [X0,X1] :
      ( gt(plus(X0,n1),X1)
      | ~ leq(X1,X0) ),
    inference(literal_reordering,[],[f427]) ).

fof(f427,plain,
    ! [X0,X1] :
      ( ~ leq(X1,X0)
      | gt(plus(X0,n1),X1) ),
    inference(definition_unfolding,[],[f280,f339]) ).

fof(f280,plain,
    ! [X0,X1] :
      ( gt(succ(X0),X1)
      | ~ leq(X1,X0) ),
    inference(cnf_transformation,[],[f200]) ).

fof(f200,plain,
    ! [X0,X1] :
      ( ( leq(X1,X0)
        | ~ gt(succ(X0),X1) )
      & ( gt(succ(X0),X1)
        | ~ leq(X1,X0) ) ),
    inference(nnf_transformation,[],[f129]) ).

fof(f129,plain,
    ! [X0,X1] :
      ( leq(X1,X0)
    <=> gt(succ(X0),X1) ),
    inference(rectify,[],[f13]) ).

fof(f13,axiom,
    ! [X1,X0] :
      ( leq(X0,X1)
    <=> gt(succ(X1),X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',leq_succ_gt_equiv) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem    : SWV041+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.00/0.11  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.11/0.32  % Computer : n017.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 300
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Tue Aug 30 18:21:20 EDT 2022
% 0.11/0.32  % CPUTime    : 
% 0.17/0.47  % (696)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.17/0.48  % (705)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.17/0.49  % (713)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.17/0.49  % (714)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.17/0.49  % (706)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.17/0.49  % (700)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.17/0.49  % (699)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.17/0.50  % (697)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.17/0.51  % (692)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.17/0.51  % (691)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.17/0.51  TRYING [1]
% 0.17/0.51  % (701)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.17/0.51  % (693)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.17/0.52  % (697)Instruction limit reached!
% 0.17/0.52  % (697)------------------------------
% 0.17/0.52  % (697)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.17/0.52  % (697)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.17/0.52  % (697)Termination reason: Unknown
% 0.17/0.52  % (697)Termination phase: Property scanning
% 0.17/0.52  
% 0.17/0.52  % (697)Memory used [KB]: 1151
% 0.17/0.52  % (697)Time elapsed: 0.012 s
% 0.17/0.52  % (697)Instructions burned: 8 (million)
% 0.17/0.52  % (697)------------------------------
% 0.17/0.52  % (697)------------------------------
% 0.17/0.52  % (711)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.17/0.53  % (712)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.17/0.53  % (698)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.17/0.53  % (698)Instruction limit reached!
% 0.17/0.53  % (698)------------------------------
% 0.17/0.53  % (698)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.17/0.53  % (698)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.17/0.53  % (698)Termination reason: Unknown
% 0.17/0.53  % (698)Termination phase: Preprocessing 2
% 0.17/0.53  
% 0.17/0.53  % (698)Memory used [KB]: 1023
% 0.17/0.53  % (698)Time elapsed: 0.003 s
% 0.17/0.53  % (698)Instructions burned: 2 (million)
% 0.17/0.53  % (698)------------------------------
% 0.17/0.53  % (698)------------------------------
% 0.17/0.53  TRYING [2]
% 0.17/0.53  % (695)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.17/0.53  % (694)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.17/0.54  % (690)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.17/0.54  % (696)Instruction limit reached!
% 0.17/0.54  % (696)------------------------------
% 0.17/0.54  % (696)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.17/0.54  % (696)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.17/0.54  % (696)Termination reason: Unknown
% 0.17/0.54  % (696)Termination phase: Finite model building SAT solving
% 0.17/0.54  
% 0.17/0.54  % (696)Memory used [KB]: 7931
% 0.17/0.54  % (696)Time elapsed: 0.161 s
% 0.17/0.54  % (696)Instructions burned: 51 (million)
% 0.17/0.54  % (696)------------------------------
% 0.17/0.54  % (696)------------------------------
% 0.17/0.54  % (709)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.17/0.54  % (702)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.17/0.55  % (703)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.17/0.55  % (718)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 0.17/0.55  % (705)First to succeed.
% 0.17/0.55  % (707)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.17/0.55  % (716)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.17/0.55  % (719)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.17/0.55  % (710)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.17/0.56  % (705)Refutation found. Thanks to Tanya!
% 0.17/0.56  % SZS status Theorem for theBenchmark
% 0.17/0.56  % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.56  % (705)------------------------------
% 0.17/0.56  % (705)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.17/0.56  % (705)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.17/0.56  % (705)Termination reason: Refutation
% 0.17/0.56  
% 0.17/0.56  % (705)Memory used [KB]: 6524
% 0.17/0.56  % (705)Time elapsed: 0.034 s
% 0.17/0.56  % (705)Instructions burned: 38 (million)
% 0.17/0.56  % (705)------------------------------
% 0.17/0.56  % (705)------------------------------
% 0.17/0.56  % (689)Success in time 0.228 s
%------------------------------------------------------------------------------