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

View Problem - Process Solution

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

% Computer : n020.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 8.41s 2.57s
% Output   : CNFRefutation 8.41s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   25 (   8 unt;   8 nHn;  19 RR)
%            Number of literals    :   45 (   0 equ;  20 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   24 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_26,negated_conjecture,
    ( ~ incident_point_and_line(esk1_0,esk3_0)
    | ~ incident_point_and_line(esk1_0,esk4_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ii2po2xh/input.p',i_0_26) ).

cnf(i_0_3,plain,
    ( incident_point_and_line(X1,X2)
    | apart_point_and_line(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ii2po2xh/input.p',i_0_3) ).

cnf(i_0_13,plain,
    ( ~ distinct_points(X1,X2)
    | ~ equal_points(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ii2po2xh/input.p',i_0_13) ).

cnf(i_0_27,negated_conjecture,
    equal_points(esk1_0,intersection_point(esk3_0,esk4_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ii2po2xh/input.p',i_0_27) ).

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

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-ii2po2xh/input.p',i_0_22) ).

cnf(i_0_28,negated_conjecture,
    convergent_lines(esk3_0,esk4_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ii2po2xh/input.p',i_0_28) ).

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-ii2po2xh/input.p',i_0_23) ).

cnf(c_0_37,negated_conjecture,
    ( ~ incident_point_and_line(esk1_0,esk3_0)
    | ~ incident_point_and_line(esk1_0,esk4_0) ),
    i_0_26 ).

cnf(c_0_38,plain,
    ( incident_point_and_line(X1,X2)
    | apart_point_and_line(X1,X2) ),
    i_0_3 ).

cnf(c_0_39,negated_conjecture,
    ( apart_point_and_line(esk1_0,esk3_0)
    | ~ incident_point_and_line(esk1_0,esk4_0) ),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_40,plain,
    ( ~ distinct_points(X1,X2)
    | ~ equal_points(X1,X2) ),
    i_0_13 ).

cnf(c_0_41,negated_conjecture,
    equal_points(esk1_0,intersection_point(esk3_0,esk4_0)),
    i_0_27 ).

cnf(c_0_42,plain,
    ( apart_point_and_line(X1,X2)
    | distinct_points(X3,X1)
    | ~ apart_point_and_line(X3,X2) ),
    i_0_17 ).

cnf(c_0_43,plain,
    ( apart_point_and_line(esk1_0,esk4_0)
    | apart_point_and_line(esk1_0,esk3_0) ),
    inference(spm,[status(thm)],[c_0_39,c_0_38]) ).

cnf(c_0_44,negated_conjecture,
    ~ distinct_points(esk1_0,intersection_point(esk3_0,esk4_0)),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

cnf(c_0_45,plain,
    ( apart_point_and_line(esk1_0,esk4_0)
    | apart_point_and_line(X1,esk3_0)
    | distinct_points(esk1_0,X1) ),
    inference(spm,[status(thm)],[c_0_42,c_0_43]) ).

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

cnf(c_0_47,negated_conjecture,
    ( apart_point_and_line(intersection_point(esk3_0,esk4_0),esk3_0)
    | apart_point_and_line(esk1_0,esk4_0) ),
    inference(spm,[status(thm)],[c_0_44,c_0_45]) ).

cnf(c_0_48,negated_conjecture,
    convergent_lines(esk3_0,esk4_0),
    i_0_28 ).

cnf(c_0_49,plain,
    apart_point_and_line(esk1_0,esk4_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48])]) ).

cnf(c_0_50,plain,
    ( apart_point_and_line(X1,esk4_0)
    | distinct_points(esk1_0,X1) ),
    inference(spm,[status(thm)],[c_0_42,c_0_49]) ).

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

cnf(c_0_52,negated_conjecture,
    apart_point_and_line(intersection_point(esk3_0,esk4_0),esk4_0),
    inference(spm,[status(thm)],[c_0_44,c_0_50]) ).

cnf(c_0_53,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_48])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14  % Problem  : GEO185+3 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.14  % Command  : enigmatic-eprover.py %s %d 1
% 0.14/0.36  % Computer : n020.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 600
% 0.14/0.36  % DateTime : Sat Jun 18 17:17:35 EDT 2022
% 0.14/0.37  % CPUTime  : 
% 0.23/0.48  # ENIGMATIC: Selected SinE mode:
% 0.23/0.49  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.23/0.49  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.23/0.49  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.23/0.49  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 8.41/2.57  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 8.41/2.57  # Version: 2.1pre011
% 8.41/2.57  # Preprocessing time       : 0.012 s
% 8.41/2.57  
% 8.41/2.57  # Proof found!
% 8.41/2.57  # SZS status Theorem
% 8.41/2.57  # SZS output start CNFRefutation
% See solution above
% 8.41/2.58  # Proof object total steps             : 25
% 8.41/2.58  # Proof object clause steps            : 17
% 8.41/2.58  # Proof object formula steps           : 8
% 8.41/2.58  # Proof object conjectures             : 10
% 8.41/2.58  # Proof object clause conjectures      : 7
% 8.41/2.58  # Proof object formula conjectures     : 3
% 8.41/2.58  # Proof object initial clauses used    : 8
% 8.41/2.58  # Proof object initial formulas used   : 8
% 8.41/2.58  # Proof object generating inferences   : 9
% 8.41/2.58  # Proof object simplifying inferences  : 4
% 8.41/2.58  # Training examples: 0 positive, 0 negative
% 8.41/2.58  # Parsed axioms                        : 50
% 8.41/2.58  # Removed by relevancy pruning/SinE    : 0
% 8.41/2.58  # Initial clauses                      : 50
% 8.41/2.58  # Removed in clause preprocessing      : 0
% 8.41/2.58  # Initial clauses in saturation        : 50
% 8.41/2.58  # Processed clauses                    : 87
% 8.41/2.58  # ...of these trivial                  : 0
% 8.41/2.58  # ...subsumed                          : 12
% 8.41/2.58  # ...remaining for further processing  : 75
% 8.41/2.58  # Other redundant clauses eliminated   : 0
% 8.41/2.58  # Clauses deleted for lack of memory   : 0
% 8.41/2.58  # Backward-subsumed                    : 0
% 8.41/2.58  # Backward-rewritten                   : 3
% 8.41/2.58  # Generated clauses                    : 183
% 8.41/2.58  # ...of the previous two non-trivial   : 144
% 8.41/2.58  # Contextual simplify-reflections      : 4
% 8.41/2.58  # Paramodulations                      : 163
% 8.41/2.58  # Factorizations                       : 20
% 8.41/2.58  # Equation resolutions                 : 0
% 8.41/2.58  # Propositional unsat checks           : 0
% 8.41/2.58  # Propositional unsat check successes  : 0
% 8.41/2.58  # Current number of processed clauses  : 72
% 8.41/2.58  #    Positive orientable unit clauses  : 8
% 8.41/2.58  #    Positive unorientable unit clauses: 0
% 8.41/2.58  #    Negative unit clauses             : 8
% 8.41/2.58  #    Non-unit-clauses                  : 56
% 8.41/2.58  # Current number of unprocessed clauses: 101
% 8.41/2.58  # ...number of literals in the above   : 403
% 8.41/2.58  # Current number of archived formulas  : 0
% 8.41/2.58  # Current number of archived clauses   : 3
% 8.41/2.58  # Clause-clause subsumption calls (NU) : 486
% 8.41/2.58  # Rec. Clause-clause subsumption calls : 296
% 8.41/2.58  # Non-unit clause-clause subsumptions  : 16
% 8.41/2.58  # Unit Clause-clause subsumption calls : 47
% 8.41/2.58  # Rewrite failures with RHS unbound    : 0
% 8.41/2.58  # BW rewrite match attempts            : 1
% 8.41/2.58  # BW rewrite match successes           : 1
% 8.41/2.58  # Condensation attempts                : 0
% 8.41/2.58  # Condensation successes               : 0
% 8.41/2.58  # Termbank termtop insertions          : 2910
% 8.41/2.58  
% 8.41/2.58  # -------------------------------------------------
% 8.41/2.58  # User time                : 0.009 s
% 8.41/2.58  # System time              : 0.006 s
% 8.41/2.58  # Total time               : 0.015 s
% 8.41/2.58  # ...preprocessing         : 0.012 s
% 8.41/2.58  # ...main loop             : 0.003 s
% 8.41/2.58  # Maximum resident set size: 7136 pages
% 8.41/2.58  
%------------------------------------------------------------------------------