TSTP Solution File: GEO260+1 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : GEO260+1 : TPTP v8.1.0. Bugfixed v8.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n032.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  : 600s
% DateTime : Sat Jul 16 03:44:58 EDT 2022

% Result   : Theorem 7.38s 2.24s
% Output   : CNFRefutation 7.38s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   43 (  12 unt;   0 def)
%            Number of atoms       :  105 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   92 (  30   ~;  41   |;  16   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-4 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   68 (   2 sgn  32   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(con,conjecture,
    ! [X2,X1,X4,X5] :
      ( ( line(X2)
        & distinct_points(X1,X5)
        & distinct_points(X4,X5)
        & distinct_points(X1,X4) )
     => ~ ( between_on_line(X2,X1,X4,X5)
          & between_on_line(X2,X1,X5,X4) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).

fof(oag8,axiom,
    ! [X2,X3] :
      ( ( line(X2)
        & line(X3) )
     => ( unequally_directed_lines(X2,X3)
        | unequally_directed_lines(X2,reverse_line(X3)) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oag8) ).

fof(oag5,axiom,
    ! [X2] : ~ unequally_directed_lines(X2,X2),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oag5) ).

fof(oag6,axiom,
    ! [X2,X3,X6] :
      ( unequally_directed_lines(X2,X3)
     => ( unequally_directed_lines(X2,X6)
        | unequally_directed_lines(X3,X6) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oag6) ).

fof(oag9,axiom,
    ! [X2,X3] :
      ( ( unequally_directed_lines(X2,X3)
        & unequally_directed_lines(X2,reverse_line(X3)) )
     => ( left_convergent_lines(X2,X3)
        | left_convergent_lines(X2,reverse_line(X3)) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oag9) ).

fof(oag11,axiom,
    ! [X2,X3] :
      ~ ( left_convergent_lines(X2,X3)
        | left_convergent_lines(X2,reverse_line(X3)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oag11) ).

fof(oagco9,axiom,
    ! [X1,X4] : ~ unequally_directed_lines(line_connecting(X1,X4),reverse_line(line_connecting(X4,X1))),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oagco9) ).

fof(c_0_7,negated_conjecture,
    ~ ! [X2,X1,X4,X5] :
        ( ( line(X2)
          & distinct_points(X1,X5)
          & distinct_points(X4,X5)
          & distinct_points(X1,X4) )
       => ~ ( between_on_line(X2,X1,X4,X5)
            & between_on_line(X2,X1,X5,X4) ) ),
    inference(assume_negation,[status(cth)],[con]) ).

fof(c_0_8,plain,
    ! [X36,X37] :
      ( ~ line(X36)
      | ~ line(X37)
      | unequally_directed_lines(X36,X37)
      | unequally_directed_lines(X36,reverse_line(X37)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag8])]) ).

fof(c_0_9,negated_conjecture,
    ( line(esk1_0)
    & distinct_points(esk2_0,esk4_0)
    & distinct_points(esk3_0,esk4_0)
    & distinct_points(esk2_0,esk3_0)
    & between_on_line(esk1_0,esk2_0,esk3_0,esk4_0)
    & between_on_line(esk1_0,esk2_0,esk4_0,esk3_0) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).

cnf(c_0_10,plain,
    ( unequally_directed_lines(X1,X2)
    | unequally_directed_lines(X1,reverse_line(X2))
    | ~ line(X1)
    | ~ line(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_11,negated_conjecture,
    line(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

fof(c_0_12,plain,
    ! [X29] : ~ unequally_directed_lines(X29,X29),
    inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[oag5])]) ).

fof(c_0_13,plain,
    ! [X30,X31,X32] :
      ( ~ unequally_directed_lines(X30,X31)
      | unequally_directed_lines(X30,X32)
      | unequally_directed_lines(X31,X32) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag6])]) ).

cnf(c_0_14,negated_conjecture,
    ( unequally_directed_lines(X1,reverse_line(esk1_0))
    | unequally_directed_lines(X1,esk1_0)
    | ~ line(X1) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_15,plain,
    ~ unequally_directed_lines(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

fof(c_0_16,plain,
    ! [X38,X39] :
      ( ~ unequally_directed_lines(X38,X39)
      | ~ unequally_directed_lines(X38,reverse_line(X39))
      | left_convergent_lines(X38,X39)
      | left_convergent_lines(X38,reverse_line(X39)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag9])]) ).

fof(c_0_17,plain,
    ! [X42,X43] :
      ( ~ left_convergent_lines(X42,X43)
      & ~ left_convergent_lines(X42,reverse_line(X43)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag11])]) ).

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

cnf(c_0_19,negated_conjecture,
    unequally_directed_lines(esk1_0,reverse_line(esk1_0)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_11]),c_0_15]) ).

