↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : GEO175+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n016.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:43:56 EDT 2022

% Result   : Theorem 5.03s 2.46s
% Output   : CNFRefutation 5.03s
% 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_19,plain,
    ( convergent_lines(X1,X2)
    | distinct_lines(X3,X2)
    | ~ convergent_lines(X1,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r7rnqn3w/lgb.p',i_0_19) ).

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

cnf(i_0_38,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-r7rnqn3w/lgb.p',i_0_38) ).

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

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

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

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

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

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

cnf(c_0_48,plain,
    ( convergent_lines(X1,X2)
    | distinct_lines(X3,X2)
    | ~ convergent_lines(X1,X3) ),
    i_0_19 ).

cnf(c_0_49,negated_conjecture,
    convergent_lines(esk3_0,esk4_0),
    i_0_29 ).

cnf(c_0_50,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_38 ).

cnf(c_0_51,negated_conjecture,
    ( convergent_lines(esk3_0,X1)
    | distinct_lines(esk4_0,X1) ),
    inference(spm,[status(thm)],[c_0_48,c_0_49]) ).

cnf(c_0_52,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(X2,X3) ),
    inference(spm,[status(thm)],[c_0_50,c_0_51]) ).

cnf(c_0_53,negated_conjecture,
    distinct_points(esk1_0,intersection_point(esk3_0,esk4_0)),
    i_0_28 ).

cnf(c_0_54,negated_conjecture,
    ~ apart_point_and_line(esk1_0,esk4_0),
    i_0_26 ).

cnf(c_0_55,plain,
    ( ~ convergent_lines(X1,X2)
    | ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
    i_0_23 ).

cnf(c_0_56,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_52,c_0_53]),c_0_54]) ).

cnf(c_0_57,plain,
    ( ~ convergent_lines(X1,X2)
    | ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
    i_0_22 ).

cnf(c_0_58,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_55,c_0_56]),c_0_49])]) ).

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

cnf(c_0_60,negated_conjecture,
    ~ apart_point_and_line(esk1_0,esk3_0),
    i_0_27 ).

cnf(c_0_61,plain,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_49])]),c_0_59]),c_0_60]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GEO175+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n016.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 12:43:09 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected SinE mode:
% 0.19/0.45  # Parsing /export/starexec/sandbox2/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
% 5.03/2.46  # ENIGMATIC: Solved by autoschedule-lgb:
% 5.03/2.46  # No SInE strategy applied
% 5.03/2.46  # Trying AutoSched0 for 150 seconds
% 5.03/2.46  # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_S5PRR_SE_Q4_CS_SP_S4S
% 5.03/2.46  # and selection function SelectNewComplexAHPNS.
% 5.03/2.46  #
% 5.03/2.46  # Preprocessing time       : 0.022 s
% 5.03/2.46  
% 5.03/2.46  # Proof found!
% 5.03/2.46  # SZS status Theorem
% 5.03/2.46  # SZS output start CNFRefutation
% See solution above
% 5.03/2.46  # Training examples: 0 positive, 0 negative
% 5.03/2.46  
% 5.03/2.46  # -------------------------------------------------
% 5.03/2.46  # User time                : 0.027 s
% 5.03/2.46  # System time              : 0.006 s
% 5.03/2.46  # Total time               : 0.032 s
% 5.03/2.46  # Maximum resident set size: 7124 pages
% 5.03/2.46  
%------------------------------------------------------------------------------