↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : NUM565+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n004.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 : Mon Jul 18 08:37:24 EDT 2022

% Result   : Theorem 8.76s 2.58s
% Output   : CNFRefutation 8.76s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   43 (  25 unt;   0 nHn;  43 RR)
%            Number of literals    :   84 (  31 equ;  43 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   7 con; 0-2 aty)
%            Number of variables   :   36 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_7,plain,
    ( aSet0(X1)
    | X1 != slcrc0 ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vm_8bgcw/input.p',i_0_7) ).

cnf(i_0_151,hypothesis,
    slbdtsldtrb0(xS,xK) = szDzozmdt0(xc),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vm_8bgcw/input.p',i_0_151) ).

cnf(i_0_157,hypothesis,
    xK = sz00,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vm_8bgcw/input.p',i_0_157) ).

cnf(i_0_68,plain,
    ( sbrdtbr0(X1) = sz00
    | X1 != slcrc0
    | ~ aSet0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vm_8bgcw/input.p',i_0_68) ).

cnf(i_0_106,plain,
    ( aSubsetOf0(X1,X2)
    | X3 != slbdtsldtrb0(X2,X4)
    | ~ aSet0(X2)
    | ~ aElementOf0(X1,X3)
    | ~ aElementOf0(X4,szNzAzT0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vm_8bgcw/input.p',i_0_106) ).

cnf(i_0_46,plain,
    aElementOf0(sz00,szNzAzT0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vm_8bgcw/input.p',i_0_46) ).

cnf(i_0_15,plain,
    ( aSet0(X1)
    | ~ aSet0(X2)
    | ~ aSubsetOf0(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vm_8bgcw/input.p',i_0_15) ).

cnf(i_0_149,hypothesis,
    aSubsetOf0(xS,szNzAzT0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vm_8bgcw/input.p',i_0_149) ).

cnf(i_0_45,plain,
    aSet0(szNzAzT0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vm_8bgcw/input.p',i_0_45) ).

cnf(i_0_105,plain,
    ( sbrdtbr0(X1) = X2
    | X3 != slbdtsldtrb0(X4,X2)
    | ~ aSet0(X4)
    | ~ aElementOf0(X1,X3)
    | ~ aElementOf0(X2,szNzAzT0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vm_8bgcw/input.p',i_0_105) ).

cnf(i_0_160,negated_conjecture,
    aElementOf0(esk22_0,slbdtsldtrb0(xS,sz00)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vm_8bgcw/input.p',i_0_160) ).

cnf(i_0_69,plain,
    ( X1 = slcrc0
    | sbrdtbr0(X1) != sz00
    | ~ aSet0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vm_8bgcw/input.p',i_0_69) ).

cnf(i_0_159,negated_conjecture,
    sdtlpdtrp0(xc,esk22_0) != sdtlpdtrp0(xc,slcrc0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vm_8bgcw/input.p',i_0_159) ).

cnf(c_0_174,plain,
    ( aSet0(X1)
    | X1 != slcrc0 ),
    i_0_7 ).

cnf(c_0_175,hypothesis,
    slbdtsldtrb0(xS,xK) = szDzozmdt0(xc),
    i_0_151 ).

cnf(c_0_176,hypothesis,
    xK = sz00,
    i_0_157 ).

cnf(c_0_177,plain,
    ( sbrdtbr0(X1) = sz00
    | X1 != slcrc0
    | ~ aSet0(X1) ),
    i_0_68 ).

cnf(c_0_178,plain,
    aSet0(slcrc0),
    inference(er,[status(thm)],[c_0_174]) ).

cnf(c_0_179,plain,
    ( aSubsetOf0(X1,X2)
    | X3 != slbdtsldtrb0(X2,X4)
    | ~ aSet0(X2)
    | ~ aElementOf0(X1,X3)
    | ~ aElementOf0(X4,szNzAzT0) ),
    i_0_106 ).

cnf(c_0_180,hypothesis,
    slbdtsldtrb0(xS,sz00) = szDzozmdt0(xc),
    inference(rw,[status(thm)],[c_0_175,c_0_176]) ).

cnf(c_0_181,plain,
    sz00 = sbrdtbr0(slcrc0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_177]),c_0_178])]) ).

cnf(c_0_182,plain,
    aElementOf0(sz00,szNzAzT0),
    i_0_46 ).

cnf(c_0_183,plain,
    ( aSet0(X1)
    | ~ aSet0(X2)
    | ~ aSubsetOf0(X1,X2) ),
    i_0_15 ).

cnf(c_0_184,hypothesis,
    aSubsetOf0(xS,szNzAzT0),
    i_0_149 ).

cnf(c_0_185,plain,
    aSet0(szNzAzT0),
    i_0_45 ).

cnf(c_0_186,plain,
    ( sbrdtbr0(X1) = X2
    | X3 != slbdtsldtrb0(X4,X2)
    | ~ aSet0(X4)
    | ~ aElementOf0(X1,X3)
    | ~ aElementOf0(X2,szNzAzT0) ),
    i_0_105 ).

cnf(c_0_187,plain,
    ( aSubsetOf0(X1,X2)
    | ~ aElementOf0(X1,slbdtsldtrb0(X2,X3))
    | ~ aElementOf0(X3,szNzAzT0)
    | ~ aSet0(X2) ),
    inference(er,[status(thm)],[c_0_179]) ).

cnf(c_0_188,hypothesis,
    slbdtsldtrb0(xS,sbrdtbr0(slcrc0)) = szDzozmdt0(xc),
    inference(rw,[status(thm)],[c_0_180,c_0_181]) ).

cnf(c_0_189,plain,
    aElementOf0(sbrdtbr0(slcrc0),szNzAzT0),
    inference(rw,[status(thm)],[c_0_182,c_0_181]) ).

cnf(c_0_190,hypothesis,
    aSet0(xS),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_183,c_0_184]),c_0_185])]) ).

cnf(c_0_191,plain,
    ( sbrdtbr0(X1) = X2
    | ~ aElementOf0(X1,slbdtsldtrb0(X3,X2))
    | ~ aElementOf0(X2,szNzAzT0)
    | ~ aSet0(X3) ),
    inference(er,[status(thm)],[c_0_186]) ).

cnf(c_0_192,negated_conjecture,
    aElementOf0(esk22_0,slbdtsldtrb0(xS,sz00)),
    i_0_160 ).

cnf(c_0_193,hypothesis,
    ( aSubsetOf0(X1,xS)
    | ~ aElementOf0(X1,szDzozmdt0(xc)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_187,c_0_188]),c_0_189]),c_0_190])]) ).

cnf(c_0_194,plain,
    ( X1 = slcrc0
    | sbrdtbr0(X1) != sz00
    | ~ aSet0(X1) ),
    i_0_69 ).

cnf(c_0_195,hypothesis,
    ( sbrdtbr0(X1) = sbrdtbr0(slcrc0)
    | ~ aElementOf0(X1,szDzozmdt0(xc)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_191,c_0_188]),c_0_189]),c_0_190])]) ).

cnf(c_0_196,negated_conjecture,
    aElementOf0(esk22_0,szDzozmdt0(xc)),
    inference(rw,[status(thm)],[c_0_192,c_0_180]) ).

cnf(c_0_197,plain,
    ( aSet0(X1)
    | ~ aElementOf0(X1,szDzozmdt0(xc)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_183,c_0_193]),c_0_190])]) ).

