TSTP Solution File: CSR004+2 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : CSR004+2 : TPTP v8.1.0. Bugfixed v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n032.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 : Fri Jul 15 02:46:30 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_62,negated_conjecture,
    ~ happens(overflow,n3),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tkclxgru/input.p',i_0_62) ).

cnf(i_0_9,plain,
    ( happens(X1,X2)
    | X1 != overflow
    | ~ holdsAt(filling,X2)
    | ~ holdsAt(waterLevel(n3),X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tkclxgru/input.p',i_0_9) ).

cnf(i_0_99,lemma,
    holdsAt(waterLevel(n3),n3),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tkclxgru/input.p',i_0_99) ).

cnf(i_0_6,lemma,
    holdsAt(filling,n3),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tkclxgru/input.p',i_0_6) ).

cnf(c_0_104,negated_conjecture,
    ~ happens(overflow,n3),
    i_0_62 ).

cnf(c_0_105,plain,
    ( happens(X1,X2)
    | X1 != overflow
    | ~ holdsAt(filling,X2)
    | ~ holdsAt(waterLevel(n3),X2) ),
    i_0_9 ).

cnf(c_0_106,lemma,
    holdsAt(waterLevel(n3),n3),
    i_0_99 ).

cnf(c_0_107,lemma,
    holdsAt(filling,n3),
    i_0_6 ).

cnf(c_0_108,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_105]),c_0_106]),c_0_107])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10  % Problem  : CSR004+2 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.03/0.11  % Command  : enigmatic-eprover.py %s %d 1
% 0.10/0.30  % Computer : n032.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit : 300
% 0.10/0.30  % WCLimit  : 600
% 0.10/0.30  % DateTime : Sat Jun 11 12:34:41 EDT 2022
% 0.10/0.30  % CPUTime  : 
% 0.15/0.38  # ENIGMATIC: Selected SinE mode:
% 0.15/0.39  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.39  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.15/0.39  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.15/0.39  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 7.11/2.19  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.11/2.19  # Version: 2.1pre011
% 7.11/2.19  # Preprocessing time       : 0.012 s
% 7.11/2.19  
% 7.11/2.19  # Proof found!
% 7.11/2.19  # SZS status Theorem
% 7.11/2.19  # SZS output start CNFRefutation
% See solution above
% 7.11/2.19  # Proof object total steps             : 9
% 7.11/2.19  # Proof object clause steps            : 5
% 7.11/2.19  # Proof object formula steps           : 4
% 7.11/2.19  # Proof object conjectures             : 3
% 7.11/2.19  # Proof object clause conjectures      : 2
% 7.11/2.19  # Proof object formula conjectures     : 1
% 7.11/2.19  # Proof object initial clauses used    : 4
% 7.11/2.19  # Proof object initial formulas used   : 4
% 7.11/2.19  # Proof object generating inferences   : 1
% 7.11/2.19  # Proof object simplifying inferences  : 3
% 7.11/2.19  # Training examples: 0 positive, 0 negative
% 7.11/2.19  # Parsed axioms                        : 138
% 7.11/2.19  # Removed by relevancy pruning/SinE    : 0
% 7.11/2.19  # Initial clauses                      : 138
% 7.11/2.19  # Removed in clause preprocessing      : 0
% 7.11/2.19  # Initial clauses in saturation        : 138
% 7.11/2.19  # Processed clauses                    : 49
% 7.11/2.19  # ...of these trivial                  : 0
% 7.11/2.19  # ...subsumed                          : 0
% 7.11/2.19  # ...remaining for further processing  : 49
% 7.11/2.19  # Other redundant clauses eliminated   : 2
% 7.11/2.19  # Clauses deleted for lack of memory   : 0
% 7.11/2.19  # Backward-subsumed                    : 0
% 7.11/2.19  # Backward-rewritten                   : 2
% 7.11/2.19  # Generated clauses                    : 37
% 7.11/2.19  # ...of the previous two non-trivial   : 19
% 7.11/2.19  # Contextual simplify-reflections      : 0
% 7.11/2.19  # Paramodulations                      : 32
% 7.11/2.19  # Factorizations                       : 2
% 7.11/2.19  # Equation resolutions                 : 3
% 7.11/2.19  # Propositional unsat checks           : 0
% 7.11/2.19  # Propositional unsat check successes  : 0
% 7.11/2.19  # Current number of processed clauses  : 45
% 7.11/2.19  #    Positive orientable unit clauses  : 11
% 7.11/2.19  #    Positive unorientable unit clauses: 1
% 7.11/2.19  #    Negative unit clauses             : 13
% 7.11/2.19  #    Non-unit-clauses                  : 20
% 7.11/2.19  # Current number of unprocessed clauses: 107
% 7.11/2.19  # ...number of literals in the above   : 364
% 7.11/2.19  # Current number of archived formulas  : 0
% 7.11/2.19  # Current number of archived clauses   : 2
% 7.11/2.19  # Clause-clause subsumption calls (NU) : 68
% 7.11/2.19  # Rec. Clause-clause subsumption calls : 33
% 7.11/2.19  # Non-unit clause-clause subsumptions  : 0
% 7.11/2.19  # Unit Clause-clause subsumption calls : 20
% 7.11/2.19  # Rewrite failures with RHS unbound    : 0
% 7.11/2.19  # BW rewrite match attempts            : 22
% 7.11/2.19  # BW rewrite match successes           : 22
% 7.11/2.19  # Condensation attempts                : 0
% 7.11/2.19  # Condensation successes               : 0
% 7.11/2.19  # Termbank termtop insertions          : 2862
% 7.11/2.19  
% 7.11/2.19  # -------------------------------------------------
% 7.11/2.19  # User time                : 0.010 s
% 7.11/2.19  # System time              : 0.003 s
% 7.11/2.19  # Total time               : 0.013 s
% 7.11/2.19  # ...preprocessing         : 0.012 s
% 7.11/2.19  # ...main loop             : 0.001 s
% 7.11/2.19  # Maximum resident set size: 7136 pages
% 7.11/2.19  
%------------------------------------------------------------------------------