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

View Problem - Process Solution

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

% Computer : n003.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:45:01 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_67,negated_conjecture,
    ~ equally_directed_opposite_lines(esk1_0,esk2_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_gj1y_34/input.p',i_0_67) ).

cnf(i_0_9,plain,
    ( unequally_directed_opposite_lines(X1,X2)
    | equally_directed_opposite_lines(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_gj1y_34/input.p',i_0_9) ).

cnf(i_0_2,plain,
    ( unequally_directed_lines(X1,reverse_line(X2))
    | ~ unequally_directed_opposite_lines(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_gj1y_34/input.p',i_0_2) ).

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

cnf(i_0_68,negated_conjecture,
    equally_directed_lines(esk1_0,reverse_line(esk2_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_gj1y_34/input.p',i_0_68) ).

cnf(c_0_74,negated_conjecture,
    ~ equally_directed_opposite_lines(esk1_0,esk2_0),
    i_0_67 ).

cnf(c_0_75,plain,
    ( unequally_directed_opposite_lines(X1,X2)
    | equally_directed_opposite_lines(X1,X2) ),
    i_0_9 ).

cnf(c_0_76,plain,
    ( unequally_directed_lines(X1,reverse_line(X2))
    | ~ unequally_directed_opposite_lines(X1,X2) ),
    i_0_2 ).

cnf(c_0_77,negated_conjecture,
    unequally_directed_opposite_lines(esk1_0,esk2_0),
    inference(spm,[status(thm)],[c_0_74,c_0_75]) ).

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

cnf(c_0_79,negated_conjecture,
    equally_directed_lines(esk1_0,reverse_line(esk2_0)),
    i_0_68 ).

cnf(c_0_80,plain,
    unequally_directed_lines(esk1_0,reverse_line(esk2_0)),
    inference(spm,[status(thm)],[c_0_76,c_0_77]) ).

cnf(c_0_81,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_80])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : GEO265+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 : n003.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 : Fri Jun 17 22:15:29 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
% 7.33/2.34  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.33/2.34  # Version: 2.1pre011
% 7.33/2.34  # Preprocessing time       : 0.010 s
% 7.33/2.34  
% 7.33/2.34  # Proof found!
% 7.33/2.34  # SZS status Theorem
% 7.33/2.34  # SZS output start CNFRefutation
% See solution above
% 7.33/2.34  # Proof object total steps             : 13
% 7.33/2.34  # Proof object clause steps            : 8
% 7.33/2.34  # Proof object formula steps           : 5
% 7.33/2.34  # Proof object conjectures             : 6
% 7.33/2.34  # Proof object clause conjectures      : 4
% 7.33/2.34  # Proof object formula conjectures     : 2
% 7.33/2.34  # Proof object initial clauses used    : 5
% 7.33/2.34  # Proof object initial formulas used   : 5
% 7.33/2.34  # Proof object generating inferences   : 3
% 7.33/2.34  # Proof object simplifying inferences  : 2
% 7.33/2.34  # Training examples: 0 positive, 0 negative
% 7.33/2.34  # Parsed axioms                        : 68
% 7.33/2.34  # Removed by relevancy pruning/SinE    : 0
% 7.33/2.34  # Initial clauses                      : 68
% 7.33/2.34  # Removed in clause preprocessing      : 0
% 7.33/2.34  # Initial clauses in saturation        : 68
% 7.33/2.34  # Processed clauses                    : 76
% 7.33/2.34  # ...of these trivial                  : 0
% 7.33/2.34  # ...subsumed                          : 18
% 7.33/2.34  # ...remaining for further processing  : 57
% 7.33/2.34  # Other redundant clauses eliminated   : 0
% 7.33/2.34  # Clauses deleted for lack of memory   : 0
% 7.33/2.34  # Backward-subsumed                    : 3
% 7.33/2.34  # Backward-rewritten                   : 0
% 7.33/2.34  # Generated clauses                    : 50
% 7.33/2.34  # ...of the previous two non-trivial   : 35
% 7.33/2.34  # Contextual simplify-reflections      : 6
% 7.33/2.34  # Paramodulations                      : 44
% 7.33/2.34  # Factorizations                       : 6
% 7.33/2.34  # Equation resolutions                 : 0
% 7.33/2.34  # Propositional unsat checks           : 0
% 7.33/2.34  # Propositional unsat check successes  : 0
% 7.33/2.34  # Current number of processed clauses  : 54
% 7.33/2.34  #    Positive orientable unit clauses  : 5
% 7.33/2.34  #    Positive unorientable unit clauses: 0
% 7.33/2.34  #    Negative unit clauses             : 13
% 7.33/2.34  #    Non-unit-clauses                  : 36
% 7.33/2.34  # Current number of unprocessed clauses: 25
% 7.33/2.34  # ...number of literals in the above   : 56
% 7.33/2.34  # Current number of archived formulas  : 0
% 7.33/2.34  # Current number of archived clauses   : 3
% 7.33/2.34  # Clause-clause subsumption calls (NU) : 639
% 7.33/2.34  # Rec. Clause-clause subsumption calls : 429
% 7.33/2.34  # Non-unit clause-clause subsumptions  : 13
% 7.33/2.34  # Unit Clause-clause subsumption calls : 143
% 7.33/2.34  # Rewrite failures with RHS unbound    : 0
% 7.33/2.34  # BW rewrite match attempts            : 2
% 7.33/2.34  # BW rewrite match successes           : 0
% 7.33/2.34  # Condensation attempts                : 0
% 7.33/2.34  # Condensation successes               : 0
% 7.33/2.34  # Termbank termtop insertions          : 1791
% 7.33/2.34  
% 7.33/2.34  # -------------------------------------------------
% 7.33/2.34  # User time                : 0.009 s
% 7.33/2.34  # System time              : 0.003 s
% 7.33/2.34  # Total time               : 0.012 s
% 7.33/2.34  # ...preprocessing         : 0.010 s
% 7.33/2.34  # ...main loop             : 0.002 s
% 7.33/2.34  # Maximum resident set size: 7124 pages
% 7.33/2.34  
%------------------------------------------------------------------------------