TSTP Solution File: GEO179+2 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n019.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:59 EDT 2022

% Result   : Theorem 7.80s 2.45s
% Output   : CNFRefutation 7.80s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   21 (  10 unt;   4 nHn;  18 RR)
%            Number of literals    :   38 (   0 equ;  17 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   21 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_8,plain,
    ( distinct_lines(X1,X2)
    | apart_point_and_line(X3,X2)
    | ~ apart_point_and_line(X3,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tk4t2m5l/input.p',i_0_8) ).

cnf(i_0_15,negated_conjecture,
    apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tk4t2m5l/input.p',i_0_15) ).

cnf(i_0_14,negated_conjecture,
    ( ~ distinct_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk3_0,esk1_0))
    | ~ distinct_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk3_0,esk2_0)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tk4t2m5l/input.p',i_0_14) ).

cnf(i_0_11,plain,
    ( distinct_points(X1,X2)
    | ~ distinct_points(X2,X3)
    | ~ apart_point_and_line(X1,line_connecting(X2,X3)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tk4t2m5l/input.p',i_0_11) ).

cnf(i_0_16,negated_conjecture,
    distinct_points(esk1_0,esk2_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tk4t2m5l/input.p',i_0_16) ).

cnf(i_0_1,plain,
    ~ distinct_points(X1,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tk4t2m5l/input.p',i_0_1) ).

cnf(i_0_10,plain,
    ( distinct_points(X1,X2)
    | ~ distinct_points(X3,X2)
    | ~ apart_point_and_line(X1,line_connecting(X3,X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tk4t2m5l/input.p',i_0_10) ).

cnf(c_0_24,plain,
    ( distinct_lines(X1,X2)
    | apart_point_and_line(X3,X2)
    | ~ apart_point_and_line(X3,X1) ),
    i_0_8 ).

cnf(c_0_25,negated_conjecture,
    apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0)),
    i_0_15 ).

cnf(c_0_26,negated_conjecture,
    ( ~ distinct_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk3_0,esk1_0))
    | ~ distinct_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk3_0,esk2_0)) ),
    i_0_14 ).

cnf(c_0_27,negated_conjecture,
    ( distinct_lines(line_connecting(esk1_0,esk2_0),X1)
    | apart_point_and_line(esk3_0,X1) ),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_28,negated_conjecture,
    ( apart_point_and_line(esk3_0,line_connecting(esk3_0,esk1_0))
    | ~ distinct_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk3_0,esk2_0)) ),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_29,plain,
    ( distinct_points(X1,X2)
    | ~ distinct_points(X2,X3)
    | ~ apart_point_and_line(X1,line_connecting(X2,X3)) ),
    i_0_11 ).

cnf(c_0_30,negated_conjecture,
    distinct_points(esk1_0,esk2_0),
    i_0_16 ).

cnf(c_0_31,negated_conjecture,
    ( apart_point_and_line(esk3_0,line_connecting(esk3_0,esk2_0))
    | apart_point_and_line(esk3_0,line_connecting(esk3_0,esk1_0)) ),
    inference(spm,[status(thm)],[c_0_28,c_0_27]) ).

cnf(c_0_32,negated_conjecture,
    distinct_points(esk3_0,esk1_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_25]),c_0_30])]) ).

cnf(c_0_33,plain,
    ~ distinct_points(X1,X1),
    i_0_1 ).

cnf(c_0_34,plain,
    ( distinct_points(X1,X2)
    | ~ distinct_points(X3,X2)
    | ~ apart_point_and_line(X1,line_connecting(X3,X2)) ),
    i_0_10 ).

cnf(c_0_35,plain,
    apart_point_and_line(esk3_0,line_connecting(esk3_0,esk2_0)),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_31]),c_0_32])]),c_0_33]) ).

cnf(c_0_36,negated_conjecture,
    distinct_points(esk3_0,esk2_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_25]),c_0_30])]) ).

