↑ Up

ET---2.0.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SWV234+2 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n029.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 18:15:40 EDT 2022

% Result   : Theorem 0.24s 1.42s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   47 (  36 unt;   0 def)
%            Number of atoms       :   70 (  19 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   44 (  21   ~;  18   |;   3   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   2 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   :   66 (   6 sgn  34   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(xor_commutes,axiom,
    ! [X1,X2,X3] : xor(X1,X2) = xor(X2,X1),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',xor_commutes) ).

fof(xor_assosciative,axiom,
    ! [X1,X2,X3] : xor(X1,xor(X2,X3)) = xor(xor(X1,X2),X3),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',xor_assosciative) ).

fof(initial_knowledge9,axiom,
    public(enc(xor(km,imp),xor(kek,xor(pin,data)))),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',initial_knowledge9) ).

fof(xor_self_cancel,axiom,
    ! [X1,X2,X3] : xor(X1,X1) = z,
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',xor_self_cancel) ).

fof(xor_zero,axiom,
    ! [X1,X2,X3] : xor(X1,z) = X1,
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',xor_zero) ).

fof(key_import_cmd,axiom,
    ! [X1,X2,X3] :
      ( ( public(X2)
        & public(enc(xor(X1,X2),X3))
        & public(enc(xor(km,imp),X1)) )
     => public(enc(xor(km,X2),X3)) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',key_import_cmd) ).

fof(encrypt_data_cmd,axiom,
    ! [X1,X2] :
      ( ( public(X1)
        & public(X2) )
     => public(enc(enc(inv(xor(data,km)),X1),X2)) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',encrypt_data_cmd) ).

fof(encrypt_decrypt_cancel,axiom,
    ! [X1,X2,X3] : enc(X1,enc(inv(X1),X2)) = X2,
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',encrypt_decrypt_cancel) ).

fof(initial_knowledge2,axiom,
    public(data),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',initial_knowledge2) ).

fof(initial_knowledge5,axiom,
    public(enc(xor(kek,pin),pp)),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',initial_knowledge5) ).

fof(co1,conjecture,
    public(enc(pp,a)),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',co1) ).

fof(initial_knowledge8,axiom,
    public(a),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',initial_knowledge8) ).

fof(c_0_12,plain,
    ! [X4,X5] : xor(X4,X5) = xor(X5,X4),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[xor_commutes])]) ).

fof(c_0_13,plain,
    ! [X4,X5,X6] : xor(X4,xor(X5,X6)) = xor(xor(X4,X5),X6),
    inference(variable_rename,[status(thm)],[xor_assosciative]) ).

cnf(c_0_14,plain,
    public(enc(xor(km,imp),xor(kek,xor(pin,data)))),
    inference(split_conjunct,[status(thm)],[initial_knowledge9]) ).

cnf(c_0_15,plain,
    xor(X1,X2) = xor(X2,X1),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_16,plain,
    xor(X1,xor(X2,X3)) = xor(xor(X1,X2),X3),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

fof(c_0_17,plain,
    ! [X4] : xor(X4,X4) = z,
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[xor_self_cancel])]) ).

fof(c_0_18,plain,
    ! [X4] : xor(X4,z) = X4,
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[xor_zero])]) ).

fof(c_0_19,plain,
    ! [X4,X5,X6] :
      ( ~ public(X5)
      | ~ public(enc(xor(X4,X5),X6))
      | ~ public(enc(xor(km,imp),X4))
      | public(enc(xor(km,X5),X6)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[key_import_cmd])]) ).

cnf(c_0_20,plain,
    public(enc(xor(km,imp),xor(kek,xor(data,pin)))),
    inference(rw,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_21,plain,
    xor(X1,xor(X2,X3)) = xor(X3,xor(X1,X2)),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_22,plain,
    xor(X1,X1) = z,
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_23,plain,
    xor(X1,z) = X1,
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

fof(c_0_24,plain,
    ! [X3,X4] :
      ( ~ public(X3)
      | ~ public(X4)
      | public(enc(enc(inv(xor(data,km)),X3),X4)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[encrypt_data_cmd])]) ).

fof(c_0_25,plain,
    ! [X4,X5] : enc(X4,enc(inv(X4),X5)) = X5,
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[encrypt_decrypt_cancel])]) ).

cnf(c_0_26,plain,
    ( public(enc(xor(km,X1),X2))
    | ~ public(enc(xor(km,imp),X3))
    | ~ public(enc(xor(X3,X1),X2))
    | ~ public(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_27,plain,
    public(enc(xor(km,imp),xor(data,xor(pin,kek)))),
    inference(rw,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_28,plain,
    xor(X1,xor(X1,X2)) = X2,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).

cnf(c_0_29,plain,
    ( public(enc(enc(inv(xor(data,km)),X1),X2))
    | ~ public(X2)
    | ~ public(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

cnf(c_0_30,plain,
    enc(X1,enc(inv(X1),X2)) = X2,
    inference(split_conjunct,[status(thm)],[c_0_25]) ).

cnf(c_0_31,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_26,c_0_27]),c_0_16]),c_0_16]) ).

cnf(c_0_32,plain,
    xor(X1,xor(X2,xor(X3,X1))) = xor(X3,X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_28]),c_0_16]) ).

cnf(c_0_33,plain,
    public(data),
    inference(split_conjunct,[status(thm)],[initial_knowledge2]) ).

cnf(c_0_34,plain,
    public(enc(xor(kek,pin),pp)),
    inference(split_conjunct,[status(thm)],[initial_knowledge5]) ).

fof(c_0_35,negated_conjecture,
    ~ public(enc(pp,a)),
    inference(assume_negation,[status(cth)],[co1]) ).

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

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

cnf(c_0_38,plain,
    ( public(enc(xor(km,data),X1))
    | ~ public(enc(xor(pin,kek),X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_15]),c_0_33])]) ).

