TSTP Solution File: SWV234+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV234+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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 19.45s 3.78s
% Output : CNFRefutation 19.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 18
% Syntax : Number of clauses : 56 ( 35 unt; 0 nHn; 41 RR)
% Number of literals : 109 ( 15 equ; 55 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 : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 89 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
xor(X1,id) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ie0qmbko/input.p',i_0_4) ).
cnf(i_0_1,plain,
xor(X1,X2) = xor(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ie0qmbko/input.p',i_0_1) ).
cnf(i_0_2,plain,
xor(xor(X1,X2),X3) = xor(X1,xor(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ie0qmbko/input.p',i_0_2) ).
cnf(i_0_5,plain,
xor(X1,X1) = id,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ie0qmbko/input.p',i_0_5) ).
cnf(i_0_6,plain,
( p(crypt(xor(km,X1),decrypt(xor(X2,X1),crypt(xor(X3,X4),X5))))
| ~ p(X1)
| ~ p(crypt(xor(X3,X4),X5))
| ~ p(crypt(xor(km,imp),X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ie0qmbko/input.p',i_0_6) ).
cnf(i_0_9,plain,
( p(crypt(xor(km,xor(X1,kp)),xor(X2,X3)))
| ~ p(X1)
| ~ p(X2)
| ~ p(crypt(xor(km,xor(kp,X1)),X3)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ie0qmbko/input.p',i_0_9) ).
cnf(i_0_25,plain,
p(crypt(xor(km,xor(kp,imp)),xor(kek,k3))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ie0qmbko/input.p',i_0_25) ).
cnf(i_0_11,plain,
( p(crypt(X1,X2))
| ~ p(X2)
| ~ p(crypt(xor(km,data),X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ie0qmbko/input.p',i_0_11) ).
cnf(i_0_19,plain,
p(data),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ie0qmbko/input.p',i_0_19) ).
cnf(i_0_10,plain,
( p(crypt(xor(km,X1),xor(X2,X3)))
| ~ p(X1)
| ~ p(X3)
| ~ p(crypt(xor(km,xor(X1,kp)),X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ie0qmbko/input.p',i_0_10) ).
cnf(i_0_24,plain,
p(k3),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ie0qmbko/input.p',i_0_24) ).
cnf(i_0_18,plain,
p(imp),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ie0qmbko/input.p',i_0_18) ).
cnf(i_0_3,plain,
decrypt(X1,crypt(X1,X2)) = X2,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ie0qmbko/input.p',i_0_3) ).
cnf(i_0_14,plain,
( p(xor(X1,X2))
| ~ p(X2)
| ~ p(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ie0qmbko/input.p',i_0_14) ).
cnf(i_0_22,plain,
p(crypt(xor(kek,pin),pp)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ie0qmbko/input.p',i_0_22) ).
cnf(i_0_21,plain,
p(pin),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ie0qmbko/input.p',i_0_21) ).
cnf(i_0_26,negated_conjecture,
~ p(crypt(pp,a)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ie0qmbko/input.p',i_0_26) ).
cnf(i_0_23,plain,
p(a),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ie0qmbko/input.p',i_0_23) ).
cnf(c_0_45,plain,
xor(X1,id) = X1,
i_0_4 ).
cnf(c_0_46,plain,
xor(X1,X2) = xor(X2,X1),
i_0_1 ).
cnf(c_0_47,plain,
xor(xor(X1,X2),X3) = xor(X1,xor(X2,X3)),
i_0_2 ).
cnf(c_0_48,plain,
xor(X1,X1) = id,
i_0_5 ).
cnf(c_0_49,plain,
xor(id,X1) = X1,
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,plain,
( p(crypt(xor(km,X1),decrypt(xor(X2,X1),crypt(xor(X3,X4),X5))))
| ~ p(X1)
| ~ p(crypt(xor(X3,X4),X5))
| ~ p(crypt(xor(km,imp),X2)) ),
i_0_6 ).
cnf(c_0_51,plain,
( p(crypt(xor(km,xor(X1,kp)),xor(X2,X3)))
| ~ p(X1)
| ~ p(X2)
| ~ p(crypt(xor(km,xor(kp,X1)),X3)) ),
i_0_9 ).
cnf(c_0_52,plain,
xor(X1,xor(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).
cnf(c_0_53,plain,
p(crypt(xor(km,xor(kp,imp)),xor(kek,k3))),
i_0_25 ).
cnf(c_0_54,plain,
( p(crypt(X1,X2))
| ~ p(X2)
| ~ p(crypt(xor(km,data),X1)) ),
i_0_11 ).
cnf(c_0_55,plain,
( p(crypt(xor(km,X1),decrypt(xor(X1,X2),crypt(xor(X3,X4),X5))))
| ~ p(crypt(xor(km,imp),X2))
| ~ p(crypt(xor(X3,X4),X5))
| ~ p(X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_46]) ).
cnf(c_0_56,plain,
p(data),
i_0_19 ).
cnf(c_0_57,plain,
( p(crypt(xor(km,X1),xor(X2,X3)))
| ~ p(X1)
| ~ p(X3)
| ~ p(crypt(xor(km,xor(X1,kp)),X2)) ),
i_0_10 ).
cnf(c_0_58,plain,
( p(crypt(xor(km,xor(X1,kp)),X2))
| ~ p(crypt(xor(km,xor(kp,X1)),xor(X3,X2)))
| ~ p(X3)
| ~ p(X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_59,plain,
p(crypt(xor(km,xor(kp,imp)),xor(k3,kek))),
inference(rw,[status(thm)],[c_0_53,c_0_46]) ).
cnf(c_0_60,plain,
p(k3),
i_0_24 ).
cnf(c_0_61,plain,
p(imp),
i_0_18 ).
cnf(c_0_62,plain,
( p(crypt(decrypt(xor(data,X1),crypt(xor(X2,X3),X4)),X5))
| ~ p(crypt(xor(km,imp),X1))
| ~ p(crypt(xor(X2,X3),X4))
| ~ p(X5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56])]) ).
cnf(c_0_63,plain,
decrypt(X1,crypt(X1,X2)) = X2,
i_0_3 ).
cnf(c_0_64,plain,
( p(crypt(xor(km,X1),xor(X2,X3)))
| ~ p(crypt(xor(km,xor(kp,X1)),X2))
| ~ p(X3)
| ~ p(X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_46]) ).
cnf(c_0_65,plain,
p(crypt(xor(km,xor(kp,imp)),kek)),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]),c_0_61])]),c_0_46]) ).
cnf(c_0_66,plain,
( p(crypt(X1,X2))
| ~ p(crypt(xor(km,imp),X3))
| ~ p(crypt(xor(data,X3),X1))
| ~ p(X2) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_67,plain,
( p(crypt(xor(km,imp),xor(kek,X1)))
| ~ p(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_61])]) ).
cnf(c_0_68,plain,
( p(crypt(X1,X2))
| ~ p(crypt(xor(km,imp),xor(data,X3)))
| ~ p(crypt(X3,X1))
| ~ p(X2) ),
inference(spm,[status(thm)],[c_0_66,c_0_52]) ).
cnf(c_0_69,plain,
( p(crypt(xor(km,imp),X1))
| ~ p(xor(kek,X1)) ),
inference(spm,[status(thm)],[c_0_67,c_0_52]) ).
cnf(c_0_70,plain,
xor(X1,xor(X2,X3)) = xor(X2,xor(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_46]),c_0_47]) ).
cnf(c_0_71,plain,
( p(crypt(X1,X2))
| ~ p(xor(data,xor(kek,X3)))
| ~ p(crypt(X3,X1))
| ~ p(X2) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70]) ).
cnf(c_0_72,plain,
( p(xor(X1,X2))
| ~ p(X2)
| ~ p(X1) ),
i_0_14 ).
cnf(c_0_73,plain,
p(crypt(xor(kek,pin),pp)),
i_0_22 ).
cnf(c_0_74,plain,
xor(X1,xor(X2,xor(X1,X2))) = id,
inference(spm,[status(thm)],[c_0_48,c_0_47]) ).
cnf(c_0_75,plain,
( p(crypt(X1,X2))
| ~ p(xor(kek,X3))
| ~ p(crypt(X3,X1))
| ~ p(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_56])]) ).
cnf(c_0_76,plain,
p(crypt(xor(pin,kek),pp)),
inference(rw,[status(thm)],[c_0_73,c_0_46]) ).
cnf(c_0_77,plain,
xor(X1,xor(X2,X1)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_74]),c_0_45]) ).
cnf(c_0_78,plain,
p(pin),
i_0_21 ).
cnf(c_0_79,negated_conjecture,
~ p(crypt(pp,a)),
i_0_26 ).
cnf(c_0_80,plain,
( p(crypt(pp,X1))
| ~ p(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_77]),c_0_78])]) ).
cnf(c_0_81,plain,
p(a),
i_0_23 ).
cnf(c_0_82,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_81])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWV234+1 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n021.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 03:09:30 EDT 2022
% 0.19/0.34 % CPUTime :
% 0.21/0.45 # ENIGMATIC: Selected complete mode:
% 19.45/3.78 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d60-l8000-e0.15+coop-eprover73:
% 19.45/3.78 # ENIGMA: LightGBM model '/export/starexec/sandbox/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d60-l8000-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 21; version: 991; iters: 150)
% 19.45/3.78 # Preprocessing time : 1.226 s
% 19.45/3.78 # Presaturation interreduction done
% 19.45/3.78
% 19.45/3.78 # Proof found!
% 19.45/3.78 # SZS status Theorem
% 19.45/3.78 # SZS output start CNFRefutation
% See solution above
% 19.45/3.78 # Training examples: 0 positive, 0 negative
% 19.45/3.78
% 19.45/3.78 # -------------------------------------------------
% 19.45/3.78 # User time : 1.261 s
% 19.45/3.78 # System time : 0.139 s
% 19.45/3.78 # Total time : 1.400 s
% 19.45/3.78 # ...preprocessing : 1.226 s
% 19.45/3.78 # ...main loop : 0.173 s
% 19.45/3.78 # Maximum resident set size: 187216 pages
% 19.45/3.78
%------------------------------------------------------------------------------