TSTP Solution File: GEO226+3 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : GEO226+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n023.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 : Tue Apr 30 11:14:53 EDT 2024

% Result   : Theorem 0.12s 0.34s
% Output   : Refutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   25 (   4 unt;   0 def)
%            Number of atoms       :   80 (   0 equ)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :   84 (  29   ~;  15   |;  29   &)
%                                         (   1 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   44 (  35   !;   9   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f154,plain,
    $false,
    inference(subsumption_resolution,[],[f153,f106]) ).

fof(f106,plain,
    convergent_lines(sK2,sK3),
    inference(cnf_transformation,[],[f99]) ).

fof(f99,plain,
    ( ! [X2] :
        ( ( ~ incident_point_and_line(X2,sK3)
          | ~ incident_point_and_line(X2,sK2) )
        & point(X2) )
    & convergent_lines(sK2,sK3)
    & line(sK3)
    & line(sK2) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f54,f98]) ).

fof(f98,plain,
    ( ? [X0,X1] :
        ( ! [X2] :
            ( ( ~ incident_point_and_line(X2,X1)
              | ~ incident_point_and_line(X2,X0) )
            & point(X2) )
        & convergent_lines(X0,X1)
        & line(X1)
        & line(X0) )
   => ( ! [X2] :
          ( ( ~ incident_point_and_line(X2,sK3)
            | ~ incident_point_and_line(X2,sK2) )
          & point(X2) )
      & convergent_lines(sK2,sK3)
      & line(sK3)
      & line(sK2) ) ),
    introduced(choice_axiom,[]) ).

fof(f54,plain,
    ? [X0,X1] :
      ( ! [X2] :
          ( ( ~ incident_point_and_line(X2,X1)
            | ~ incident_point_and_line(X2,X0) )
          & point(X2) )
      & convergent_lines(X0,X1)
      & line(X1)
      & line(X0) ),
    inference(flattening,[],[f53]) ).

fof(f53,plain,
    ? [X0,X1] :
      ( ! [X2] :
          ( ( ~ incident_point_and_line(X2,X1)
            | ~ incident_point_and_line(X2,X0) )
          & point(X2) )
      & convergent_lines(X0,X1)
      & line(X1)
      & line(X0) ),
    inference(ennf_transformation,[],[f38]) ).

fof(f38,plain,
    ~ ! [X0,X1] :
        ( ( convergent_lines(X0,X1)
          & line(X1)
          & line(X0) )
       => ? [X2] :
            ( point(X2)
           => ( incident_point_and_line(X2,X1)
              & incident_point_and_line(X2,X0) ) ) ),
    inference(rectify,[],[f37]) ).

fof(f37,negated_conjecture,
    ~ ! [X5,X6] :
        ( ( convergent_lines(X5,X6)
          & line(X6)
          & line(X5) )
       => ? [X0] :
            ( point(X0)
           => ( incident_point_and_line(X0,X6)
              & incident_point_and_line(X0,X5) ) ) ),
    inference(negated_conjecture,[],[f36]) ).

