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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : GEO233+1 : TPTP v8.1.0. Bugfixed v6.4.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:44 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_36,plain,
    ( unequally_directed_lines(X1,X2)
    | unequally_directed_lines(X3,X2)
    | ~ unequally_directed_lines(X3,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xncgjmqn/input.p',i_0_36) ).

cnf(i_0_17,negated_conjecture,
    unequally_directed_lines(reverse_line(reverse_line(esk1_0)),esk1_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xncgjmqn/input.p',i_0_17) ).

cnf(i_0_42,plain,
    ( left_convergent_lines(X1,X2)
    | left_convergent_lines(X1,reverse_line(X2))
    | ~ unequally_directed_lines(X1,X2)
    | ~ unequally_directed_lines(X1,reverse_line(X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xncgjmqn/input.p',i_0_42) ).

cnf(i_0_30,plain,
    ~ left_convergent_lines(X1,X2),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xncgjmqn/input.p',i_0_30) ).

cnf(i_0_35,plain,
    ~ unequally_directed_lines(X1,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xncgjmqn/input.p',i_0_35) ).

cnf(c_0_48,plain,
    ( unequally_directed_lines(X1,X2)
    | unequally_directed_lines(X3,X2)
    | ~ unequally_directed_lines(X3,X1) ),
    i_0_36 ).

cnf(c_0_49,negated_conjecture,
    unequally_directed_lines(reverse_line(reverse_line(esk1_0)),esk1_0),
    i_0_17 ).

cnf(c_0_50,plain,
    ( left_convergent_lines(X1,X2)
    | left_convergent_lines(X1,reverse_line(X2))
    | ~ unequally_directed_lines(X1,X2)
    | ~ unequally_directed_lines(X1,reverse_line(X2)) ),
    i_0_42 ).

cnf(c_0_51,plain,
    ~ left_convergent_lines(X1,X2),
    i_0_30 ).

cnf(c_0_52,plain,
    ~ unequally_directed_lines(X1,X1),
    i_0_35 ).

cnf(c_0_53,negated_conjecture,
    ( unequally_directed_lines(reverse_line(reverse_line(esk1_0)),X1)
    | unequally_directed_lines(esk1_0,X1) ),
    inference(spm,[status(thm)],[c_0_48,c_0_49]) ).

cnf(c_0_54,plain,
    ( ~ unequally_directed_lines(X1,reverse_line(X2))
    | ~ unequally_directed_lines(X1,X2) ),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_50,c_0_51]),c_0_51]) ).

cnf(c_0_55,plain,
    unequally_directed_lines(esk1_0,reverse_line(reverse_line(esk1_0))),
    inference(spm,[status(thm)],[c_0_52,c_0_53]) ).

cnf(c_0_56,plain,
    ( unequally_directed_lines(esk1_0,reverse_line(X1))
    | ~ unequally_directed_lines(reverse_line(reverse_line(esk1_0)),X1) ),
    inference(spm,[status(thm)],[c_0_54,c_0_53]) ).

cnf(c_0_57,plain,
    ~ unequally_directed_lines(esk1_0,reverse_line(esk1_0)),
    inference(spm,[status(thm)],[c_0_54,c_0_55]) ).

cnf(c_0_58,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_49]),c_0_57]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GEO233+1 : TPTP v8.1.0. Bugfixed v6.4.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n010.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 13:31:40 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.45  # 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
% 8.35/2.47  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.35/2.47  # Version: 2.1pre011
% 8.35/2.47  # Preprocessing time       : 0.018 s
% 8.35/2.47  
% 8.35/2.47  # Proof found!
% 8.35/2.47  # SZS status Theorem
% 8.35/2.47  # SZS output start CNFRefutation
% See solution above
% 8.35/2.47  # Proof object total steps             : 16
% 8.35/2.47  # Proof object clause steps            : 11
% 8.35/2.47  # Proof object formula steps           : 5
% 8.35/2.47  # Proof object conjectures             : 4
% 8.35/2.47  # Proof object clause conjectures      : 3
% 8.35/2.47  # Proof object formula conjectures     : 1
% 8.35/2.47  # Proof object initial clauses used    : 5
% 8.35/2.47  # Proof object initial formulas used   : 5
% 8.35/2.47  # Proof object generating inferences   : 5
% 8.35/2.47  # Proof object simplifying inferences  : 3
% 8.35/2.47  # Training examples: 0 positive, 0 negative
% 8.35/2.47  # Parsed axioms                        : 59
% 8.35/2.47  # Removed by relevancy pruning/SinE    : 0
% 8.35/2.47  # Initial clauses                      : 59
% 8.35/2.47  # Removed in clause preprocessing      : 0
% 8.35/2.47  # Initial clauses in saturation        : 59
% 8.35/2.47  # Processed clauses                    : 66
% 8.35/2.47  # ...of these trivial                  : 0
% 8.35/2.47  # ...subsumed                          : 26
% 8.35/2.47  # ...remaining for further processing  : 40
% 8.35/2.47  # Other redundant clauses eliminated   : 0
% 8.35/2.47  # Clauses deleted for lack of memory   : 0
% 8.35/2.47  # Backward-subsumed                    : 1
% 8.35/2.47  # Backward-rewritten                   : 0
% 8.35/2.47  # Generated clauses                    : 47
% 8.35/2.47  # ...of the previous two non-trivial   : 31
% 8.35/2.47  # Contextual simplify-reflections      : 9
% 8.35/2.47  # Paramodulations                      : 45
% 8.35/2.47  # Factorizations                       : 2
% 8.35/2.47  # Equation resolutions                 : 0
% 8.35/2.47  # Propositional unsat checks           : 0
% 8.35/2.47  # Propositional unsat check successes  : 0
% 8.35/2.47  # Current number of processed clauses  : 39
% 8.35/2.47  #    Positive orientable unit clauses  : 2
% 8.35/2.47  #    Positive unorientable unit clauses: 0
% 8.35/2.47  #    Negative unit clauses             : 12
% 8.35/2.47  #    Non-unit-clauses                  : 25
% 8.35/2.47  # Current number of unprocessed clauses: 22
% 8.35/2.47  # ...number of literals in the above   : 70
% 8.35/2.47  # Current number of archived formulas  : 0
% 8.35/2.47  # Current number of archived clauses   : 1
% 8.35/2.47  # Clause-clause subsumption calls (NU) : 164
% 8.35/2.47  # Rec. Clause-clause subsumption calls : 108
% 8.35/2.47  # Non-unit clause-clause subsumptions  : 15
% 8.35/2.47  # Unit Clause-clause subsumption calls : 69
% 8.35/2.47  # Rewrite failures with RHS unbound    : 0
% 8.35/2.47  # BW rewrite match attempts            : 0
% 8.35/2.47  # BW rewrite match successes           : 0
% 8.35/2.47  # Condensation attempts                : 0
% 8.35/2.47  # Condensation successes               : 0
% 8.35/2.47  # Termbank termtop insertions          : 1659
% 8.35/2.47  
% 8.35/2.47  # -------------------------------------------------
% 8.35/2.47  # User time                : 0.018 s
% 8.35/2.47  # System time              : 0.003 s
% 8.35/2.47  # Total time               : 0.021 s
% 8.35/2.47  # ...preprocessing         : 0.018 s
% 8.35/2.47  # ...main loop             : 0.002 s
% 8.35/2.47  # Maximum resident set size: 7124 pages
% 8.35/2.47  
%------------------------------------------------------------------------------