%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWW957+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% 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 : Thu Jul 21 00:03:11 EDT 2022
% Result : Theorem 7.85s 2.34s
% Output : CNFRefutation 7.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 16
% Syntax : Number of clauses : 47 ( 27 unt; 0 nHn; 33 RR)
% Number of literals : 70 ( 16 equ; 27 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-2 aty)
% Number of variables : 56 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_50,plain,
constr_xor(X1,constr_ZERO) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lnt485rm/input.p',i_0_50) ).
cnf(i_0_51,plain,
constr_xor(X1,X2) = constr_xor(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lnt485rm/input.p',i_0_51) ).
cnf(i_0_52,plain,
constr_xor(constr_xor(X1,X2),X3) = constr_xor(X1,constr_xor(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lnt485rm/input.p',i_0_52) ).
cnf(i_0_49,plain,
constr_xor(X1,X1) = constr_ZERO,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lnt485rm/input.p',i_0_49) ).
cnf(i_0_83,plain,
pred_attacker(tuple_B_out_1(name_v,constr_xor(constr_concat(name_objective,constr_C(name_objective)),constr_RC4(name_v,name_Kab)))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lnt485rm/input.p',i_0_83) ).
cnf(i_0_53,plain,
( pred_attacker(constr_xor(X1,X2))
| ~ pred_attacker(X2)
| ~ pred_attacker(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lnt485rm/input.p',i_0_53) ).
cnf(i_0_73,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_B_out_1(X2,X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lnt485rm/input.p',i_0_73) ).
cnf(i_0_82,plain,
( pred_attacker(tuple_enc_oracle_out_2(name_v,constr_xor(constr_concat(X1,constr_C(X1)),constr_RC4(name_v,name_Kab))))
| ~ pred_attacker(tuple_enc_oracle_in_1(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lnt485rm/input.p',i_0_82) ).
cnf(i_0_48,plain,
constr_xor(constr_C(X1),constr_C(X2)) = constr_C(constr_xor(X1,X2)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lnt485rm/input.p',i_0_48) ).
cnf(i_0_47,plain,
constr_concat(constr_xor(X1,X2),constr_xor(X3,X4)) = constr_xor(constr_concat(X1,X3),constr_concat(X2,X4)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lnt485rm/input.p',i_0_47) ).
cnf(i_0_75,plain,
( pred_attacker(X1)
| ~ pred_attacker(constr_split(constr_concat(X1,X2))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lnt485rm/input.p',i_0_75) ).
cnf(i_0_55,plain,
( pred_attacker(constr_split(X1))
| ~ pred_attacker(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lnt485rm/input.p',i_0_55) ).
cnf(i_0_84,negated_conjecture,
~ pred_attacker(name_objective),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lnt485rm/input.p',i_0_84) ).
cnf(i_0_59,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_enc_oracle_out_2(X2,X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lnt485rm/input.p',i_0_59) ).
cnf(i_0_60,plain,
( pred_attacker(tuple_enc_oracle_in_1(X1))
| ~ pred_attacker(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lnt485rm/input.p',i_0_60) ).
cnf(i_0_63,plain,
pred_attacker(constr_ZERO),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lnt485rm/input.p',i_0_63) ).
cnf(c_0_101,plain,
constr_xor(X1,constr_ZERO) = X1,
i_0_50 ).
cnf(c_0_102,plain,
constr_xor(X1,X2) = constr_xor(X2,X1),
i_0_51 ).
cnf(c_0_103,plain,
constr_xor(constr_xor(X1,X2),X3) = constr_xor(X1,constr_xor(X2,X3)),
i_0_52 ).
cnf(c_0_104,plain,
constr_xor(X1,X1) = constr_ZERO,
i_0_49 ).
cnf(c_0_105,plain,
constr_xor(constr_ZERO,X1) = X1,
inference(spm,[status(thm)],[c_0_101,c_0_102]) ).
cnf(c_0_106,plain,
pred_attacker(tuple_B_out_1(name_v,constr_xor(constr_concat(name_objective,constr_C(name_objective)),constr_RC4(name_v,name_Kab)))),
i_0_83 ).
cnf(c_0_107,plain,
( pred_attacker(constr_xor(X1,X2))
| ~ pred_attacker(X2)
| ~ pred_attacker(X1) ),
i_0_53 ).
cnf(c_0_108,plain,
constr_xor(X1,constr_xor(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_104]),c_0_105]) ).
cnf(c_0_109,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_B_out_1(X2,X1)) ),
i_0_73 ).
cnf(c_0_110,plain,
pred_attacker(tuple_B_out_1(name_v,constr_xor(constr_RC4(name_v,name_Kab),constr_concat(name_objective,constr_C(name_objective))))),
inference(rw,[status(thm)],[c_0_106,c_0_102]) ).
cnf(c_0_111,plain,
( pred_attacker(tuple_enc_oracle_out_2(name_v,constr_xor(constr_concat(X1,constr_C(X1)),constr_RC4(name_v,name_Kab))))
| ~ pred_attacker(tuple_enc_oracle_in_1(X1)) ),
i_0_82 ).
cnf(c_0_112,plain,
constr_xor(constr_C(X1),constr_C(X2)) = constr_C(constr_xor(X1,X2)),
i_0_48 ).
cnf(c_0_113,plain,
constr_concat(constr_xor(X1,X2),constr_xor(X3,X4)) = constr_xor(constr_concat(X1,X3),constr_concat(X2,X4)),
i_0_47 ).
cnf(c_0_114,plain,
( pred_attacker(X1)
| ~ pred_attacker(constr_split(constr_concat(X1,X2))) ),
i_0_75 ).
cnf(c_0_115,plain,
( pred_attacker(constr_split(X1))
| ~ pred_attacker(X1) ),
i_0_55 ).
cnf(c_0_116,plain,
( pred_attacker(X1)
| ~ pred_attacker(constr_xor(X2,X1))
| ~ pred_attacker(X2) ),
inference(spm,[status(thm)],[c_0_107,c_0_108]) ).
cnf(c_0_117,plain,
pred_attacker(constr_xor(constr_RC4(name_v,name_Kab),constr_concat(name_objective,constr_C(name_objective)))),
inference(spm,[status(thm)],[c_0_109,c_0_110]) ).
cnf(c_0_118,plain,
( pred_attacker(tuple_enc_oracle_out_2(name_v,constr_xor(constr_RC4(name_v,name_Kab),constr_concat(X1,constr_C(X1)))))
| ~ pred_attacker(tuple_enc_oracle_in_1(X1)) ),
inference(rw,[status(thm)],[c_0_111,c_0_102]) ).
cnf(c_0_119,plain,
constr_C(constr_ZERO) = constr_ZERO,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_112]),c_0_104]) ).
cnf(c_0_120,plain,
constr_concat(constr_ZERO,constr_ZERO) = constr_ZERO,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_113]),c_0_104]),c_0_104]) ).
cnf(c_0_121,plain,
( pred_attacker(X1)
| ~ pred_attacker(constr_concat(X1,X2)) ),
inference(spm,[status(thm)],[c_0_114,c_0_115]) ).
cnf(c_0_122,plain,
( pred_attacker(constr_concat(name_objective,constr_C(name_objective)))
| ~ pred_attacker(constr_RC4(name_v,name_Kab)) ),
inference(spm,[status(thm)],[c_0_116,c_0_117]) ).
cnf(c_0_123,negated_conjecture,
~ pred_attacker(name_objective),
i_0_84 ).
cnf(c_0_124,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_enc_oracle_out_2(X2,X1)) ),
i_0_59 ).
cnf(c_0_125,plain,
( pred_attacker(tuple_enc_oracle_out_2(name_v,constr_RC4(name_v,name_Kab)))
| ~ pred_attacker(tuple_enc_oracle_in_1(constr_ZERO)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_119]),c_0_120]),c_0_101]) ).
cnf(c_0_126,plain,
~ pred_attacker(constr_RC4(name_v,name_Kab)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_122]),c_0_123]) ).
cnf(c_0_127,plain,
( pred_attacker(constr_RC4(name_v,name_Kab))
| ~ pred_attacker(tuple_enc_oracle_in_1(constr_ZERO)) ),
inference(spm,[status(thm)],[c_0_124,c_0_125]) ).
cnf(c_0_128,plain,
~ pred_attacker(tuple_enc_oracle_in_1(constr_ZERO)),
inference(spm,[status(thm)],[c_0_126,c_0_127]) ).
cnf(c_0_129,plain,
( pred_attacker(tuple_enc_oracle_in_1(X1))
| ~ pred_attacker(X1) ),
i_0_60 ).
cnf(c_0_130,plain,
pred_attacker(constr_ZERO),
i_0_63 ).
cnf(c_0_131,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_128,c_0_129]),c_0_130])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWW957+1 : TPTP v8.1.0. Released v7.4.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n029.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jun 5 22:51:36 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.85/2.34 # ENIGMATIC: Solved by autoschedule:
% 7.85/2.34 # No SInE strategy applied
% 7.85/2.34 # Trying AutoSched0 for 150 seconds
% 7.85/2.34 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.85/2.34 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.85/2.34 #
% 7.85/2.34 # Preprocessing time : 0.024 s
% 7.85/2.34 # Presaturation interreduction done
% 7.85/2.34
% 7.85/2.34 # Proof found!
% 7.85/2.34 # SZS status Theorem
% 7.85/2.34 # SZS output start CNFRefutation
% See solution above
% 7.85/2.34 # Training examples: 0 positive, 0 negative
% 7.85/2.34
% 7.85/2.34 # -------------------------------------------------
% 7.85/2.34 # User time : 0.043 s
% 7.85/2.34 # System time : 0.004 s
% 7.85/2.34 # Total time : 0.047 s
% 7.85/2.34 # Maximum resident set size: 7120 pages
% 7.85/2.34
%------------------------------------------------------------------------------