TSTP Solution File: GEO239+3 by iProver---3.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : GEO239+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n004.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 30 23:10:36 EDT 2023

% Result   : Theorem 0.49s 1.18s
% Output   : CNFRefutation 0.49s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   22 (   6 unt;   0 def)
%            Number of atoms       :   55 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   55 (  22   ~;  16   |;  10   &)
%                                         (   0 <=>;   7  =>;   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   :   48 (   4 sgn;  35   !;   6   ?)

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

fof(f33,axiom,
    ! [X2,X5,X3] :
      ( ( left_apart_point(X2,X3)
        & distinct_points(X2,X5) )
     => ( left_convergent_lines(line_connecting(X2,X5),X3)
        | left_apart_point(X5,X3) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax2_uniq_cons) ).

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

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

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

fof(f66,plain,
    ! [X0,X1,X2] :
      ( ( left_apart_point(X0,X2)
        & distinct_points(X0,X1) )
     => ( left_convergent_lines(line_connecting(X0,X1),X2)
        | left_apart_point(X1,X2) ) ),
    inference(rectify,[],[f33]) ).

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

fof(f74,plain,
    ~ ! [X0,X1,X2] :
        ( left_apart_point(X1,X2)
       => left_convergent_lines(X2,line_connecting(X0,X1)) ),
    inference(pure_predicate_removal,[],[f70]) ).

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

fof(f103,plain,
    ! [X0,X1,X2] :
      ( left_convergent_lines(line_connecting(X0,X1),X2)
      | left_apart_point(X1,X2)
      | ~ left_apart_point(X0,X2)
      | ~ distinct_points(X0,X1) ),
    inference(ennf_transformation,[],[f66]) ).

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

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

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

fof(f113,plain,
    ( ~ left_convergent_lines(sK2,line_connecting(sK0,sK1))
    & left_apart_point(sK1,sK2) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f111,f112]) ).

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

fof(f147,plain,
    ! [X2,X0,X1] :
      ( left_convergent_lines(line_connecting(X0,X1),X2)
      | left_apart_point(X1,X2)
      | ~ left_apart_point(X0,X2)
      | ~ distinct_points(X0,X1) ),
    inference(cnf_transformation,[],[f104]) ).

fof(f151,plain,
    left_apart_point(sK1,sK2),
    inference(cnf_transformation,[],[f113]) ).

cnf(c_66,plain,
    ~ left_apart_point(X0,X1),
    inference(cnf_transformation,[],[f130]) ).

cnf(c_82,plain,
    ( ~ left_apart_point(X0,X1)
    | ~ distinct_points(X0,X2)
    | left_convergent_lines(line_connecting(X0,X2),X1)
    | left_apart_point(X2,X1) ),
    inference(cnf_transformation,[],[f147]) ).

cnf(c_87,negated_conjecture,
    left_apart_point(sK1,sK2),
    inference(cnf_transformation,[],[f151]) ).

cnf(c_123,plain,
    ~ left_apart_point(X0,X1),
    inference(global_subsumption_just,[status(thm)],[c_82,c_66]) ).

cnf(c_214,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_87,c_123]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem  : GEO239+3 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.14  % Command  : run_iprover %s %d THM
% 0.14/0.35  % Computer : n004.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 : Wed Aug 30 00:01:37 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 0.21/0.48  Running first-order theorem proving
% 0.21/0.48  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.49/1.18  % SZS status Started for theBenchmark.p
% 0.49/1.18  % SZS status Theorem for theBenchmark.p
% 0.49/1.18  
% 0.49/1.18  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.49/1.18  
% 0.49/1.18  ------  iProver source info
% 0.49/1.18  
% 0.49/1.18  git: date: 2023-05-31 18:12:56 +0000
% 0.49/1.18  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.49/1.18  git: non_committed_changes: false
% 0.49/1.18  git: last_make_outside_of_git: false
% 0.49/1.18  
% 0.49/1.18  ------ Parsing...
% 0.49/1.18  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 0.49/1.18  
% 0.49/1.18  ------ Preprocessing...
% 0.49/1.18  
% 0.49/1.18  % SZS status Theorem for theBenchmark.p
% 0.49/1.18  
% 0.49/1.18  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.49/1.18  
% 0.49/1.18  
%------------------------------------------------------------------------------