cnf(c_0_198,plain,
    ( X1 = slcrc0
    | sbrdtbr0(X1) != sbrdtbr0(slcrc0)
    | ~ aSet0(X1) ),
    inference(rw,[status(thm)],[c_0_194,c_0_181]) ).

cnf(c_0_199,negated_conjecture,
    sbrdtbr0(esk22_0) = sbrdtbr0(slcrc0),
    inference(spm,[status(thm)],[c_0_195,c_0_196]) ).

cnf(c_0_200,negated_conjecture,
    aSet0(esk22_0),
    inference(spm,[status(thm)],[c_0_197,c_0_196]) ).

cnf(c_0_201,negated_conjecture,
    sdtlpdtrp0(xc,esk22_0) != sdtlpdtrp0(xc,slcrc0),
    i_0_159 ).

cnf(c_0_202,plain,
    esk22_0 = slcrc0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_198,c_0_199]),c_0_200])]) ).

cnf(c_0_203,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_201,c_0_202])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : NUM565+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.35  % Computer : n004.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Wed Jul  6 05:53:39 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.47  # ENIGMATIC: Selected complete mode:
% 8.76/2.58  # ENIGMATIC: Solved by autoschedule:
% 8.76/2.58  # No SInE strategy applied
% 8.76/2.58  # Trying AutoSched0 for 150 seconds
% 8.76/2.58  # AutoSched0-Mode selected heuristic G_E___208_B07_F1_SE_CS_SP_PS_S0Y
% 8.76/2.58  # and selection function SelectMaxLComplexAvoidPosPred.
% 8.76/2.58  #
% 8.76/2.58  # Preprocessing time       : 0.015 s
% 8.76/2.58  # Presaturation interreduction done
% 8.76/2.58  
% 8.76/2.58  # Proof found!
% 8.76/2.58  # SZS status Theorem
% 8.76/2.58  # SZS output start CNFRefutation
% See solution above
% 8.76/2.58  # Training examples: 0 positive, 0 negative
% 8.76/2.58  
% 8.76/2.58  # -------------------------------------------------
% 8.76/2.58  # User time                : 0.033 s
% 8.76/2.58  # System time              : 0.010 s
% 8.76/2.58  # Total time               : 0.043 s
% 8.76/2.58  # Maximum resident set size: 7120 pages
% 8.76/2.58  
%------------------------------------------------------------------------------