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

View Problem - Process Solution

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

% 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 30 23:10:14 EDT 2023

% Result   : Theorem 2.54s 1.19s
% Output   : CNFRefutation 2.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   45 (  10 unt;   0 def)
%            Number of atoms       :  128 (   0 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :  134 (  51   ~;  52   |;  21   &)
%                                         (   1 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   75 (   0 sgn;  52   !;   9   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f7,axiom,
    ! [X0,X1] :
      ( distinct_points(X0,X1)
     => ~ apart_point_and_line(X0,line_connecting(X0,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ci1) ).

fof(f8,axiom,
    ! [X0,X1] :
      ( distinct_points(X0,X1)
     => ~ apart_point_and_line(X1,line_connecting(X0,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ci2) ).

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

fof(f11,axiom,
    ! [X0,X1,X3,X4] :
      ( ( distinct_lines(X3,X4)
        & distinct_points(X0,X1) )
     => ( apart_point_and_line(X1,X4)
        | apart_point_and_line(X1,X3)
        | apart_point_and_line(X0,X4)
        | apart_point_and_line(X0,X3) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cu1) ).

fof(f32,axiom,
    ! [X0,X1] :
      ( equal_lines(X0,X1)
    <=> ~ distinct_lines(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2) ).

fof(f36,conjecture,
    ! [X0,X1,X2] :
      ( ( distinct_points(intersection_point(X0,X1),intersection_point(X0,X2))
        & convergent_lines(X0,X2)
        & convergent_lines(X0,X1) )
     => equal_lines(line_connecting(intersection_point(X0,X1),intersection_point(X0,X2)),X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).

fof(f37,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( ( distinct_points(intersection_point(X0,X1),intersection_point(X0,X2))
          & convergent_lines(X0,X2)
          & convergent_lines(X0,X1) )
       => equal_lines(line_connecting(intersection_point(X0,X1),intersection_point(X0,X2)),X0) ),
    inference(negated_conjecture,[],[f36]) ).

fof(f38,plain,
    ! [X0,X1,X2,X3] :
      ( ( distinct_lines(X2,X3)
        & distinct_points(X0,X1) )
     => ( apart_point_and_line(X1,X3)
        | apart_point_and_line(X1,X2)
        | apart_point_and_line(X0,X3)
        | apart_point_and_line(X0,X2) ) ),
    inference(rectify,[],[f11]) ).

fof(f51,plain,
    ! [X0,X1] :
      ( ~ distinct_lines(X0,X1)
     => equal_lines(X0,X1) ),
    inference(unused_predicate_definition_removal,[],[f32]) ).

fof(f58,plain,
    ! [X0,X1] :
      ( ~ apart_point_and_line(X0,line_connecting(X0,X1))
      | ~ distinct_points(X0,X1) ),
    inference(ennf_transformation,[],[f7]) ).

fof(f59,plain,
    ! [X0,X1] :
      ( ~ apart_point_and_line(X1,line_connecting(X0,X1))
      | ~ distinct_points(X0,X1) ),
    inference(ennf_transformation,[],[f8]) ).

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

fof(f62,plain,
    ! [X0,X1,X2,X3] :
      ( apart_point_and_line(X1,X3)
      | apart_point_and_line(X1,X2)
      | apart_point_and_line(X0,X3)
      | apart_point_and_line(X0,X2)
      | ~ distinct_lines(X2,X3)
      | ~ distinct_points(X0,X1) ),
    inference(ennf_transformation,[],[f38]) ).

fof(f63,plain,
    ! [X0,X1,X2,X3] :
      ( apart_point_and_line(X1,X3)
      | apart_point_and_line(X1,X2)
      | apart_point_and_line(X0,X3)
      | apart_point_and_line(X0,X2)
      | ~ distinct_lines(X2,X3)
      | ~ distinct_points(X0,X1) ),
    inference(flattening,[],[f62]) ).

fof(f90,plain,
    ! [X0,X1] :
      ( equal_lines(X0,X1)
      | distinct_lines(X0,X1) ),
    inference(ennf_transformation,[],[f51]) ).

fof(f91,plain,
    ? [X0,X1,X2] :
      ( ~ equal_lines(line_connecting(intersection_point(X0,X1),intersection_point(X0,X2)),X0)
      & distinct_points(intersection_point(X0,X1),intersection_point(X0,X2))
      & convergent_lines(X0,X2)
      & convergent_lines(X0,X1) ),
    inference(ennf_transformation,[],[f37]) ).

fof(f92,plain,
    ? [X0,X1,X2] :
      ( ~ equal_lines(line_connecting(intersection_point(X0,X1),intersection_point(X0,X2)),X0)
      & distinct_points(intersection_point(X0,X1),intersection_point(X0,X2))
      & convergent_lines(X0,X2)
      & convergent_lines(X0,X1) ),
    inference(flattening,[],[f91]) ).

fof(f93,plain,
    ( ? [X0,X1,X2] :
        ( ~ equal_lines(line_connecting(intersection_point(X0,X1),intersection_point(X0,X2)),X0)
        & distinct_points(intersection_point(X0,X1),intersection_point(X0,X2))
        & convergent_lines(X0,X2)
        & convergent_lines(X0,X1) )
   => ( ~ equal_lines(line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2)),sK0)
      & distinct_points(intersection_point(sK0,sK1),intersection_point(sK0,sK2))
      & convergent_lines(sK0,sK2)
      & convergent_lines(sK0,sK1) ) ),
    introduced(choice_axiom,[]) ).

fof(f94,plain,
    ( ~ equal_lines(line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2)),sK0)
    & distinct_points(intersection_point(sK0,sK1),intersection_point(sK0,sK2))
    & convergent_lines(sK0,sK2)
    & convergent_lines(sK0,sK1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f92,f93]) ).

fof(f101,plain,
    ! [X0,X1] :
      ( ~ apart_point_and_line(X0,line_connecting(X0,X1))
      | ~ distinct_points(X0,X1) ),
    inference(cnf_transformation,[],[f58]) ).

fof(f102,plain,
    ! [X0,X1] :
      ( ~ apart_point_and_line(X1,line_connecting(X0,X1))
      | ~ distinct_points(X0,X1) ),
    inference(cnf_transformation,[],[f59]) ).

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

fof(f105,plain,
    ! [X2,X3,X0,X1] :
      ( apart_point_and_line(X1,X3)
      | apart_point_and_line(X1,X2)
      | apart_point_and_line(X0,X3)
      | apart_point_and_line(X0,X2)
      | ~ distinct_lines(X2,X3)
      | ~ distinct_points(X0,X1) ),
    inference(cnf_transformation,[],[f63]) ).

fof(f131,plain,
    ! [X0,X1] :
      ( equal_lines(X0,X1)
      | distinct_lines(X0,X1) ),
    inference(cnf_transformation,[],[f90]) ).

fof(f132,plain,
    convergent_lines(sK0,sK1),
    inference(cnf_transformation,[],[f94]) ).

fof(f133,plain,
    convergent_lines(sK0,sK2),
    inference(cnf_transformation,[],[f94]) ).

fof(f134,plain,
    distinct_points(intersection_point(sK0,sK1),intersection_point(sK0,sK2)),
    inference(cnf_transformation,[],[f94]) ).

fof(f135,plain,
    ~ equal_lines(line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2)),sK0),
    inference(cnf_transformation,[],[f94]) ).

cnf(c_55,plain,
    ( ~ apart_point_and_line(X0,line_connecting(X0,X1))
    | ~ distinct_points(X0,X1) ),
    inference(cnf_transformation,[],[f101]) ).

cnf(c_56,plain,
    ( ~ apart_point_and_line(X0,line_connecting(X1,X0))
    | ~ distinct_points(X1,X0) ),
    inference(cnf_transformation,[],[f102]) ).

cnf(c_57,plain,
    ( ~ apart_point_and_line(intersection_point(X0,X1),X0)
    | ~ convergent_lines(X0,X1) ),
    inference(cnf_transformation,[],[f103]) ).

cnf(c_59,plain,
    ( ~ distinct_points(X0,X1)
    | ~ distinct_lines(X2,X3)
    | apart_point_and_line(X0,X2)
    | apart_point_and_line(X0,X3)
    | apart_point_and_line(X1,X2)
    | apart_point_and_line(X1,X3) ),
    inference(cnf_transformation,[],[f105]) ).

cnf(c_85,plain,
    ( distinct_lines(X0,X1)
    | equal_lines(X0,X1) ),
    inference(cnf_transformation,[],[f131]) ).

cnf(c_86,negated_conjecture,
    ~ equal_lines(line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2)),sK0),
    inference(cnf_transformation,[],[f135]) ).

cnf(c_87,negated_conjecture,
    distinct_points(intersection_point(sK0,sK1),intersection_point(sK0,sK2)),
    inference(cnf_transformation,[],[f134]) ).

cnf(c_88,negated_conjecture,
    convergent_lines(sK0,sK2),
    inference(cnf_transformation,[],[f133]) ).

cnf(c_89,negated_conjecture,
    convergent_lines(sK0,sK1),
    inference(cnf_transformation,[],[f132]) ).

cnf(c_297,plain,
    distinct_lines(line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2)),sK0),
    inference(resolution,[status(thm)],[c_85,c_86]) ).

