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

View Problem - Process Solution

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

% Computer : n023.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 : Sun Jul 17 02:56:12 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_77,plain,
    ( status(X1,X2,thm)
    | ~ model(esk51_2(X1,X2),X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-af1iu26s/input.p',i_0_77) ).

cnf(i_0_72,plain,
    model(X1,esk48_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-af1iu26s/input.p',i_0_72) ).

cnf(i_0_29,plain,
    ( mighta(X1,X2)
    | ~ status(X3,X4,X2)
    | ~ status(X3,X4,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-af1iu26s/input.p',i_0_29) ).

cnf(i_0_81,plain,
    ( status(X1,X2,unp)
    | ~ model(X3,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-af1iu26s/input.p',i_0_81) ).

cnf(i_0_30,negated_conjecture,
    ~ mighta(unp,thm),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-af1iu26s/input.p',i_0_30) ).

cnf(c_0_87,plain,
    ( status(X1,X2,thm)
    | ~ model(esk51_2(X1,X2),X2) ),
    i_0_77 ).

cnf(c_0_88,plain,
    model(X1,esk48_0),
    i_0_72 ).

cnf(c_0_89,plain,
    ( mighta(X1,X2)
    | ~ status(X3,X4,X2)
    | ~ status(X3,X4,X1) ),
    i_0_29 ).

cnf(c_0_90,plain,
    status(X1,esk48_0,thm),
    inference(spm,[status(thm)],[c_0_87,c_0_88]) ).

cnf(c_0_91,plain,
    ( status(X1,X2,unp)
    | ~ model(X3,X1) ),
    i_0_81 ).

cnf(c_0_92,plain,
    ( mighta(X1,thm)
    | ~ status(X2,esk48_0,X1) ),
    inference(spm,[status(thm)],[c_0_89,c_0_90]) ).

cnf(c_0_93,plain,
    status(esk48_0,X1,unp),
    inference(spm,[status(thm)],[c_0_91,c_0_88]) ).

cnf(c_0_94,negated_conjecture,
    ~ mighta(unp,thm),
    i_0_30 ).

cnf(c_0_95,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_94]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : KRS254+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.00/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n023.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 : Tue Jun  7 14:58:25 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.43  # ENIGMATIC: Selected SinE mode:
% 0.18/0.44  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.44  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.18/0.44  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.18/0.44  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 4.34/2.20  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 4.34/2.20  # Version: 2.1pre011
% 4.34/2.20  # Preprocessing time       : 0.012 s
% 4.34/2.20  
% 4.34/2.20  # Proof found!
% 4.34/2.20  # SZS status Theorem
% 4.34/2.20  # SZS output start CNFRefutation
% See solution above
% 4.34/2.20  # Proof object total steps             : 14
% 4.34/2.20  # Proof object clause steps            : 9
% 4.34/2.20  # Proof object formula steps           : 5
% 4.34/2.20  # Proof object conjectures             : 2
% 4.34/2.20  # Proof object clause conjectures      : 1
% 4.34/2.20  # Proof object formula conjectures     : 1
% 4.34/2.20  # Proof object initial clauses used    : 5
% 4.34/2.20  # Proof object initial formulas used   : 5
% 4.34/2.20  # Proof object generating inferences   : 4
% 4.34/2.20  # Proof object simplifying inferences  : 1
% 4.34/2.20  # Training examples: 0 positive, 0 negative
% 4.34/2.20  # Parsed axioms                        : 109
% 4.34/2.20  # Removed by relevancy pruning/SinE    : 0
% 4.34/2.20  # Initial clauses                      : 109
% 4.34/2.20  # Removed in clause preprocessing      : 0
% 4.34/2.20  # Initial clauses in saturation        : 109
% 4.34/2.20  # Processed clauses                    : 206
% 4.34/2.20  # ...of these trivial                  : 10
% 4.34/2.20  # ...subsumed                          : 4
% 4.34/2.20  # ...remaining for further processing  : 192
% 4.34/2.20  # Other redundant clauses eliminated   : 0
% 4.34/2.20  # Clauses deleted for lack of memory   : 0
% 4.34/2.20  # Backward-subsumed                    : 0
% 4.34/2.20  # Backward-rewritten                   : 0
% 4.34/2.20  # Generated clauses                    : 1654
% 4.34/2.20  # ...of the previous two non-trivial   : 1617
% 4.34/2.20  # Contextual simplify-reflections      : 0
% 4.34/2.20  # Paramodulations                      : 1654
% 4.34/2.20  # Factorizations                       : 0
% 4.34/2.20  # Equation resolutions                 : 0
% 4.34/2.20  # Propositional unsat checks           : 0
% 4.34/2.20  # Propositional unsat check successes  : 0
% 4.34/2.20  # Current number of processed clauses  : 192
% 4.34/2.20  #    Positive orientable unit clauses  : 50
% 4.34/2.20  #    Positive unorientable unit clauses: 0
% 4.34/2.20  #    Negative unit clauses             : 26
% 4.34/2.20  #    Non-unit-clauses                  : 116
% 4.34/2.20  # Current number of unprocessed clauses: 1517
% 4.34/2.20  # ...number of literals in the above   : 4053
% 4.34/2.20  # Current number of archived formulas  : 0
% 4.34/2.20  # Current number of archived clauses   : 0
% 4.34/2.20  # Clause-clause subsumption calls (NU) : 2449
% 4.34/2.20  # Rec. Clause-clause subsumption calls : 1419
% 4.34/2.20  # Non-unit clause-clause subsumptions  : 2
% 4.34/2.20  # Unit Clause-clause subsumption calls : 1381
% 4.34/2.20  # Rewrite failures with RHS unbound    : 0
% 4.34/2.20  # BW rewrite match attempts            : 42
% 4.34/2.20  # BW rewrite match successes           : 0
% 4.34/2.20  # Condensation attempts                : 0
% 4.34/2.20  # Condensation successes               : 0
% 4.34/2.20  # Termbank termtop insertions          : 18436
% 4.34/2.20  
% 4.34/2.20  # -------------------------------------------------
% 4.34/2.20  # User time                : 0.023 s
% 4.34/2.20  # System time              : 0.004 s
% 4.34/2.20  # Total time               : 0.027 s
% 4.34/2.20  # ...preprocessing         : 0.012 s
% 4.34/2.20  # ...main loop             : 0.016 s
% 4.34/2.20  # Maximum resident set size: 7136 pages
% 4.34/2.20  
%------------------------------------------------------------------------------