TSTP Solution File: GEO186+1 by iProver---3.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : GEO186+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n008.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:00 EDT 2023

% Result   : Theorem 2.04s 1.13s
% Output   : CNFRefutation 2.04s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   45 (  13 unt;   0 def)
%            Number of atoms       :  142 (   0 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :  162 (  65   ~;  57   |;  31   &)
%                                         (   0 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   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;   4 con; 0-2 aty)
%            Number of variables   :   85 (   0 sgn;  58   !;  12   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f3,axiom,
    ! [X0] : ~ convergent_lines(X0,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',apart3) ).

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(f10,axiom,
    ! [X0,X1] :
      ( convergent_lines(X0,X1)
     => ~ apart_point_and_line(intersection_point(X0,X1),X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ci4) ).

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(f14,axiom,
    ! [X0,X1,X2] :
      ( convergent_lines(X0,X1)
     => ( convergent_lines(X0,X2)
        | distinct_lines(X1,X2) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ceq3) ).

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

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

fof(f17,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(f18,plain,
    ~ ! [X0,X1,X2,X3] :
        ( ( ~ apart_point_and_line(X0,X3)
          & ~ apart_point_and_line(X0,X2)
          & convergent_lines(X2,X3)
          & distinct_points(X0,X1) )
       => ~ distinct_points(X0,intersection_point(X2,X3)) ),
    inference(rectify,[],[f16]) ).

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

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

fof(f29,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,[],[f17]) ).

fof(f30,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,[],[f29]) ).

fof(f35,plain,
    ! [X0,X1,X2] :
      ( convergent_lines(X0,X2)
      | distinct_lines(X1,X2)
      | ~ convergent_lines(X0,X1) ),
    inference(ennf_transformation,[],[f14]) ).

fof(f36,plain,
    ! [X0,X1,X2] :
      ( convergent_lines(X0,X2)
      | distinct_lines(X1,X2)
      | ~ convergent_lines(X0,X1) ),
    inference(flattening,[],[f35]) ).

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

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

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

fof(f40,plain,
    ( distinct_points(sK0,intersection_point(sK2,sK3))
    & ~ apart_point_and_line(sK0,sK3)
    & ~ apart_point_and_line(sK0,sK2)
    & convergent_lines(sK2,sK3)
    & distinct_points(sK0,sK1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f38,f39]) ).

fof(f43,plain,
    ! [X0] : ~ convergent_lines(X0,X0),
    inference(cnf_transformation,[],[f3]) ).

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

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

fof(f51,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,[],[f30]) ).

fof(f54,plain,
    ! [X2,X0,X1] :
      ( convergent_lines(X0,X2)
      | distinct_lines(X1,X2)
      | ~ convergent_lines(X0,X1) ),
    inference(cnf_transformation,[],[f36]) ).

fof(f56,plain,
    convergent_lines(sK2,sK3),
    inference(cnf_transformation,[],[f40]) ).

fof(f57,plain,
    ~ apart_point_and_line(sK0,sK2),
    inference(cnf_transformation,[],[f40]) ).

fof(f58,plain,
    ~ apart_point_and_line(sK0,sK3),
    inference(cnf_transformation,[],[f40]) ).

fof(f59,plain,
    distinct_points(sK0,intersection_point(sK2,sK3)),
    inference(cnf_transformation,[],[f40]) ).

cnf(c_51,plain,
    ~ convergent_lines(X0,X0),
    inference(cnf_transformation,[],[f43]) ).

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

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

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,[],[f51]) ).

cnf(c_62,plain,
    ( ~ convergent_lines(X0,X1)
    | distinct_lines(X1,X2)
    | convergent_lines(X0,X2) ),
    inference(cnf_transformation,[],[f54]) ).

cnf(c_63,negated_conjecture,
    distinct_points(sK0,intersection_point(sK2,sK3)),
    inference(cnf_transformation,[],[f59]) ).

cnf(c_64,negated_conjecture,
    ~ apart_point_and_line(sK0,sK3),
    inference(cnf_transformation,[],[f58]) ).

cnf(c_65,negated_conjecture,
    ~ apart_point_and_line(sK0,sK2),
    inference(cnf_transformation,[],[f57]) ).

cnf(c_66,negated_conjecture,
    convergent_lines(sK2,sK3),
    inference(cnf_transformation,[],[f56]) ).

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

cnf(c_156,plain,
    ( ~ apart_point_and_line(intersection_point(sK2,sK3),sK3)
    | ~ convergent_lines(sK2,sK3) ),
    inference(instantiation,[status(thm)],[c_58]) ).

cnf(c_163,plain,
    ( ~ convergent_lines(sK2,sK3)
    | distinct_lines(sK3,X0)
    | convergent_lines(sK2,X0) ),
    inference(instantiation,[status(thm)],[c_62]) ).

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

cnf(c_175,plain,
    ~ convergent_lines(sK2,sK2),
    inference(instantiation,[status(thm)],[c_51]) ).

cnf(c_201,plain,
    ( ~ convergent_lines(sK2,sK3)
    | distinct_lines(sK3,sK2)
    | convergent_lines(sK2,sK2) ),
    inference(instantiation,[status(thm)],[c_163]) ).

cnf(c_233,plain,
    ( ~ distinct_points(sK0,intersection_point(sK2,sK3))
    | ~ distinct_lines(sK3,sK2)
    | apart_point_and_line(intersection_point(sK2,sK3),sK2)
    | apart_point_and_line(intersection_point(sK2,sK3),sK3)
    | apart_point_and_line(sK0,sK2)
    | apart_point_and_line(sK0,sK3) ),
    inference(instantiation,[status(thm)],[c_165]) ).

cnf(c_236,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_233,c_201,c_175,c_156,c_155,c_63,c_64,c_65,c_66]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : GEO186+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13  % Command  : run_iprover %s %d THM
% 0.12/0.34  % Computer : n008.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Tue Aug 29 19:15:17 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.20/0.46  Running first-order theorem proving
% 0.20/0.46  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.04/1.13  % SZS status Started for theBenchmark.p
% 2.04/1.13  % SZS status Theorem for theBenchmark.p
% 2.04/1.13  
% 2.04/1.13  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.04/1.13  
% 2.04/1.13  ------  iProver source info
% 2.04/1.13  
% 2.04/1.13  git: date: 2023-05-31 18:12:56 +0000
% 2.04/1.13  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.04/1.13  git: non_committed_changes: false
% 2.04/1.13  git: last_make_outside_of_git: false
% 2.04/1.13  
% 2.04/1.13  ------ Parsing...
% 2.04/1.13  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 2.04/1.13  
% 2.04/1.13  ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 2.04/1.13  
% 2.04/1.13  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 2.04/1.13  ------ Proving...
% 2.04/1.13  ------ Problem Properties 
% 2.04/1.13  
% 2.04/1.13  
% 2.04/1.13  clauses                                 19
% 2.04/1.13  conjectures                             5
% 2.04/1.13  EPR                                     14
% 2.04/1.13  Horn                                    12
% 2.04/1.13  unary                                   8
% 2.04/1.13  binary                                  4
% 2.04/1.13  lits                                    40
% 2.04/1.13  lits eq                                 0
% 2.04/1.13  fd_pure                                 0
% 2.04/1.13  fd_pseudo                               0
% 2.04/1.13  fd_cond                                 0
% 2.04/1.13  fd_pseudo_cond                          0
% 2.04/1.13  AC symbols                              0
% 2.04/1.13  
% 2.04/1.13  ------ Schedule dynamic 5 is on 
% 2.04/1.13  
% 2.04/1.13  ------ no equalities: superposition off 
% 2.04/1.13  
% 2.04/1.13  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.04/1.13  
% 2.04/1.13  
% 2.04/1.13  ------ 
% 2.04/1.13  Current options:
% 2.04/1.13  ------ 
% 2.04/1.13  
% 2.04/1.13  
% 2.04/1.13  
% 2.04/1.13  
% 2.04/1.13  ------ Proving...
% 2.04/1.13  
% 2.04/1.13  
% 2.04/1.13  % SZS status Theorem for theBenchmark.p
% 2.04/1.13  
% 2.04/1.13  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.04/1.14  
% 2.04/1.14  
%------------------------------------------------------------------------------