cnf(c_461,plain,
    ( ~ apart_point_and_line(intersection_point(sK0,sK1),line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2)))
    | ~ distinct_points(intersection_point(sK0,sK1),intersection_point(sK0,sK2)) ),
    inference(instantiation,[status(thm)],[c_55]) ).

cnf(c_462,plain,
    ( ~ apart_point_and_line(intersection_point(sK0,sK2),line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2)))
    | ~ distinct_points(intersection_point(sK0,sK1),intersection_point(sK0,sK2)) ),
    inference(instantiation,[status(thm)],[c_56]) ).

cnf(c_463,plain,
    ( ~ apart_point_and_line(intersection_point(sK0,sK2),sK0)
    | ~ convergent_lines(sK0,sK2) ),
    inference(instantiation,[status(thm)],[c_57]) ).

cnf(c_464,plain,
    ( ~ apart_point_and_line(intersection_point(sK0,sK1),sK0)
    | ~ convergent_lines(sK0,sK1) ),
    inference(instantiation,[status(thm)],[c_57]) ).

cnf(c_479,plain,
    ( ~ distinct_points(intersection_point(sK0,sK1),intersection_point(sK0,sK2))
    | ~ distinct_lines(X0,X1)
    | apart_point_and_line(intersection_point(sK0,sK1),X0)
    | apart_point_and_line(intersection_point(sK0,sK1),X1)
    | apart_point_and_line(intersection_point(sK0,sK2),X0)
    | apart_point_and_line(intersection_point(sK0,sK2),X1) ),
    inference(instantiation,[status(thm)],[c_59]) ).

