TSTP Solution File: GEO251+3 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : GEO251+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/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:47:29 EDT 2023

% Result   : Theorem 0.21s 0.60s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   28
% Syntax   : Number of formulae    :   37 (   4 unt;  25 typ;   0 def)
%            Number of atoms       :   22 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   20 (  10   ~;   4   |;   3   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   45 (  22   >;  23   *;   0   +;   0  <<)
%            Number of predicates  :   19 (  18 usr;   1 prp; 0-4 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   20 (   4 sgn;  14   !;   0   ?;   0   :)

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

tff(decl_23,type,
    reverse_line: $i > $i ).

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

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

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

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

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

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

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

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

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

tff(decl_33,type,
    divides_points: ( $i * $i * $i ) > $o ).

tff(decl_34,type,
    before_on_line: ( $i * $i * $i ) > $o ).

tff(decl_35,type,
    distinct_points: ( $i * $i ) > $o ).

tff(decl_36,type,
    incident_point_and_line: ( $i * $i ) > $o ).

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

tff(decl_38,type,
    between_on_line: ( $i * $i * $i * $i ) > $o ).

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

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

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

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

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

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

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

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

fof(con,conjecture,
    ! [X3,X6,X4] :
      ( right_apart_point(X6,parallel_through_point(X4,X3))
     => left_apart_point(X3,parallel_through_point(X4,X6)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).

fof(a2_defns,axiom,
    ! [X1,X2] :
      ( right_apart_point(X1,X2)
    <=> left_apart_point(X1,reverse_line(X2)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',a2_defns) ).

fof(ax10_basics,axiom,
    ! [X3,X4] :
      ~ ( left_apart_point(X3,X4)
        | left_apart_point(X3,reverse_line(X4)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',ax10_basics) ).

fof(c_0_3,negated_conjecture,
    ~ ! [X3,X6,X4] :
        ( right_apart_point(X6,parallel_through_point(X4,X3))
       => left_apart_point(X3,parallel_through_point(X4,X6)) ),
    inference(assume_negation,[status(cth)],[con]) ).

fof(c_0_4,plain,
    ! [X11,X12] :
      ( ( ~ right_apart_point(X11,X12)
        | left_apart_point(X11,reverse_line(X12)) )
      & ( ~ left_apart_point(X11,reverse_line(X12))
        | right_apart_point(X11,X12) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a2_defns])]) ).

fof(c_0_5,plain,
    ! [X52,X53] :
      ( ~ left_apart_point(X52,X53)
      & ~ left_apart_point(X52,reverse_line(X53)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax10_basics])]) ).

fof(c_0_6,negated_conjecture,
    ( right_apart_point(esk2_0,parallel_through_point(esk3_0,esk1_0))
    & ~ left_apart_point(esk1_0,parallel_through_point(esk3_0,esk2_0)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).

cnf(c_0_7,plain,
    ( left_apart_point(X1,reverse_line(X2))
    | ~ right_apart_point(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,plain,
    ~ left_apart_point(X1,X2),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,negated_conjecture,
    right_apart_point(esk2_0,parallel_through_point(esk3_0,esk1_0)),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,plain,
    ~ right_apart_point(X1,X2),
    inference(sr,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[c_0_9,c_0_10]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : GEO251+3 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34  % Computer : n014.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:56:45 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.21/0.58  start to proof: theBenchmark
% 0.21/0.60  % Version  : CSE_E---1.5
% 0.21/0.60  % Problem  : theBenchmark.p
% 0.21/0.60  % Proof found
% 0.21/0.60  % SZS status Theorem for theBenchmark.p
% 0.21/0.60  % SZS output start Proof
% See solution above
% 0.21/0.60  % Total time : 0.009000 s
% 0.21/0.60  % SZS output end Proof
% 0.21/0.60  % Total time : 0.012000 s
%------------------------------------------------------------------------------