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

View Problem - Process Solution

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

% Computer : n021.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:49:52 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_3619,plain,
    ( p__d__disjoint(X1,X2)
    | ~ p__d__disjointDecomposition3(X3,X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ijxcidpk/input.p',i_0_3619) ).

cnf(i_0_3548,plain,
    ( p__d__disjointDecomposition3(X1,X2,X3)
    | ~ p__d__partition3(X1,X2,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ijxcidpk/input.p',i_0_3548) ).

cnf(i_0_1033,plain,
    p__d__partition3(c__HumanLanguage,c__NaturalLanguage,c__ConstructedLanguage),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ijxcidpk/input.p',i_0_1033) ).

cnf(i_0_3534,plain,
    ( ~ p__d__instance(X1,X2)
    | ~ p__d__instance(X1,X3)
    | ~ p__d__disjoint(X3,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ijxcidpk/input.p',i_0_3534) ).

cnf(i_0_3,negated_conjecture,
    p__d__instance(esk1_0,c__ConstructedLanguage),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ijxcidpk/input.p',i_0_3) ).

cnf(i_0_1,negated_conjecture,
    esk2_0 = esk1_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ijxcidpk/input.p',i_0_1) ).

cnf(i_0_2,negated_conjecture,
    p__d__instance(esk2_0,c__NaturalLanguage),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ijxcidpk/input.p',i_0_2) ).

cnf(c_0_3627,plain,
    ( p__d__disjoint(X1,X2)
    | ~ p__d__disjointDecomposition3(X3,X1,X2) ),
    i_0_3619 ).

cnf(c_0_3628,plain,
    ( p__d__disjointDecomposition3(X1,X2,X3)
    | ~ p__d__partition3(X1,X2,X3) ),
    i_0_3548 ).

cnf(c_0_3629,plain,
    ( p__d__disjoint(X1,X2)
    | ~ p__d__partition3(X3,X1,X2) ),
    inference(spm,[status(thm)],[c_0_3627,c_0_3628]) ).

cnf(c_0_3630,plain,
    p__d__partition3(c__HumanLanguage,c__NaturalLanguage,c__ConstructedLanguage),
    i_0_1033 ).

cnf(c_0_3631,plain,
    ( ~ p__d__instance(X1,X2)
    | ~ p__d__instance(X1,X3)
    | ~ p__d__disjoint(X3,X2) ),
    i_0_3534 ).

cnf(c_0_3632,plain,
    p__d__disjoint(c__NaturalLanguage,c__ConstructedLanguage),
    inference(spm,[status(thm)],[c_0_3629,c_0_3630]) ).

cnf(c_0_3633,negated_conjecture,
    p__d__instance(esk1_0,c__ConstructedLanguage),
    i_0_3 ).

cnf(c_0_3634,negated_conjecture,
    esk2_0 = esk1_0,
    i_0_1 ).

cnf(c_0_3635,plain,
    ( ~ p__d__instance(X1,c__NaturalLanguage)
    | ~ p__d__instance(X1,c__ConstructedLanguage) ),
    inference(spm,[status(thm)],[c_0_3631,c_0_3632]) ).

cnf(c_0_3636,negated_conjecture,
    p__d__instance(esk2_0,c__ConstructedLanguage),
    inference(rw,[status(thm)],[c_0_3633,c_0_3634]) ).

cnf(c_0_3637,negated_conjecture,
    p__d__instance(esk2_0,c__NaturalLanguage),
    i_0_2 ).

cnf(c_0_3638,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3635,c_0_3636]),c_0_3637])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : CSR158+1 : TPTP v8.1.0. Released v7.3.0.
% 0.06/0.11  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.32  % Computer : n021.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 600
% 0.11/0.32  % DateTime : Sat Jun 11 01:55:57 EDT 2022
% 0.11/0.32  % CPUTime  : 
% 0.17/0.43  # ENIGMATIC: Selected SinE mode:
% 0.36/0.58  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.36/0.58  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.36/0.58  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.36/0.58  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 24.49/6.17  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 24.49/6.17  # Version: 2.1pre011
% 24.49/6.17  # Preprocessing time       : 0.102 s
% 24.49/6.17  
% 24.49/6.17  # Proof found!
% 24.49/6.17  # SZS status Theorem
% 24.49/6.17  # SZS output start CNFRefutation
% See solution above
% 24.49/6.17  # Proof object total steps             : 19
% 24.49/6.17  # Proof object clause steps            : 12
% 24.49/6.17  # Proof object formula steps           : 7
% 24.49/6.17  # Proof object conjectures             : 8
% 24.49/6.17  # Proof object clause conjectures      : 5
% 24.49/6.17  # Proof object formula conjectures     : 3
% 24.49/6.17  # Proof object initial clauses used    : 7
% 24.49/6.17  # Proof object initial formulas used   : 7
% 24.49/6.17  # Proof object generating inferences   : 4
% 24.49/6.17  # Proof object simplifying inferences  : 3
% 24.49/6.17  # Training examples: 0 positive, 0 negative
% 24.49/6.17  # Parsed axioms                        : 4390
% 24.49/6.17  # Removed by relevancy pruning/SinE    : 0
% 24.49/6.17  # Initial clauses                      : 4390
% 24.49/6.17  # Removed in clause preprocessing      : 0
% 24.49/6.17  # Initial clauses in saturation        : 4390
% 24.49/6.17  # Processed clauses                    : 5850
% 24.49/6.17  # ...of these trivial                  : 56
% 24.49/6.17  # ...subsumed                          : 115
% 24.49/6.17  # ...remaining for further processing  : 5679
% 24.49/6.17  # Other redundant clauses eliminated   : 44
% 24.49/6.17  # Clauses deleted for lack of memory   : 0
% 24.49/6.17  # Backward-subsumed                    : 0
% 24.49/6.17  # Backward-rewritten                   : 0
% 24.49/6.17  # Generated clauses                    : 23678
% 24.49/6.17  # ...of the previous two non-trivial   : 22804
% 24.49/6.17  # Contextual simplify-reflections      : 1634
% 24.49/6.17  # Paramodulations                      : 23595
% 24.49/6.17  # Factorizations                       : 0
% 24.49/6.17  # Equation resolutions                 : 83
% 24.49/6.17  # Propositional unsat checks           : 1
% 24.49/6.17  # Propositional unsat check successes  : 0
% 24.49/6.17  # Current number of processed clauses  : 5674
% 24.49/6.17  #    Positive orientable unit clauses  : 1397
% 24.49/6.17  #    Positive unorientable unit clauses: 0
% 24.49/6.17  #    Negative unit clauses             : 249
% 24.49/6.17  #    Non-unit-clauses                  : 4028
% 24.49/6.17  # Current number of unprocessed clauses: 21324
% 24.49/6.17  # ...number of literals in the above   : 88208
% 24.49/6.17  # Current number of archived formulas  : 0
% 24.49/6.17  # Current number of archived clauses   : 0
% 24.49/6.17  # Clause-clause subsumption calls (NU) : 5508428
% 24.49/6.17  # Rec. Clause-clause subsumption calls : 2492085
% 24.49/6.17  # Non-unit clause-clause subsumptions  : 1745
% 24.49/6.17  # Unit Clause-clause subsumption calls : 615785
% 24.49/6.17  # Rewrite failures with RHS unbound    : 0
% 24.49/6.17  # BW rewrite match attempts            : 0
% 24.49/6.17  # BW rewrite match successes           : 0
% 24.49/6.17  # Condensation attempts                : 0
% 24.49/6.17  # Condensation successes               : 0
% 24.49/6.17  # Termbank termtop insertions          : 530476
% 24.49/6.17  
% 24.49/6.17  # -------------------------------------------------
% 24.49/6.17  # User time                : 1.757 s
% 24.49/6.17  # System time              : 0.037 s
% 24.49/6.17  # Total time               : 1.794 s
% 24.49/6.17  # ...preprocessing         : 0.102 s
% 24.49/6.17  # ...main loop             : 1.692 s
% 24.49/6.17  # Maximum resident set size: 60652 pages
% 24.49/6.17  
%------------------------------------------------------------------------------