cnf(c_0_37,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_35]),c_0_36])]),c_0_33]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : GEO179+2 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n019.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 01:02:41 EDT 2022
% 0.12/0.34  % 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
% 7.80/2.45  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.80/2.45  # Version: 2.1pre011
% 7.80/2.45  # Preprocessing time       : 0.010 s
% 7.80/2.45  
% 7.80/2.45  # Proof found!
% 7.80/2.45  # SZS status Theorem
% 7.80/2.45  # SZS output start CNFRefutation
% See solution above
% 7.80/2.45  # Proof object total steps             : 21
% 7.80/2.45  # Proof object clause steps            : 14
% 7.80/2.45  # Proof object formula steps           : 7
% 7.80/2.45  # Proof object conjectures             : 11
% 7.80/2.45  # Proof object clause conjectures      : 8
% 7.80/2.45  # Proof object formula conjectures     : 3
% 7.80/2.45  # Proof object initial clauses used    : 7
% 7.80/2.45  # Proof object initial formulas used   : 7
% 7.80/2.45  # Proof object generating inferences   : 7
% 7.80/2.45  # Proof object simplifying inferences  : 10
% 7.80/2.45  # Training examples: 0 positive, 0 negative
% 7.80/2.45  # Parsed axioms                        : 17
% 7.80/2.45  # Removed by relevancy pruning/SinE    : 0
% 7.80/2.45  # Initial clauses                      : 17
% 7.80/2.45  # Removed in clause preprocessing      : 0
% 7.80/2.45  # Initial clauses in saturation        : 17
% 7.80/2.45  # Processed clauses                    : 32
% 7.80/2.45  # ...of these trivial                  : 0
% 7.80/2.45  # ...subsumed                          : 1
% 7.80/2.45  # ...remaining for further processing  : 31
% 7.80/2.45  # Other redundant clauses eliminated   : 0
% 7.80/2.45  # Clauses deleted for lack of memory   : 0
% 7.80/2.45  # Backward-subsumed                    : 0
% 7.80/2.45  # Backward-rewritten                   : 1
% 7.80/2.45  # Generated clauses                    : 47
% 7.80/2.45  # ...of the previous two non-trivial   : 40
% 7.80/2.45  # Contextual simplify-reflections      : 0
% 7.80/2.45  # Paramodulations                      : 45
% 7.80/2.45  # Factorizations                       : 2
% 7.80/2.45  # Equation resolutions                 : 0
% 7.80/2.45  # Propositional unsat checks           : 0
% 7.80/2.45  # Propositional unsat check successes  : 0
% 7.80/2.45  # Current number of processed clauses  : 30
% 7.80/2.45  #    Positive orientable unit clauses  : 6
% 7.80/2.45  #    Positive unorientable unit clauses: 0
% 7.80/2.45  #    Negative unit clauses             : 3
% 7.80/2.45  #    Non-unit-clauses                  : 21
% 7.80/2.45  # Current number of unprocessed clauses: 21
% 7.80/2.45  # ...number of literals in the above   : 72
% 7.80/2.45  # Current number of archived formulas  : 0
% 7.80/2.45  # Current number of archived clauses   : 1
% 7.80/2.45  # Clause-clause subsumption calls (NU) : 16
% 7.80/2.45  # Rec. Clause-clause subsumption calls : 16
% 7.80/2.45  # Non-unit clause-clause subsumptions  : 1
% 7.80/2.45  # Unit Clause-clause subsumption calls : 11
% 7.80/2.45  # Rewrite failures with RHS unbound    : 0
% 7.80/2.45  # BW rewrite match attempts            : 1
% 7.80/2.45  # BW rewrite match successes           : 1
% 7.80/2.45  # Condensation attempts                : 0
% 7.80/2.45  # Condensation successes               : 0
% 7.80/2.45  # Termbank termtop insertions          : 889
% 7.80/2.45  
% 7.80/2.45  # -------------------------------------------------
% 7.80/2.45  # User time                : 0.009 s
% 7.80/2.45  # System time              : 0.002 s
% 7.80/2.45  # Total time               : 0.011 s
% 7.80/2.45  # ...preprocessing         : 0.010 s
% 7.80/2.45  # ...main loop             : 0.001 s
% 7.80/2.45  # Maximum resident set size: 7136 pages
% 7.80/2.45  
%------------------------------------------------------------------------------