cnf(c_0_20,plain,
    ( left_convergent_lines(X1,X2)
    | left_convergent_lines(X1,reverse_line(X2))
    | ~ unequally_directed_lines(X1,X2)
    | ~ unequally_directed_lines(X1,reverse_line(X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

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

cnf(c_0_22,negated_conjecture,
    ( unequally_directed_lines(reverse_line(esk1_0),X1)
    | unequally_directed_lines(esk1_0,X1) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_23,plain,
    ( ~ unequally_directed_lines(X1,reverse_line(X2))
    | ~ unequally_directed_lines(X1,X2) ),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_20,c_0_21]),c_0_21]) ).

cnf(c_0_24,negated_conjecture,
    ( unequally_directed_lines(reverse_line(esk1_0),X1)
    | unequally_directed_lines(esk1_0,X2)
    | unequally_directed_lines(X2,X1) ),
    inference(spm,[status(thm)],[c_0_18,c_0_22]) ).

cnf(c_0_25,negated_conjecture,
    ( unequally_directed_lines(esk1_0,reverse_line(X1))
    | ~ unequally_directed_lines(reverse_line(esk1_0),X1) ),
    inference(spm,[status(thm)],[c_0_23,c_0_22]) ).

cnf(c_0_26,negated_conjecture,
    ( unequally_directed_lines(X1,reverse_line(esk1_0))
    | unequally_directed_lines(esk1_0,X1) ),
    inference(spm,[status(thm)],[c_0_15,c_0_24]) ).

cnf(c_0_27,negated_conjecture,
    ( unequally_directed_lines(esk1_0,reverse_line(X1))
    | unequally_directed_lines(esk1_0,X1) ),
    inference(spm,[status(thm)],[c_0_25,c_0_22]) ).

cnf(c_0_28,negated_conjecture,
    ( unequally_directed_lines(esk1_0,X1)
    | ~ unequally_directed_lines(X1,esk1_0) ),
    inference(spm,[status(thm)],[c_0_23,c_0_26]) ).

cnf(c_0_29,negated_conjecture,
    ( unequally_directed_lines(reverse_line(X1),X2)
    | unequally_directed_lines(esk1_0,X1)
    | unequally_directed_lines(esk1_0,X2) ),
    inference(spm,[status(thm)],[c_0_18,c_0_27]) ).

cnf(c_0_30,negated_conjecture,
    ( unequally_directed_lines(reverse_line(X1),esk1_0)
    | unequally_directed_lines(esk1_0,X1) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_15]) ).

cnf(c_0_31,negated_conjecture,
    ( unequally_directed_lines(reverse_line(reverse_line(X1)),esk1_0)
    | ~ unequally_directed_lines(esk1_0,X1) ),
    inference(spm,[status(thm)],[c_0_23,c_0_30]) ).

cnf(c_0_32,negated_conjecture,
    ( unequally_directed_lines(reverse_line(X1),X1)
    | unequally_directed_lines(esk1_0,X1) ),
    inference(ef,[status(thm)],[c_0_29]) ).

