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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : GEO258+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 : n028.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:32 EDT 2023

% Result   : Theorem 0.18s 0.58s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   28
% Syntax   : Number of formulae    :   49 (   6 unt;  26 typ;   0 def)
%            Number of atoms       :   65 (   0 equ)
%            Maximal formula atoms :   18 (   2 avg)
%            Number of connectives :   69 (  27   ~;  31   |;   8   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   4 avg)
%            Maximal term depth    :    1 (   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    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :   40 (   2 sgn;  16   !;   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 ).

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

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

fof(a9_defns,axiom,
    ! [X4,X3,X6,X7] :
      ( between_on_line(X4,X3,X6,X7)
    <=> ( ( before_on_line(X4,X3,X6)
          & before_on_line(X4,X6,X7) )
        | ( before_on_line(X4,X7,X6)
          & before_on_line(X4,X6,X3) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',a9_defns) ).

fof(c_0_2,negated_conjecture,
    ~ ! [X4,X3,X6,X7] :
        ( between_on_line(X4,X3,X6,X7)
       => between_on_line(X4,X7,X6,X3) ),
    inference(assume_negation,[status(cth)],[con]) ).

fof(c_0_3,negated_conjecture,
    ( between_on_line(esk1_0,esk2_0,esk3_0,esk4_0)
    & ~ between_on_line(esk1_0,esk4_0,esk3_0,esk2_0) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).

fof(c_0_4,plain,
    ! [X29,X30,X31,X32] :
      ( ( before_on_line(X29,X32,X31)
        | before_on_line(X29,X30,X31)
        | ~ between_on_line(X29,X30,X31,X32) )
      & ( before_on_line(X29,X31,X30)
        | before_on_line(X29,X30,X31)
        | ~ between_on_line(X29,X30,X31,X32) )
      & ( before_on_line(X29,X32,X31)
        | before_on_line(X29,X31,X32)
        | ~ between_on_line(X29,X30,X31,X32) )
      & ( before_on_line(X29,X31,X30)
        | before_on_line(X29,X31,X32)
        | ~ between_on_line(X29,X30,X31,X32) )
      & ( ~ before_on_line(X29,X30,X31)
        | ~ before_on_line(X29,X31,X32)
        | between_on_line(X29,X30,X31,X32) )
      & ( ~ before_on_line(X29,X32,X31)
        | ~ before_on_line(X29,X31,X30)
        | between_on_line(X29,X30,X31,X32) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a9_defns])])]) ).

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

cnf(c_0_6,plain,
    ( between_on_line(X1,X2,X3,X4)
    | ~ before_on_line(X1,X2,X3)
    | ~ before_on_line(X1,X3,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,plain,
    ( before_on_line(X1,X2,X3)
    | before_on_line(X1,X3,X2)
    | ~ between_on_line(X1,X4,X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

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

cnf(c_0_9,plain,
    ( before_on_line(X1,X2,X3)
    | before_on_line(X1,X4,X3)
    | ~ between_on_line(X1,X4,X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_10,plain,
    ( between_on_line(X1,X4,X3,X2)
    | ~ before_on_line(X1,X2,X3)
    | ~ before_on_line(X1,X3,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_11,negated_conjecture,
    ( ~ before_on_line(esk1_0,esk3_0,esk2_0)
    | ~ before_on_line(esk1_0,esk4_0,esk3_0) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_12,negated_conjecture,
    ( before_on_line(esk1_0,esk4_0,esk3_0)
    | before_on_line(esk1_0,esk3_0,esk4_0) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_13,negated_conjecture,
    ( before_on_line(esk1_0,esk4_0,esk3_0)
    | before_on_line(esk1_0,esk2_0,esk3_0) ),
    inference(spm,[status(thm)],[c_0_9,c_0_8]) ).

cnf(c_0_14,negated_conjecture,
    ( ~ before_on_line(esk1_0,esk3_0,esk4_0)
    | ~ before_on_line(esk1_0,esk2_0,esk3_0) ),
    inference(spm,[status(thm)],[c_0_5,c_0_10]) ).

cnf(c_0_15,negated_conjecture,
    ( before_on_line(esk1_0,esk3_0,esk4_0)
    | ~ before_on_line(esk1_0,esk3_0,esk2_0) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,negated_conjecture,
    ( before_on_line(esk1_0,esk2_0,esk3_0)
    | ~ before_on_line(esk1_0,esk3_0,esk2_0) ),
    inference(spm,[status(thm)],[c_0_11,c_0_13]) ).

cnf(c_0_17,plain,
    ( before_on_line(X1,X2,X3)
    | before_on_line(X1,X3,X2)
    | ~ between_on_line(X1,X3,X2,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_18,negated_conjecture,
    ~ before_on_line(esk1_0,esk3_0,esk2_0),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).

cnf(c_0_19,negated_conjecture,
    before_on_line(esk1_0,esk2_0,esk3_0),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_8]),c_0_18]) ).

cnf(c_0_20,plain,
    ( before_on_line(X1,X2,X3)
    | before_on_line(X1,X2,X4)
    | ~ between_on_line(X1,X3,X2,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_21,negated_conjecture,
    ~ before_on_line(esk1_0,esk3_0,esk4_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_19])]) ).

cnf(c_0_22,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_8]),c_0_21]),c_0_18]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : GEO258+3 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.33  % Computer : n028.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Tue Aug 29 23:21:56 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.18/0.55  start to proof: theBenchmark
% 0.18/0.58  % Version  : CSE_E---1.5
% 0.18/0.58  % Problem  : theBenchmark.p
% 0.18/0.58  % Proof found
% 0.18/0.58  % SZS status Theorem for theBenchmark.p
% 0.18/0.58  % SZS output start Proof
% See solution above
% 0.18/0.58  % Total time : 0.018000 s
% 0.18/0.58  % SZS output end Proof
% 0.18/0.58  % Total time : 0.020000 s
%------------------------------------------------------------------------------