TSTP Solution File: GEO200+3 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : GEO200+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n004.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:19 EDT 2022

% Result   : Theorem 8.58s 2.43s
% Output   : CNFRefutation 8.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   31 (  16 unt;  11 nHn;  23 RR)
%            Number of literals    :   61 (   0 equ;  27 neg)
%            Maximal clause size   :    6 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   40 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_26,negated_conjecture,
    ~ equal_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk2_0,esk1_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fahfiyji/lgb.p',i_0_26) ).

cnf(i_0_14,plain,
    ( distinct_lines(X1,X2)
    | equal_lines(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fahfiyji/lgb.p',i_0_14) ).

cnf(i_0_10,plain,
    ( distinct_points(X1,X2)
    | distinct_points(X3,X2)
    | ~ distinct_points(X3,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fahfiyji/lgb.p',i_0_10) ).

cnf(i_0_27,negated_conjecture,
    distinct_points(esk1_0,esk2_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fahfiyji/lgb.p',i_0_27) ).

cnf(i_0_11,plain,
    ( distinct_lines(X1,X2)
    | distinct_lines(X3,X2)
    | ~ distinct_lines(X3,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fahfiyji/lgb.p',i_0_11) ).

cnf(i_0_7,plain,
    ~ distinct_points(X1,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fahfiyji/lgb.p',i_0_7) ).

cnf(i_0_35,plain,
    ( apart_point_and_line(X1,X2)
    | apart_point_and_line(X1,X3)
    | apart_point_and_line(X4,X2)
    | apart_point_and_line(X4,X3)
    | ~ distinct_points(X4,X1)
    | ~ distinct_lines(X3,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fahfiyji/lgb.p',i_0_35) ).

cnf(i_0_8,plain,
    ~ distinct_lines(X1,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fahfiyji/lgb.p',i_0_8) ).

cnf(i_0_21,plain,
    ( ~ distinct_points(X1,X2)
    | ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fahfiyji/lgb.p',i_0_21) ).

cnf(i_0_20,plain,
    ( ~ distinct_points(X1,X2)
    | ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fahfiyji/lgb.p',i_0_20) ).

cnf(c_0_46,negated_conjecture,
    ~ equal_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk2_0,esk1_0)),
    i_0_26 ).

cnf(c_0_47,plain,
    ( distinct_lines(X1,X2)
    | equal_lines(X1,X2) ),
    i_0_14 ).

cnf(c_0_48,plain,
    ( distinct_points(X1,X2)
    | distinct_points(X3,X2)
    | ~ distinct_points(X3,X1) ),
    i_0_10 ).

cnf(c_0_49,negated_conjecture,
    distinct_points(esk1_0,esk2_0),
    i_0_27 ).

cnf(c_0_50,plain,
    ( distinct_lines(X1,X2)
    | distinct_lines(X3,X2)
    | ~ distinct_lines(X3,X1) ),
    i_0_11 ).

cnf(c_0_51,negated_conjecture,
    distinct_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk2_0,esk1_0)),
    inference(spm,[status(thm)],[c_0_46,c_0_47]) ).

cnf(c_0_52,plain,
    ~ distinct_points(X1,X1),
    i_0_7 ).

cnf(c_0_53,negated_conjecture,
    ( distinct_points(esk1_0,X1)
    | distinct_points(esk2_0,X1) ),
    inference(spm,[status(thm)],[c_0_48,c_0_49]) ).

cnf(c_0_54,plain,
    ( apart_point_and_line(X1,X2)
    | apart_point_and_line(X1,X3)
    | apart_point_and_line(X4,X2)
    | apart_point_and_line(X4,X3)
    | ~ distinct_points(X4,X1)
    | ~ distinct_lines(X3,X2) ),
    i_0_35 ).

cnf(c_0_55,plain,
    ~ distinct_lines(X1,X1),
    i_0_8 ).

cnf(c_0_56,plain,
    ( distinct_lines(line_connecting(esk1_0,esk2_0),X1)
    | distinct_lines(line_connecting(esk2_0,esk1_0),X1) ),
    inference(spm,[status(thm)],[c_0_50,c_0_51]) ).

cnf(c_0_57,plain,
    ( ~ distinct_points(X1,X2)
    | ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
    i_0_21 ).

cnf(c_0_58,plain,
    distinct_points(esk2_0,esk1_0),
    inference(spm,[status(thm)],[c_0_52,c_0_53]) ).

cnf(c_0_59,plain,
    ( ~ distinct_points(X1,X2)
    | ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
    i_0_20 ).

cnf(c_0_60,negated_conjecture,
    ( apart_point_and_line(esk1_0,X1)
    | apart_point_and_line(esk1_0,X2)
    | apart_point_and_line(esk2_0,X1)
    | apart_point_and_line(esk2_0,X2)
    | ~ distinct_lines(X1,X2) ),
    inference(spm,[status(thm)],[c_0_54,c_0_49]) ).

cnf(c_0_61,plain,
    distinct_lines(line_connecting(esk2_0,esk1_0),line_connecting(esk1_0,esk2_0)),
    inference(spm,[status(thm)],[c_0_55,c_0_56]) ).

cnf(c_0_62,plain,
    ~ apart_point_and_line(esk1_0,line_connecting(esk2_0,esk1_0)),
    inference(spm,[status(thm)],[c_0_57,c_0_58]) ).

cnf(c_0_63,negated_conjecture,
    ~ apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0)),
    inference(spm,[status(thm)],[c_0_59,c_0_49]) ).

cnf(c_0_64,plain,
    ~ apart_point_and_line(esk2_0,line_connecting(esk2_0,esk1_0)),
    inference(spm,[status(thm)],[c_0_59,c_0_58]) ).

cnf(c_0_65,negated_conjecture,
    ~ apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0)),
    inference(spm,[status(thm)],[c_0_57,c_0_49]) ).

cnf(c_0_66,plain,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62]),c_0_63]),c_0_64]),c_0_65]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : GEO200+3 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n004.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Fri Jun 17 23:17:10 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected SinE mode:
% 0.18/0.45  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.18/0.45  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.18/0.45  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 8.58/2.43  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.58/2.43  # No SInE strategy applied
% 8.58/2.43  # Trying AutoSched0 for 150 seconds
% 8.58/2.43  # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4d
% 8.58/2.43  # and selection function SelectCQIPrecWNTNp.
% 8.58/2.43  #
% 8.58/2.43  # Preprocessing time       : 0.012 s
% 8.58/2.43  
% 8.58/2.43  # Proof found!
% 8.58/2.43  # SZS status Theorem
% 8.58/2.43  # SZS output start CNFRefutation
% See solution above
% 8.58/2.43  # Training examples: 0 positive, 0 negative
% 8.58/2.43  
% 8.58/2.43  # -------------------------------------------------
% 8.58/2.43  # User time                : 0.013 s
% 8.58/2.43  # System time              : 0.005 s
% 8.58/2.43  # Total time               : 0.018 s
% 8.58/2.43  # Maximum resident set size: 7128 pages
% 8.58/2.43  
%------------------------------------------------------------------------------