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

% Computer : n002.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 : Fri May  3 02:17:02 EDT 2024

% Result   : Theorem 0.64s 1.12s
% Output   : CNFRefutation 0.64s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   19 (  12 unt;   0 def)
%            Number of atoms       :   26 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   25 (  18   ~;   4   |;   2   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   18 (   0 sgn  13   !;   2   ?)

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

fof(f13,axiom,
    ! [X5,X6] :
      ~ ( ~ unorthogonal_lines(X5,X6)
        & ~ convergent_lines(X5,X6) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',coipo1) ).

fof(f16,conjecture,
    ! [X5] : unorthogonal_lines(X5,X5),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).

fof(f17,negated_conjecture,
    ~ ! [X5] : unorthogonal_lines(X5,X5),
    inference(negated_conjecture,[],[f16]) ).

fof(f19,plain,
    ! [X0,X1] :
      ~ ( ~ unorthogonal_lines(X0,X1)
        & ~ convergent_lines(X0,X1) ),
    inference(rectify,[],[f13]) ).

fof(f22,plain,
    ~ ! [X0] : unorthogonal_lines(X0,X0),
    inference(rectify,[],[f17]) ).

fof(f40,plain,
    ! [X0,X1] :
      ( unorthogonal_lines(X0,X1)
      | convergent_lines(X0,X1) ),
    inference(ennf_transformation,[],[f19]) ).

fof(f45,plain,
    ? [X0] : ~ unorthogonal_lines(X0,X0),
    inference(ennf_transformation,[],[f22]) ).

fof(f46,plain,
    ( ? [X0] : ~ unorthogonal_lines(X0,X0)
   => ~ unorthogonal_lines(sK0,sK0) ),
    introduced(choice_axiom,[]) ).

fof(f47,plain,
    ~ unorthogonal_lines(sK0,sK0),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f45,f46]) ).

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

fof(f62,plain,
    ! [X0,X1] :
      ( unorthogonal_lines(X0,X1)
      | convergent_lines(X0,X1) ),
    inference(cnf_transformation,[],[f40]) ).

fof(f68,plain,
    ~ unorthogonal_lines(sK0,sK0),
    inference(cnf_transformation,[],[f47]) ).

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

cnf(c_63,plain,
    ( convergent_lines(X0,X1)
    | unorthogonal_lines(X0,X1) ),
    inference(cnf_transformation,[],[f62]) ).

cnf(c_69,negated_conjecture,
    ~ unorthogonal_lines(sK0,sK0),
    inference(cnf_transformation,[],[f68]) ).

cnf(c_70,plain,
    ~ convergent_lines(sK0,sK0),
    inference(instantiation,[status(thm)],[c_51]) ).

cnf(c_73,plain,
    ( convergent_lines(sK0,sK0)
    | unorthogonal_lines(sK0,sK0) ),
    inference(instantiation,[status(thm)],[c_63]) ).

cnf(c_74,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_73,c_70,c_69]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10  % Problem  : GEO216+2 : TPTP v8.1.2. Released v3.3.0.
% 0.06/0.11  % Command  : run_iprover %s %d THM
% 0.10/0.32  % Computer : n002.cluster.edu
% 0.10/0.32  % Model    : x86_64 x86_64
% 0.10/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32  % Memory   : 8042.1875MB
% 0.10/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32  % CPULimit : 300
% 0.10/0.32  % WCLimit  : 300
% 0.10/0.32  % DateTime : Fri May  3 01:37:42 EDT 2024
% 0.10/0.32  % CPUTime  : 
% 0.17/0.43  Running first-order theorem proving
% 0.17/0.43  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.64/1.12  % SZS status Started for theBenchmark.p
% 0.64/1.12  % SZS status Theorem for theBenchmark.p
% 0.64/1.12  
% 0.64/1.12  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.64/1.12  
% 0.64/1.12  ------  iProver source info
% 0.64/1.12  
% 0.64/1.12  git: date: 2024-05-02 19:28:25 +0000
% 0.64/1.12  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.64/1.12  git: non_committed_changes: false
% 0.64/1.12  
% 0.64/1.12  ------ Parsing...
% 0.64/1.12  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 0.64/1.12  
% 0.64/1.12  ------ Preprocessing...
% 0.64/1.12  
% 0.64/1.12  % SZS status Theorem for theBenchmark.p
% 0.64/1.12  
% 0.64/1.12  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.64/1.12  
% 0.64/1.12  
%------------------------------------------------------------------------------