TSTP Solution File: GEO247+3 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : GEO247+3 : 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 : n022.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 16:12:27 EDT 2022

% Result   : Theorem 0.20s 0.51s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   15 (   3 unt;   0 def)
%            Number of atoms       :   92 (   0 equ)
%            Maximal formula atoms :   18 (   6 avg)
%            Number of connectives :   92 (  15   ~;   2   |;  71   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (  10 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-1 aty)
%            Number of variables   :   52 (  28   !;  24   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f189,plain,
    $false,
    inference(resolution,[],[f186,f148]) ).

fof(f148,plain,
    left_apart_point(sK2,sK5),
    inference(cnf_transformation,[],[f118]) ).

fof(f118,plain,
    ( right_apart_point(sK1,sK3)
    & right_apart_point(sK2,sK3)
    & ~ convergent_lines(sK5,sK3)
    & right_apart_point(sK1,sK5)
    & left_apart_point(sK0,sK5)
    & right_apart_point(sK4,sK5)
    & left_apart_point(sK0,sK3)
    & left_apart_point(sK2,sK5)
    & left_apart_point(sK4,sK3) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f116,f117]) ).

fof(f117,plain,
    ( ? [X0,X1,X2,X3,X4,X5] :
        ( right_apart_point(X1,X3)
        & right_apart_point(X2,X3)
        & ~ convergent_lines(X5,X3)
        & right_apart_point(X1,X5)
        & left_apart_point(X0,X5)
        & right_apart_point(X4,X5)
        & left_apart_point(X0,X3)
        & left_apart_point(X2,X5)
        & left_apart_point(X4,X3) )
   => ( right_apart_point(sK1,sK3)
      & right_apart_point(sK2,sK3)
      & ~ convergent_lines(sK5,sK3)
      & right_apart_point(sK1,sK5)
      & left_apart_point(sK0,sK5)
      & right_apart_point(sK4,sK5)
      & left_apart_point(sK0,sK3)
      & left_apart_point(sK2,sK5)
      & left_apart_point(sK4,sK3) ) ),
    introduced(choice_axiom,[]) ).

fof(f116,plain,
    ? [X0,X1,X2,X3,X4,X5] :
      ( right_apart_point(X1,X3)
      & right_apart_point(X2,X3)
      & ~ convergent_lines(X5,X3)
      & right_apart_point(X1,X5)
      & left_apart_point(X0,X5)
      & right_apart_point(X4,X5)
      & left_apart_point(X0,X3)
      & left_apart_point(X2,X5)
      & left_apart_point(X4,X3) ),
    inference(rectify,[],[f109]) ).

fof(f109,plain,
    ? [X3,X2,X4,X1,X5,X0] :
      ( right_apart_point(X2,X1)
      & right_apart_point(X4,X1)
      & ~ convergent_lines(X0,X1)
      & right_apart_point(X2,X0)
      & left_apart_point(X3,X0)
      & right_apart_point(X5,X0)
      & left_apart_point(X3,X1)
      & left_apart_point(X4,X0)
      & left_apart_point(X5,X1) ),
    inference(flattening,[],[f108]) ).

fof(f108,plain,
    ? [X1,X4,X3,X0,X5,X2] :
      ( ~ convergent_lines(X0,X1)
      & left_apart_point(X4,X0)
      & right_apart_point(X5,X0)
      & right_apart_point(X2,X1)
      & right_apart_point(X4,X1)
      & right_apart_point(X2,X0)
      & left_apart_point(X3,X0)
      & left_apart_point(X5,X1)
      & left_apart_point(X3,X1) ),
    inference(ennf_transformation,[],[f63]) ).

fof(f63,plain,
    ~ ! [X1,X4,X3,X0,X5,X2] :
        ( ( left_apart_point(X4,X0)
          & right_apart_point(X5,X0)
          & right_apart_point(X2,X1)
          & right_apart_point(X4,X1)
          & right_apart_point(X2,X0)
          & left_apart_point(X3,X0)
          & left_apart_point(X5,X1)
          & left_apart_point(X3,X1) )
       => convergent_lines(X0,X1) ),
    inference(rectify,[],[f38]) ).

fof(f38,negated_conjecture,
    ~ ! [X3,X4,X5,X2,X6,X8] :
        ( ( right_apart_point(X8,X3)
          & right_apart_point(X5,X4)
          & right_apart_point(X5,X3)
          & right_apart_point(X6,X4)
          & left_apart_point(X2,X4)
          & left_apart_point(X6,X3)
          & left_apart_point(X2,X3)
          & left_apart_point(X8,X4) )
       => convergent_lines(X3,X4) ),
    inference(negated_conjecture,[],[f37]) ).

fof(f37,conjecture,
    ! [X3,X4,X5,X2,X6,X8] :
      ( ( right_apart_point(X8,X3)
        & right_apart_point(X5,X4)
        & right_apart_point(X5,X3)
        & right_apart_point(X6,X4)
        & left_apart_point(X2,X4)
        & left_apart_point(X6,X3)
        & left_apart_point(X2,X3)
        & left_apart_point(X8,X4) )
     => convergent_lines(X3,X4) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).

fof(f186,plain,
    ! [X0,X1] : ~ left_apart_point(X1,X0),
    inference(cnf_transformation,[],[f134]) ).

fof(f134,plain,
    ! [X0,X1] :
      ( ~ left_apart_point(X1,X0)
      & ~ left_apart_point(X1,reverse_line(X0)) ),
    inference(rectify,[],[f92]) ).

fof(f92,plain,
    ! [X1,X0] :
      ( ~ left_apart_point(X0,X1)
      & ~ left_apart_point(X0,reverse_line(X1)) ),
    inference(ennf_transformation,[],[f62]) ).

fof(f62,plain,
    ! [X1,X0] :
      ~ ( left_apart_point(X0,X1)
        | left_apart_point(X0,reverse_line(X1)) ),
    inference(rectify,[],[f20]) ).

fof(f20,axiom,
    ! [X2,X3] :
      ~ ( left_apart_point(X2,X3)
        | left_apart_point(X2,reverse_line(X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax10_basics) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : GEO247+3 : TPTP v8.1.0. Released v4.0.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.14/0.34  % Computer : n022.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Mon Aug 29 21:35:41 EDT 2022
% 0.14/0.34  % CPUTime    : 
% 0.20/0.50  % (21473)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.50  % (21465)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  % (21473)First to succeed.
% 0.20/0.51  % (21457)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.51  % (21465)Also succeeded, but the first one will report.
% 0.20/0.51  % (21473)Refutation found. Thanks to Tanya!
% 0.20/0.51  % SZS status Theorem for theBenchmark
% 0.20/0.51  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.51  % (21473)------------------------------
% 0.20/0.51  % (21473)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51  % (21473)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51  % (21473)Termination reason: Refutation
% 0.20/0.51  
% 0.20/0.51  % (21473)Memory used [KB]: 1023
% 0.20/0.51  % (21473)Time elapsed: 0.056 s
% 0.20/0.51  % (21473)Instructions burned: 3 (million)
% 0.20/0.51  % (21473)------------------------------
% 0.20/0.51  % (21473)------------------------------
% 0.20/0.51  % (21450)Success in time 0.166 s
%------------------------------------------------------------------------------