TSTP Solution File: GEO226+2 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : GEO226+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% Computer : n013.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 22:47:17 EDT 2023

% Result   : Theorem 0.20s 0.61s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   17
% Syntax   : Number of formulae    :   38 (  11 unt;  12 typ;   0 def)
%            Number of atoms       :   64 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   67 (  29   ~;  20   |;  11   &)
%                                         (   0 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   18 (  10   >;   8   *;   0   +;   0  <<)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :   43 (   0 sgn;  23   !;   2   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    distinct_points: ( $i * $i ) > $o ).

tff(decl_23,type,
    distinct_lines: ( $i * $i ) > $o ).

tff(decl_24,type,
    convergent_lines: ( $i * $i ) > $o ).

tff(decl_25,type,
    line_connecting: ( $i * $i ) > $i ).

tff(decl_26,type,
    apart_point_and_line: ( $i * $i ) > $o ).

tff(decl_27,type,
    intersection_point: ( $i * $i ) > $i ).

tff(decl_28,type,
    point: $i > $o ).

tff(decl_29,type,
    line: $i > $o ).

tff(decl_30,type,
    parallel_through_point: ( $i * $i ) > $i ).

tff(decl_31,type,
    orthogonal_through_point: ( $i * $i ) > $i ).

tff(decl_32,type,
    esk1_0: $i ).

tff(decl_33,type,
    esk2_0: $i ).

fof(apart1,axiom,
    ! [X1] : ~ distinct_points(X1,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',apart1) ).

fof(con2,axiom,
    ! [X1,X2,X3] :
      ( convergent_lines(X1,X2)
     => ( ( apart_point_and_line(X3,X1)
          | apart_point_and_line(X3,X2) )
       => distinct_points(X3,intersection_point(X1,X2)) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',con2) ).

fof(con,conjecture,
    ! [X8,X9] :
      ( ( line(X8)
        & line(X9)
        & convergent_lines(X8,X9) )
     => ? [X1] :
          ( point(X1)
         => ( ~ apart_point_and_line(X1,X8)
            & ~ apart_point_and_line(X1,X9) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).

fof(apart3,axiom,
    ! [X1] : ~ convergent_lines(X1,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',apart3) ).

fof(apart6,axiom,
    ! [X1,X2,X3] :
      ( convergent_lines(X1,X2)
     => ( convergent_lines(X1,X3)
        | convergent_lines(X2,X3) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',apart6) ).

fof(c_0_5,plain,
    ! [X1] : ~ distinct_points(X1,X1),
    inference(fof_simplification,[status(thm)],[apart1]) ).

fof(c_0_6,plain,
    ! [X10] : ~ distinct_points(X10,X10),
    inference(variable_rename,[status(thm)],[c_0_5]) ).

fof(c_0_7,plain,
    ! [X25,X26,X27] :
      ( ( ~ apart_point_and_line(X27,X25)
        | distinct_points(X27,intersection_point(X25,X26))
        | ~ convergent_lines(X25,X26) )
      & ( ~ apart_point_and_line(X27,X26)
        | distinct_points(X27,intersection_point(X25,X26))
        | ~ convergent_lines(X25,X26) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[con2])])]) ).

fof(c_0_8,negated_conjecture,
    ~ ! [X8,X9] :
        ( ( line(X8)
          & line(X9)
          & convergent_lines(X8,X9) )
       => ? [X1] :
            ( point(X1)
           => ( ~ apart_point_and_line(X1,X8)
              & ~ apart_point_and_line(X1,X9) ) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).

cnf(c_0_9,plain,
    ~ distinct_points(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,plain,
    ( distinct_points(X1,intersection_point(X3,X2))
    | ~ apart_point_and_line(X1,X2)
    | ~ convergent_lines(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_11,negated_conjecture,
    ! [X50] :
      ( line(esk1_0)
      & line(esk2_0)
      & convergent_lines(esk1_0,esk2_0)
      & point(X50)
      & ( apart_point_and_line(X50,esk1_0)
        | apart_point_and_line(X50,esk2_0) ) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).

fof(c_0_12,plain,
    ! [X1] : ~ convergent_lines(X1,X1),
    inference(fof_simplification,[status(thm)],[apart3]) ).

fof(c_0_13,plain,
    ! [X19,X20,X21] :
      ( ~ convergent_lines(X19,X20)
      | convergent_lines(X19,X21)
      | convergent_lines(X20,X21) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart6])]) ).

cnf(c_0_14,plain,
    ( distinct_points(X1,intersection_point(X2,X3))
    | ~ apart_point_and_line(X1,X2)
    | ~ convergent_lines(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_15,plain,
    ( ~ apart_point_and_line(intersection_point(X1,X2),X2)
    | ~ convergent_lines(X1,X2) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_16,negated_conjecture,
    ( apart_point_and_line(X1,esk1_0)
    | apart_point_and_line(X1,esk2_0) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

fof(c_0_17,plain,
    ! [X12] : ~ convergent_lines(X12,X12),
    inference(variable_rename,[status(thm)],[c_0_12]) ).

cnf(c_0_18,plain,
    ( convergent_lines(X1,X3)
    | convergent_lines(X2,X3)
    | ~ convergent_lines(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_19,negated_conjecture,
    convergent_lines(esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_20,plain,
    ( ~ apart_point_and_line(intersection_point(X1,X2),X1)
    | ~ convergent_lines(X1,X2) ),
    inference(spm,[status(thm)],[c_0_9,c_0_14]) ).

cnf(c_0_21,negated_conjecture,
    ( apart_point_and_line(intersection_point(X1,esk1_0),esk2_0)
    | ~ convergent_lines(X1,esk1_0) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_22,plain,
    ~ convergent_lines(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_23,negated_conjecture,
    ( convergent_lines(esk1_0,X1)
    | convergent_lines(esk2_0,X1) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_24,negated_conjecture,
    ~ convergent_lines(esk2_0,esk1_0),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_25,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : GEO226+2 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.14  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35  % Computer : n013.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Tue Aug 29 19:48:46 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 0.20/0.59  start to proof: theBenchmark
% 0.20/0.61  % Version  : CSE_E---1.5
% 0.20/0.61  % Problem  : theBenchmark.p
% 0.20/0.61  % Proof found
% 0.20/0.61  % SZS status Theorem for theBenchmark.p
% 0.20/0.61  % SZS output start Proof
% See solution above
% 0.20/0.61  % Total time : 0.008000 s
% 0.20/0.61  % SZS output end Proof
% 0.20/0.61  % Total time : 0.010000 s
%------------------------------------------------------------------------------