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

View Problem - Process Solution

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

% Computer : n025.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:13 EDT 2022

% Result   : Theorem 7.58s 2.31s
% Output   : CNFRefutation 7.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   20 (  12 unt;   6 nHn;  11 RR)
%            Number of literals    :   32 (   0 equ;  12 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   32 (   8 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_18,plain,
    ( apart_point_and_line(X1,X2)
    | distinct_lines(X3,X2)
    | ~ apart_point_and_line(X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e3f035sd/lgb.p',i_0_18) ).

cnf(i_0_27,negated_conjecture,
    apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e3f035sd/lgb.p',i_0_27) ).

cnf(i_0_37,plain,
    ~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e3f035sd/lgb.p',i_0_37) ).

cnf(i_0_50,plain,
    ( convergent_lines(X1,X2)
    | ~ distinct_lines(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e3f035sd/lgb.p',i_0_50) ).

cnf(i_0_16,plain,
    ( convergent_lines(X1,X2)
    | convergent_lines(X3,X2)
    | ~ convergent_lines(X3,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e3f035sd/lgb.p',i_0_16) ).

cnf(i_0_36,plain,
    ~ convergent_lines(parallel_through_point(X1,X2),X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e3f035sd/lgb.p',i_0_36) ).

cnf(i_0_9,plain,
    ~ convergent_lines(X1,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e3f035sd/lgb.p',i_0_9) ).

cnf(c_0_58,plain,
    ( apart_point_and_line(X1,X2)
    | distinct_lines(X3,X2)
    | ~ apart_point_and_line(X1,X3) ),
    i_0_18 ).

cnf(c_0_59,negated_conjecture,
    apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0),
    i_0_27 ).

cnf(c_0_60,plain,
    ~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
    i_0_37 ).

cnf(c_0_61,negated_conjecture,
    ( distinct_lines(esk3_0,X1)
    | apart_point_and_line(intersection_point(esk1_0,esk2_0),X1) ),
    inference(spm,[status(thm)],[c_0_58,c_0_59]) ).

cnf(c_0_62,plain,
    ( convergent_lines(X1,X2)
    | ~ distinct_lines(X1,X2) ),
    i_0_50 ).

cnf(c_0_63,plain,
    distinct_lines(esk3_0,parallel_through_point(X1,intersection_point(esk1_0,esk2_0))),
    inference(spm,[status(thm)],[c_0_60,c_0_61]) ).

cnf(c_0_64,plain,
    ( convergent_lines(X1,X2)
    | convergent_lines(X3,X2)
    | ~ convergent_lines(X3,X1) ),
    i_0_16 ).

cnf(c_0_65,plain,
    convergent_lines(esk3_0,parallel_through_point(X1,intersection_point(esk1_0,esk2_0))),
    inference(spm,[status(thm)],[c_0_62,c_0_63]) ).

cnf(c_0_66,plain,
    ~ convergent_lines(parallel_through_point(X1,X2),X1),
    i_0_36 ).

cnf(c_0_67,plain,
    ( convergent_lines(parallel_through_point(X1,intersection_point(esk1_0,esk2_0)),X2)
    | convergent_lines(esk3_0,X2) ),
    inference(spm,[status(thm)],[c_0_64,c_0_65]) ).

cnf(c_0_68,plain,
    ~ convergent_lines(X1,X1),
    i_0_9 ).

cnf(c_0_69,plain,
    convergent_lines(esk3_0,X1),
    inference(spm,[status(thm)],[c_0_66,c_0_67]) ).

cnf(c_0_70,plain,
    $false,
    inference(spm,[status(thm)],[c_0_68,c_0_69]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GEO195+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n025.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 : Sat Jun 18 04:57:14 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected SinE mode:
% 0.19/0.45  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.19/0.45  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.19/0.45  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 7.58/2.31  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.58/2.31  # No SInE strategy applied
% 7.58/2.31  # Trying AutoSched0 for 150 seconds
% 7.58/2.31  # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_S5PRR_SE_Q4_CS_SP_S4S
% 7.58/2.31  # and selection function SelectNewComplexAHPNS.
% 7.58/2.31  #
% 7.58/2.31  # Preprocessing time       : 0.023 s
% 7.58/2.31  
% 7.58/2.31  # Proof found!
% 7.58/2.31  # SZS status Theorem
% 7.58/2.31  # SZS output start CNFRefutation
% See solution above
% 7.58/2.31  # Training examples: 0 positive, 0 negative
% 7.58/2.31  
% 7.58/2.31  # -------------------------------------------------
% 7.58/2.31  # User time                : 0.025 s
% 7.58/2.31  # System time              : 0.008 s
% 7.58/2.31  # Total time               : 0.033 s
% 7.58/2.31  # Maximum resident set size: 7124 pages
% 7.58/2.31  
%------------------------------------------------------------------------------