↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n008.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 : Wed Jul 20 17:46:18 EDT 2022

% Result   : Theorem 7.34s 2.36s
% Output   : CNFRefutation 7.34s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   40 (  31 unt;   0 nHn;  24 RR)
%            Number of literals    :   58 (  16 equ;  20 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   8 con; 0-2 aty)
%            Number of variables   :   49 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_12,plain,
    xor(X1,z) = X1,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rwu3uozp/input.p',i_0_12) ).

cnf(i_0_9,plain,
    xor(X1,X2) = xor(X2,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rwu3uozp/input.p',i_0_9) ).

cnf(i_0_21,plain,
    public(enc(xor(km,imp),xor(kek,xor(pin,data)))),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rwu3uozp/input.p',i_0_21) ).

cnf(i_0_10,plain,
    xor(xor(X1,X2),X3) = xor(X1,xor(X2,X3)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rwu3uozp/input.p',i_0_10) ).

cnf(i_0_11,plain,
    xor(X1,X1) = z,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rwu3uozp/input.p',i_0_11) ).

cnf(i_0_6,plain,
    ( public(enc(xor(km,X1),X2))
    | ~ public(X1)
    | ~ public(enc(xor(X3,X1),X2))
    | ~ public(enc(xor(km,imp),X3)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rwu3uozp/input.p',i_0_6) ).

cnf(i_0_5,plain,
    ( public(enc(enc(inv(xor(data,km)),X1),X2))
    | ~ public(X2)
    | ~ public(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rwu3uozp/input.p',i_0_5) ).

cnf(i_0_8,plain,
    enc(X1,enc(inv(X1),X2)) = X2,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rwu3uozp/input.p',i_0_8) ).

cnf(i_0_14,plain,
    public(data),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rwu3uozp/input.p',i_0_14) ).

cnf(i_0_17,plain,
    public(enc(xor(kek,pin),pp)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rwu3uozp/input.p',i_0_17) ).

cnf(i_0_22,negated_conjecture,
    ~ public(enc(pp,a)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rwu3uozp/input.p',i_0_22) ).

cnf(i_0_20,plain,
    public(a),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rwu3uozp/input.p',i_0_20) ).

cnf(c_0_35,plain,
    xor(X1,z) = X1,
    i_0_12 ).

cnf(c_0_36,plain,
    xor(X1,X2) = xor(X2,X1),
    i_0_9 ).

cnf(c_0_37,plain,
    public(enc(xor(km,imp),xor(kek,xor(pin,data)))),
    i_0_21 ).

cnf(c_0_38,plain,
    xor(xor(X1,X2),X3) = xor(X1,xor(X2,X3)),
    i_0_10 ).

cnf(c_0_39,plain,
    xor(X1,X1) = z,
    i_0_11 ).

cnf(c_0_40,plain,
    xor(z,X1) = X1,
    inference(spm,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_41,plain,
    public(enc(xor(km,imp),xor(kek,xor(data,pin)))),
    inference(rw,[status(thm)],[c_0_37,c_0_36]) ).

cnf(c_0_42,plain,
    xor(X1,xor(X2,X3)) = xor(X2,xor(X3,X1)),
    inference(spm,[status(thm)],[c_0_38,c_0_36]) ).

cnf(c_0_43,plain,
    xor(X1,xor(X1,X2)) = X2,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).

cnf(c_0_44,plain,
    ( public(enc(xor(km,X1),X2))
    | ~ public(X1)
    | ~ public(enc(xor(X3,X1),X2))
    | ~ public(enc(xor(km,imp),X3)) ),
    i_0_6 ).

cnf(c_0_45,plain,
    public(enc(xor(km,imp),xor(data,xor(pin,kek)))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42]),c_0_36]),c_0_42]),c_0_36]) ).

cnf(c_0_46,plain,
    xor(X1,xor(X2,X1)) = X2,
    inference(spm,[status(thm)],[c_0_43,c_0_36]) ).

cnf(c_0_47,plain,
    ( public(enc(enc(inv(xor(data,km)),X1),X2))
    | ~ public(X2)
    | ~ public(X1) ),
    i_0_5 ).

cnf(c_0_48,plain,
    enc(X1,enc(inv(X1),X2)) = X2,
    i_0_8 ).

cnf(c_0_49,plain,
    ( public(enc(xor(km,X1),X2))
    | ~ public(enc(xor(data,xor(pin,xor(kek,X1))),X2))
    | ~ public(X1) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_38]),c_0_38]) ).

cnf(c_0_50,plain,
    xor(X1,xor(X2,xor(X3,X1))) = xor(X2,X3),
    inference(spm,[status(thm)],[c_0_46,c_0_38]) ).

cnf(c_0_51,plain,
    public(data),
    i_0_14 ).

cnf(c_0_52,plain,
    public(enc(xor(kek,pin),pp)),
    i_0_17 ).

cnf(c_0_53,plain,
    ( public(enc(enc(inv(xor(km,data)),X1),X2))
    | ~ public(X2)
    | ~ public(X1) ),
    inference(rw,[status(thm)],[c_0_47,c_0_36]) ).

cnf(c_0_54,plain,
    enc(inv(inv(X1)),X2) = enc(X1,X2),
    inference(spm,[status(thm)],[c_0_48,c_0_48]) ).

cnf(c_0_55,plain,
    ( public(enc(xor(km,data),X1))
    | ~ public(enc(xor(pin,kek),X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51])]) ).

cnf(c_0_56,plain,
    public(enc(xor(pin,kek),pp)),
    inference(rw,[status(thm)],[c_0_52,c_0_36]) ).

cnf(c_0_57,plain,
    ( public(enc(X1,X2))
    | ~ public(enc(xor(km,data),X1))
    | ~ public(X2) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_48]),c_0_54]) ).

cnf(c_0_58,plain,
    public(enc(xor(km,data),pp)),
    inference(spm,[status(thm)],[c_0_55,c_0_56]) ).

cnf(c_0_59,negated_conjecture,
    ~ public(enc(pp,a)),
    i_0_22 ).

cnf(c_0_60,plain,
    ( public(enc(pp,X1))
    | ~ public(X1) ),
    inference(spm,[status(thm)],[c_0_57,c_0_58]) ).

cnf(c_0_61,plain,
    public(a),
    i_0_20 ).

cnf(c_0_62,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWV234+2 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.33  % Computer : n008.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Wed Jun 15 00:59:09 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 7.34/2.36  # ENIGMATIC: Solved by autoschedule:
% 7.34/2.36  # No SInE strategy applied
% 7.34/2.36  # Trying AutoSched0 for 150 seconds
% 7.34/2.36  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S060A
% 7.34/2.36  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.34/2.36  #
% 7.34/2.36  # Preprocessing time       : 0.025 s
% 7.34/2.36  # Presaturation interreduction done
% 7.34/2.36  
% 7.34/2.36  # Proof found!
% 7.34/2.36  # SZS status Theorem
% 7.34/2.36  # SZS output start CNFRefutation
% See solution above
% 7.34/2.36  # Training examples: 0 positive, 0 negative
% 7.34/2.36  
% 7.34/2.36  # -------------------------------------------------
% 7.34/2.36  # User time                : 0.053 s
% 7.34/2.36  # System time              : 0.011 s
% 7.34/2.36  # Total time               : 0.064 s
% 7.34/2.36  # Maximum resident set size: 7116 pages
% 7.34/2.36  
%------------------------------------------------------------------------------