cnf(c_0_33,negated_conjecture,
    ( unequally_directed_lines(reverse_line(reverse_line(X1)),esk1_0)
    | unequally_directed_lines(reverse_line(X1),X1) ),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_34,negated_conjecture,
    ( unequally_directed_lines(esk1_0,reverse_line(reverse_line(X1)))
    | unequally_directed_lines(reverse_line(X1),X1) ),
    inference(spm,[status(thm)],[c_0_28,c_0_33]) ).

cnf(c_0_35,negated_conjecture,
    ( unequally_directed_lines(esk1_0,reverse_line(X1))
    | unequally_directed_lines(esk1_0,X2)
    | unequally_directed_lines(X2,X1) ),
    inference(spm,[status(thm)],[c_0_25,c_0_24]) ).

cnf(c_0_36,negated_conjecture,
    ( unequally_directed_lines(reverse_line(X1),X1)
    | ~ unequally_directed_lines(esk1_0,reverse_line(X1)) ),
    inference(spm,[status(thm)],[c_0_23,c_0_34]) ).

cnf(c_0_37,negated_conjecture,
    unequally_directed_lines(reverse_line(X1),X1),
    inference(csr,[status(thm)],[inference(ef,[status(thm)],[c_0_35]),c_0_36]) ).

fof(c_0_38,plain,
    ! [X58,X59] : ~ unequally_directed_lines(line_connecting(X58,X59),reverse_line(line_connecting(X59,X58))),
    inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[oagco9])]) ).

cnf(c_0_39,negated_conjecture,
    ( unequally_directed_lines(reverse_line(X1),X2)
    | unequally_directed_lines(X1,X2) ),
    inference(spm,[status(thm)],[c_0_18,c_0_37]) ).

cnf(c_0_40,plain,
    ~ unequally_directed_lines(line_connecting(X1,X2),reverse_line(line_connecting(X2,X1))),
    inference(split_conjunct,[status(thm)],[c_0_38]) ).

cnf(c_0_41,negated_conjecture,
    unequally_directed_lines(X1,reverse_line(X1)),
    inference(spm,[status(thm)],[c_0_15,c_0_39]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10  % Problem  : GEO260+1 : TPTP v8.1.0. Bugfixed v8.1.0.
% 0.03/0.10  % Command  : enigmatic-eprover.py %s %d 1
% 0.09/0.29  % Computer : n032.cluster.edu
% 0.09/0.29  % Model    : x86_64 x86_64
% 0.09/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29  % Memory   : 8042.1875MB
% 0.09/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29  % CPULimit : 300
% 0.09/0.29  % WCLimit  : 600
% 0.09/0.29  % DateTime : Sat Jun 18 05:51:48 EDT 2022
% 0.09/0.29  % CPUTime  : 
% 0.13/0.37  # ENIGMATIC: Selected SinE mode:
% 0.13/0.38  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.38  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.13/0.38  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.13/0.38  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 7.38/2.24  # ENIGMATIC: Solved by autoschedule:
% 7.38/2.24  # No SInE strategy applied
% 7.38/2.24  # Trying AutoSched0 for 150 seconds
% 7.38/2.24  # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YA
% 7.38/2.24  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.38/2.24  #
% 7.38/2.24  # Preprocessing time       : 0.014 s
% 7.38/2.24  # Presaturation interreduction done
% 7.38/2.24  
% 7.38/2.24  # Proof found!
% 7.38/2.24  # SZS status Theorem
% 7.38/2.24  # SZS output start CNFRefutation
% See solution above
% 7.38/2.24  # Training examples: 0 positive, 0 negative
% 7.38/2.24  
% 7.38/2.24  # -------------------------------------------------
% 7.38/2.24  # User time                : 0.059 s
% 7.38/2.24  # System time              : 0.007 s
% 7.38/2.24  # Total time               : 0.066 s
% 7.38/2.24  # Maximum resident set size: 7120 pages
% 7.38/2.24  
%------------------------------------------------------------------------------