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

View Problem - Process Solution

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

% Computer : n020.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.21s 2.37s
% Output   : CNFRefutation 8.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   20 (  11 unt;   6 nHn;  13 RR)
%            Number of literals    :   33 (   0 equ;  16 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-1 aty)
%            Number of variables   :   27 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_8,plain,
    ( ~ unequally_directed_lines(X1,X2)
    | ~ equally_directed_lines(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-aya3wjn1/input.p',i_0_8) ).

cnf(i_0_52,plain,
    equally_directed_lines(X1,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-aya3wjn1/input.p',i_0_52) ).

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

cnf(i_0_33,plain,
    ~ left_convergent_lines(X1,X2),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-aya3wjn1/input.p',i_0_33) ).

cnf(i_0_63,plain,
    ( unequally_directed_lines(X1,X2)
    | unequally_directed_lines(X1,reverse_line(X2)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-aya3wjn1/input.p',i_0_63) ).

cnf(i_0_67,negated_conjecture,
    ~ equally_directed_lines(reverse_line(reverse_line(esk1_0)),esk1_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-aya3wjn1/input.p',i_0_67) ).

cnf(i_0_7,plain,
    ( unequally_directed_lines(X1,X2)
    | equally_directed_lines(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-aya3wjn1/input.p',i_0_7) ).

cnf(c_0_75,plain,
    ( ~ unequally_directed_lines(X1,X2)
    | ~ equally_directed_lines(X1,X2) ),
    i_0_8 ).

cnf(c_0_76,plain,
    equally_directed_lines(X1,X1),
    i_0_52 ).

cnf(c_0_77,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_65 ).

cnf(c_0_78,plain,
    ~ left_convergent_lines(X1,X2),
    i_0_33 ).

cnf(c_0_79,plain,
    ~ unequally_directed_lines(X1,X1),
    inference(spm,[status(thm)],[c_0_75,c_0_76]) ).

cnf(c_0_80,plain,
    ( unequally_directed_lines(X1,X2)
    | unequally_directed_lines(X1,reverse_line(X2)) ),
    i_0_63 ).

cnf(c_0_81,negated_conjecture,
    ~ equally_directed_lines(reverse_line(reverse_line(esk1_0)),esk1_0),
    i_0_67 ).

cnf(c_0_82,plain,
    ( unequally_directed_lines(X1,X2)
    | equally_directed_lines(X1,X2) ),
    i_0_7 ).

cnf(c_0_83,plain,
    ( ~ unequally_directed_lines(X1,reverse_line(X2))
    | ~ unequally_directed_lines(X1,X2) ),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_77,c_0_78]),c_0_78]) ).

cnf(c_0_84,plain,
    unequally_directed_lines(reverse_line(X1),X1),
    inference(spm,[status(thm)],[c_0_79,c_0_80]) ).

cnf(c_0_85,negated_conjecture,
    unequally_directed_lines(reverse_line(reverse_line(esk1_0)),esk1_0),
    inference(spm,[status(thm)],[c_0_81,c_0_82]) ).

cnf(c_0_86,plain,
    ~ unequally_directed_lines(reverse_line(reverse_line(X1)),X1),
    inference(spm,[status(thm)],[c_0_83,c_0_84]) ).

cnf(c_0_87,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[c_0_85,c_0_86]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : GEO233+3 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n020.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 : Fri Jun 17 17:33:20 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected SinE mode:
% 0.19/0.46  # Parsing /export/starexec/sandbox/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.21/2.37  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 8.21/2.37  # Version: 2.1pre011
% 8.21/2.37  # Preprocessing time       : 0.013 s
% 8.21/2.37  
% 8.21/2.37  # Proof found!
% 8.21/2.37  # SZS status Theorem
% 8.21/2.37  # SZS output start CNFRefutation
% See solution above
% 8.21/2.37  # Proof object total steps             : 20
% 8.21/2.37  # Proof object clause steps            : 13
% 8.21/2.37  # Proof object formula steps           : 7
% 8.21/2.37  # Proof object conjectures             : 4
% 8.21/2.37  # Proof object clause conjectures      : 3
% 8.21/2.37  # Proof object formula conjectures     : 1
% 8.21/2.37  # Proof object initial clauses used    : 7
% 8.21/2.37  # Proof object initial formulas used   : 7
% 8.21/2.37  # Proof object generating inferences   : 4
% 8.21/2.37  # Proof object simplifying inferences  : 3
% 8.21/2.37  # Training examples: 0 positive, 0 negative
% 8.21/2.37  # Parsed axioms                        : 67
% 8.21/2.37  # Removed by relevancy pruning/SinE    : 0
% 8.21/2.37  # Initial clauses                      : 67
% 8.21/2.37  # Removed in clause preprocessing      : 0
% 8.21/2.37  # Initial clauses in saturation        : 67
% 8.21/2.37  # Processed clauses                    : 76
% 8.21/2.37  # ...of these trivial                  : 0
% 8.21/2.37  # ...subsumed                          : 20
% 8.21/2.37  # ...remaining for further processing  : 56
% 8.21/2.37  # Other redundant clauses eliminated   : 0
% 8.21/2.37  # Clauses deleted for lack of memory   : 0
% 8.21/2.37  # Backward-subsumed                    : 3
% 8.21/2.37  # Backward-rewritten                   : 0
% 8.21/2.37  # Generated clauses                    : 54
% 8.21/2.37  # ...of the previous two non-trivial   : 36
% 8.21/2.37  # Contextual simplify-reflections      : 6
% 8.21/2.37  # Paramodulations                      : 39
% 8.21/2.37  # Factorizations                       : 14
% 8.21/2.37  # Equation resolutions                 : 0
% 8.21/2.37  # Propositional unsat checks           : 0
% 8.21/2.37  # Propositional unsat check successes  : 0
% 8.21/2.37  # Current number of processed clauses  : 52
% 8.21/2.37  #    Positive orientable unit clauses  : 3
% 8.21/2.37  #    Positive unorientable unit clauses: 0
% 8.21/2.37  #    Negative unit clauses             : 13
% 8.21/2.37  #    Non-unit-clauses                  : 36
% 8.21/2.37  # Current number of unprocessed clauses: 25
% 8.21/2.37  # ...number of literals in the above   : 52
% 8.21/2.37  # Current number of archived formulas  : 0
% 8.21/2.37  # Current number of archived clauses   : 4
% 8.21/2.37  # Clause-clause subsumption calls (NU) : 555
% 8.21/2.37  # Rec. Clause-clause subsumption calls : 381
% 8.21/2.37  # Non-unit clause-clause subsumptions  : 13
% 8.21/2.37  # Unit Clause-clause subsumption calls : 107
% 8.21/2.37  # Rewrite failures with RHS unbound    : 0
% 8.21/2.37  # BW rewrite match attempts            : 3
% 8.21/2.37  # BW rewrite match successes           : 0
% 8.21/2.37  # Condensation attempts                : 0
% 8.21/2.37  # Condensation successes               : 0
% 8.21/2.37  # Termbank termtop insertions          : 1777
% 8.21/2.37  
% 8.21/2.37  # -------------------------------------------------
% 8.21/2.37  # User time                : 0.008 s
% 8.21/2.37  # System time              : 0.006 s
% 8.21/2.37  # Total time               : 0.014 s
% 8.21/2.37  # ...preprocessing         : 0.013 s
% 8.21/2.37  # ...main loop             : 0.002 s
% 8.21/2.37  # Maximum resident set size: 7136 pages
% 8.21/2.37  
%------------------------------------------------------------------------------