TSTP Solution File: GEO236+1 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : GEO236+1 : TPTP v8.1.0. Bugfixed v6.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --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 16:09:26 EDT 2022

% Result   : Theorem 0.20s 0.56s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   14 (   3 unt;   0 def)
%            Number of atoms       :   45 (   0 equ)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :   50 (  19   ~;   5   |;  22   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-1 aty)
%            Number of variables   :   29 (  17   !;  12   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f170,plain,
    $false,
    inference(subsumption_resolution,[],[f123,f131]) ).

fof(f131,plain,
    ! [X0,X1] : ~ left_apart_point(X1,reverse_line(X0)),
    inference(cnf_transformation,[],[f93]) ).

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

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

fof(f15,axiom,
    ! [X1,X0] :
      ~ ( left_apart_point(X0,reverse_line(X1))
        | left_apart_point(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',oag10) ).

fof(f123,plain,
    left_apart_point(sK0,reverse_line(sK1)),
    inference(cnf_transformation,[],[f103]) ).

fof(f103,plain,
    ( left_apart_point(sK0,reverse_line(sK1))
    & left_apart_point(sK0,sK2)
    & ~ distinct_lines(sK2,sK1)
    & ~ unequally_directed_lines(sK2,sK1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f101,f102]) ).

fof(f102,plain,
    ( ? [X0,X1,X2] :
        ( left_apart_point(X0,reverse_line(X1))
        & left_apart_point(X0,X2)
        & ~ distinct_lines(X2,X1)
        & ~ unequally_directed_lines(X2,X1) )
   => ( left_apart_point(sK0,reverse_line(sK1))
      & left_apart_point(sK0,sK2)
      & ~ distinct_lines(sK2,sK1)
      & ~ unequally_directed_lines(sK2,sK1) ) ),
    introduced(choice_axiom,[]) ).

fof(f101,plain,
    ? [X0,X1,X2] :
      ( left_apart_point(X0,reverse_line(X1))
      & left_apart_point(X0,X2)
      & ~ distinct_lines(X2,X1)
      & ~ unequally_directed_lines(X2,X1) ),
    inference(rectify,[],[f82]) ).

fof(f82,plain,
    ? [X1,X0,X2] :
      ( left_apart_point(X1,reverse_line(X0))
      & left_apart_point(X1,X2)
      & ~ distinct_lines(X2,X0)
      & ~ unequally_directed_lines(X2,X0) ),
    inference(flattening,[],[f81]) ).

fof(f81,plain,
    ? [X2,X1,X0] :
      ( ~ distinct_lines(X2,X0)
      & ~ unequally_directed_lines(X2,X0)
      & left_apart_point(X1,reverse_line(X0))
      & left_apart_point(X1,X2) ),
    inference(ennf_transformation,[],[f41]) ).

fof(f41,plain,
    ~ ! [X2,X1,X0] :
        ( ( left_apart_point(X1,reverse_line(X0))
          & left_apart_point(X1,X2) )
       => ( distinct_lines(X2,X0)
          | unequally_directed_lines(X2,X0) ) ),
    inference(rectify,[],[f33]) ).

fof(f33,negated_conjecture,
    ~ ! [X2,X0,X1] :
        ( ( left_apart_point(X0,reverse_line(X2))
          & left_apart_point(X0,X1) )
       => ( distinct_lines(X1,X2)
          | unequally_directed_lines(X1,X2) ) ),
    inference(negated_conjecture,[],[f32]) ).

fof(f32,conjecture,
    ! [X2,X0,X1] :
      ( ( left_apart_point(X0,reverse_line(X2))
        & left_apart_point(X0,X1) )
     => ( distinct_lines(X1,X2)
        | unequally_directed_lines(X1,X2) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : GEO236+1 : TPTP v8.1.0. Bugfixed v6.4.0.
% 0.03/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.35  % Computer : n003.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Mon Aug 29 21:32:52 EDT 2022
% 0.14/0.35  % CPUTime    : 
% 0.20/0.55  % (6454)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.55  % (6468)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.56  % (6468)First to succeed.
% 0.20/0.56  % (6454)Also succeeded, but the first one will report.
% 0.20/0.56  % (6468)Refutation found. Thanks to Tanya!
% 0.20/0.56  % SZS status Theorem for theBenchmark
% 0.20/0.56  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.56  % (6468)------------------------------
% 0.20/0.56  % (6468)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.56  % (6468)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.56  % (6468)Termination reason: Refutation
% 0.20/0.56  
% 0.20/0.56  % (6468)Memory used [KB]: 6012
% 0.20/0.56  % (6468)Time elapsed: 0.009 s
% 0.20/0.56  % (6468)Instructions burned: 2 (million)
% 0.20/0.56  % (6468)------------------------------
% 0.20/0.56  % (6468)------------------------------
% 0.20/0.56  % (6452)Success in time 0.204 s
%------------------------------------------------------------------------------