TSTP Solution File: SWW948+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWW948+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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:10 EDT 2022
% Result : Theorem 8.49s 2.41s
% Output : CNFRefutation 8.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 16
% Syntax : Number of clauses : 48 ( 28 unt; 0 nHn; 37 RR)
% Number of literals : 74 ( 11 equ; 30 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 : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 47 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_107,plain,
( pred_attacker(tuple_R_out_4(name_objective_R))
| ~ pred_attacker(tuple_R_in_2(X1,constr_h(constr_xor(constr_xor(name_r0x30,X1),name_k)))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ltdj8_hz/input.p',i_0_107) ).
cnf(i_0_69,plain,
constr_xor(X1,X2) = constr_xor(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ltdj8_hz/input.p',i_0_69) ).
cnf(i_0_68,plain,
constr_xor(X1,constr_ZERO) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ltdj8_hz/input.p',i_0_68) ).
cnf(i_0_103,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_2(name_r1_from_1st,constr_h(constr_xor(constr_xor(name_r0x30_from_1st,name_r1_from_1st),name_k)))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ltdj8_hz/input.p',i_0_103) ).
cnf(i_0_70,plain,
constr_xor(constr_xor(X1,X2),X3) = constr_xor(X1,constr_xor(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ltdj8_hz/input.p',i_0_70) ).
cnf(i_0_89,plain,
( pred_attacker(tuple_R_in_2(X1,X2))
| ~ pred_attacker(X2)
| ~ pred_attacker(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ltdj8_hz/input.p',i_0_89) ).
cnf(i_0_67,plain,
constr_xor(X1,X1) = constr_ZERO,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ltdj8_hz/input.p',i_0_67) ).
cnf(i_0_77,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X2,X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ltdj8_hz/input.p',i_0_77) ).
cnf(i_0_84,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_R_out_4(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ltdj8_hz/input.p',i_0_84) ).
cnf(i_0_108,negated_conjecture,
~ pred_attacker(name_objective_R),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ltdj8_hz/input.p',i_0_108) ).
cnf(i_0_88,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_R_out_1(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ltdj8_hz/input.p',i_0_88) ).
cnf(i_0_105,plain,
pred_attacker(tuple_R_out_1(name_r0x30)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ltdj8_hz/input.p',i_0_105) ).
cnf(i_0_71,plain,
( pred_attacker(constr_xor(X1,X2))
| ~ pred_attacker(X2)
| ~ pred_attacker(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ltdj8_hz/input.p',i_0_71) ).
cnf(i_0_76,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X1,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ltdj8_hz/input.p',i_0_76) ).
cnf(i_0_79,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_1(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ltdj8_hz/input.p',i_0_79) ).
cnf(i_0_102,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_1(name_r0x30_from_1st)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ltdj8_hz/input.p',i_0_102) ).
cnf(c_0_125,plain,
( pred_attacker(tuple_R_out_4(name_objective_R))
| ~ pred_attacker(tuple_R_in_2(X1,constr_h(constr_xor(constr_xor(name_r0x30,X1),name_k)))) ),
i_0_107 ).
cnf(c_0_126,plain,
constr_xor(X1,X2) = constr_xor(X2,X1),
i_0_69 ).
cnf(c_0_127,plain,
constr_xor(X1,constr_ZERO) = X1,
i_0_68 ).
cnf(c_0_128,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_2(name_r1_from_1st,constr_h(constr_xor(constr_xor(name_r0x30_from_1st,name_r1_from_1st),name_k)))),
i_0_103 ).
cnf(c_0_129,plain,
constr_xor(constr_xor(X1,X2),X3) = constr_xor(X1,constr_xor(X2,X3)),
i_0_70 ).
cnf(c_0_130,plain,
( pred_attacker(tuple_R_out_4(name_objective_R))
| ~ pred_attacker(tuple_R_in_2(X1,constr_h(constr_xor(name_k,constr_xor(name_r0x30,X1))))) ),
inference(rw,[status(thm)],[c_0_125,c_0_126]) ).
cnf(c_0_131,plain,
( pred_attacker(tuple_R_in_2(X1,X2))
| ~ pred_attacker(X2)
| ~ pred_attacker(X1) ),
i_0_89 ).
cnf(c_0_132,plain,
constr_xor(X1,X1) = constr_ZERO,
i_0_67 ).
cnf(c_0_133,plain,
constr_xor(constr_ZERO,X1) = X1,
inference(spm,[status(thm)],[c_0_127,c_0_126]) ).
cnf(c_0_134,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X2,X1)) ),
i_0_77 ).
cnf(c_0_135,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_2(name_r1_from_1st,constr_h(constr_xor(name_r0x30_from_1st,constr_xor(name_k,name_r1_from_1st))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_128,c_0_129]),c_0_126]) ).
cnf(c_0_136,plain,
( pred_attacker(tuple_R_out_4(name_objective_R))
| ~ pred_attacker(constr_h(constr_xor(name_k,constr_xor(name_r0x30,X1))))
| ~ pred_attacker(X1) ),
inference(spm,[status(thm)],[c_0_130,c_0_131]) ).
cnf(c_0_137,plain,
constr_xor(X1,constr_xor(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_129,c_0_132]),c_0_133]) ).
cnf(c_0_138,plain,
pred_attacker(constr_h(constr_xor(name_r0x30_from_1st,constr_xor(name_k,name_r1_from_1st)))),
inference(spm,[status(thm)],[c_0_134,c_0_135]) ).
cnf(c_0_139,plain,
constr_xor(X1,constr_xor(X2,X3)) = constr_xor(X2,constr_xor(X3,X1)),
inference(spm,[status(thm)],[c_0_129,c_0_126]) ).
cnf(c_0_140,plain,
( pred_attacker(tuple_R_out_4(name_objective_R))
| ~ pred_attacker(constr_h(constr_xor(name_k,X1)))
| ~ pred_attacker(constr_xor(name_r0x30,X1)) ),
inference(spm,[status(thm)],[c_0_136,c_0_137]) ).
cnf(c_0_141,plain,
pred_attacker(constr_h(constr_xor(name_k,constr_xor(name_r0x30_from_1st,name_r1_from_1st)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_138,c_0_139]),c_0_126]) ).
cnf(c_0_142,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_R_out_4(X1)) ),
i_0_84 ).
cnf(c_0_143,plain,
( pred_attacker(tuple_R_out_4(name_objective_R))
| ~ pred_attacker(constr_xor(name_r0x30,constr_xor(name_r0x30_from_1st,name_r1_from_1st))) ),
inference(spm,[status(thm)],[c_0_140,c_0_141]) ).
cnf(c_0_144,negated_conjecture,
~ pred_attacker(name_objective_R),
i_0_108 ).
cnf(c_0_145,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_R_out_1(X1)) ),
i_0_88 ).
cnf(c_0_146,plain,
pred_attacker(tuple_R_out_1(name_r0x30)),
i_0_105 ).
cnf(c_0_147,plain,
~ pred_attacker(constr_xor(name_r0x30,constr_xor(name_r0x30_from_1st,name_r1_from_1st))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_142,c_0_143]),c_0_144]) ).
cnf(c_0_148,plain,
( pred_attacker(constr_xor(X1,X2))
| ~ pred_attacker(X2)
| ~ pred_attacker(X1) ),
i_0_71 ).
cnf(c_0_149,plain,
pred_attacker(name_r0x30),
inference(spm,[status(thm)],[c_0_145,c_0_146]) ).
cnf(c_0_150,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X1,X2)) ),
i_0_76 ).
cnf(c_0_151,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_1(X1)) ),
i_0_79 ).
cnf(c_0_152,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_1(name_r0x30_from_1st)),
i_0_102 ).
cnf(c_0_153,plain,
~ pred_attacker(constr_xor(name_r0x30_from_1st,name_r1_from_1st)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_147,c_0_148]),c_0_149])]) ).
cnf(c_0_154,plain,
pred_attacker(name_r1_from_1st),
inference(spm,[status(thm)],[c_0_150,c_0_135]) ).
cnf(c_0_155,plain,
pred_attacker(name_r0x30_from_1st),
inference(spm,[status(thm)],[c_0_151,c_0_152]) ).
cnf(c_0_156,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_153,c_0_148]),c_0_154]),c_0_155])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWW948+1 : TPTP v8.1.0. Released v7.4.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n020.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jun 5 12:54:39 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 8.49/2.41 # ENIGMATIC: Solved by autoschedule:
% 8.49/2.41 # No SInE strategy applied
% 8.49/2.41 # Trying AutoSched0 for 150 seconds
% 8.49/2.41 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 8.49/2.41 # and selection function SelectComplexExceptUniqMaxHorn.
% 8.49/2.41 #
% 8.49/2.41 # Preprocessing time : 0.024 s
% 8.49/2.41 # Presaturation interreduction done
% 8.49/2.41
% 8.49/2.41 # Proof found!
% 8.49/2.41 # SZS status Theorem
% 8.49/2.41 # SZS output start CNFRefutation
% See solution above
% 8.49/2.41 # Training examples: 0 positive, 0 negative
% 8.49/2.41
% 8.49/2.41 # -------------------------------------------------
% 8.49/2.41 # User time : 0.046 s
% 8.49/2.41 # System time : 0.004 s
% 8.49/2.41 # Total time : 0.050 s
% 8.49/2.41 # Maximum resident set size: 7124 pages
% 8.49/2.41
%------------------------------------------------------------------------------