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

View Problem - Process Solution

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

% Computer : n010.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:46 EDT 2022

% Result   : Theorem 8.41s 2.48s
% Output   : CNFRefutation 8.41s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   11 (   7 unt;   2 nHn;  11 RR)
%            Number of literals    :   17 (   0 equ;   8 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    :    3 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :   16 (   8 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
    ( left_apart_point(X1,reverse_line(X2))
    | ~ right_apart_point(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f9dfrqgc/input.p',i_0_4) ).

cnf(i_0_30,plain,
    ~ left_apart_point(X1,X2),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f9dfrqgc/input.p',i_0_30) ).

cnf(i_0_13,plain,
    ( right_apart_point(X1,X2)
    | left_apart_point(X1,X2)
    | ~ apart_point_and_line(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f9dfrqgc/input.p',i_0_13) ).

cnf(i_0_70,negated_conjecture,
    apart_point_and_line(esk3_0,esk4_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f9dfrqgc/input.p',i_0_70) ).

cnf(c_0_75,plain,
    ( left_apart_point(X1,reverse_line(X2))
    | ~ right_apart_point(X1,X2) ),
    i_0_4 ).

cnf(c_0_76,plain,
    ~ left_apart_point(X1,X2),
    i_0_30 ).

cnf(c_0_77,plain,
    ( right_apart_point(X1,X2)
    | left_apart_point(X1,X2)
    | ~ apart_point_and_line(X1,X2) ),
    i_0_13 ).

cnf(c_0_78,plain,
    ~ right_apart_point(X1,X2),
    inference(sr,[status(thm)],[c_0_75,c_0_76]) ).

cnf(c_0_79,negated_conjecture,
    apart_point_and_line(esk3_0,esk4_0),
    i_0_70 ).

cnf(c_0_80,plain,
    ~ apart_point_and_line(X1,X2),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_77,c_0_76]),c_0_78]) ).

cnf(c_0_81,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[c_0_79,c_0_80]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : GEO237+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.14/0.34  % Computer : n010.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Sat Jun 18 13:52:09 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.21/0.46  # ENIGMATIC: Selected SinE mode:
% 0.21/0.46  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.46  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.21/0.46  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.21/0.46  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 8.41/2.48  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.41/2.48  # Version: 2.1pre011
% 8.41/2.48  # Preprocessing time       : 0.020 s
% 8.41/2.48  
% 8.41/2.48  # Proof found!
% 8.41/2.48  # SZS status Theorem
% 8.41/2.48  # SZS output start CNFRefutation
% See solution above
% 8.41/2.48  # Proof object total steps             : 11
% 8.41/2.48  # Proof object clause steps            : 7
% 8.41/2.48  # Proof object formula steps           : 4
% 8.41/2.48  # Proof object conjectures             : 3
% 8.41/2.48  # Proof object clause conjectures      : 2
% 8.41/2.48  # Proof object formula conjectures     : 1
% 8.41/2.48  # Proof object initial clauses used    : 4
% 8.41/2.48  # Proof object initial formulas used   : 4
% 8.41/2.48  # Proof object generating inferences   : 0
% 8.41/2.48  # Proof object simplifying inferences  : 4
% 8.41/2.48  # Training examples: 0 positive, 0 negative
% 8.41/2.48  # Parsed axioms                        : 70
% 8.41/2.48  # Removed by relevancy pruning/SinE    : 0
% 8.41/2.48  # Initial clauses                      : 70
% 8.41/2.48  # Removed in clause preprocessing      : 0
% 8.41/2.48  # Initial clauses in saturation        : 70
% 8.41/2.48  # Processed clauses                    : 33
% 8.41/2.48  # ...of these trivial                  : 0
% 8.41/2.48  # ...subsumed                          : 4
% 8.41/2.48  # ...remaining for further processing  : 29
% 8.41/2.48  # Other redundant clauses eliminated   : 0
% 8.41/2.48  # Clauses deleted for lack of memory   : 0
% 8.41/2.48  # Backward-subsumed                    : 0
% 8.41/2.48  # Backward-rewritten                   : 0
% 8.41/2.48  # Generated clauses                    : 11
% 8.41/2.48  # ...of the previous two non-trivial   : 7
% 8.41/2.48  # Contextual simplify-reflections      : 0
% 8.41/2.48  # Paramodulations                      : 10
% 8.41/2.48  # Factorizations                       : 0
% 8.41/2.48  # Equation resolutions                 : 0
% 8.41/2.48  # Propositional unsat checks           : 0
% 8.41/2.48  # Propositional unsat check successes  : 0
% 8.41/2.48  # Current number of processed clauses  : 28
% 8.41/2.48  #    Positive orientable unit clauses  : 3
% 8.41/2.48  #    Positive unorientable unit clauses: 0
% 8.41/2.48  #    Negative unit clauses             : 10
% 8.41/2.48  #    Non-unit-clauses                  : 15
% 8.41/2.48  # Current number of unprocessed clauses: 44
% 8.41/2.48  # ...number of literals in the above   : 136
% 8.41/2.48  # Current number of archived formulas  : 0
% 8.41/2.48  # Current number of archived clauses   : 1
% 8.41/2.48  # Clause-clause subsumption calls (NU) : 90
% 8.41/2.48  # Rec. Clause-clause subsumption calls : 70
% 8.41/2.48  # Non-unit clause-clause subsumptions  : 0
% 8.41/2.48  # Unit Clause-clause subsumption calls : 61
% 8.41/2.48  # Rewrite failures with RHS unbound    : 0
% 8.41/2.48  # BW rewrite match attempts            : 1
% 8.41/2.48  # BW rewrite match successes           : 0
% 8.41/2.48  # Condensation attempts                : 0
% 8.41/2.48  # Condensation successes               : 0
% 8.41/2.48  # Termbank termtop insertions          : 1246
% 8.41/2.48  
% 8.41/2.48  # -------------------------------------------------
% 8.41/2.48  # User time                : 0.017 s
% 8.41/2.48  # System time              : 0.004 s
% 8.41/2.48  # Total time               : 0.021 s
% 8.41/2.48  # ...preprocessing         : 0.020 s
% 8.41/2.48  # ...main loop             : 0.001 s
% 8.41/2.48  # Maximum resident set size: 7128 pages
% 8.41/2.48  
%------------------------------------------------------------------------------