TSTP Solution File: GEO176+2 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : GEO176+2 : TPTP v8.1.0. Released v3.3.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:06 EDT 2022

% Result   : Theorem 0.21s 0.50s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   32 (   5 unt;   0 def)
%            Number of atoms       :  102 (   0 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :  104 (  34   ~;  33   |;  27   &)
%                                         (   2 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   3 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   51 (  35   !;  16   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f138,plain,
    $false,
    inference(avatar_sat_refutation,[],[f79,f109,f137]) ).

fof(f137,plain,
    ~ spl4_1,
    inference(avatar_contradiction_clause,[],[f135]) ).

fof(f135,plain,
    ( $false
    | ~ spl4_1 ),
    inference(resolution,[],[f120,f68]) ).

fof(f68,plain,
    ~ distinct_points(sK0,intersection_point(sK1,sK3)),
    inference(cnf_transformation,[],[f52]) ).

fof(f52,plain,
    ( ( apart_point_and_line(sK0,sK1)
      | apart_point_and_line(sK0,sK3) )
    & ~ distinct_points(sK0,intersection_point(sK1,sK3))
    & convergent_lines(sK1,sK3)
    & distinct_points(sK0,sK2) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f50,f51]) ).

fof(f51,plain,
    ( ? [X0,X1,X2,X3] :
        ( ( apart_point_and_line(X0,X1)
          | apart_point_and_line(X0,X3) )
        & ~ distinct_points(X0,intersection_point(X1,X3))
        & convergent_lines(X1,X3)
        & distinct_points(X0,X2) )
   => ( ( apart_point_and_line(sK0,sK1)
        | apart_point_and_line(sK0,sK3) )
      & ~ distinct_points(sK0,intersection_point(sK1,sK3))
      & convergent_lines(sK1,sK3)
      & distinct_points(sK0,sK2) ) ),
    introduced(choice_axiom,[]) ).

fof(f50,plain,
    ? [X0,X1,X2,X3] :
      ( ( apart_point_and_line(X0,X1)
        | apart_point_and_line(X0,X3) )
      & ~ distinct_points(X0,intersection_point(X1,X3))
      & convergent_lines(X1,X3)
      & distinct_points(X0,X2) ),
    inference(rectify,[],[f38]) ).

fof(f38,plain,
    ? [X2,X1,X3,X0] :
      ( ( apart_point_and_line(X2,X1)
        | apart_point_and_line(X2,X0) )
      & ~ distinct_points(X2,intersection_point(X1,X0))
      & convergent_lines(X1,X0)
      & distinct_points(X2,X3) ),
    inference(flattening,[],[f37]) ).

fof(f37,plain,
    ? [X3,X1,X2,X0] :
      ( ~ distinct_points(X2,intersection_point(X1,X0))
      & distinct_points(X2,X3)
      & ( apart_point_and_line(X2,X1)
        | apart_point_and_line(X2,X0) )
      & convergent_lines(X1,X0) ),
    inference(ennf_transformation,[],[f16]) ).

fof(f16,plain,
    ~ ! [X3,X1,X2,X0] :
        ( ( distinct_points(X2,X3)
          & ( apart_point_and_line(X2,X1)
            | apart_point_and_line(X2,X0) )
          & convergent_lines(X1,X0) )
       => distinct_points(X2,intersection_point(X1,X0)) ),
    inference(rectify,[],[f14]) ).

fof(f14,negated_conjecture,
    ~ ! [X4,X3,X0,X1] :
        ( ( distinct_points(X0,X1)
          & ( apart_point_and_line(X0,X4)
            | apart_point_and_line(X0,X3) )
          & convergent_lines(X3,X4) )
       => distinct_points(X0,intersection_point(X3,X4)) ),
    inference(negated_conjecture,[],[f13]) ).

fof(f13,conjecture,
    ! [X4,X3,X0,X1] :
      ( ( distinct_points(X0,X1)
        & ( apart_point_and_line(X0,X4)
          | apart_point_and_line(X0,X3) )
        & convergent_lines(X3,X4) )
     => distinct_points(X0,intersection_point(X3,X4)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).

fof(f120,plain,
    ( distinct_points(sK0,intersection_point(sK1,sK3))
    | ~ spl4_1 ),
    inference(resolution,[],[f110,f67]) ).

fof(f67,plain,
    convergent_lines(sK1,sK3),
    inference(cnf_transformation,[],[f52]) ).

fof(f110,plain,
    ( ! [X0] :
        ( ~ convergent_lines(sK1,X0)
        | distinct_points(sK0,intersection_point(sK1,X0)) )
    | ~ spl4_1 ),
    inference(resolution,[],[f74,f65]) ).

fof(f65,plain,
    ! [X2,X0,X1] :
      ( ~ apart_point_and_line(X1,X0)
      | distinct_points(X1,intersection_point(X0,X2))
      | ~ convergent_lines(X0,X2) ),
    inference(cnf_transformation,[],[f49]) ).

fof(f49,plain,
    ! [X0,X1,X2] :
      ( ~ convergent_lines(X0,X2)
      | ( ~ apart_point_and_line(X1,X0)
        & ~ apart_point_and_line(X1,X2) )
      | distinct_points(X1,intersection_point(X0,X2)) ),
    inference(rectify,[],[f32]) ).

fof(f32,plain,
    ! [X1,X2,X0] :
      ( ~ convergent_lines(X1,X0)
      | ( ~ apart_point_and_line(X2,X1)
        & ~ apart_point_and_line(X2,X0) )
      | distinct_points(X2,intersection_point(X1,X0)) ),
    inference(flattening,[],[f31]) ).

fof(f31,plain,
    ! [X1,X2,X0] :
      ( distinct_points(X2,intersection_point(X1,X0))
      | ( ~ apart_point_and_line(X2,X1)
        & ~ apart_point_and_line(X2,X0) )
      | ~ convergent_lines(X1,X0) ),
    inference(ennf_transformation,[],[f18]) ).

fof(f18,plain,
    ! [X1,X2,X0] :
      ( convergent_lines(X1,X0)
     => ( ( apart_point_and_line(X2,X0)
          | apart_point_and_line(X2,X1) )
       => distinct_points(X2,intersection_point(X1,X0)) ) ),
    inference(rectify,[],[f8]) ).

fof(f8,axiom,
    ! [X1,X0,X2] :
      ( convergent_lines(X0,X1)
     => ( ( apart_point_and_line(X2,X0)
          | apart_point_and_line(X2,X1) )
       => distinct_points(X2,intersection_point(X0,X1)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',con2) ).

fof(f74,plain,
    ( apart_point_and_line(sK0,sK1)
    | ~ spl4_1 ),
    inference(avatar_component_clause,[],[f72]) ).

fof(f72,plain,
    ( spl4_1
  <=> apart_point_and_line(sK0,sK1) ),
    introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).

fof(f109,plain,
    ~ spl4_2,
    inference(avatar_contradiction_clause,[],[f107]) ).

fof(f107,plain,
    ( $false
    | ~ spl4_2 ),
    inference(resolution,[],[f104,f68]) ).

fof(f104,plain,
    ( distinct_points(sK0,intersection_point(sK1,sK3))
    | ~ spl4_2 ),
    inference(resolution,[],[f85,f67]) ).

fof(f85,plain,
    ( ! [X0] :
        ( ~ convergent_lines(X0,sK3)
        | distinct_points(sK0,intersection_point(X0,sK3)) )
    | ~ spl4_2 ),
    inference(resolution,[],[f64,f78]) ).

fof(f78,plain,
    ( apart_point_and_line(sK0,sK3)
    | ~ spl4_2 ),
    inference(avatar_component_clause,[],[f76]) ).

fof(f76,plain,
    ( spl4_2
  <=> apart_point_and_line(sK0,sK3) ),
    introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).

fof(f64,plain,
    ! [X2,X0,X1] :
      ( ~ apart_point_and_line(X1,X2)
      | distinct_points(X1,intersection_point(X0,X2))
      | ~ convergent_lines(X0,X2) ),
    inference(cnf_transformation,[],[f49]) ).

fof(f79,plain,
    ( spl4_1
    | spl4_2 ),
    inference(avatar_split_clause,[],[f69,f76,f72]) ).

fof(f69,plain,
    ( apart_point_and_line(sK0,sK3)
    | apart_point_and_line(sK0,sK1) ),
    inference(cnf_transformation,[],[f52]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : GEO176+2 : TPTP v8.1.0. Released v3.3.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.35  % Computer : n005.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:24:18 EDT 2022
% 0.14/0.35  % CPUTime    : 
% 0.21/0.49  % (13427)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.21/0.49  % (13435)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 0.21/0.49  % (13435)First to succeed.
% 0.21/0.50  % (13435)Refutation found. Thanks to Tanya!
% 0.21/0.50  % SZS status Theorem for theBenchmark
% 0.21/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.50  % (13435)------------------------------
% 0.21/0.50  % (13435)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.50  % (13435)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.50  % (13435)Termination reason: Refutation
% 0.21/0.50  
% 0.21/0.50  % (13435)Memory used [KB]: 5500
% 0.21/0.50  % (13435)Time elapsed: 0.077 s
% 0.21/0.50  % (13435)Instructions burned: 3 (million)
% 0.21/0.50  % (13435)------------------------------
% 0.21/0.50  % (13435)------------------------------
% 0.21/0.50  % (13405)Success in time 0.148 s
%------------------------------------------------------------------------------