TSTP Solution File: GEO170+1 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n005.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:52 EDT 2022

% Result   : Theorem 6.58s 2.34s
% Output   : CNFRefutation 6.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   24 (  13 unt;   7 nHn;  21 RR)
%            Number of literals    :   48 (   0 equ;  21 neg)
%            Maximal clause size   :    6 (   2 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   :   27 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
    ( distinct_points(X1,X2)
    | distinct_points(X3,X2)
    | ~ distinct_points(X3,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8gq2ioj4/input.p',i_0_4) ).

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

cnf(i_0_18,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-8gq2ioj4/input.p',i_0_18) ).

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

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

cnf(i_0_15,negated_conjecture,
    ~ apart_point_and_line(esk2_0,esk3_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8gq2ioj4/input.p',i_0_15) ).

cnf(i_0_16,negated_conjecture,
    ~ apart_point_and_line(esk1_0,esk3_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8gq2ioj4/input.p',i_0_16) ).

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

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

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

cnf(c_0_29,negated_conjecture,
    distinct_points(esk1_0,esk2_0),
    i_0_17 ).

cnf(c_0_30,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_18 ).

cnf(c_0_31,negated_conjecture,
    distinct_lines(esk3_0,line_connecting(esk1_0,esk2_0)),
    i_0_14 ).

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

cnf(c_0_33,negated_conjecture,
    ( distinct_points(esk1_0,X1)
    | distinct_points(esk2_0,X1) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_34,negated_conjecture,
    ( apart_point_and_line(X1,line_connecting(esk1_0,esk2_0))
    | apart_point_and_line(X2,line_connecting(esk1_0,esk2_0))
    | apart_point_and_line(X1,esk3_0)
    | apart_point_and_line(X2,esk3_0)
    | ~ distinct_points(X1,X2) ),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_35,plain,
    distinct_points(esk2_0,esk1_0),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_36,negated_conjecture,
    ~ apart_point_and_line(esk2_0,esk3_0),
    i_0_15 ).

cnf(c_0_37,negated_conjecture,
    ~ apart_point_and_line(esk1_0,esk3_0),
    i_0_16 ).

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

cnf(c_0_39,plain,
    ( apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))
    | apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0)) ),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),c_0_37]) ).

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

cnf(c_0_41,plain,
    apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_29])]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GEO170+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n005.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sat Jun 18 08:14:10 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.46  # ENIGMATIC: Selected SinE mode:
% 0.19/0.46  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.19/0.46  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.19/0.46  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 6.58/2.34  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 6.58/2.34  # Version: 2.1pre011
% 6.58/2.34  # Preprocessing time       : 0.009 s
% 6.58/2.34  
% 6.58/2.34  # Proof found!
% 6.58/2.34  # SZS status Theorem
% 6.58/2.34  # SZS output start CNFRefutation
% See solution above
% 6.58/2.34  # Proof object total steps             : 24
% 6.58/2.34  # Proof object clause steps            : 15
% 6.58/2.34  # Proof object formula steps           : 9
% 6.58/2.34  # Proof object conjectures             : 10
% 6.58/2.34  # Proof object clause conjectures      : 6
% 6.58/2.34  # Proof object formula conjectures     : 4
% 6.58/2.34  # Proof object initial clauses used    : 9
% 6.58/2.34  # Proof object initial formulas used   : 9
% 6.58/2.34  # Proof object generating inferences   : 6
% 6.58/2.34  # Proof object simplifying inferences  : 6
% 6.58/2.34  # Training examples: 0 positive, 0 negative
% 6.58/2.34  # Parsed axioms                        : 18
% 6.58/2.34  # Removed by relevancy pruning/SinE    : 0
% 6.58/2.34  # Initial clauses                      : 18
% 6.58/2.34  # Removed in clause preprocessing      : 0
% 6.58/2.34  # Initial clauses in saturation        : 18
% 6.58/2.34  # Processed clauses                    : 30
% 6.58/2.34  # ...of these trivial                  : 0
% 6.58/2.34  # ...subsumed                          : 3
% 6.58/2.34  # ...remaining for further processing  : 27
% 6.58/2.34  # Other redundant clauses eliminated   : 0
% 6.58/2.34  # Clauses deleted for lack of memory   : 0
% 6.58/2.34  # Backward-subsumed                    : 0
% 6.58/2.34  # Backward-rewritten                   : 1
% 6.58/2.34  # Generated clauses                    : 44
% 6.58/2.34  # ...of the previous two non-trivial   : 38
% 6.58/2.34  # Contextual simplify-reflections      : 0
% 6.58/2.34  # Paramodulations                      : 40
% 6.58/2.34  # Factorizations                       : 4
% 6.58/2.34  # Equation resolutions                 : 0
% 6.58/2.34  # Propositional unsat checks           : 0
% 6.58/2.34  # Propositional unsat check successes  : 0
% 6.58/2.34  # Current number of processed clauses  : 26
% 6.58/2.34  #    Positive orientable unit clauses  : 4
% 6.58/2.34  #    Positive unorientable unit clauses: 0
% 6.58/2.34  #    Negative unit clauses             : 5
% 6.58/2.34  #    Non-unit-clauses                  : 17
% 6.58/2.34  # Current number of unprocessed clauses: 22
% 6.58/2.34  # ...number of literals in the above   : 108
% 6.58/2.34  # Current number of archived formulas  : 0
% 6.58/2.34  # Current number of archived clauses   : 1
% 6.58/2.34  # Clause-clause subsumption calls (NU) : 30
% 6.58/2.34  # Rec. Clause-clause subsumption calls : 22
% 6.58/2.34  # Non-unit clause-clause subsumptions  : 3
% 6.58/2.34  # Unit Clause-clause subsumption calls : 3
% 6.58/2.34  # Rewrite failures with RHS unbound    : 0
% 6.58/2.34  # BW rewrite match attempts            : 1
% 6.58/2.34  # BW rewrite match successes           : 1
% 6.58/2.34  # Condensation attempts                : 0
% 6.58/2.34  # Condensation successes               : 0
% 6.58/2.34  # Termbank termtop insertions          : 972
% 6.58/2.34  
% 6.58/2.34  # -------------------------------------------------
% 6.58/2.34  # User time                : 0.007 s
% 6.58/2.34  # System time              : 0.003 s
% 6.58/2.34  # Total time               : 0.010 s
% 6.58/2.34  # ...preprocessing         : 0.009 s
% 6.58/2.34  # ...main loop             : 0.001 s
% 6.58/2.34  # Maximum resident set size: 7132 pages
% 6.58/2.34  
%------------------------------------------------------------------------------