↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n028.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 20:25:02 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_90,plain,
    ( sdtasdt0(X1,esk18_3(X1,X2,X3)) = X3
    | X2 != slsdtgt0(X1)
    | ~ aElement0(X1)
    | ~ aElementOf0(X3,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d5q3nryn/input.p',i_0_90) ).

cnf(i_0_91,plain,
    ( aElement0(esk18_3(X1,X2,X3))
    | X2 != slsdtgt0(X1)
    | ~ aElement0(X1)
    | ~ aElementOf0(X3,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d5q3nryn/input.p',i_0_91) ).

cnf(i_0_111,hypothesis,
    aElementOf0(xl,slsdtgt0(xb)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d5q3nryn/input.p',i_0_111) ).

cnf(i_0_94,hypothesis,
    aElement0(xb),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d5q3nryn/input.p',i_0_94) ).

cnf(i_0_113,negated_conjecture,
    ( sdtpldt0(sdtasdt0(xa,X1),sdtasdt0(xb,X2)) != xu
    | ~ aElement0(X2)
    | ~ aElement0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d5q3nryn/input.p',i_0_113) ).

cnf(i_0_112,hypothesis,
    aElementOf0(xk,slsdtgt0(xa)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d5q3nryn/input.p',i_0_112) ).

cnf(i_0_95,hypothesis,
    aElement0(xa),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d5q3nryn/input.p',i_0_95) ).

cnf(i_0_110,hypothesis,
    sdtpldt0(xk,xl) = xu,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d5q3nryn/input.p',i_0_110) ).

cnf(c_0_122,plain,
    ( sdtasdt0(X1,esk18_3(X1,X2,X3)) = X3
    | X2 != slsdtgt0(X1)
    | ~ aElement0(X1)
    | ~ aElementOf0(X3,X2) ),
    i_0_90 ).

cnf(c_0_123,plain,
    ( aElement0(esk18_3(X1,X2,X3))
    | X2 != slsdtgt0(X1)
    | ~ aElement0(X1)
    | ~ aElementOf0(X3,X2) ),
    i_0_91 ).

cnf(c_0_124,plain,
    ( sdtasdt0(X1,esk18_3(X1,slsdtgt0(X1),X2)) = X2
    | ~ aElementOf0(X2,slsdtgt0(X1))
    | ~ aElement0(X1) ),
    inference(er,[status(thm)],[c_0_122]) ).

cnf(c_0_125,hypothesis,
    aElementOf0(xl,slsdtgt0(xb)),
    i_0_111 ).

cnf(c_0_126,hypothesis,
    aElement0(xb),
    i_0_94 ).

cnf(c_0_127,plain,
    ( aElement0(esk18_3(X1,slsdtgt0(X1),X2))
    | ~ aElementOf0(X2,slsdtgt0(X1))
    | ~ aElement0(X1) ),
    inference(er,[status(thm)],[c_0_123]) ).

cnf(c_0_128,negated_conjecture,
    ( sdtpldt0(sdtasdt0(xa,X1),sdtasdt0(xb,X2)) != xu
    | ~ aElement0(X2)
    | ~ aElement0(X1) ),
    i_0_113 ).

cnf(c_0_129,hypothesis,
    sdtasdt0(xb,esk18_3(xb,slsdtgt0(xb),xl)) = xl,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_125]),c_0_126])]) ).

cnf(c_0_130,hypothesis,
    aElement0(esk18_3(xb,slsdtgt0(xb),xl)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_127,c_0_125]),c_0_126])]) ).

cnf(c_0_131,hypothesis,
    aElementOf0(xk,slsdtgt0(xa)),
    i_0_112 ).

cnf(c_0_132,hypothesis,
    aElement0(xa),
    i_0_95 ).

cnf(c_0_133,negated_conjecture,
    ( sdtpldt0(sdtasdt0(xa,X1),xl) != xu
    | ~ aElement0(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_128,c_0_129]),c_0_130])]) ).

cnf(c_0_134,hypothesis,
    sdtasdt0(xa,esk18_3(xa,slsdtgt0(xa),xk)) = xk,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_131]),c_0_132])]) ).

cnf(c_0_135,hypothesis,
    sdtpldt0(xk,xl) = xu,
    i_0_110 ).

cnf(c_0_136,hypothesis,
    aElement0(esk18_3(xa,slsdtgt0(xa),xk)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_127,c_0_131]),c_0_132])]) ).

cnf(c_0_137,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_133,c_0_134]),c_0_135]),c_0_136])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : RNG116+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n028.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 : Mon May 30 13:00:36 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 7.85/2.45  # ENIGMATIC: Solved by autoschedule:
% 7.85/2.45  # No SInE strategy applied
% 7.85/2.45  # Trying AutoSched0 for 150 seconds
% 7.85/2.45  # AutoSched0-Mode selected heuristic G_E___208_B07_F1_SE_CS_SP_PS_S4d
% 7.85/2.45  # and selection function SelectCQIPrecWNTNp.
% 7.85/2.45  #
% 7.85/2.45  # Preprocessing time       : 0.014 s
% 7.85/2.45  # Presaturation interreduction done
% 7.85/2.45  
% 7.85/2.45  # Proof found!
% 7.85/2.45  # SZS status Theorem
% 7.85/2.45  # SZS output start CNFRefutation
% See solution above
% 7.85/2.45  # Training examples: 0 positive, 0 negative
% 7.85/2.45  
% 7.85/2.45  # -------------------------------------------------
% 7.85/2.45  # User time                : 0.035 s
% 7.85/2.45  # System time              : 0.004 s
% 7.85/2.45  # Total time               : 0.040 s
% 7.85/2.45  # Maximum resident set size: 7124 pages
% 7.85/2.45  
%------------------------------------------------------------------------------