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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : GEO241+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 : n005.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:26 EDT 2022

% Result   : Theorem 0.20s 0.50s
% 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       :   39 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   38 (  13   ~;   2   |;  18   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   29 (  20   !;   9   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f177,plain,
    $false,
    inference(resolution,[],[f165,f143]) ).

fof(f143,plain,
    left_convergent_lines(sK0,line_connecting(sK1,sK2)),
    inference(cnf_transformation,[],[f117]) ).

fof(f117,plain,
    ( ~ left_apart_point(sK2,sK0)
    & left_convergent_lines(sK0,line_connecting(sK1,sK2))
    & distinct_points(sK1,sK2) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f104,f116]) ).

fof(f116,plain,
    ( ? [X0,X1,X2] :
        ( ~ left_apart_point(X2,X0)
        & left_convergent_lines(X0,line_connecting(X1,X2))
        & distinct_points(X1,X2) )
   => ( ~ left_apart_point(sK2,sK0)
      & left_convergent_lines(sK0,line_connecting(sK1,sK2))
      & distinct_points(sK1,sK2) ) ),
    introduced(choice_axiom,[]) ).

fof(f104,plain,
    ? [X0,X1,X2] :
      ( ~ left_apart_point(X2,X0)
      & left_convergent_lines(X0,line_connecting(X1,X2))
      & distinct_points(X1,X2) ),
    inference(flattening,[],[f103]) ).

fof(f103,plain,
    ? [X1,X2,X0] :
      ( ~ left_apart_point(X2,X0)
      & left_convergent_lines(X0,line_connecting(X1,X2))
      & distinct_points(X1,X2) ),
    inference(ennf_transformation,[],[f77]) ).

fof(f77,plain,
    ~ ! [X1,X2,X0] :
        ( ( left_convergent_lines(X0,line_connecting(X1,X2))
          & distinct_points(X1,X2) )
       => left_apart_point(X2,X0) ),
    inference(pure_predicate_removal,[],[f40]) ).

fof(f40,plain,
    ~ ! [X1,X2,X0] :
        ( ( left_convergent_lines(X0,line_connecting(X1,X2))
          & distinct_points(X1,X2)
          & incident_point_and_line(X1,X0) )
       => left_apart_point(X2,X0) ),
    inference(rectify,[],[f38]) ).

fof(f38,negated_conjecture,
    ~ ! [X3,X2,X5] :
        ( ( left_convergent_lines(X3,line_connecting(X2,X5))
          & distinct_points(X2,X5)
          & incident_point_and_line(X2,X3) )
       => left_apart_point(X5,X3) ),
    inference(negated_conjecture,[],[f37]) ).

fof(f37,conjecture,
    ! [X3,X2,X5] :
      ( ( left_convergent_lines(X3,line_connecting(X2,X5))
        & distinct_points(X2,X5)
        & incident_point_and_line(X2,X3) )
     => left_apart_point(X5,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).

fof(f165,plain,
    ! [X0,X1] : ~ left_convergent_lines(X0,X1),
    inference(cnf_transformation,[],[f88]) ).

fof(f88,plain,
    ! [X0,X1] :
      ( ~ left_convergent_lines(X0,X1)
      & ~ left_convergent_lines(X0,reverse_line(X1)) ),
    inference(ennf_transformation,[],[f71]) ).

fof(f71,plain,
    ! [X1,X0] :
      ~ ( left_convergent_lines(X0,reverse_line(X1))
        | left_convergent_lines(X0,X1) ),
    inference(rectify,[],[f21]) ).

fof(f21,axiom,
    ! [X3,X4] :
      ~ ( left_convergent_lines(X3,reverse_line(X4))
        | left_convergent_lines(X3,X4) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax11_basics) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : GEO241+3 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.14  % 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.35  % Computer : n005.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Mon Aug 29 21:33:18 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.20/0.49  % (15862)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.20/0.50  % (15862)First to succeed.
% 0.20/0.50  % (15870)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.20/0.50  % (15862)Refutation found. Thanks to Tanya!
% 0.20/0.50  % SZS status Theorem for theBenchmark
% 0.20/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.50  % (15862)------------------------------
% 0.20/0.50  % (15862)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50  % (15862)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50  % (15862)Termination reason: Refutation
% 0.20/0.50  
% 0.20/0.50  % (15862)Memory used [KB]: 1023
% 0.20/0.50  % (15862)Time elapsed: 0.073 s
% 0.20/0.50  % (15862)Instructions burned: 3 (million)
% 0.20/0.50  % (15862)------------------------------
% 0.20/0.50  % (15862)------------------------------
% 0.20/0.50  % (15852)Success in time 0.149 s
%------------------------------------------------------------------------------