TSTP Solution File: LCL648+1.001 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : LCL648+1.001 : TPTP v8.1.0. Released v4.0.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 : n001.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 17:49:01 EDT 2022

% Result   : Theorem 0.19s 0.50s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   17 (   5 unt;   0 def)
%            Number of atoms       :   76 (   0 equ)
%            Maximal formula atoms :   12 (   4 avg)
%            Number of connectives :  112 (  53   ~;  27   |;  30   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   6 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   29 (  15   !;  14   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f17,plain,
    $false,
    inference(subsumption_resolution,[],[f16,f13]) ).

fof(f13,plain,
    p201(sK1),
    inference(cnf_transformation,[],[f10]) ).

fof(f10,plain,
    ( r1(sK0,sK1)
    & p201(sK1)
    & p101(sK1)
    & ! [X2] :
        ( ~ r1(sK0,X2)
        | ~ p101(X2)
        | ~ p201(X2) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f7,f9,f8]) ).

fof(f8,plain,
    ( ? [X0] :
        ( ? [X1] :
            ( r1(X0,X1)
            & p201(X1)
            & p101(X1) )
        & ! [X2] :
            ( ~ r1(X0,X2)
            | ~ p101(X2)
            | ~ p201(X2) ) )
   => ( ? [X1] :
          ( r1(sK0,X1)
          & p201(X1)
          & p101(X1) )
      & ! [X2] :
          ( ~ r1(sK0,X2)
          | ~ p101(X2)
          | ~ p201(X2) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f9,plain,
    ( ? [X1] :
        ( r1(sK0,X1)
        & p201(X1)
        & p101(X1) )
   => ( r1(sK0,sK1)
      & p201(sK1)
      & p101(sK1) ) ),
    introduced(choice_axiom,[]) ).

fof(f7,plain,
    ? [X0] :
      ( ? [X1] :
          ( r1(X0,X1)
          & p201(X1)
          & p101(X1) )
      & ! [X2] :
          ( ~ r1(X0,X2)
          | ~ p101(X2)
          | ~ p201(X2) ) ),
    inference(rectify,[],[f6]) ).

fof(f6,plain,
    ? [X0] :
      ( ? [X2] :
          ( r1(X0,X2)
          & p201(X2)
          & p101(X2) )
      & ! [X1] :
          ( ~ r1(X0,X1)
          | ~ p101(X1)
          | ~ p201(X1) ) ),
    inference(flattening,[],[f5]) ).

fof(f5,plain,
    ? [X0] :
      ( ! [X1] :
          ( ~ r1(X0,X1)
          | ~ p201(X1)
          | ~ p101(X1) )
      & ? [X2] :
          ( r1(X0,X2)
          & p201(X2)
          & p101(X2) ) ),
    inference(ennf_transformation,[],[f4]) ).

fof(f4,plain,
    ? [X0] :
      ~ ( ~ ! [X1] :
              ( ~ r1(X0,X1)
              | ~ ( p201(X1)
                  & p101(X1) ) )
        | ! [X2] :
            ( ~ r1(X0,X2)
            | ~ ( p201(X2)
                & p101(X2) ) ) ),
    inference(flattening,[],[f3]) ).

fof(f3,plain,
    ~ ~ ? [X0] :
          ~ ( ~ ! [X1] :
                  ( ~ r1(X0,X1)
                  | ~ ( p201(X1)
                      & p101(X1) ) )
            | ! [X2] :
                ( ~ r1(X0,X2)
                | ~ ( p201(X2)
                    & p101(X2) ) ) ),
    inference(rectify,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ ~ ? [X0] :
          ~ ( ~ ! [X1] :
                  ( ~ r1(X0,X1)
                  | ~ ( p201(X1)
                      & p101(X1) ) )
            | ! [X1] :
                ( ~ ( p201(X1)
                    & p101(X1) )
                | ~ r1(X0,X1) ) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    ~ ? [X0] :
        ~ ( ~ ! [X1] :
                ( ~ r1(X0,X1)
                | ~ ( p201(X1)
                    & p101(X1) ) )
          | ! [X1] :
              ( ~ ( p201(X1)
                  & p101(X1) )
              | ~ r1(X0,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).

fof(f16,plain,
    ~ p201(sK1),
    inference(subsumption_resolution,[],[f15,f14]) ).

fof(f14,plain,
    r1(sK0,sK1),
    inference(cnf_transformation,[],[f10]) ).

fof(f15,plain,
    ( ~ r1(sK0,sK1)
    | ~ p201(sK1) ),
    inference(resolution,[],[f11,f12]) ).

fof(f12,plain,
    p101(sK1),
    inference(cnf_transformation,[],[f10]) ).

fof(f11,plain,
    ! [X2] :
      ( ~ p101(X2)
      | ~ r1(sK0,X2)
      | ~ p201(X2) ),
    inference(cnf_transformation,[],[f10]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem    : LCL648+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.03/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.12/0.33  % Computer : n001.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Tue Aug 30 02:36:00 EDT 2022
% 0.12/0.33  % CPUTime    : 
% 0.19/0.49  % (6633)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 (3000ds/467Mi)
% 0.19/0.49  % (6624)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 (3000ds/68Mi)
% 0.19/0.49  % (6633)First to succeed.
% 0.19/0.50  % (6615)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 (3000ds/48Mi)
% 0.19/0.50  % (6618)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.19/0.50  % (6617)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/7Mi)
% 0.19/0.50  % (6623)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/99Mi)
% 0.19/0.50  % (6631)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/138Mi)
% 0.19/0.50  % (6631)Also succeeded, but the first one will report.
% 0.19/0.50  % (6633)Refutation found. Thanks to Tanya!
% 0.19/0.50  % SZS status Theorem for theBenchmark
% 0.19/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.50  % (6633)------------------------------
% 0.19/0.50  % (6633)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50  % (6633)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50  % (6633)Termination reason: Refutation
% 0.19/0.50  
% 0.19/0.50  % (6633)Memory used [KB]: 5373
% 0.19/0.50  % (6633)Time elapsed: 0.065 s
% 0.19/0.50  % (6633)Instructions burned: 1 (million)
% 0.19/0.50  % (6633)------------------------------
% 0.19/0.50  % (6633)------------------------------
% 0.19/0.50  % (6609)Success in time 0.161 s
%------------------------------------------------------------------------------