cnf(c_546,plain,
    ( ~ distinct_lines(line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2)),sK0)
    | ~ distinct_points(intersection_point(sK0,sK1),intersection_point(sK0,sK2))
    | apart_point_and_line(intersection_point(sK0,sK1),line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2)))
    | apart_point_and_line(intersection_point(sK0,sK2),line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2)))
    | apart_point_and_line(intersection_point(sK0,sK1),sK0)
    | apart_point_and_line(intersection_point(sK0,sK2),sK0) ),
    inference(instantiation,[status(thm)],[c_479]) ).

cnf(c_547,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_546,c_464,c_463,c_462,c_461,c_297,c_87,c_88,c_89]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : GEO203+3 : TPTP v8.1.2. Released v4.0.0.
% 0.08/0.14  % Command  : run_iprover %s %d THM
% 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 : Tue Aug 29 19:35:56 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 0.20/0.48  Running first-order theorem proving
% 0.20/0.48  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.54/1.19  % SZS status Started for theBenchmark.p
% 2.54/1.19  % SZS status Theorem for theBenchmark.p
% 2.54/1.19  
% 2.54/1.19  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.54/1.19  
% 2.54/1.19  ------  iProver source info
% 2.54/1.19  
% 2.54/1.19  git: date: 2023-05-31 18:12:56 +0000
% 2.54/1.19  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.54/1.19  git: non_committed_changes: false
% 2.54/1.19  git: last_make_outside_of_git: false
% 2.54/1.19  
% 2.54/1.19  ------ Parsing...
% 2.54/1.19  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 2.54/1.19  
% 2.54/1.19  ------ Preprocessing... sf_s  rm: 4 0s  sf_e  pe_s  pe:1:0s pe_e  sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 2.54/1.19  
% 2.54/1.19  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 2.54/1.19  ------ Proving...
% 2.54/1.19  ------ Problem Properties 
% 2.54/1.19  
% 2.54/1.19  
% 2.54/1.19  clauses                                 32
% 2.54/1.19  conjectures                             3
% 2.54/1.19  EPR                                     22
% 2.54/1.19  Horn                                    16
% 2.54/1.19  unary                                   11
% 2.54/1.19  binary                                  6
% 2.54/1.19  lits                                    79
% 2.54/1.19  lits eq                                 0
% 2.54/1.19  fd_pure                                 0
% 2.54/1.19  fd_pseudo                               0
% 2.54/1.19  fd_cond                                 0
% 2.54/1.19  fd_pseudo_cond                          0
% 2.54/1.19  AC symbols                              0
% 2.54/1.19  
% 2.54/1.19  ------ Schedule dynamic 5 is on 
% 2.54/1.19  
% 2.54/1.19  ------ no equalities: superposition off 
% 2.54/1.19  
% 2.54/1.19  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.54/1.19  
% 2.54/1.19  
% 2.54/1.19  ------ 
% 2.54/1.19  Current options:
% 2.54/1.19  ------ 
% 2.54/1.19  
% 2.54/1.19  
% 2.54/1.19  
% 2.54/1.19  
% 2.54/1.19  ------ Proving...
% 2.54/1.19  
% 2.54/1.19  
% 2.54/1.19  % SZS status Theorem for theBenchmark.p
% 2.54/1.19  
% 2.54/1.19  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.54/1.19  
% 2.54/1.19  
%------------------------------------------------------------------------------