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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : CSR023+1 : TPTP v8.1.0. Bugfixed v3.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 : n010.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 15:58:33 EDT 2022

% Result   : Theorem 0.19s 0.53s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   55 (  17 unt;   0 def)
%            Number of atoms       :  229 ( 104 equ)
%            Maximal formula atoms :   16 (   4 avg)
%            Number of connectives :  258 (  84   ~;  90   |;  72   &)
%                                         (  10 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   1 prp; 0-3 aty)
%            Number of functors    :   10 (  10 usr;   9 con; 0-2 aty)
%            Number of variables   :   95 (  95   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f722,plain,
    $false,
    inference(subsumption_resolution,[],[f720,f301]) ).

fof(f301,plain,
    ~ holdsAt(spinning,n3),
    inference(cnf_transformation,[],[f72]) ).

fof(f72,plain,
    ~ holdsAt(spinning,n3),
    inference(flattening,[],[f49]) ).

fof(f49,negated_conjecture,
    ~ holdsAt(spinning,n3),
    inference(negated_conjecture,[],[f48]) ).

fof(f48,conjecture,
    holdsAt(spinning,n3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',spinning_3) ).

fof(f720,plain,
    holdsAt(spinning,n3),
    inference(resolution,[],[f609,f491]) ).

fof(f491,plain,
    initiates(pull,spinning,n2),
    inference(resolution,[],[f264,f431]) ).

fof(f431,plain,
    sP2(spinning,n2,pull),
    inference(resolution,[],[f315,f347]) ).

fof(f347,plain,
    happens(push,n2),
    inference(resolution,[],[f204,f307]) ).

fof(f307,plain,
    sP1(n2,push),
    inference(equality_resolution,[],[f306]) ).

fof(f306,plain,
    ! [X1] :
      ( sP1(n2,X1)
      | push != X1 ),
    inference(equality_resolution,[],[f197]) ).

fof(f197,plain,
    ! [X0,X1] :
      ( sP1(X0,X1)
      | n2 != X0
      | push != X1 ),
    inference(cnf_transformation,[],[f122]) ).

fof(f122,plain,
    ! [X0,X1] :
      ( ( sP1(X0,X1)
        | ( ( n0 != X0
            | push != X1 )
          & ( pull != X1
            | n2 != X0 )
          & ( n2 != X0
            | push != X1 )
          & ~ sP0(X1,X0) ) )
      & ( ( n0 = X0
          & push = X1 )
        | ( pull = X1
          & n2 = X0 )
        | ( n2 = X0
          & push = X1 )
        | sP0(X1,X0)
        | ~ sP1(X0,X1) ) ),
    inference(flattening,[],[f121]) ).

fof(f121,plain,
    ! [X0,X1] :
      ( ( sP1(X0,X1)
        | ( ( n0 != X0
            | push != X1 )
          & ( pull != X1
            | n2 != X0 )
          & ( n2 != X0
            | push != X1 )
          & ~ sP0(X1,X0) ) )
      & ( ( n0 = X0
          & push = X1 )
        | ( pull = X1
          & n2 = X0 )
        | ( n2 = X0
          & push = X1 )
        | sP0(X1,X0)
        | ~ sP1(X0,X1) ) ),
    inference(nnf_transformation,[],[f105]) ).

fof(f105,plain,
    ! [X0,X1] :
      ( sP1(X0,X1)
    <=> ( ( n0 = X0
          & push = X1 )
        | ( pull = X1
          & n2 = X0 )
        | ( n2 = X0
          & push = X1 )
        | sP0(X1,X0) ) ),
    introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).

fof(f204,plain,
    ! [X0,X1] :
      ( ~ sP1(X1,X0)
      | happens(X0,X1) ),
    inference(cnf_transformation,[],[f127]) ).

fof(f127,plain,
    ! [X0,X1] :
      ( ( happens(X0,X1)
        | ~ sP1(X1,X0) )
      & ( sP1(X1,X0)
        | ~ happens(X0,X1) ) ),
    inference(rectify,[],[f126]) ).

fof(f126,plain,
    ! [X1,X0] :
      ( ( happens(X1,X0)
        | ~ sP1(X0,X1) )
      & ( sP1(X0,X1)
        | ~ happens(X1,X0) ) ),
    inference(nnf_transformation,[],[f106]) ).

fof(f106,plain,
    ! [X1,X0] :
      ( happens(X1,X0)
    <=> sP1(X0,X1) ),
    inference(definition_folding,[],[f51,f105,f104]) ).

fof(f104,plain,
    ! [X1,X0] :
      ( sP0(X1,X0)
    <=> ( pull = X1
        & n1 = X0 ) ),
    introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).

fof(f51,plain,
    ! [X1,X0] :
      ( happens(X1,X0)
    <=> ( ( n0 = X0
          & push = X1 )
        | ( pull = X1
          & n2 = X0 )
        | ( n2 = X0
          & push = X1 )
        | ( pull = X1
          & n1 = X0 ) ) ),
    inference(rectify,[],[f16]) ).

fof(f16,axiom,
    ! [X4,X3] :
      ( happens(X3,X4)
    <=> ( ( n1 = X4
          & pull = X3 )
        | ( push = X3
          & n0 = X4 )
        | ( pull = X3
          & n2 = X4 )
        | ( push = X3
          & n2 = X4 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',happens_all_defn) ).

fof(f315,plain,
    ! [X1] :
      ( ~ happens(push,X1)
      | sP2(spinning,X1,pull) ),
    inference(equality_resolution,[],[f314]) ).

fof(f314,plain,
    ! [X2,X1] :
      ( sP2(spinning,X1,X2)
      | ~ happens(push,X1)
      | pull != X2 ),
    inference(equality_resolution,[],[f260]) ).

fof(f260,plain,
    ! [X2,X0,X1] :
      ( sP2(X0,X1,X2)
      | spinning != X0
      | ~ happens(push,X1)
      | pull != X2 ),
    inference(cnf_transformation,[],[f158]) ).

fof(f158,plain,
    ! [X0,X1,X2] :
      ( ( sP2(X0,X1,X2)
        | spinning != X0
        | ~ happens(push,X1)
        | pull != X2 )
      & ( ( spinning = X0
          & happens(push,X1)
          & pull = X2 )
        | ~ sP2(X0,X1,X2) ) ),
    inference(rectify,[],[f157]) ).

fof(f157,plain,
    ! [X1,X0,X2] :
      ( ( sP2(X1,X0,X2)
        | spinning != X1
        | ~ happens(push,X0)
        | pull != X2 )
      & ( ( spinning = X1
          & happens(push,X0)
          & pull = X2 )
        | ~ sP2(X1,X0,X2) ) ),
    inference(flattening,[],[f156]) ).

fof(f156,plain,
    ! [X1,X0,X2] :
      ( ( sP2(X1,X0,X2)
        | spinning != X1
        | ~ happens(push,X0)
        | pull != X2 )
      & ( ( spinning = X1
          & happens(push,X0)
          & pull = X2 )
        | ~ sP2(X1,X0,X2) ) ),
    inference(nnf_transformation,[],[f107]) ).

fof(f107,plain,
    ! [X1,X0,X2] :
      ( sP2(X1,X0,X2)
    <=> ( spinning = X1
        & happens(push,X0)
        & pull = X2 ) ),
    introduced(predicate_definition_introduction,[new_symbols(naming,[sP2])]) ).

fof(f264,plain,
    ! [X2,X0,X1] :
      ( ~ sP2(X0,X2,X1)
      | initiates(X1,X0,X2) ),
    inference(cnf_transformation,[],[f161]) ).

fof(f161,plain,
    ! [X0,X1,X2] :
      ( ( initiates(X1,X0,X2)
        | ( ( happens(pull,X2)
            | push != X1
            | forwards != X0 )
          & ~ sP3(X1,X2,X0)
          & ~ sP2(X0,X2,X1) ) )
      & ( ( ~ happens(pull,X2)
          & push = X1
          & forwards = X0 )
        | sP3(X1,X2,X0)
        | sP2(X0,X2,X1)
        | ~ initiates(X1,X0,X2) ) ),
    inference(rectify,[],[f160]) ).

fof(f160,plain,
    ! [X1,X2,X0] :
      ( ( initiates(X2,X1,X0)
        | ( ( happens(pull,X0)
            | push != X2
            | forwards != X1 )
          & ~ sP3(X2,X0,X1)
          & ~ sP2(X1,X0,X2) ) )
      & ( ( ~ happens(pull,X0)
          & push = X2
          & forwards = X1 )
        | sP3(X2,X0,X1)
        | sP2(X1,X0,X2)
        | ~ initiates(X2,X1,X0) ) ),
    inference(flattening,[],[f159]) ).

fof(f159,plain,
    ! [X1,X2,X0] :
      ( ( initiates(X2,X1,X0)
        | ( ( happens(pull,X0)
            | push != X2
            | forwards != X1 )
          & ~ sP3(X2,X0,X1)
          & ~ sP2(X1,X0,X2) ) )
      & ( ( ~ happens(pull,X0)
          & push = X2
          & forwards = X1 )
        | sP3(X2,X0,X1)
        | sP2(X1,X0,X2)
        | ~ initiates(X2,X1,X0) ) ),
    inference(nnf_transformation,[],[f109]) ).

fof(f109,plain,
    ! [X1,X2,X0] :
      ( initiates(X2,X1,X0)
    <=> ( ( ~ happens(pull,X0)
          & push = X2
          & forwards = X1 )
        | sP3(X2,X0,X1)
        | sP2(X1,X0,X2) ) ),
    inference(definition_folding,[],[f60,f108,f107]) ).

fof(f108,plain,
    ! [X2,X0,X1] :
      ( sP3(X2,X0,X1)
    <=> ( pull = X2
        & ~ happens(push,X0)
        & backwards = X1 ) ),
    introduced(predicate_definition_introduction,[new_symbols(naming,[sP3])]) ).

fof(f60,plain,
    ! [X1,X2,X0] :
      ( initiates(X2,X1,X0)
    <=> ( ( ~ happens(pull,X0)
          & push = X2
          & forwards = X1 )
        | ( pull = X2
          & ~ happens(push,X0)
          & backwards = X1 )
        | ( spinning = X1
          & happens(push,X0)
          & pull = X2 ) ) ),
    inference(rectify,[],[f13]) ).

fof(f13,axiom,
    ! [X4,X1,X3] :
      ( ( ( pull = X3
          & backwards = X1
          & ~ happens(push,X4) )
        | ( forwards = X1
          & push = X3
          & ~ happens(pull,X4) )
        | ( spinning = X1
          & pull = X3
          & happens(push,X4) ) )
    <=> initiates(X3,X1,X4) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',initiates_all_defn) ).

fof(f609,plain,
    ! [X2] :
      ( ~ initiates(pull,X2,n2)
      | holdsAt(X2,n3) ),
    inference(forward_demodulation,[],[f608,f242]) ).

fof(f242,plain,
    n3 = plus(n1,n2),
    inference(cnf_transformation,[],[f26]) ).

fof(f26,axiom,
    n3 = plus(n1,n2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus1_2) ).

fof(f608,plain,
    ! [X2] :
      ( ~ initiates(pull,X2,n2)
      | holdsAt(X2,plus(n1,n2)) ),
    inference(forward_demodulation,[],[f604,f215]) ).

fof(f215,plain,
    ! [X0,X1] : plus(X1,X0) = plus(X0,X1),
    inference(cnf_transformation,[],[f80]) ).

fof(f80,plain,
    ! [X0,X1] : plus(X1,X0) = plus(X0,X1),
    inference(rectify,[],[f31]) ).

fof(f31,axiom,
    ! [X8,X9] : plus(X8,X9) = plus(X9,X8),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_plus) ).

fof(f604,plain,
    ! [X2] :
      ( holdsAt(X2,plus(n2,n1))
      | ~ initiates(pull,X2,n2) ),
    inference(resolution,[],[f228,f346]) ).

fof(f346,plain,
    happens(pull,n2),
    inference(resolution,[],[f204,f305]) ).

fof(f305,plain,
    sP1(n2,pull),
    inference(equality_resolution,[],[f304]) ).

fof(f304,plain,
    ! [X0] :
      ( sP1(X0,pull)
      | n2 != X0 ),
    inference(equality_resolution,[],[f198]) ).

fof(f198,plain,
    ! [X0,X1] :
      ( sP1(X0,X1)
      | pull != X1
      | n2 != X0 ),
    inference(cnf_transformation,[],[f122]) ).

fof(f228,plain,
    ! [X2,X0,X1] :
      ( ~ happens(X0,X2)
      | holdsAt(X1,plus(X2,n1))
      | ~ initiates(X0,X1,X2) ),
    inference(cnf_transformation,[],[f137]) ).

fof(f137,plain,
    ! [X0,X1,X2] :
      ( ~ initiates(X0,X1,X2)
      | holdsAt(X1,plus(X2,n1))
      | ~ happens(X0,X2) ),
    inference(rectify,[],[f88]) ).

fof(f88,plain,
    ! [X2,X0,X1] :
      ( ~ initiates(X2,X0,X1)
      | holdsAt(X0,plus(X1,n1))
      | ~ happens(X2,X1) ),
    inference(flattening,[],[f87]) ).

fof(f87,plain,
    ! [X2,X1,X0] :
      ( holdsAt(X0,plus(X1,n1))
      | ~ happens(X2,X1)
      | ~ initiates(X2,X0,X1) ),
    inference(ennf_transformation,[],[f70]) ).

fof(f70,plain,
    ! [X2,X1,X0] :
      ( ( happens(X2,X1)
        & initiates(X2,X0,X1) )
     => holdsAt(X0,plus(X1,n1)) ),
    inference(rectify,[],[f9]) ).

fof(f9,axiom,
    ! [X1,X4,X3] :
      ( ( happens(X3,X4)
        & initiates(X3,X1,X4) )
     => holdsAt(X1,plus(X4,n1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',happens_holds) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11  % Problem    : CSR023+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.09/0.12  % 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.33  % Computer : n010.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Mon Aug 29 17:33:29 EDT 2022
% 0.13/0.33  % CPUTime    : 
% 0.19/0.50  % (9536)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.19/0.50  % (9528)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.19/0.51  % (9520)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.51  % (9539)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.19/0.51  % (9518)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.19/0.51  % (9514)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.19/0.51  % (9516)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.52  % (9520)Instruction limit reached!
% 0.19/0.52  % (9520)------------------------------
% 0.19/0.52  % (9520)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52  % (9520)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52  % (9520)Termination reason: Unknown
% 0.19/0.52  % (9520)Termination phase: Saturation
% 0.19/0.52  
% 0.19/0.52  % (9520)Memory used [KB]: 5628
% 0.19/0.52  % (9520)Time elapsed: 0.075 s
% 0.19/0.52  % (9520)Instructions burned: 7 (million)
% 0.19/0.52  % (9520)------------------------------
% 0.19/0.52  % (9520)------------------------------
% 0.19/0.52  % (9513)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.19/0.52  % (9512)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.19/0.52  % (9529)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.19/0.52  % (9515)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.19/0.52  % (9534)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.19/0.52  % (9526)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.52  % (9531)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.19/0.53  % (9528)First to succeed.
% 0.19/0.53  % (9541)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.19/0.53  % (9528)Refutation found. Thanks to Tanya!
% 0.19/0.53  % SZS status Theorem for theBenchmark
% 0.19/0.53  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.53  % (9528)------------------------------
% 0.19/0.53  % (9528)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53  % (9528)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53  % (9528)Termination reason: Refutation
% 0.19/0.53  
% 0.19/0.53  % (9528)Memory used [KB]: 1279
% 0.19/0.53  % (9528)Time elapsed: 0.088 s
% 0.19/0.53  % (9528)Instructions burned: 19 (million)
% 0.19/0.53  % (9528)------------------------------
% 0.19/0.53  % (9528)------------------------------
% 0.19/0.53  % (9508)Success in time 0.194 s
%------------------------------------------------------------------------------