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

View Problem - Process Solution

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

% Computer : n014.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:46:49 EDT 2023

% Result   : Theorem 0.19s 0.61s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   23 (   5 unt;  10 typ;   0 def)
%            Number of atoms       :   38 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   43 (  18   ~;  11   |;  10   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   12 (   6   >;   6   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   20 (   0 sgn;  14   !;   0   ?;   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,
    esk1_0: $i ).

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

tff(decl_30,type,
    esk3_0: $i ).

tff(decl_31,type,
    esk4_0: $i ).

fof(con,conjecture,
    ! [X1,X2,X4,X5] :
      ( ( distinct_points(X1,X2)
        & convergent_lines(X4,X5)
        & ~ distinct_points(X1,intersection_point(X4,X5)) )
     => ( ~ apart_point_and_line(X1,X4)
        & ~ apart_point_and_line(X1,X5) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).

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/sandbox/benchmark/Axioms/GEO008+0.ax',con2) ).

fof(c_0_2,negated_conjecture,
    ~ ! [X1,X2,X4,X5] :
        ( ( distinct_points(X1,X2)
          & convergent_lines(X4,X5)
          & ~ distinct_points(X1,intersection_point(X4,X5)) )
       => ( ~ apart_point_and_line(X1,X4)
          & ~ apart_point_and_line(X1,X5) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).

fof(c_0_3,negated_conjecture,
    ( distinct_points(esk1_0,esk2_0)
    & convergent_lines(esk3_0,esk4_0)
    & ~ distinct_points(esk1_0,intersection_point(esk3_0,esk4_0))
    & ( apart_point_and_line(esk1_0,esk3_0)
      | apart_point_and_line(esk1_0,esk4_0) ) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).

fof(c_0_4,plain,
    ! [X21,X22,X23] :
      ( ( ~ apart_point_and_line(X23,X21)
        | distinct_points(X23,intersection_point(X21,X22))
        | ~ convergent_lines(X21,X22) )
      & ( ~ apart_point_and_line(X23,X22)
        | distinct_points(X23,intersection_point(X21,X22))
        | ~ convergent_lines(X21,X22) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[con2])])]) ).

cnf(c_0_5,negated_conjecture,
    ~ distinct_points(esk1_0,intersection_point(esk3_0,esk4_0)),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,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_4]) ).

cnf(c_0_7,negated_conjecture,
    convergent_lines(esk3_0,esk4_0),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_8,negated_conjecture,
    ( apart_point_and_line(esk1_0,esk3_0)
    | apart_point_and_line(esk1_0,esk4_0) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_9,negated_conjecture,
    ~ apart_point_and_line(esk1_0,esk4_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]) ).

cnf(c_0_10,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_4]) ).

cnf(c_0_11,negated_conjecture,
    apart_point_and_line(esk1_0,esk3_0),
    inference(sr,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_12,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_10]),c_0_11]),c_0_7])]),
    [proof] ).

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