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

View Problem - Process Solution

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

% Computer : n032.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:16 EDT 2023

% Result   : Theorem 0.45s 1.14s
% Output   : CNFRefutation 0.45s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   35 (  15 unt;   0 def)
%            Number of atoms       :   85 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   91 (  41   ~;  33   |;  12   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   59 (   2 sgn;  38   !;   9   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f6,axiom,
    ! [X0,X1,X2] :
      ( convergent_lines(X0,X1)
     => ( convergent_lines(X1,X2)
        | convergent_lines(X0,X2) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax6) ).

fof(f15,axiom,
    ! [X0,X1] : ~ convergent_lines(parallel_through_point(X1,X0),X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cp1) ).

fof(f16,axiom,
    ! [X0,X1] : ~ apart_point_and_line(X0,parallel_through_point(X1,X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cp2) ).

fof(f17,axiom,
    ! [X0,X1,X2] :
      ( distinct_lines(X1,X2)
     => ( convergent_lines(X1,X2)
        | apart_point_and_line(X0,X2)
        | apart_point_and_line(X0,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cup1) ).

fof(f18,conjecture,
    ! [X0,X1,X2] :
      ( ( ~ convergent_lines(X1,X2)
        & ~ apart_point_and_line(X0,X1) )
     => ~ distinct_lines(X1,parallel_through_point(X2,X0)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).

fof(f19,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( ( ~ convergent_lines(X1,X2)
          & ~ apart_point_and_line(X0,X1) )
       => ~ distinct_lines(X1,parallel_through_point(X2,X0)) ),
    inference(negated_conjecture,[],[f18]) ).

fof(f25,plain,
    ! [X0,X1,X2] :
      ( convergent_lines(X1,X2)
      | convergent_lines(X0,X2)
      | ~ convergent_lines(X0,X1) ),
    inference(ennf_transformation,[],[f6]) ).

fof(f26,plain,
    ! [X0,X1,X2] :
      ( convergent_lines(X1,X2)
      | convergent_lines(X0,X2)
      | ~ convergent_lines(X0,X1) ),
    inference(flattening,[],[f25]) ).

fof(f39,plain,
    ! [X0,X1,X2] :
      ( convergent_lines(X1,X2)
      | apart_point_and_line(X0,X2)
      | apart_point_and_line(X0,X1)
      | ~ distinct_lines(X1,X2) ),
    inference(ennf_transformation,[],[f17]) ).

fof(f40,plain,
    ! [X0,X1,X2] :
      ( convergent_lines(X1,X2)
      | apart_point_and_line(X0,X2)
      | apart_point_and_line(X0,X1)
      | ~ distinct_lines(X1,X2) ),
    inference(flattening,[],[f39]) ).

fof(f41,plain,
    ? [X0,X1,X2] :
      ( distinct_lines(X1,parallel_through_point(X2,X0))
      & ~ convergent_lines(X1,X2)
      & ~ apart_point_and_line(X0,X1) ),
    inference(ennf_transformation,[],[f19]) ).

fof(f42,plain,
    ? [X0,X1,X2] :
      ( distinct_lines(X1,parallel_through_point(X2,X0))
      & ~ convergent_lines(X1,X2)
      & ~ apart_point_and_line(X0,X1) ),
    inference(flattening,[],[f41]) ).

fof(f43,plain,
    ( ? [X0,X1,X2] :
        ( distinct_lines(X1,parallel_through_point(X2,X0))
        & ~ convergent_lines(X1,X2)
        & ~ apart_point_and_line(X0,X1) )
   => ( distinct_lines(sK1,parallel_through_point(sK2,sK0))
      & ~ convergent_lines(sK1,sK2)
      & ~ apart_point_and_line(sK0,sK1) ) ),
    introduced(choice_axiom,[]) ).

fof(f44,plain,
    ( distinct_lines(sK1,parallel_through_point(sK2,sK0))
    & ~ convergent_lines(sK1,sK2)
    & ~ apart_point_and_line(sK0,sK1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f42,f43]) ).

fof(f50,plain,
    ! [X2,X0,X1] :
      ( convergent_lines(X1,X2)
      | convergent_lines(X0,X2)
      | ~ convergent_lines(X0,X1) ),
    inference(cnf_transformation,[],[f26]) ).

fof(f59,plain,
    ! [X0,X1] : ~ convergent_lines(parallel_through_point(X1,X0),X1),
    inference(cnf_transformation,[],[f15]) ).

fof(f60,plain,
    ! [X0,X1] : ~ apart_point_and_line(X0,parallel_through_point(X1,X0)),
    inference(cnf_transformation,[],[f16]) ).

fof(f61,plain,
    ! [X2,X0,X1] :
      ( convergent_lines(X1,X2)
      | apart_point_and_line(X0,X2)
      | apart_point_and_line(X0,X1)
      | ~ distinct_lines(X1,X2) ),
    inference(cnf_transformation,[],[f40]) ).

fof(f62,plain,
    ~ apart_point_and_line(sK0,sK1),
    inference(cnf_transformation,[],[f44]) ).

fof(f63,plain,
    ~ convergent_lines(sK1,sK2),
    inference(cnf_transformation,[],[f44]) ).

fof(f64,plain,
    distinct_lines(sK1,parallel_through_point(sK2,sK0)),
    inference(cnf_transformation,[],[f44]) ).

cnf(c_54,plain,
    ( ~ convergent_lines(X0,X1)
    | convergent_lines(X0,X2)
    | convergent_lines(X1,X2) ),
    inference(cnf_transformation,[],[f50]) ).

cnf(c_63,plain,
    ~ convergent_lines(parallel_through_point(X0,X1),X0),
    inference(cnf_transformation,[],[f59]) ).

cnf(c_64,plain,
    ~ apart_point_and_line(X0,parallel_through_point(X1,X0)),
    inference(cnf_transformation,[],[f60]) ).

cnf(c_65,plain,
    ( ~ distinct_lines(X0,X1)
    | convergent_lines(X0,X1)
    | apart_point_and_line(X2,X0)
    | apart_point_and_line(X2,X1) ),
    inference(cnf_transformation,[],[f61]) ).

cnf(c_66,negated_conjecture,
    distinct_lines(sK1,parallel_through_point(sK2,sK0)),
    inference(cnf_transformation,[],[f64]) ).

cnf(c_67,negated_conjecture,
    ~ convergent_lines(sK1,sK2),
    inference(cnf_transformation,[],[f63]) ).

cnf(c_68,negated_conjecture,
    ~ apart_point_and_line(sK0,sK1),
    inference(cnf_transformation,[],[f62]) ).

cnf(c_164,plain,
    ( ~ distinct_lines(sK1,parallel_through_point(sK2,sK0))
    | apart_point_and_line(X0,parallel_through_point(sK2,sK0))
    | convergent_lines(sK1,parallel_through_point(sK2,sK0))
    | apart_point_and_line(X0,sK1) ),
    inference(instantiation,[status(thm)],[c_65]) ).

cnf(c_171,plain,
    ( ~ convergent_lines(sK1,parallel_through_point(sK2,sK0))
    | convergent_lines(parallel_through_point(sK2,sK0),X0)
    | convergent_lines(sK1,X0) ),
    inference(instantiation,[status(thm)],[c_54]) ).

cnf(c_176,plain,
    ( ~ distinct_lines(sK1,parallel_through_point(sK2,sK0))
    | convergent_lines(sK1,parallel_through_point(sK2,sK0))
    | apart_point_and_line(sK0,parallel_through_point(sK2,sK0))
    | apart_point_and_line(sK0,sK1) ),
    inference(instantiation,[status(thm)],[c_164]) ).

cnf(c_193,plain,
    ~ apart_point_and_line(sK0,parallel_through_point(sK2,sK0)),
    inference(instantiation,[status(thm)],[c_64]) ).

cnf(c_220,plain,
    ( ~ convergent_lines(sK1,parallel_through_point(sK2,sK0))
    | convergent_lines(parallel_through_point(sK2,sK0),sK2)
    | convergent_lines(sK1,sK2) ),
    inference(instantiation,[status(thm)],[c_171]) ).

cnf(c_221,plain,
    ~ convergent_lines(parallel_through_point(sK2,sK0),sK2),
    inference(instantiation,[status(thm)],[c_63]) ).

cnf(c_222,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_221,c_220,c_193,c_176,c_66,c_67,c_68]) ).


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