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

View Problem - Process Solution

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

% Computer : n027.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:24 EDT 2023

% Result   : Theorem 0.49s 1.19s
% Output   : CNFRefutation 0.49s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   56 (  16 unt;   0 def)
%            Number of atoms       :  123 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  109 (  42   ~;  45   |;  14   &)
%                                         (   1 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   91 (   0 sgn;  51   !;   9   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f2,axiom,
    ! [X0] : ~ distinct_lines(X0,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',apart2) ).

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

fof(f5,axiom,
    ! [X0,X1,X2] :
      ( distinct_lines(X0,X1)
     => ( distinct_lines(X1,X2)
        | distinct_lines(X0,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',apart5) ).

fof(f14,axiom,
    ! [X0,X1,X2] :
      ( convergent_lines(X0,X1)
     => ( convergent_lines(X0,X2)
        | distinct_lines(X1,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ceq3) ).

fof(f15,axiom,
    ! [X0,X1] :
      ( distinct_lines(X0,X1)
     => convergent_lines(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p1) ).

fof(f33,axiom,
    ! [X0,X1] :
      ( parallel_lines(X0,X1)
    <=> ~ convergent_lines(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a3) ).

fof(f36,conjecture,
    ! [X5,X6,X7] :
      ( ( parallel_lines(X5,X7)
        & parallel_lines(X5,X6) )
     => parallel_lines(X6,X7) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).

fof(f37,negated_conjecture,
    ~ ! [X5,X6,X7] :
        ( ( parallel_lines(X5,X7)
          & parallel_lines(X5,X6) )
       => parallel_lines(X6,X7) ),
    inference(negated_conjecture,[],[f36]) ).

fof(f51,plain,
    ~ ! [X0,X1,X2] :
        ( ( parallel_lines(X0,X2)
          & parallel_lines(X0,X1) )
       => parallel_lines(X1,X2) ),
    inference(rectify,[],[f37]) ).

fof(f54,plain,
    ! [X0,X1,X2] :
      ( distinct_lines(X1,X2)
      | distinct_lines(X0,X2)
      | ~ distinct_lines(X0,X1) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f55,plain,
    ! [X0,X1,X2] :
      ( distinct_lines(X1,X2)
      | distinct_lines(X0,X2)
      | ~ distinct_lines(X0,X1) ),
    inference(flattening,[],[f54]) ).

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

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

fof(f70,plain,
    ! [X0,X1] :
      ( convergent_lines(X0,X1)
      | ~ distinct_lines(X0,X1) ),
    inference(ennf_transformation,[],[f15]) ).

fof(f90,plain,
    ? [X0,X1,X2] :
      ( ~ parallel_lines(X1,X2)
      & parallel_lines(X0,X2)
      & parallel_lines(X0,X1) ),
    inference(ennf_transformation,[],[f51]) ).

fof(f91,plain,
    ? [X0,X1,X2] :
      ( ~ parallel_lines(X1,X2)
      & parallel_lines(X0,X2)
      & parallel_lines(X0,X1) ),
    inference(flattening,[],[f90]) ).

fof(f92,plain,
    ! [X0,X1] :
      ( ( parallel_lines(X0,X1)
        | convergent_lines(X0,X1) )
      & ( ~ convergent_lines(X0,X1)
        | ~ parallel_lines(X0,X1) ) ),
    inference(nnf_transformation,[],[f33]) ).

fof(f93,plain,
    ( ? [X0,X1,X2] :
        ( ~ parallel_lines(X1,X2)
        & parallel_lines(X0,X2)
        & parallel_lines(X0,X1) )
   => ( ~ parallel_lines(sK1,sK2)
      & parallel_lines(sK0,sK2)
      & parallel_lines(sK0,sK1) ) ),
    introduced(choice_axiom,[]) ).

fof(f94,plain,
    ( ~ parallel_lines(sK1,sK2)
    & parallel_lines(sK0,sK2)
    & parallel_lines(sK0,sK1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f91,f93]) ).

fof(f96,plain,
    ! [X0] : ~ distinct_lines(X0,X0),
    inference(cnf_transformation,[],[f2]) ).

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

fof(f99,plain,
    ! [X2,X0,X1] :
      ( distinct_lines(X1,X2)
      | distinct_lines(X0,X2)
      | ~ distinct_lines(X0,X1) ),
    inference(cnf_transformation,[],[f55]) ).

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

fof(f109,plain,
    ! [X0,X1] :
      ( convergent_lines(X0,X1)
      | ~ distinct_lines(X0,X1) ),
    inference(cnf_transformation,[],[f70]) ).

fof(f131,plain,
    ! [X0,X1] :
      ( ~ convergent_lines(X0,X1)
      | ~ parallel_lines(X0,X1) ),
    inference(cnf_transformation,[],[f92]) ).

fof(f132,plain,
    ! [X0,X1] :
      ( parallel_lines(X0,X1)
      | convergent_lines(X0,X1) ),
    inference(cnf_transformation,[],[f92]) ).

fof(f133,plain,
    parallel_lines(sK0,sK1),
    inference(cnf_transformation,[],[f94]) ).

fof(f134,plain,
    parallel_lines(sK0,sK2),
    inference(cnf_transformation,[],[f94]) ).

fof(f135,plain,
    ~ parallel_lines(sK1,sK2),
    inference(cnf_transformation,[],[f94]) ).

cnf(c_50,plain,
    ~ distinct_lines(X0,X0),
    inference(cnf_transformation,[],[f96]) ).

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

cnf(c_53,plain,
    ( ~ distinct_lines(X0,X1)
    | distinct_lines(X0,X2)
    | distinct_lines(X1,X2) ),
    inference(cnf_transformation,[],[f99]) ).

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

cnf(c_63,plain,
    ( ~ distinct_lines(X0,X1)
    | convergent_lines(X0,X1) ),
    inference(cnf_transformation,[],[f109]) ).

cnf(c_85,plain,
    ( convergent_lines(X0,X1)
    | parallel_lines(X0,X1) ),
    inference(cnf_transformation,[],[f132]) ).

cnf(c_86,plain,
    ( ~ convergent_lines(X0,X1)
    | ~ parallel_lines(X0,X1) ),
    inference(cnf_transformation,[],[f131]) ).

cnf(c_87,negated_conjecture,
    ~ parallel_lines(sK1,sK2),
    inference(cnf_transformation,[],[f135]) ).

cnf(c_88,negated_conjecture,
    parallel_lines(sK0,sK2),
    inference(cnf_transformation,[],[f134]) ).

cnf(c_89,negated_conjecture,
    parallel_lines(sK0,sK1),
    inference(cnf_transformation,[],[f133]) ).

cnf(c_109,plain,
    ( parallel_lines(X0,X1)
    | convergent_lines(X0,X1) ),
    inference(prop_impl_just,[status(thm)],[c_85]) ).

cnf(c_110,plain,
    ( convergent_lines(X0,X1)
    | parallel_lines(X0,X1) ),
    inference(renaming,[status(thm)],[c_109]) ).

cnf(c_113,plain,
    ( ~ distinct_lines(X0,X1)
    | ~ parallel_lines(X0,X1) ),
    inference(prop_impl_just,[status(thm)],[c_63,c_86]) ).

cnf(c_191,plain,
    ( distinct_lines(X0,X1)
    | convergent_lines(X2,X1)
    | parallel_lines(X2,X0) ),
    inference(bin_hyper_res,[status(thm)],[c_62,c_110]) ).

cnf(c_699,plain,
    ~ distinct_lines(sK0,sK2),
    inference(resolution,[status(thm)],[c_113,c_88]) ).

cnf(c_711,plain,
    ~ distinct_lines(sK0,sK1),
    inference(resolution,[status(thm)],[c_113,c_89]) ).

cnf(c_1791,plain,
    ~ convergent_lines(sK1,sK1),
    inference(instantiation,[status(thm)],[c_51]) ).

cnf(c_1792,plain,
    ( ~ convergent_lines(sK1,X0)
    | ~ parallel_lines(sK1,X0) ),
    inference(instantiation,[status(thm)],[c_86]) ).

cnf(c_1793,plain,
    ( ~ convergent_lines(sK1,sK0)
    | ~ parallel_lines(sK1,sK0) ),
    inference(instantiation,[status(thm)],[c_1792]) ).

cnf(c_1799,plain,
    ( distinct_lines(X0,X1)
    | convergent_lines(sK1,X1)
    | parallel_lines(sK1,X0) ),
    inference(instantiation,[status(thm)],[c_191]) ).

cnf(c_2031,plain,
    ( distinct_lines(X0,sK1)
    | parallel_lines(sK1,X0)
    | convergent_lines(sK1,sK1) ),
    inference(instantiation,[status(thm)],[c_1799]) ).

cnf(c_2032,plain,
    ( distinct_lines(sK0,sK1)
    | convergent_lines(sK1,sK1)
    | parallel_lines(sK1,sK0) ),
    inference(instantiation,[status(thm)],[c_2031]) ).

cnf(c_2110,plain,
    ( distinct_lines(sK2,X0)
    | convergent_lines(sK1,X0) ),
    inference(superposition,[status(thm)],[c_191,c_87]) ).

cnf(c_2279,plain,
    ( distinct_lines(X0,X1)
    | distinct_lines(sK2,X1)
    | convergent_lines(sK1,X0) ),
    inference(superposition,[status(thm)],[c_2110,c_53]) ).

cnf(c_2421,plain,
    ( distinct_lines(X0,sK2)
    | convergent_lines(sK1,X0) ),
    inference(superposition,[status(thm)],[c_2279,c_50]) ).

cnf(c_2445,plain,
    ( distinct_lines(sK0,sK2)
    | convergent_lines(sK1,sK0) ),
    inference(instantiation,[status(thm)],[c_2421]) ).

cnf(c_2446,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_2445,c_2032,c_1793,c_1791,c_711,c_699]) ).


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