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

View Problem - Process Solution

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

% Computer : n023.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:05 EDT 2022

% Result   : Theorem 6.62s 2.28s
% Output   : CNFRefutation 6.62s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   23 (  11 unt;   8 nHn;  17 RR)
%            Number of literals    :   52 (   0 equ;  21 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   30 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_9,plain,
    ( distinct_lines(X1,X2)
    | convergent_lines(X3,X2)
    | ~ convergent_lines(X3,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ot8wvxki/lgb.p',i_0_9) ).

cnf(i_0_17,negated_conjecture,
    convergent_lines(esk3_0,esk4_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ot8wvxki/lgb.p',i_0_17) ).

cnf(i_0_19,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/sandbox2/tmp/enigma-theBenchmark.p-ot8wvxki/lgb.p',i_0_19) ).

cnf(i_0_14,negated_conjecture,
    distinct_points(esk1_0,intersection_point(esk3_0,esk4_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ot8wvxki/lgb.p',i_0_14) ).

cnf(i_0_15,negated_conjecture,
    ~ apart_point_and_line(esk1_0,esk4_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ot8wvxki/lgb.p',i_0_15) ).

cnf(i_0_13,plain,
    ( ~ convergent_lines(X1,X2)
    | ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ot8wvxki/lgb.p',i_0_13) ).

cnf(i_0_12,plain,
    ( ~ convergent_lines(X1,X2)
    | ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ot8wvxki/lgb.p',i_0_12) ).

cnf(i_0_3,plain,
    ~ convergent_lines(X1,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ot8wvxki/lgb.p',i_0_3) ).

cnf(i_0_16,negated_conjecture,
    ~ apart_point_and_line(esk1_0,esk3_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ot8wvxki/lgb.p',i_0_16) ).

cnf(c_0_29,plain,
    ( distinct_lines(X1,X2)
    | convergent_lines(X3,X2)
    | ~ convergent_lines(X3,X1) ),
    i_0_9 ).

cnf(c_0_30,negated_conjecture,
    convergent_lines(esk3_0,esk4_0),
    i_0_17 ).

cnf(c_0_31,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_19 ).

cnf(c_0_32,negated_conjecture,
    ( convergent_lines(esk3_0,X1)
    | distinct_lines(esk4_0,X1) ),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_33,plain,
    ( convergent_lines(esk3_0,X1)
    | apart_point_and_line(X2,esk4_0)
    | apart_point_and_line(X3,esk4_0)
    | apart_point_and_line(X2,X1)
    | apart_point_and_line(X3,X1)
    | ~ distinct_points(X3,X2) ),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_34,negated_conjecture,
    distinct_points(esk1_0,intersection_point(esk3_0,esk4_0)),
    i_0_14 ).

cnf(c_0_35,negated_conjecture,
    ~ apart_point_and_line(esk1_0,esk4_0),
    i_0_15 ).

cnf(c_0_36,plain,
    ( ~ convergent_lines(X1,X2)
    | ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
    i_0_13 ).

cnf(c_0_37,negated_conjecture,
    ( convergent_lines(esk3_0,X1)
    | apart_point_and_line(intersection_point(esk3_0,esk4_0),esk4_0)
    | apart_point_and_line(intersection_point(esk3_0,esk4_0),X1)
    | apart_point_and_line(esk1_0,X1) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).

cnf(c_0_38,plain,
    ( ~ convergent_lines(X1,X2)
    | ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
    i_0_12 ).

cnf(c_0_39,plain,
    ( convergent_lines(esk3_0,X1)
    | apart_point_and_line(intersection_point(esk3_0,esk4_0),X1)
    | apart_point_and_line(esk1_0,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_30])]) ).

cnf(c_0_40,plain,
    ~ convergent_lines(X1,X1),
    i_0_3 ).

cnf(c_0_41,negated_conjecture,
    ~ apart_point_and_line(esk1_0,esk3_0),
    i_0_16 ).

cnf(c_0_42,plain,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_30])]),c_0_40]),c_0_41]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GEO186+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n023.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 17:19:06 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected SinE mode:
% 0.18/0.45  # Parsing /export/starexec/sandbox2/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
% 6.62/2.28  # ENIGMATIC: Solved by autoschedule-lgb:
% 6.62/2.28  # No SInE strategy applied
% 6.62/2.28  # Trying AutoSched0 for 150 seconds
% 6.62/2.28  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 6.62/2.28  # and selection function SelectComplexExceptUniqMaxHorn.
% 6.62/2.28  #
% 6.62/2.28  # Preprocessing time       : 0.023 s
% 6.62/2.28  # Presaturation interreduction done
% 6.62/2.28  
% 6.62/2.28  # Proof found!
% 6.62/2.28  # SZS status Theorem
% 6.62/2.28  # SZS output start CNFRefutation
% See solution above
% 6.62/2.28  # Training examples: 0 positive, 0 negative
% 6.62/2.28  
% 6.62/2.28  # -------------------------------------------------
% 6.62/2.28  # User time                : 0.027 s
% 6.62/2.28  # System time              : 0.007 s
% 6.62/2.28  # Total time               : 0.034 s
% 6.62/2.28  # Maximum resident set size: 7120 pages
% 6.62/2.28  
%------------------------------------------------------------------------------