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

View Problem - Process Solution

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

% Computer : n024.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:30 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_6,plain,
    ( X1 != X2
    | ~ between_c(X3,X1,X4,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qp18xajs/input.p',i_0_6) ).

cnf(i_0_57,plain,
    ( between_c(esk14_4(X1,X2,X3,X4),X1,X2,X3)
    | ~ between_o(X4,X1,X2,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qp18xajs/input.p',i_0_57) ).

cnf(i_0_7,plain,
    ( between_o(X1,X2,X3,X4)
    | ~ ordered_by(X1,X3,X2)
    | ~ ordered_by(X1,X4,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qp18xajs/input.p',i_0_7) ).

cnf(i_0_82,negated_conjecture,
    ordered_by(esk24_0,esk26_0,esk25_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qp18xajs/input.p',i_0_82) ).

cnf(i_0_83,negated_conjecture,
    ordered_by(esk24_0,esk25_0,esk26_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qp18xajs/input.p',i_0_83) ).

cnf(c_0_89,plain,
    ( X1 != X2
    | ~ between_c(X3,X1,X4,X2) ),
    i_0_6 ).

cnf(c_0_90,plain,
    ~ between_c(X1,X2,X3,X2),
    inference(er,[status(thm)],[c_0_89]) ).

cnf(c_0_91,plain,
    ( between_c(esk14_4(X1,X2,X3,X4),X1,X2,X3)
    | ~ between_o(X4,X1,X2,X3) ),
    i_0_57 ).

cnf(c_0_92,plain,
    ~ between_o(X1,X2,X3,X2),
    inference(spm,[status(thm)],[c_0_90,c_0_91]) ).

cnf(c_0_93,plain,
    ( between_o(X1,X2,X3,X4)
    | ~ ordered_by(X1,X3,X2)
    | ~ ordered_by(X1,X4,X3) ),
    i_0_7 ).

cnf(c_0_94,plain,
    ( ~ ordered_by(X1,X2,X3)
    | ~ ordered_by(X1,X3,X2) ),
    inference(spm,[status(thm)],[c_0_92,c_0_93]) ).

cnf(c_0_95,negated_conjecture,
    ordered_by(esk24_0,esk26_0,esk25_0),
    i_0_82 ).

cnf(c_0_96,negated_conjecture,
    ordered_by(esk24_0,esk25_0,esk26_0),
    i_0_83 ).

cnf(c_0_97,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_96])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GEO118+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n024.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sat Jun 18 03:19:04 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.20/0.45  # ENIGMATIC: Selected SinE mode:
% 0.20/0.46  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.20/0.46  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.20/0.46  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 7.99/2.53  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.99/2.53  # Version: 2.1pre011
% 7.99/2.53  # Preprocessing time       : 0.019 s
% 7.99/2.53  
% 7.99/2.53  # Proof found!
% 7.99/2.53  # SZS status Theorem
% 7.99/2.53  # SZS output start CNFRefutation
% See solution above
% 7.99/2.53  # Proof object total steps             : 14
% 7.99/2.53  # Proof object clause steps            : 9
% 7.99/2.53  # Proof object formula steps           : 5
% 7.99/2.53  # Proof object conjectures             : 5
% 7.99/2.53  # Proof object clause conjectures      : 3
% 7.99/2.53  # Proof object formula conjectures     : 2
% 7.99/2.53  # Proof object initial clauses used    : 5
% 7.99/2.53  # Proof object initial formulas used   : 5
% 7.99/2.53  # Proof object generating inferences   : 3
% 7.99/2.53  # Proof object simplifying inferences  : 3
% 7.99/2.53  # Training examples: 0 positive, 0 negative
% 7.99/2.53  # Parsed axioms                        : 87
% 7.99/2.53  # Removed by relevancy pruning/SinE    : 0
% 7.99/2.53  # Initial clauses                      : 87
% 7.99/2.53  # Removed in clause preprocessing      : 0
% 7.99/2.53  # Initial clauses in saturation        : 87
% 7.99/2.53  # Processed clauses                    : 97
% 7.99/2.53  # ...of these trivial                  : 0
% 7.99/2.53  # ...subsumed                          : 1
% 7.99/2.53  # ...remaining for further processing  : 96
% 7.99/2.53  # Other redundant clauses eliminated   : 4
% 7.99/2.53  # Clauses deleted for lack of memory   : 0
% 7.99/2.53  # Backward-subsumed                    : 0
% 7.99/2.53  # Backward-rewritten                   : 0
% 7.99/2.53  # Generated clauses                    : 172
% 7.99/2.53  # ...of the previous two non-trivial   : 140
% 7.99/2.53  # Contextual simplify-reflections      : 2
% 7.99/2.53  # Paramodulations                      : 155
% 7.99/2.53  # Factorizations                       : 10
% 7.99/2.53  # Equation resolutions                 : 7
% 7.99/2.53  # Propositional unsat checks           : 0
% 7.99/2.53  # Propositional unsat check successes  : 0
% 7.99/2.53  # Current number of processed clauses  : 95
% 7.99/2.53  #    Positive orientable unit clauses  : 8
% 7.99/2.53  #    Positive unorientable unit clauses: 0
% 7.99/2.53  #    Negative unit clauses             : 3
% 7.99/2.53  #    Non-unit-clauses                  : 84
% 7.99/2.53  # Current number of unprocessed clauses: 129
% 7.99/2.53  # ...number of literals in the above   : 574
% 7.99/2.53  # Current number of archived formulas  : 0
% 7.99/2.53  # Current number of archived clauses   : 0
% 7.99/2.53  # Clause-clause subsumption calls (NU) : 1451
% 7.99/2.53  # Rec. Clause-clause subsumption calls : 560
% 7.99/2.53  # Non-unit clause-clause subsumptions  : 3
% 7.99/2.53  # Unit Clause-clause subsumption calls : 204
% 7.99/2.53  # Rewrite failures with RHS unbound    : 0
% 7.99/2.53  # BW rewrite match attempts            : 0
% 7.99/2.53  # BW rewrite match successes           : 0
% 7.99/2.53  # Condensation attempts                : 0
% 7.99/2.53  # Condensation successes               : 0
% 7.99/2.53  # Termbank termtop insertions          : 4083
% 7.99/2.53  
% 7.99/2.53  # -------------------------------------------------
% 7.99/2.53  # User time                : 0.024 s
% 7.99/2.53  # System time              : 0.002 s
% 7.99/2.53  # Total time               : 0.026 s
% 7.99/2.53  # ...preprocessing         : 0.019 s
% 7.99/2.53  # ...main loop             : 0.007 s
% 7.99/2.53  # Maximum resident set size: 7124 pages
% 7.99/2.53  
%------------------------------------------------------------------------------