cnf(c_0_39,plain,
    public(enc(xor(pin,kek),pp)),
    inference(rw,[status(thm)],[c_0_34,c_0_15]) ).

fof(c_0_40,negated_conjecture,
    ~ public(enc(pp,a)),
    inference(fof_simplification,[status(thm)],[c_0_35]) ).

cnf(c_0_41,plain,
    ( public(enc(X1,X2))
    | ~ public(enc(xor(km,data),X1))
    | ~ public(X2) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_30]),c_0_37]) ).

cnf(c_0_42,plain,
    public(enc(xor(km,data),pp)),
    inference(spm,[status(thm)],[c_0_38,c_0_39]) ).

cnf(c_0_43,negated_conjecture,
    ~ public(enc(pp,a)),
    inference(split_conjunct,[status(thm)],[c_0_40]) ).

cnf(c_0_44,plain,
    ( public(enc(pp,X1))
    | ~ public(X1) ),
    inference(spm,[status(thm)],[c_0_41,c_0_42]) ).

cnf(c_0_45,plain,
    public(a),
    inference(split_conjunct,[status(thm)],[initial_knowledge8]) ).

cnf(c_0_46,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWV234+2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13  % Command  : run_ET %s %d
% 0.13/0.34  % Computer : n029.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 : Wed Jun 15 01:04:26 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.24/1.42  # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.24/1.42  # Preprocessing time       : 0.014 s
% 0.24/1.42  
% 0.24/1.42  # Proof found!
% 0.24/1.42  # SZS status Theorem
% 0.24/1.42  # SZS output start CNFRefutation
% See solution above
% 0.24/1.42  # Proof object total steps             : 47
% 0.24/1.42  # Proof object clause steps            : 26
% 0.24/1.42  # Proof object formula steps           : 21
% 0.24/1.42  # Proof object conjectures             : 5
% 0.24/1.42  # Proof object clause conjectures      : 2
% 0.24/1.42  # Proof object formula conjectures     : 3
% 0.24/1.42  # Proof object initial clauses used    : 12
% 0.24/1.42  # Proof object initial formulas used   : 12
% 0.24/1.42  # Proof object generating inferences   : 10
% 0.24/1.42  # Proof object simplifying inferences  : 14
% 0.24/1.42  # Training examples: 0 positive, 0 negative
% 0.24/1.42  # Parsed axioms                        : 22
% 0.24/1.42  # Removed by relevancy pruning/SinE    : 0
% 0.24/1.42  # Initial clauses                      : 22
% 0.24/1.42  # Removed in clause preprocessing      : 0
% 0.24/1.42  # Initial clauses in saturation        : 22
% 0.24/1.42  # Processed clauses                    : 2234
% 0.24/1.42  # ...of these trivial                  : 43
% 0.24/1.42  # ...subsumed                          : 1553
% 0.24/1.42  # ...remaining for further processing  : 638
% 0.24/1.42  # Other redundant clauses eliminated   : 0
% 0.24/1.42  # Clauses deleted for lack of memory   : 0
% 0.24/1.42  # Backward-subsumed                    : 8
% 0.24/1.42  # Backward-rewritten                   : 5
% 0.24/1.42  # Generated clauses                    : 11302
% 0.24/1.42  # ...of the previous two non-trivial   : 10941
% 0.24/1.42  # Contextual simplify-reflections      : 1380
% 0.24/1.42  # Paramodulations                      : 11302
% 0.24/1.42  # Factorizations                       : 0
% 0.24/1.42  # Equation resolutions                 : 0
% 0.24/1.42  # Current number of processed clauses  : 625
% 0.24/1.42  #    Positive orientable unit clauses  : 21
% 0.24/1.42  #    Positive unorientable unit clauses: 4
% 0.24/1.42  #    Negative unit clauses             : 10
% 0.24/1.42  #    Non-unit-clauses                  : 590
% 0.24/1.42  # Current number of unprocessed clauses: 8458
% 0.24/1.42  # ...number of literals in the above   : 50587
% 0.24/1.42  # Current number of archived formulas  : 0
% 0.24/1.42  # Current number of archived clauses   : 13
% 0.24/1.42  # Clause-clause subsumption calls (NU) : 1056656
% 0.24/1.42  # Rec. Clause-clause subsumption calls : 78267
% 0.24/1.42  # Non-unit clause-clause subsumptions  : 2637
% 0.24/1.42  # Unit Clause-clause subsumption calls : 1805
% 0.24/1.42  # Rewrite failures with RHS unbound    : 0
% 0.24/1.42  # BW rewrite match attempts            : 146
% 0.24/1.42  # BW rewrite match successes           : 104
% 0.24/1.42  # Condensation attempts                : 0
% 0.24/1.42  # Condensation successes               : 0
% 0.24/1.42  # Termbank termtop insertions          : 448597
% 0.24/1.42  
% 0.24/1.42  # -------------------------------------------------
% 0.24/1.42  # User time                : 0.652 s
% 0.24/1.42  # System time              : 0.013 s
% 0.24/1.42  # Total time               : 0.665 s
% 0.24/1.42  # Maximum resident set size: 14140 pages
% 0.24/23.41  eprover: CPU time limit exceeded, terminating
% 0.24/23.41  eprover: CPU time limit exceeded, terminating
% 0.24/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.43  eprover: No such file or directory
% 0.24/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.43  eprover: No such file or directory
% 0.24/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.43  eprover: No such file or directory
% 0.24/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.44  eprover: No such file or directory
% 0.24/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.44  eprover: No such file or directory
% 0.24/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.44  eprover: No such file or directory
% 0.24/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.44  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.46  eprover: No such file or directory
% 0.24/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.46  eprover: No such file or directory
% 0.24/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.46  eprover: No such file or directory
% 0.24/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.46  eprover: No such file or directory
% 0.24/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.47  eprover: No such file or directory
% 0.24/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.47  eprover: No such file or directory
% 0.24/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.47  eprover: No such file or directory
% 0.24/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.48  eprover: No such file or directory
% 0.24/23.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.49  eprover: No such file or directory
% 0.24/23.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.49  eprover: No such file or directory
%------------------------------------------------------------------------------