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

View Problem - Process Solution

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

% Computer : n024.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:39 EDT 2022

% Result   : Theorem 8.92s 2.56s
% Output   : CNFRefutation 8.92s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   14 (   3 unt;   3 nHn;  11 RR)
%            Number of literals    :   25 (   0 equ;  14 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   17 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_26,negated_conjecture,
    ( ~ incident_point_and_line(esk1_0,X1)
    | ~ incident_point_and_line(esk2_0,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dbzhf_g7/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/sandbox/tmp/enigma-theBenchmark.p-dbzhf_g7/input.p',i_0_3) ).

cnf(i_0_20,plain,
    ( ~ distinct_points(X1,X2)
    | ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dbzhf_g7/input.p',i_0_20) ).

cnf(i_0_21,plain,
    ( ~ distinct_points(X1,X2)
    | ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dbzhf_g7/input.p',i_0_21) ).

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

cnf(c_0_34,negated_conjecture,
    ( ~ incident_point_and_line(esk1_0,X1)
    | ~ incident_point_and_line(esk2_0,X1) ),
    i_0_26 ).

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

cnf(c_0_36,negated_conjecture,
    ( apart_point_and_line(esk1_0,X1)
    | ~ incident_point_and_line(esk2_0,X1) ),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_37,plain,
    ( ~ distinct_points(X1,X2)
    | ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
    i_0_20 ).

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

cnf(c_0_39,plain,
    ( ~ distinct_points(X1,X2)
    | ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
    i_0_21 ).

cnf(c_0_40,plain,
    ( apart_point_and_line(esk2_0,line_connecting(esk1_0,X1))
    | ~ distinct_points(esk1_0,X1) ),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_41,negated_conjecture,
    distinct_points(esk1_0,esk2_0),
    i_0_28 ).

cnf(c_0_42,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GEO225+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 : n024.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 10:37:19 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.92/2.56  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 8.92/2.56  # Version: 2.1pre011
% 8.92/2.56  # Preprocessing time       : 0.010 s
% 8.92/2.56  
% 8.92/2.56  # Proof found!
% 8.92/2.56  # SZS status Theorem
% 8.92/2.56  # SZS output start CNFRefutation
% See solution above
% 8.92/2.56  # Proof object total steps             : 14
% 8.92/2.56  # Proof object clause steps            : 9
% 8.92/2.56  # Proof object formula steps           : 5
% 8.92/2.56  # Proof object conjectures             : 5
% 8.92/2.56  # Proof object clause conjectures      : 3
% 8.92/2.56  # Proof object formula conjectures     : 2
% 8.92/2.56  # Proof object initial clauses used    : 5
% 8.92/2.56  # Proof object initial formulas used   : 5
% 8.92/2.56  # Proof object generating inferences   : 4
% 8.92/2.56  # Proof object simplifying inferences  : 2
% 8.92/2.56  # Training examples: 0 positive, 0 negative
% 8.92/2.56  # Parsed axioms                        : 47
% 8.92/2.56  # Removed by relevancy pruning/SinE    : 0
% 8.92/2.56  # Initial clauses                      : 47
% 8.92/2.56  # Removed in clause preprocessing      : 0
% 8.92/2.56  # Initial clauses in saturation        : 47
% 8.92/2.56  # Processed clauses                    : 68
% 8.92/2.56  # ...of these trivial                  : 0
% 8.92/2.56  # ...subsumed                          : 9
% 8.92/2.56  # ...remaining for further processing  : 59
% 8.92/2.56  # Other redundant clauses eliminated   : 0
% 8.92/2.56  # Clauses deleted for lack of memory   : 0
% 8.92/2.56  # Backward-subsumed                    : 0
% 8.92/2.56  # Backward-rewritten                   : 0
% 8.92/2.56  # Generated clauses                    : 119
% 8.92/2.56  # ...of the previous two non-trivial   : 98
% 8.92/2.56  # Contextual simplify-reflections      : 4
% 8.92/2.56  # Paramodulations                      : 95
% 8.92/2.56  # Factorizations                       : 24
% 8.92/2.56  # Equation resolutions                 : 0
% 8.92/2.56  # Propositional unsat checks           : 0
% 8.92/2.56  # Propositional unsat check successes  : 0
% 8.92/2.56  # Current number of processed clauses  : 59
% 8.92/2.56  #    Positive orientable unit clauses  : 7
% 8.92/2.56  #    Positive unorientable unit clauses: 0
% 8.92/2.56  #    Negative unit clauses             : 7
% 8.92/2.56  #    Non-unit-clauses                  : 45
% 8.92/2.56  # Current number of unprocessed clauses: 75
% 8.92/2.56  # ...number of literals in the above   : 336
% 8.92/2.56  # Current number of archived formulas  : 0
% 8.92/2.56  # Current number of archived clauses   : 0
% 8.92/2.56  # Clause-clause subsumption calls (NU) : 396
% 8.92/2.56  # Rec. Clause-clause subsumption calls : 219
% 8.92/2.56  # Non-unit clause-clause subsumptions  : 13
% 8.92/2.56  # Unit Clause-clause subsumption calls : 22
% 8.92/2.56  # Rewrite failures with RHS unbound    : 0
% 8.92/2.56  # BW rewrite match attempts            : 0
% 8.92/2.56  # BW rewrite match successes           : 0
% 8.92/2.56  # Condensation attempts                : 0
% 8.92/2.56  # Condensation successes               : 0
% 8.92/2.56  # Termbank termtop insertions          : 2192
% 8.92/2.56  
% 8.92/2.56  # -------------------------------------------------
% 8.92/2.56  # User time                : 0.010 s
% 8.92/2.56  # System time              : 0.002 s
% 8.92/2.56  # Total time               : 0.012 s
% 8.92/2.56  # ...preprocessing         : 0.010 s
% 8.92/2.56  # ...main loop             : 0.002 s
% 8.92/2.56  # Maximum resident set size: 7132 pages
% 8.92/2.56  
%------------------------------------------------------------------------------