fof(f36,conjecture,
    ! [X5,X6] :
      ( ( convergent_lines(X5,X6)
        & line(X6)
        & line(X5) )
     => ? [X0] :
          ( point(X0)
         => ( incident_point_and_line(X0,X6)
            & incident_point_and_line(X0,X5) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).

fof(f153,plain,
    ~ convergent_lines(sK2,sK3),
    inference(resolution,[],[f151,f120]) ).

fof(f120,plain,
    ! [X0,X1] :
      ( ~ apart_point_and_line(intersection_point(X0,X1),X0)
      | ~ convergent_lines(X0,X1) ),
    inference(cnf_transformation,[],[f58]) ).

fof(f58,plain,
    ! [X0,X1] :
      ( ~ apart_point_and_line(intersection_point(X0,X1),X0)
      | ~ convergent_lines(X0,X1) ),
    inference(ennf_transformation,[],[f9]) ).

fof(f9,axiom,
    ! [X0,X1] :
      ( convergent_lines(X0,X1)
     => ~ apart_point_and_line(intersection_point(X0,X1),X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ci3) ).

fof(f151,plain,
    apart_point_and_line(intersection_point(sK2,sK3),sK2),
    inference(resolution,[],[f150,f106]) ).

fof(f150,plain,
    ! [X0] :
      ( ~ convergent_lines(X0,sK3)
      | apart_point_and_line(intersection_point(X0,sK3),sK2) ),
    inference(resolution,[],[f121,f148]) ).

fof(f148,plain,
    ! [X0] :
      ( apart_point_and_line(X0,sK3)
      | apart_point_and_line(X0,sK2) ),
    inference(resolution,[],[f147,f126]) ).

fof(f126,plain,
    ! [X0,X1] :
      ( incident_point_and_line(X0,X1)
      | apart_point_and_line(X0,X1) ),
    inference(cnf_transformation,[],[f68]) ).

fof(f68,plain,
    ! [X0,X1] :
      ( incident_point_and_line(X0,X1)
      | apart_point_and_line(X0,X1) ),
    inference(ennf_transformation,[],[f52]) ).

fof(f52,plain,
    ! [X0,X1] :
      ( ~ apart_point_and_line(X0,X1)
     => incident_point_and_line(X0,X1) ),
    inference(unused_predicate_definition_removal,[],[f34]) ).

fof(f34,axiom,
    ! [X0,X1] :
      ( incident_point_and_line(X0,X1)
    <=> ~ apart_point_and_line(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a4) ).

fof(f147,plain,
    ! [X0] :
      ( ~ incident_point_and_line(X0,sK2)
      | apart_point_and_line(X0,sK3) ),
    inference(resolution,[],[f126,f108]) ).

fof(f108,plain,
    ! [X2] :
      ( ~ incident_point_and_line(X2,sK3)
      | ~ incident_point_and_line(X2,sK2) ),
    inference(cnf_transformation,[],[f99]) ).

fof(f121,plain,
    ! [X0,X1] :
      ( ~ apart_point_and_line(intersection_point(X0,X1),X1)
      | ~ convergent_lines(X0,X1) ),
    inference(cnf_transformation,[],[f59]) ).

fof(f59,plain,
    ! [X0,X1] :
      ( ~ apart_point_and_line(intersection_point(X0,X1),X1)
      | ~ convergent_lines(X0,X1) ),
    inference(ennf_transformation,[],[f10]) ).

fof(f10,axiom,
    ! [X0,X1] :
      ( convergent_lines(X0,X1)
     => ~ apart_point_and_line(intersection_point(X0,X1),X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ci4) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem    : GEO226+3 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.12  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.12/0.32  % Computer : n023.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit   : 300
% 0.12/0.32  % WCLimit    : 300
% 0.12/0.32  % DateTime   : Tue Apr 30 05:58:55 EDT 2024
% 0.12/0.32  % CPUTime    : 
% 0.12/0.32  % (2542)Running in auto input_syntax mode. Trying TPTP
% 0.12/0.33  % (2549)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.12/0.33  % (2549)First to succeed.
% 0.12/0.33  % (2550)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.12/0.34  % (2549)Refutation found. Thanks to Tanya!
% 0.12/0.34  % SZS status Theorem for theBenchmark
% 0.12/0.34  % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.34  % (2549)------------------------------
% 0.12/0.34  % (2549)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.12/0.34  % (2549)Termination reason: Refutation
% 0.12/0.34  
% 0.12/0.34  % (2549)Memory used [KB]: 943
% 0.12/0.34  % (2549)Time elapsed: 0.002 s
% 0.12/0.34  % (2549)Instructions burned: 4 (million)
% 0.12/0.34  % (2549)------------------------------
% 0.12/0.34  % (2549)------------------------------
% 0.12/0.34  % (2542)Success in time 0.013 s
%------------------------------------------------------------------------------