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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : GEO196+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 : n020.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:57 EDT 2023

% Result   : Theorem 35.58s 35.66s
% Output   : CNFRefutation 35.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :   28
% Syntax   : Number of formulae    :   63 (  14 unt;  20 typ;   0 def)
%            Number of atoms       :   96 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   81 (  28   ~;  33   |;  13   &)
%                                         (   2 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   30 (  16   >;  14   *;   0   +;   0  <<)
%            Number of predicates  :   13 (  12 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :   78 (  16 sgn;  45   !;   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,
    parallel_through_point: ( $i * $i ) > $i ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

fof(a4,axiom,
    ! [X1,X2] :
      ( incident_point_and_line(X1,X2)
    <=> ~ apart_point_and_line(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+6.ax',a4) ).

fof(cp2,axiom,
    ! [X1,X2] : ~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+2.ax',cp2) ).

fof(ceq2,axiom,
    ! [X1,X2,X3] :
      ( apart_point_and_line(X1,X2)
     => ( distinct_lines(X2,X3)
        | apart_point_and_line(X1,X3) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ceq2) ).

fof(p1,axiom,
    ! [X1,X2] :
      ( distinct_lines(X1,X2)
     => convergent_lines(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+1.ax',p1) ).

fof(cp1,axiom,
    ! [X1,X2] : ~ convergent_lines(parallel_through_point(X2,X1),X2),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+2.ax',cp1) ).

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

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

fof(c_0_8,negated_conjecture,
    ~ ! [X1,X2,X4,X5] :
        ( ( convergent_lines(X1,X2)
          & convergent_lines(X4,X5)
          & incident_point_and_line(intersection_point(X1,X2),X4)
          & incident_point_and_line(intersection_point(X1,X2),X5) )
       => ( incident_point_and_line(intersection_point(X4,X5),X1)
          & incident_point_and_line(intersection_point(X4,X5),X2) ) ),
    inference(assume_negation,[status(cth)],[con]) ).

fof(c_0_9,plain,
    ! [X1,X2] :
      ( incident_point_and_line(X1,X2)
    <=> ~ apart_point_and_line(X1,X2) ),
    inference(fof_simplification,[status(thm)],[a4]) ).

fof(c_0_10,negated_conjecture,
    ( convergent_lines(esk1_0,esk2_0)
    & convergent_lines(esk3_0,esk4_0)
    & incident_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)
    & incident_point_and_line(intersection_point(esk1_0,esk2_0),esk4_0)
    & ( ~ incident_point_and_line(intersection_point(esk3_0,esk4_0),esk1_0)
      | ~ incident_point_and_line(intersection_point(esk3_0,esk4_0),esk2_0) ) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).

fof(c_0_11,plain,
    ! [X88,X89] :
      ( ( ~ incident_point_and_line(X88,X89)
        | ~ apart_point_and_line(X88,X89) )
      & ( apart_point_and_line(X88,X89)
        | incident_point_and_line(X88,X89) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])]) ).

cnf(c_0_12,negated_conjecture,
    ( ~ incident_point_and_line(intersection_point(esk3_0,esk4_0),esk1_0)
    | ~ incident_point_and_line(intersection_point(esk3_0,esk4_0),esk2_0) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_13,plain,
    ( apart_point_and_line(X1,X2)
    | incident_point_and_line(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

fof(c_0_14,plain,
    ! [X1,X2] : ~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
    inference(fof_simplification,[status(thm)],[cp2]) ).

fof(c_0_15,plain,
    ! [X38,X39,X40] :
      ( ~ apart_point_and_line(X38,X39)
      | distinct_lines(X39,X40)
      | apart_point_and_line(X38,X40) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq2])]) ).

cnf(c_0_16,negated_conjecture,
    ( apart_point_and_line(intersection_point(esk3_0,esk4_0),esk1_0)
    | ~ incident_point_and_line(intersection_point(esk3_0,esk4_0),esk2_0) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

fof(c_0_17,plain,
    ! [X48,X49] : ~ apart_point_and_line(X48,parallel_through_point(X49,X48)),
    inference(variable_rename,[status(thm)],[c_0_14]) ).

cnf(c_0_18,plain,
    ( distinct_lines(X2,X3)
    | apart_point_and_line(X1,X3)
    | ~ apart_point_and_line(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_19,negated_conjecture,
    ( apart_point_and_line(intersection_point(esk3_0,esk4_0),esk2_0)
    | apart_point_and_line(intersection_point(esk3_0,esk4_0),esk1_0) ),
    inference(spm,[status(thm)],[c_0_16,c_0_13]) ).

fof(c_0_20,plain,
    ! [X44,X45] :
      ( ~ distinct_lines(X44,X45)
      | convergent_lines(X44,X45) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p1])]) ).

cnf(c_0_21,plain,
    ~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_22,negated_conjecture,
    ( apart_point_and_line(intersection_point(esk3_0,esk4_0),esk2_0)
    | apart_point_and_line(intersection_point(esk3_0,esk4_0),X1)
    | distinct_lines(esk1_0,X1) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

fof(c_0_23,plain,
    ! [X1,X2] : ~ convergent_lines(parallel_through_point(X2,X1),X2),
    inference(fof_simplification,[status(thm)],[cp1]) ).

fof(c_0_24,plain,
    ! [X20,X21,X22] :
      ( ~ convergent_lines(X20,X21)
      | convergent_lines(X20,X22)
      | convergent_lines(X21,X22) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax6])]) ).

cnf(c_0_25,plain,
    ( convergent_lines(X1,X2)
    | ~ distinct_lines(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_26,negated_conjecture,
    ( apart_point_and_line(intersection_point(esk3_0,esk4_0),esk2_0)
    | distinct_lines(esk1_0,parallel_through_point(X1,intersection_point(esk3_0,esk4_0))) ),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

fof(c_0_27,plain,
    ! [X46,X47] : ~ convergent_lines(parallel_through_point(X47,X46),X47),
    inference(variable_rename,[status(thm)],[c_0_23]) ).

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

cnf(c_0_29,negated_conjecture,
    ( apart_point_and_line(intersection_point(esk3_0,esk4_0),esk2_0)
    | convergent_lines(esk1_0,parallel_through_point(X1,intersection_point(esk3_0,esk4_0))) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_30,plain,
    ~ convergent_lines(parallel_through_point(X1,X2),X1),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

cnf(c_0_31,negated_conjecture,
    ( apart_point_and_line(intersection_point(esk3_0,esk4_0),esk2_0)
    | convergent_lines(parallel_through_point(X1,intersection_point(esk3_0,esk4_0)),X2)
    | convergent_lines(esk1_0,X2) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_32,negated_conjecture,
    ( apart_point_and_line(intersection_point(esk3_0,esk4_0),esk2_0)
    | convergent_lines(esk1_0,X1) ),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_33,negated_conjecture,
    ( apart_point_and_line(intersection_point(esk3_0,esk4_0),X1)
    | convergent_lines(esk1_0,X2)
    | distinct_lines(esk2_0,X1) ),
    inference(spm,[status(thm)],[c_0_18,c_0_32]) ).

cnf(c_0_34,negated_conjecture,
    ( convergent_lines(esk1_0,X1)
    | distinct_lines(esk2_0,parallel_through_point(X2,intersection_point(esk3_0,esk4_0))) ),
    inference(spm,[status(thm)],[c_0_21,c_0_33]) ).

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

cnf(c_0_36,negated_conjecture,
    ( convergent_lines(esk2_0,parallel_through_point(X1,intersection_point(esk3_0,esk4_0)))
    | convergent_lines(esk1_0,X2) ),
    inference(spm,[status(thm)],[c_0_25,c_0_34]) ).

fof(c_0_37,plain,
    ! [X13] : ~ convergent_lines(X13,X13),
    inference(variable_rename,[status(thm)],[c_0_35]) ).

cnf(c_0_38,negated_conjecture,
    ( convergent_lines(parallel_through_point(X1,intersection_point(esk3_0,esk4_0)),X2)
    | convergent_lines(esk1_0,X3)
    | convergent_lines(esk2_0,X2) ),
    inference(spm,[status(thm)],[c_0_28,c_0_36]) ).

cnf(c_0_39,plain,
    ~ convergent_lines(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_37]) ).

cnf(c_0_40,negated_conjecture,
    ( convergent_lines(esk2_0,X1)
    | convergent_lines(esk1_0,X2) ),
    inference(spm,[status(thm)],[c_0_30,c_0_38]) ).

cnf(c_0_41,negated_conjecture,
    convergent_lines(esk2_0,X1),
    inference(spm,[status(thm)],[c_0_39,c_0_40]) ).

cnf(c_0_42,negated_conjecture,
    $false,
    inference(spm,[status(thm)],[c_0_39,c_0_41]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem    : GEO196+3 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.12  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.33  % Computer : n020.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 22:27:58 EDT 2023
% 0.13/0.33  % CPUTime  : 
% 0.19/0.55  start to proof: theBenchmark
% 35.58/35.66  % Version  : CSE_E---1.5
% 35.58/35.66  % Problem  : theBenchmark.p
% 35.58/35.66  % Proof found
% 35.58/35.66  % SZS status Theorem for theBenchmark.p
% 35.58/35.66  % SZS output start Proof
% See solution above
% 35.58/35.67  % Total time : 35.099000 s
% 35.58/35.67  % SZS output end Proof
% 35.58/35.67  % Total time : 35.104000 s
%------------------------------------------------------------------------------