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

View Problem - Process Solution

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

% Computer : n014.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 01:07:27 EDT 2022

% Result   : Theorem 8.19s 2.64s
% Output   : CNFRefutation 8.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   40 (  19 unt;   6 nHn;  34 RR)
%            Number of literals    :   83 (  43 equ;  37 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :   20 (  20 usr;   7 con; 0-3 aty)
%            Number of variables   :   93 (  32 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_144,plain,
    ( vvar(esk24_3(X1,X2,X3)) = X1
    | vapp(esk29_3(X1,X2,X3),esk30_3(X1,X2,X3)) = X1
    | vabs(esk25_3(X1,X2,X3),esk27_3(X1,X2,X3),esk26_3(X1,X2,X3)) = X1
    | ~ vtcheck(X3,X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-frns8pid/input.p',i_0_144) ).

cnf(i_0_147,negated_conjecture,
    vtcheck(esk34_0,vapp(ve1app,ve2app),esk35_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-frns8pid/input.p',i_0_147) ).

cnf(i_0_1,plain,
    vabs(X1,X2,X3) != vapp(X4,X5),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-frns8pid/input.p',i_0_1) ).

cnf(i_0_6,plain,
    vvar(X1) != vapp(X2,X3),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-frns8pid/input.p',i_0_6) ).

cnf(i_0_12,plain,
    ( X1 = X2
    | vapp(X3,X1) != vapp(X4,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-frns8pid/input.p',i_0_12) ).

cnf(i_0_13,plain,
    ( X1 = X2
    | vapp(X1,X3) != vapp(X2,X4) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-frns8pid/input.p',i_0_13) ).

cnf(i_0_124,plain,
    ( vtcheck(X1,vapp(X2,X3),X4)
    | ~ vtcheck(X1,X3,X5)
    | ~ vtcheck(X1,X2,varrow(X5,X4)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-frns8pid/input.p',i_0_124) ).

cnf(i_0_149,plain,
    ( vtcheck(vbind(X1,X2,X3),ve1app,X4)
    | vlookup(X1,X3) != vnoType
    | ~ vtcheck(X3,ve1app,X4) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-frns8pid/input.p',i_0_149) ).

cnf(i_0_143,plain,
    ( vvar(esk24_3(X1,X2,X3)) = X1
    | vabs(esk25_3(X1,X2,X3),esk27_3(X1,X2,X3),esk26_3(X1,X2,X3)) = X1
    | vtcheck(X3,esk29_3(X1,X2,X3),varrow(esk31_3(X1,X2,X3),X2))
    | ~ vtcheck(X3,X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-frns8pid/input.p',i_0_143) ).

cnf(i_0_142,plain,
    ( vvar(esk24_3(X1,X2,X3)) = X1
    | vabs(esk25_3(X1,X2,X3),esk27_3(X1,X2,X3),esk26_3(X1,X2,X3)) = X1
    | vtcheck(X3,esk30_3(X1,X2,X3),esk31_3(X1,X2,X3))
    | ~ vtcheck(X3,X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-frns8pid/input.p',i_0_142) ).

cnf(i_0_150,plain,
    ( vtcheck(vbind(X1,X2,X3),ve2app,X4)
    | vlookup(X1,X3) != vnoType
    | ~ vtcheck(X3,ve2app,X4) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-frns8pid/input.p',i_0_150) ).

cnf(i_0_146,negated_conjecture,
    ~ vtcheck(vbind(esk32_0,esk33_0,esk34_0),vapp(ve1app,ve2app),esk35_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-frns8pid/input.p',i_0_146) ).

cnf(i_0_148,negated_conjecture,
    vlookup(esk32_0,esk34_0) = vnoType,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-frns8pid/input.p',i_0_148) ).

cnf(c_0_164,plain,
    ( vvar(esk24_3(X1,X2,X3)) = X1
    | vapp(esk29_3(X1,X2,X3),esk30_3(X1,X2,X3)) = X1
    | vabs(esk25_3(X1,X2,X3),esk27_3(X1,X2,X3),esk26_3(X1,X2,X3)) = X1
    | ~ vtcheck(X3,X1,X2) ),
    i_0_144 ).

cnf(c_0_165,negated_conjecture,
    vtcheck(esk34_0,vapp(ve1app,ve2app),esk35_0),
    i_0_147 ).

cnf(c_0_166,plain,
    vabs(X1,X2,X3) != vapp(X4,X5),
    i_0_1 ).

cnf(c_0_167,plain,
    vvar(X1) != vapp(X2,X3),
    i_0_6 ).

cnf(c_0_168,plain,
    ( X1 = X2
    | vapp(X3,X1) != vapp(X4,X2) ),
    i_0_12 ).

cnf(c_0_169,negated_conjecture,
    vapp(esk29_3(vapp(ve1app,ve2app),esk35_0,esk34_0),esk30_3(vapp(ve1app,ve2app),esk35_0,esk34_0)) = vapp(ve1app,ve2app),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_164,c_0_165]),c_0_166]),c_0_167]) ).

cnf(c_0_170,plain,
    ( esk30_3(vapp(ve1app,ve2app),esk35_0,esk34_0) = X1
    | vapp(ve1app,ve2app) != vapp(X2,X1) ),
    inference(spm,[status(thm)],[c_0_168,c_0_169]) ).

cnf(c_0_171,plain,
    esk30_3(vapp(ve1app,ve2app),esk35_0,esk34_0) = ve2app,
    inference(er,[status(thm)],[c_0_170]) ).

cnf(c_0_172,plain,
    ( X1 = X2
    | vapp(X1,X3) != vapp(X2,X4) ),
    i_0_13 ).

cnf(c_0_173,negated_conjecture,
    vapp(esk29_3(vapp(ve1app,ve2app),esk35_0,esk34_0),ve2app) = vapp(ve1app,ve2app),
    inference(rw,[status(thm)],[c_0_169,c_0_171]) ).

cnf(c_0_174,plain,
    ( vtcheck(X1,vapp(X2,X3),X4)
    | ~ vtcheck(X1,X3,X5)
    | ~ vtcheck(X1,X2,varrow(X5,X4)) ),
    i_0_124 ).

cnf(c_0_175,plain,
    ( vtcheck(vbind(X1,X2,X3),ve1app,X4)
    | vlookup(X1,X3) != vnoType
    | ~ vtcheck(X3,ve1app,X4) ),
    i_0_149 ).

cnf(c_0_176,plain,
    ( vvar(esk24_3(X1,X2,X3)) = X1
    | vabs(esk25_3(X1,X2,X3),esk27_3(X1,X2,X3),esk26_3(X1,X2,X3)) = X1
    | vtcheck(X3,esk29_3(X1,X2,X3),varrow(esk31_3(X1,X2,X3),X2))
    | ~ vtcheck(X3,X1,X2) ),
    i_0_143 ).

cnf(c_0_177,plain,
    ( esk29_3(vapp(ve1app,ve2app),esk35_0,esk34_0) = X1
    | vapp(ve1app,ve2app) != vapp(X1,X2) ),
    inference(spm,[status(thm)],[c_0_172,c_0_173]) ).

cnf(c_0_178,plain,
    ( vvar(esk24_3(X1,X2,X3)) = X1
    | vabs(esk25_3(X1,X2,X3),esk27_3(X1,X2,X3),esk26_3(X1,X2,X3)) = X1
    | vtcheck(X3,esk30_3(X1,X2,X3),esk31_3(X1,X2,X3))
    | ~ vtcheck(X3,X1,X2) ),
    i_0_142 ).

cnf(c_0_179,plain,
    ( vtcheck(vbind(X1,X2,X3),vapp(ve1app,X4),X5)
    | vlookup(X1,X3) != vnoType
    | ~ vtcheck(vbind(X1,X2,X3),X4,X6)
    | ~ vtcheck(X3,ve1app,varrow(X6,X5)) ),
    inference(spm,[status(thm)],[c_0_174,c_0_175]) ).

cnf(c_0_180,plain,
    ( vtcheck(vbind(X1,X2,X3),ve2app,X4)
    | vlookup(X1,X3) != vnoType
    | ~ vtcheck(X3,ve2app,X4) ),
    i_0_150 ).

cnf(c_0_181,negated_conjecture,
    vtcheck(esk34_0,esk29_3(vapp(ve1app,ve2app),esk35_0,esk34_0),varrow(esk31_3(vapp(ve1app,ve2app),esk35_0,esk34_0),esk35_0)),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_176,c_0_165]),c_0_166]),c_0_167]) ).

cnf(c_0_182,plain,
    esk29_3(vapp(ve1app,ve2app),esk35_0,esk34_0) = ve1app,
    inference(er,[status(thm)],[c_0_177]) ).

cnf(c_0_183,negated_conjecture,
    vtcheck(esk34_0,esk30_3(vapp(ve1app,ve2app),esk35_0,esk34_0),esk31_3(vapp(ve1app,ve2app),esk35_0,esk34_0)),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_178,c_0_165]),c_0_166]),c_0_167]) ).

cnf(c_0_184,plain,
    ( vtcheck(vbind(X1,X2,X3),vapp(ve1app,ve2app),X4)
    | vlookup(X1,X3) != vnoType
    | ~ vtcheck(X3,ve1app,varrow(X5,X4))
    | ~ vtcheck(X3,ve2app,X5) ),
    inference(spm,[status(thm)],[c_0_179,c_0_180]) ).

cnf(c_0_185,negated_conjecture,
    vtcheck(esk34_0,ve1app,varrow(esk31_3(vapp(ve1app,ve2app),esk35_0,esk34_0),esk35_0)),
    inference(rw,[status(thm)],[c_0_181,c_0_182]) ).

cnf(c_0_186,negated_conjecture,
    vtcheck(esk34_0,ve2app,esk31_3(vapp(ve1app,ve2app),esk35_0,esk34_0)),
    inference(rw,[status(thm)],[c_0_183,c_0_171]) ).

cnf(c_0_187,negated_conjecture,
    ~ vtcheck(vbind(esk32_0,esk33_0,esk34_0),vapp(ve1app,ve2app),esk35_0),
    i_0_146 ).

cnf(c_0_188,plain,
    ( vtcheck(vbind(X1,X2,esk34_0),vapp(ve1app,ve2app),esk35_0)
    | vlookup(X1,esk34_0) != vnoType ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_184,c_0_185]),c_0_186])]) ).

cnf(c_0_189,negated_conjecture,
    vlookup(esk32_0,esk34_0) = vnoType,
    i_0_148 ).

cnf(c_0_190,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_187,c_0_188]),c_0_189])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : COM142+1 : TPTP v8.1.0. Released v6.4.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n014.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Thu Jun 16 19:04:07 EDT 2022
% 0.13/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
% 8.19/2.64  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 8.19/2.64  # Version: 2.1pre011
% 8.19/2.64  # Preprocessing time       : 0.035 s
% 8.19/2.64  
% 8.19/2.64  # Proof found!
% 8.19/2.64  # SZS status Theorem
% 8.19/2.64  # SZS output start CNFRefutation
% See solution above
% 8.19/2.64  # Proof object total steps             : 40
% 8.19/2.64  # Proof object clause steps            : 27
% 8.19/2.64  # Proof object formula steps           : 13
% 8.19/2.64  # Proof object conjectures             : 13
% 8.19/2.64  # Proof object clause conjectures      : 10
% 8.19/2.64  # Proof object formula conjectures     : 3
% 8.19/2.64  # Proof object initial clauses used    : 13
% 8.19/2.64  # Proof object initial formulas used   : 13
% 8.19/2.64  # Proof object generating inferences   : 11
% 8.19/2.64  # Proof object simplifying inferences  : 13
% 8.19/2.64  # Training examples: 0 positive, 0 negative
% 8.19/2.64  # Parsed axioms                        : 410
% 8.19/2.64  # Removed by relevancy pruning/SinE    : 0
% 8.19/2.64  # Initial clauses                      : 410
% 8.19/2.64  # Removed in clause preprocessing      : 0
% 8.19/2.64  # Initial clauses in saturation        : 410
% 8.19/2.64  # Processed clauses                    : 525
% 8.19/2.64  # ...of these trivial                  : 16
% 8.19/2.64  # ...subsumed                          : 64
% 8.19/2.64  # ...remaining for further processing  : 445
% 8.19/2.64  # Other redundant clauses eliminated   : 44
% 8.19/2.64  # Clauses deleted for lack of memory   : 0
% 8.19/2.64  # Backward-subsumed                    : 0
% 8.19/2.64  # Backward-rewritten                   : 9
% 8.19/2.64  # Generated clauses                    : 650
% 8.19/2.64  # ...of the previous two non-trivial   : 576
% 8.19/2.64  # Contextual simplify-reflections      : 40
% 8.19/2.64  # Paramodulations                      : 488
% 8.19/2.64  # Factorizations                       : 19
% 8.19/2.64  # Equation resolutions                 : 154
% 8.19/2.64  # Propositional unsat checks           : 0
% 8.19/2.64  # Propositional unsat check successes  : 0
% 8.19/2.64  # Current number of processed clauses  : 418
% 8.19/2.64  #    Positive orientable unit clauses  : 9
% 8.19/2.64  #    Positive unorientable unit clauses: 0
% 8.19/2.64  #    Negative unit clauses             : 11
% 8.19/2.64  #    Non-unit-clauses                  : 398
% 8.19/2.64  # Current number of unprocessed clauses: 386
% 8.19/2.64  # ...number of literals in the above   : 1488
% 8.19/2.64  # Current number of archived formulas  : 0
% 8.19/2.64  # Current number of archived clauses   : 9
% 8.19/2.64  # Clause-clause subsumption calls (NU) : 50575
% 8.19/2.64  # Rec. Clause-clause subsumption calls : 12089
% 8.19/2.64  # Non-unit clause-clause subsumptions  : 93
% 8.19/2.64  # Unit Clause-clause subsumption calls : 1558
% 8.19/2.64  # Rewrite failures with RHS unbound    : 0
% 8.19/2.64  # BW rewrite match attempts            : 2
% 8.19/2.64  # BW rewrite match successes           : 2
% 8.19/2.64  # Condensation attempts                : 0
% 8.19/2.64  # Condensation successes               : 0
% 8.19/2.64  # Termbank termtop insertions          : 39979
% 8.19/2.64  
% 8.19/2.64  # -------------------------------------------------
% 8.19/2.64  # User time                : 0.072 s
% 8.19/2.64  # System time              : 0.007 s
% 8.19/2.64  # Total time               : 0.079 s
% 8.19/2.64  # ...preprocessing         : 0.035 s
% 8.19/2.64  # ...main loop             : 0.044 s
% 8.19/2.64  # Maximum resident set size: 7132 pages
% 8.19/2.64  
%------------------------------------------------------------------------------