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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : GEO201+2 : 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:19 EDT 2022

% Result   : Theorem 8.47s 2.29s
% Output   : CNFRefutation 8.47s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   39 (  15 unt;  16 nHn;  29 RR)
%            Number of literals    :   88 (   0 equ;  32 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    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   60 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_6,plain,
    ( convergent_lines(X1,X2)
    | convergent_lines(X3,X2)
    | ~ convergent_lines(X3,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a2ote1hl/input.p',i_0_6) ).

cnf(i_0_15,negated_conjecture,
    convergent_lines(esk1_0,esk2_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a2ote1hl/input.p',i_0_15) ).

cnf(i_0_5,plain,
    ( distinct_lines(X1,X2)
    | distinct_lines(X3,X2)
    | ~ distinct_lines(X3,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a2ote1hl/input.p',i_0_5) ).

cnf(i_0_9,plain,
    ( distinct_lines(X1,X2)
    | ~ convergent_lines(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a2ote1hl/input.p',i_0_9) ).

cnf(i_0_3,plain,
    ~ convergent_lines(X1,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a2ote1hl/input.p',i_0_3) ).

cnf(i_0_2,plain,
    ~ distinct_lines(X1,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a2ote1hl/input.p',i_0_2) ).

cnf(i_0_4,plain,
    ( distinct_points(X1,X2)
    | distinct_points(X3,X2)
    | ~ distinct_points(X3,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a2ote1hl/input.p',i_0_4) ).

cnf(i_0_14,negated_conjecture,
    distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk2_0,esk1_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a2ote1hl/input.p',i_0_14) ).

cnf(i_0_16,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/sandbox/tmp/enigma-theBenchmark.p-a2ote1hl/input.p',i_0_16) ).

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

cnf(i_0_13,plain,
    ( distinct_points(X1,intersection_point(X2,X3))
    | ~ convergent_lines(X2,X3)
    | ~ apart_point_and_line(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a2ote1hl/input.p',i_0_13) ).

cnf(i_0_12,plain,
    ( distinct_points(X1,intersection_point(X2,X3))
    | ~ convergent_lines(X2,X3)
    | ~ apart_point_and_line(X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a2ote1hl/input.p',i_0_12) ).

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

cnf(c_0_30,negated_conjecture,
    convergent_lines(esk1_0,esk2_0),
    i_0_15 ).

cnf(c_0_31,plain,
    ( distinct_lines(X1,X2)
    | distinct_lines(X3,X2)
    | ~ distinct_lines(X3,X1) ),
    i_0_5 ).

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

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

cnf(c_0_34,negated_conjecture,
    ( convergent_lines(esk1_0,X1)
    | convergent_lines(esk2_0,X1) ),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_35,plain,
    ( distinct_lines(X1,X2)
    | distinct_lines(X3,X2)
    | ~ convergent_lines(X1,X3) ),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_36,plain,
    convergent_lines(esk2_0,esk1_0),
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_37,plain,
    ~ distinct_lines(X1,X1),
    i_0_2 ).

cnf(c_0_38,plain,
    ( distinct_lines(esk1_0,X1)
    | distinct_lines(esk2_0,X1) ),
    inference(spm,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_39,plain,
    ( distinct_points(X1,X2)
    | distinct_points(X3,X2)
    | ~ distinct_points(X3,X1) ),
    i_0_4 ).

cnf(c_0_40,negated_conjecture,
    distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk2_0,esk1_0)),
    i_0_14 ).

cnf(c_0_41,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_16 ).

cnf(c_0_42,plain,
    distinct_lines(esk2_0,esk1_0),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

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

cnf(c_0_44,negated_conjecture,
    ( distinct_points(intersection_point(esk1_0,esk2_0),X1)
    | distinct_points(intersection_point(esk2_0,esk1_0),X1) ),
    inference(spm,[status(thm)],[c_0_39,c_0_40]) ).

cnf(c_0_45,plain,
    ( distinct_points(X1,intersection_point(X2,X3))
    | ~ convergent_lines(X2,X3)
    | ~ apart_point_and_line(X1,X2) ),
    i_0_13 ).

cnf(c_0_46,plain,
    ( apart_point_and_line(X1,esk2_0)
    | apart_point_and_line(X1,esk1_0)
    | apart_point_and_line(X2,esk2_0)
    | apart_point_and_line(X2,esk1_0)
    | ~ distinct_points(X1,X2) ),
    inference(spm,[status(thm)],[c_0_41,c_0_42]) ).

cnf(c_0_47,plain,
    distinct_points(intersection_point(esk2_0,esk1_0),intersection_point(esk1_0,esk2_0)),
    inference(spm,[status(thm)],[c_0_43,c_0_44]) ).

cnf(c_0_48,plain,
    ( distinct_points(X1,intersection_point(X2,X3))
    | ~ convergent_lines(X2,X3)
    | ~ apart_point_and_line(X1,X3) ),
    i_0_12 ).

cnf(c_0_49,plain,
    ( ~ apart_point_and_line(intersection_point(X1,X2),X1)
    | ~ convergent_lines(X1,X2) ),
    inference(spm,[status(thm)],[c_0_43,c_0_45]) ).

cnf(c_0_50,plain,
    ( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)
    | apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)
    | apart_point_and_line(intersection_point(esk2_0,esk1_0),esk1_0)
    | apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0) ),
    inference(spm,[status(thm)],[c_0_46,c_0_47]) ).

cnf(c_0_51,plain,
    ( ~ apart_point_and_line(intersection_point(X1,X2),X2)
    | ~ convergent_lines(X1,X2) ),
    inference(spm,[status(thm)],[c_0_43,c_0_48]) ).

cnf(c_0_52,plain,
    ( apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0)
    | apart_point_and_line(intersection_point(esk2_0,esk1_0),esk1_0)
    | apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_30])]) ).

cnf(c_0_53,plain,
    ( apart_point_and_line(intersection_point(esk2_0,esk1_0),esk1_0)
    | apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_30])]) ).

cnf(c_0_54,plain,
    apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_53]),c_0_36])]) ).

cnf(c_0_55,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_54]),c_0_36])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : GEO201+2 : TPTP v8.1.0. Released v3.3.0.
% 0.06/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:25:36 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected SinE mode:
% 0.18/0.45  # Parsing /export/starexec/sandbox/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
% 8.47/2.29  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 8.47/2.29  # Version: 2.1pre011
% 8.47/2.29  # Preprocessing time       : 0.017 s
% 8.47/2.29  
% 8.47/2.29  # Proof found!
% 8.47/2.29  # SZS status Theorem
% 8.47/2.29  # SZS output start CNFRefutation
% See solution above
% 8.47/2.29  # Proof object total steps             : 39
% 8.47/2.29  # Proof object clause steps            : 27
% 8.47/2.29  # Proof object formula steps           : 12
% 8.47/2.29  # Proof object conjectures             : 6
% 8.47/2.29  # Proof object clause conjectures      : 4
% 8.47/2.29  # Proof object formula conjectures     : 2
% 8.47/2.29  # Proof object initial clauses used    : 12
% 8.47/2.29  # Proof object initial formulas used   : 12
% 8.47/2.29  # Proof object generating inferences   : 15
% 8.47/2.29  # Proof object simplifying inferences  : 8
% 8.47/2.29  # Training examples: 0 positive, 0 negative
% 8.47/2.29  # Parsed axioms                        : 16
% 8.47/2.29  # Removed by relevancy pruning/SinE    : 0
% 8.47/2.29  # Initial clauses                      : 16
% 8.47/2.29  # Removed in clause preprocessing      : 0
% 8.47/2.29  # Initial clauses in saturation        : 16
% 8.47/2.29  # Processed clauses                    : 55
% 8.47/2.29  # ...of these trivial                  : 0
% 8.47/2.29  # ...subsumed                          : 12
% 8.47/2.29  # ...remaining for further processing  : 43
% 8.47/2.29  # Other redundant clauses eliminated   : 0
% 8.47/2.29  # Clauses deleted for lack of memory   : 0
% 8.47/2.29  # Backward-subsumed                    : 2
% 8.47/2.29  # Backward-rewritten                   : 2
% 8.47/2.29  # Generated clauses                    : 192
% 8.47/2.29  # ...of the previous two non-trivial   : 165
% 8.47/2.29  # Contextual simplify-reflections      : 1
% 8.47/2.29  # Paramodulations                      : 154
% 8.47/2.29  # Factorizations                       : 38
% 8.47/2.29  # Equation resolutions                 : 0
% 8.47/2.29  # Propositional unsat checks           : 0
% 8.47/2.29  # Propositional unsat check successes  : 0
% 8.47/2.29  # Current number of processed clauses  : 39
% 8.47/2.29  #    Positive orientable unit clauses  : 6
% 8.47/2.29  #    Positive unorientable unit clauses: 0
% 8.47/2.29  #    Negative unit clauses             : 3
% 8.47/2.29  #    Non-unit-clauses                  : 30
% 8.47/2.29  # Current number of unprocessed clauses: 96
% 8.47/2.29  # ...number of literals in the above   : 406
% 8.47/2.29  # Current number of archived formulas  : 0
% 8.47/2.29  # Current number of archived clauses   : 4
% 8.47/2.29  # Clause-clause subsumption calls (NU) : 161
% 8.47/2.29  # Rec. Clause-clause subsumption calls : 114
% 8.47/2.29  # Non-unit clause-clause subsumptions  : 14
% 8.47/2.29  # Unit Clause-clause subsumption calls : 4
% 8.47/2.29  # Rewrite failures with RHS unbound    : 0
% 8.47/2.29  # BW rewrite match attempts            : 1
% 8.47/2.29  # BW rewrite match successes           : 1
% 8.47/2.29  # Condensation attempts                : 0
% 8.47/2.29  # Condensation successes               : 0
% 8.47/2.29  # Termbank termtop insertions          : 2475
% 8.47/2.29  
% 8.47/2.29  # -------------------------------------------------
% 8.47/2.29  # User time                : 0.020 s
% 8.47/2.29  # System time              : 0.002 s
% 8.47/2.29  # Total time               : 0.022 s
% 8.47/2.29  # ...preprocessing         : 0.017 s
% 8.47/2.29  # ...main loop             : 0.005 s
% 8.47/2.29  # Maximum resident set size: 7128 pages
% 8.47/2.29  
%------------------------------------------------------------------------------