TSTP Solution File: GEO251+1 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : GEO251+1 : TPTP v8.1.2. Bugfixed v6.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n029.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:15 EDT 2024

% Result   : Theorem 1.11s 1.21s
% Output   : CNFRefutation 1.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   20 (   6 unt;   0 def)
%            Number of atoms       :   48 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   48 (  20   ~;  15   |;   7   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   43 (   4 sgn  30   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f15,axiom,
    ! [X0,X1] :
      ~ ( left_apart_point(X0,reverse_line(X1))
        | left_apart_point(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',oag10) ).

fof(f28,axiom,
    ! [X0,X3,X1] :
      ( ( left_apart_point(X0,X1)
        & distinct_points(X0,X3) )
     => ( left_convergent_lines(line_connecting(X0,X3),X1)
        | left_apart_point(X3,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',oaguc2) ).

fof(f32,conjecture,
    ! [X0,X3,X1] :
      ( left_apart_point(X3,reverse_line(parallel_through_point(X1,X0)))
     => left_apart_point(X0,parallel_through_point(X1,X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).

fof(f33,negated_conjecture,
    ~ ! [X0,X3,X1] :
        ( left_apart_point(X3,reverse_line(parallel_through_point(X1,X0)))
       => left_apart_point(X0,parallel_through_point(X1,X3)) ),
    inference(negated_conjecture,[],[f32]) ).

fof(f56,plain,
    ! [X0,X1,X2] :
      ( ( left_apart_point(X0,X2)
        & distinct_points(X0,X1) )
     => ( left_convergent_lines(line_connecting(X0,X1),X2)
        | left_apart_point(X1,X2) ) ),
    inference(rectify,[],[f28]) ).

fof(f59,plain,
    ~ ! [X0,X1,X2] :
        ( left_apart_point(X1,reverse_line(parallel_through_point(X2,X0)))
       => left_apart_point(X0,parallel_through_point(X2,X1)) ),
    inference(rectify,[],[f33]) ).

fof(f74,plain,
    ! [X0,X1] :
      ( ~ left_apart_point(X0,reverse_line(X1))
      & ~ left_apart_point(X0,X1) ),
    inference(ennf_transformation,[],[f15]) ).

fof(f88,plain,
    ! [X0,X1,X2] :
      ( left_convergent_lines(line_connecting(X0,X1),X2)
      | left_apart_point(X1,X2)
      | ~ left_apart_point(X0,X2)
      | ~ distinct_points(X0,X1) ),
    inference(ennf_transformation,[],[f56]) ).

fof(f89,plain,
    ! [X0,X1,X2] :
      ( left_convergent_lines(line_connecting(X0,X1),X2)
      | left_apart_point(X1,X2)
      | ~ left_apart_point(X0,X2)
      | ~ distinct_points(X0,X1) ),
    inference(flattening,[],[f88]) ).

fof(f96,plain,
    ? [X0,X1,X2] :
      ( ~ left_apart_point(X0,parallel_through_point(X2,X1))
      & left_apart_point(X1,reverse_line(parallel_through_point(X2,X0))) ),
    inference(ennf_transformation,[],[f59]) ).

fof(f97,plain,
    ( ? [X0,X1,X2] :
        ( ~ left_apart_point(X0,parallel_through_point(X2,X1))
        & left_apart_point(X1,reverse_line(parallel_through_point(X2,X0))) )
   => ( ~ left_apart_point(sK0,parallel_through_point(sK2,sK1))
      & left_apart_point(sK1,reverse_line(parallel_through_point(sK2,sK0))) ) ),
    introduced(choice_axiom,[]) ).

fof(f98,plain,
    ( ~ left_apart_point(sK0,parallel_through_point(sK2,sK1))
    & left_apart_point(sK1,reverse_line(parallel_through_point(sK2,sK0))) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f96,f97]) ).

fof(f113,plain,
    ! [X0,X1] : ~ left_apart_point(X0,X1),
    inference(cnf_transformation,[],[f74]) ).

fof(f130,plain,
    ! [X2,X0,X1] :
      ( left_convergent_lines(line_connecting(X0,X1),X2)
      | left_apart_point(X1,X2)
      | ~ left_apart_point(X0,X2)
      | ~ distinct_points(X0,X1) ),
    inference(cnf_transformation,[],[f89]) ).

fof(f134,plain,
    left_apart_point(sK1,reverse_line(parallel_through_point(sK2,sK0))),
    inference(cnf_transformation,[],[f98]) ).

cnf(c_64,plain,
    ~ left_apart_point(X0,X1),
    inference(cnf_transformation,[],[f113]) ).

cnf(c_80,plain,
    ( ~ left_apart_point(X0,X1)
    | ~ distinct_points(X0,X2)
    | left_convergent_lines(line_connecting(X0,X2),X1)
    | left_apart_point(X2,X1) ),
    inference(cnf_transformation,[],[f130]) ).

cnf(c_85,negated_conjecture,
    left_apart_point(sK1,reverse_line(parallel_through_point(sK2,sK0))),
    inference(cnf_transformation,[],[f134]) ).

cnf(c_116,plain,
    ~ left_apart_point(X0,X1),
    inference(global_subsumption_just,[status(thm)],[c_80,c_64]) ).

cnf(c_138,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_85,c_116]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : GEO251+1 : TPTP v8.1.2. Bugfixed v6.4.0.
% 0.07/0.14  % Command  : run_iprover %s %d THM
% 0.15/0.35  % Computer : n029.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 300
% 0.15/0.35  % DateTime : Fri May  3 01:46:07 EDT 2024
% 0.15/0.35  % CPUTime  : 
% 0.21/0.48  Running first-order theorem proving
% 0.21/0.48  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.11/1.21  % SZS status Started for theBenchmark.p
% 1.11/1.21  % SZS status Theorem for theBenchmark.p
% 1.11/1.21  
% 1.11/1.21  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.11/1.21  
% 1.11/1.21  ------  iProver source info
% 1.11/1.21  
% 1.11/1.21  git: date: 2024-05-02 19:28:25 +0000
% 1.11/1.21  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.11/1.21  git: non_committed_changes: false
% 1.11/1.21  
% 1.11/1.21  ------ Parsing...
% 1.11/1.21  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 1.11/1.21  
% 1.11/1.21  ------ Preprocessing...
% 1.11/1.21  
% 1.11/1.21  % SZS status Theorem for theBenchmark.p
% 1.11/1.21  
% 1.11/1.21  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.11/1.21  
% 1.11/1.21  
%------------------------------------------------------------------------------