TSTP Solution File: SWV236+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV236+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n008.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 9.57s 2.61s
% Output : CNFRefutation 9.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 26 ( 14 unt; 0 nHn; 22 RR)
% Number of literals : 45 ( 4 equ; 22 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_7,plain,
( p(crypt(xor(X1,X2),X3))
| ~ p(X2)
| ~ p(crypt(xor(km,X2),X3))
| ~ p(crypt(xor(km,exp),X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-shnj_o2y/lgb.p',i_0_7) ).
cnf(i_0_4,plain,
xor(X1,id) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-shnj_o2y/lgb.p',i_0_4) ).
cnf(i_0_21,plain,
p(id),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-shnj_o2y/lgb.p',i_0_21) ).
cnf(i_0_17,plain,
( p(crypt(X1,X2))
| ~ p(crypt(xor(X1,data),X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-shnj_o2y/lgb.p',i_0_17) ).
cnf(i_0_25,plain,
p(crypt(xor(km,data),eurk)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-shnj_o2y/lgb.p',i_0_25) ).
cnf(i_0_12,plain,
( p(decrypt(X1,X2))
| ~ p(X2)
| ~ p(crypt(xor(km,data),X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-shnj_o2y/lgb.p',i_0_12) ).
cnf(i_0_3,plain,
decrypt(X1,crypt(X1,X2)) = X2,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-shnj_o2y/lgb.p',i_0_3) ).
cnf(i_0_24,plain,
p(crypt(xor(km,exp),eurk)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-shnj_o2y/lgb.p',i_0_24) ).
cnf(i_0_28,negated_conjecture,
( ~ p(X1)
| ~ p(crypt(xor(km,exp),X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-shnj_o2y/lgb.p',i_0_28) ).
cnf(c_0_38,plain,
( p(crypt(xor(X1,X2),X3))
| ~ p(X2)
| ~ p(crypt(xor(km,X2),X3))
| ~ p(crypt(xor(km,exp),X1)) ),
i_0_7 ).
cnf(c_0_39,plain,
xor(X1,id) = X1,
i_0_4 ).
cnf(c_0_40,plain,
p(id),
i_0_21 ).
cnf(c_0_41,plain,
( p(crypt(X1,X2))
| ~ p(crypt(xor(X1,data),X2)) ),
i_0_17 ).
cnf(c_0_42,plain,
p(crypt(xor(km,data),eurk)),
i_0_25 ).
cnf(c_0_43,plain,
( p(decrypt(X1,X2))
| ~ p(X2)
| ~ p(crypt(xor(km,data),X1)) ),
i_0_12 ).
cnf(c_0_44,plain,
( p(crypt(X1,X2))
| ~ p(crypt(xor(km,exp),X1))
| ~ p(crypt(km,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_39]),c_0_40])]) ).
cnf(c_0_45,plain,
p(crypt(km,eurk)),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,plain,
( p(decrypt(eurk,X1))
| ~ p(X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_42]) ).
cnf(c_0_47,plain,
decrypt(X1,crypt(X1,X2)) = X2,
i_0_3 ).
cnf(c_0_48,plain,
( p(crypt(X1,eurk))
| ~ p(crypt(xor(km,exp),X1)) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_49,plain,
p(crypt(xor(km,exp),eurk)),
i_0_24 ).
cnf(c_0_50,negated_conjecture,
( ~ p(X1)
| ~ p(crypt(xor(km,exp),X1)) ),
i_0_28 ).
cnf(c_0_51,plain,
( p(X1)
| ~ p(crypt(eurk,X1)) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_52,plain,
p(crypt(eurk,eurk)),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_53,negated_conjecture,
~ p(eurk),
inference(spm,[status(thm)],[c_0_50,c_0_49]) ).
cnf(c_0_54,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWV236+1 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n008.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 : Tue Jun 14 22:22:09 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 9.57/2.61 # ENIGMATIC: Solved by autoschedule-lgb:
% 9.57/2.61 # No SInE strategy applied
% 9.57/2.61 # Trying AutoSched0 for 150 seconds
% 9.57/2.61 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S07EI
% 9.57/2.61 # and selection function SelectCQIArNTNpEqFirst.
% 9.57/2.61 #
% 9.57/2.61 # Preprocessing time : 0.023 s
% 9.57/2.61 # Presaturation interreduction done
% 9.57/2.61
% 9.57/2.61 # Proof found!
% 9.57/2.61 # SZS status Theorem
% 9.57/2.61 # SZS output start CNFRefutation
% See solution above
% 9.57/2.61 # Training examples: 0 positive, 0 negative
% 9.57/2.61
% 9.57/2.61 # -------------------------------------------------
% 9.57/2.61 # User time : 0.028 s
% 9.57/2.61 # System time : 0.006 s
% 9.57/2.61 # Total time : 0.034 s
% 9.57/2.61 # Maximum resident set size: 7124 pages
% 9.57/2.61
%------------------------------------------------------------------------------