TSTP Solution File: SWW949+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWW949+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 18.74s 3.75s
% Output : CNFRefutation 18.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 16
% Syntax : Number of clauses : 53 ( 29 unt; 0 nHn; 40 RR)
% Number of literals : 86 ( 13 equ; 36 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 : 60 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_81,plain,
constr_xor(X1,X2) = constr_xor(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qhcz_izb/input.p',i_0_81) ).
cnf(i_0_82,plain,
constr_xor(constr_xor(X1,X2),X3) = constr_xor(X1,constr_xor(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qhcz_izb/input.p',i_0_82) ).
cnf(i_0_80,plain,
constr_xor(X1,constr_ZERO) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qhcz_izb/input.p',i_0_80) ).
cnf(i_0_123,plain,
( pred_attacker(tuple_R_out_4(name_objective))
| ~ pred_attacker(tuple_R_in_2(X1,constr_f(constr_xor(name_r1,constr_xor(X1,name_t)),name_t))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qhcz_izb/input.p',i_0_123) ).
cnf(i_0_79,plain,
constr_xor(X1,X1) = constr_ZERO,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qhcz_izb/input.p',i_0_79) ).
cnf(i_0_105,plain,
( pred_attacker(tuple_R_in_2(X1,X2))
| ~ pred_attacker(X2)
| ~ pred_attacker(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qhcz_izb/input.p',i_0_105) ).
cnf(i_0_89,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X2,X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qhcz_izb/input.p',i_0_89) ).
cnf(i_0_119,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_2(constr_xor(name_t,name_r2_from_1st),constr_f(constr_xor(name_r1_from_1st,name_r2_from_1st),name_t))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qhcz_izb/input.p',i_0_119) ).
cnf(i_0_83,plain,
( pred_attacker(constr_xor(X1,X2))
| ~ pred_attacker(X2)
| ~ pred_attacker(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qhcz_izb/input.p',i_0_83) ).
cnf(i_0_88,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X1,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qhcz_izb/input.p',i_0_88) ).
cnf(i_0_100,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_R_out_4(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qhcz_izb/input.p',i_0_100) ).
cnf(i_0_124,negated_conjecture,
~ pred_attacker(name_objective),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qhcz_izb/input.p',i_0_124) ).
cnf(i_0_91,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_1(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qhcz_izb/input.p',i_0_91) ).
cnf(i_0_118,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_1(name_r1_from_1st)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qhcz_izb/input.p',i_0_118) ).
cnf(i_0_104,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_R_out_1(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qhcz_izb/input.p',i_0_104) ).
cnf(i_0_121,plain,
pred_attacker(tuple_R_out_1(name_r1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qhcz_izb/input.p',i_0_121) ).
cnf(c_0_141,plain,
constr_xor(X1,X2) = constr_xor(X2,X1),
i_0_81 ).
cnf(c_0_142,plain,
constr_xor(constr_xor(X1,X2),X3) = constr_xor(X1,constr_xor(X2,X3)),
i_0_82 ).
cnf(c_0_143,plain,
constr_xor(X1,constr_ZERO) = X1,
i_0_80 ).
cnf(c_0_144,plain,
( pred_attacker(tuple_R_out_4(name_objective))
| ~ pred_attacker(tuple_R_in_2(X1,constr_f(constr_xor(name_r1,constr_xor(X1,name_t)),name_t))) ),
i_0_123 ).
cnf(c_0_145,plain,
constr_xor(X1,constr_xor(X2,X3)) = constr_xor(X3,constr_xor(X1,X2)),
inference(spm,[status(thm)],[c_0_141,c_0_142]) ).
cnf(c_0_146,plain,
constr_xor(X1,X1) = constr_ZERO,
i_0_79 ).
cnf(c_0_147,plain,
constr_xor(constr_ZERO,X1) = X1,
inference(spm,[status(thm)],[c_0_143,c_0_141]) ).
cnf(c_0_148,plain,
( pred_attacker(tuple_R_out_4(name_objective))
| ~ pred_attacker(tuple_R_in_2(X1,constr_f(constr_xor(name_t,constr_xor(name_r1,X1)),name_t))) ),
inference(rw,[status(thm)],[c_0_144,c_0_145]) ).
cnf(c_0_149,plain,
( pred_attacker(tuple_R_in_2(X1,X2))
| ~ pred_attacker(X2)
| ~ pred_attacker(X1) ),
i_0_105 ).
cnf(c_0_150,plain,
constr_xor(X1,constr_xor(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_142,c_0_146]),c_0_147]) ).
cnf(c_0_151,plain,
( pred_attacker(tuple_R_out_4(name_objective))
| ~ pred_attacker(constr_f(constr_xor(name_t,constr_xor(name_r1,X1)),name_t))
| ~ pred_attacker(X1) ),
inference(spm,[status(thm)],[c_0_148,c_0_149]) ).
cnf(c_0_152,plain,
constr_xor(X1,constr_xor(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_150,c_0_141]) ).
cnf(c_0_153,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X2,X1)) ),
i_0_89 ).
cnf(c_0_154,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_2(constr_xor(name_t,name_r2_from_1st),constr_f(constr_xor(name_r1_from_1st,name_r2_from_1st),name_t))),
i_0_119 ).
cnf(c_0_155,plain,
( pred_attacker(tuple_R_out_4(name_objective))
| ~ pred_attacker(constr_f(constr_xor(name_t,X1),name_t))
| ~ pred_attacker(constr_xor(X1,name_r1)) ),
inference(spm,[status(thm)],[c_0_151,c_0_152]) ).
cnf(c_0_156,plain,
pred_attacker(constr_f(constr_xor(name_r1_from_1st,name_r2_from_1st),name_t)),
inference(spm,[status(thm)],[c_0_153,c_0_154]) ).
cnf(c_0_157,plain,
( pred_attacker(constr_xor(X1,X2))
| ~ pred_attacker(X2)
| ~ pred_attacker(X1) ),
i_0_83 ).
cnf(c_0_158,plain,
( pred_attacker(tuple_R_out_4(name_objective))
| ~ pred_attacker(constr_xor(X1,constr_xor(name_t,name_r1)))
| ~ pred_attacker(constr_f(X1,name_t)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_155,c_0_152]),c_0_142]) ).
cnf(c_0_159,plain,
pred_attacker(constr_f(constr_xor(name_r2_from_1st,name_r1_from_1st),name_t)),
inference(rw,[status(thm)],[c_0_156,c_0_141]) ).
cnf(c_0_160,plain,
constr_xor(X1,constr_xor(X2,X3)) = constr_xor(X2,constr_xor(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_142,c_0_141]),c_0_142]) ).
cnf(c_0_161,plain,
( pred_attacker(constr_xor(X1,constr_xor(X2,X3)))
| ~ pred_attacker(constr_xor(X1,X2))
| ~ pred_attacker(X3) ),
inference(spm,[status(thm)],[c_0_157,c_0_142]) ).
cnf(c_0_162,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X1,X2)) ),
i_0_88 ).
cnf(c_0_163,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_2(constr_xor(name_t,name_r2_from_1st),constr_f(constr_xor(name_r2_from_1st,name_r1_from_1st),name_t))),
inference(rw,[status(thm)],[c_0_154,c_0_141]) ).
cnf(c_0_164,plain,
( pred_attacker(tuple_R_out_4(name_objective))
| ~ pred_attacker(constr_xor(name_t,constr_xor(name_r1,constr_xor(name_r2_from_1st,name_r1_from_1st)))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_158,c_0_159]),c_0_142]),c_0_160]),c_0_141]),c_0_160]),c_0_160]) ).
cnf(c_0_165,plain,
( pred_attacker(constr_xor(X1,constr_xor(X2,constr_xor(X3,X4))))
| ~ pred_attacker(constr_xor(X1,X3))
| ~ pred_attacker(constr_xor(X2,X4)) ),
inference(spm,[status(thm)],[c_0_161,c_0_160]) ).
cnf(c_0_166,plain,
pred_attacker(constr_xor(name_t,name_r2_from_1st)),
inference(spm,[status(thm)],[c_0_162,c_0_163]) ).
cnf(c_0_167,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_R_out_4(X1)) ),
i_0_100 ).
cnf(c_0_168,plain,
( pred_attacker(tuple_R_out_4(name_objective))
| ~ pred_attacker(constr_xor(name_r1,name_r1_from_1st)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_164,c_0_165]),c_0_166])]) ).
cnf(c_0_169,negated_conjecture,
~ pred_attacker(name_objective),
i_0_124 ).
cnf(c_0_170,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_1(X1)) ),
i_0_91 ).
cnf(c_0_171,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_1(name_r1_from_1st)),
i_0_118 ).
cnf(c_0_172,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_R_out_1(X1)) ),
i_0_104 ).
cnf(c_0_173,plain,
pred_attacker(tuple_R_out_1(name_r1)),
i_0_121 ).
cnf(c_0_174,plain,
~ pred_attacker(constr_xor(name_r1,name_r1_from_1st)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_167,c_0_168]),c_0_169]) ).
cnf(c_0_175,plain,
pred_attacker(name_r1_from_1st),
inference(spm,[status(thm)],[c_0_170,c_0_171]) ).
cnf(c_0_176,plain,
pred_attacker(name_r1),
inference(spm,[status(thm)],[c_0_172,c_0_173]) ).
cnf(c_0_177,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_174,c_0_157]),c_0_175]),c_0_176])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWW949+1 : TPTP v8.1.0. Released v7.4.0.
% 0.07/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 09:38:24 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.44 # ENIGMATIC: Selected complete mode:
% 18.74/3.75 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d45-l8000-e0.15+coop-mzr02:
% 18.74/3.75 # ENIGMA: LightGBM model '/export/starexec/sandbox/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d45-l8000-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 15; version: 991; iters: 150)
% 18.74/3.75 # Preprocessing time : 1.135 s
% 18.74/3.75
% 18.74/3.75 # Proof found!
% 18.74/3.75 # SZS status Theorem
% 18.74/3.75 # SZS output start CNFRefutation
% See solution above
% 18.74/3.75 # Training examples: 0 positive, 0 negative
% 18.74/3.75
% 18.74/3.75 # -------------------------------------------------
% 18.74/3.75 # User time : 1.124 s
% 18.74/3.75 # System time : 0.145 s
% 18.74/3.75 # Total time : 1.269 s
% 18.74/3.75 # ...preprocessing : 1.135 s
% 18.74/3.75 # ...main loop : 0.135 s
% 18.74/3.75 # Maximum resident set size: 174220 pages
% 18.74/3.75
%------------------------------------------------------------------------------