TSTP Solution File: SWV235+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV235+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n010.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 7.85s 2.22s
% Output : CNFRefutation 7.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 17
% Syntax : Number of clauses : 49 ( 28 unt; 0 nHn; 38 RR)
% Number of literals : 89 ( 11 equ; 43 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 61 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
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/sandbox2/tmp/enigma-theBenchmark.p-210y_bhc/input.p',i_0_9) ).
cnf(i_0_5,plain,
xor(X1,X1) = id,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-210y_bhc/input.p',i_0_5) ).
cnf(i_0_8,plain,
( p(crypt(xor(km,xor(kp,X1)),X2))
| ~ p(X1)
| ~ p(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-210y_bhc/input.p',i_0_8) ).
cnf(i_0_25,plain,
p(crypt(xor(km,xor(imp,kp)),kek)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-210y_bhc/input.p',i_0_25) ).
cnf(i_0_4,plain,
xor(X1,id) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-210y_bhc/input.p',i_0_4) ).
cnf(i_0_1,plain,
xor(X1,X2) = xor(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-210y_bhc/input.p',i_0_1) ).
cnf(i_0_2,plain,
xor(xor(X1,X2),X3) = xor(X1,xor(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-210y_bhc/input.p',i_0_2) ).
cnf(i_0_14,plain,
( p(xor(X1,X2))
| ~ p(X2)
| ~ p(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-210y_bhc/input.p',i_0_14) ).
cnf(i_0_17,plain,
p(kp),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-210y_bhc/input.p',i_0_17) ).
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-210y_bhc/input.p',i_0_7) ).
cnf(i_0_27,plain,
p(exp),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-210y_bhc/input.p',i_0_27) ).
cnf(i_0_22,plain,
p(crypt(xor(km,pin),pp)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-210y_bhc/input.p',i_0_22) ).
cnf(i_0_21,plain,
p(pin),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-210y_bhc/input.p',i_0_21) ).
cnf(i_0_29,negated_conjecture,
~ p(crypt(pp,a)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-210y_bhc/input.p',i_0_29) ).
cnf(i_0_16,plain,
( p(crypt(X1,X2))
| ~ p(X1)
| ~ p(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-210y_bhc/input.p',i_0_16) ).
cnf(i_0_28,plain,
p(a),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-210y_bhc/input.p',i_0_28) ).
cnf(i_0_15,plain,
( p(X1)
| ~ p(X2)
| ~ p(crypt(X2,X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-210y_bhc/input.p',i_0_15) ).
cnf(c_0_47,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_48,plain,
xor(X1,X1) = id,
i_0_5 ).
cnf(c_0_49,plain,
( p(crypt(xor(km,xor(kp,X1)),X2))
| ~ p(X1)
| ~ p(X2) ),
i_0_8 ).
cnf(c_0_50,plain,
( p(crypt(xor(km,xor(X1,kp)),id))
| ~ p(X2)
| ~ p(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).
cnf(c_0_51,plain,
p(crypt(xor(km,xor(imp,kp)),kek)),
i_0_25 ).
cnf(c_0_52,plain,
xor(X1,id) = X1,
i_0_4 ).
cnf(c_0_53,plain,
xor(X1,X2) = xor(X2,X1),
i_0_1 ).
cnf(c_0_54,plain,
( p(crypt(xor(km,xor(X1,kp)),id))
| ~ p(X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_55,plain,
xor(xor(X1,X2),X3) = xor(X1,xor(X2,X3)),
i_0_2 ).
cnf(c_0_56,plain,
xor(id,X1) = X1,
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_57,plain,
( p(crypt(xor(km,xor(kp,X1)),id))
| ~ p(X1) ),
inference(spm,[status(thm)],[c_0_54,c_0_53]) ).
cnf(c_0_58,plain,
xor(X1,xor(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_48]),c_0_56]) ).
cnf(c_0_59,plain,
( p(crypt(xor(km,X1),id))
| ~ p(xor(kp,X1)) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_60,plain,
xor(X1,xor(X2,X3)) = xor(X2,xor(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_53]),c_0_55]) ).
cnf(c_0_61,plain,
( p(crypt(X1,id))
| ~ p(xor(km,xor(kp,X1))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_58]),c_0_60]) ).
cnf(c_0_62,plain,
( p(xor(X1,X2))
| ~ p(X2)
| ~ p(X1) ),
i_0_14 ).
cnf(c_0_63,plain,
( p(crypt(X1,id))
| ~ p(xor(km,xor(X1,kp))) ),
inference(spm,[status(thm)],[c_0_61,c_0_53]) ).
cnf(c_0_64,plain,
( p(xor(X1,xor(X2,X3)))
| ~ p(xor(X1,X2))
| ~ p(X3) ),
inference(spm,[status(thm)],[c_0_62,c_0_55]) ).
cnf(c_0_65,plain,
p(kp),
i_0_17 ).
cnf(c_0_66,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_67,plain,
( p(crypt(X1,id))
| ~ p(xor(km,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65])]) ).
cnf(c_0_68,plain,
p(exp),
i_0_27 ).
cnf(c_0_69,plain,
( p(crypt(X1,X2))
| ~ p(crypt(xor(km,X1),X2))
| ~ p(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_56]),c_0_58]),c_0_68])]) ).
cnf(c_0_70,plain,
p(crypt(xor(km,pin),pp)),
i_0_22 ).
cnf(c_0_71,plain,
p(pin),
i_0_21 ).
cnf(c_0_72,negated_conjecture,
~ p(crypt(pp,a)),
i_0_29 ).
cnf(c_0_73,plain,
( p(crypt(X1,X2))
| ~ p(X1)
| ~ p(X2) ),
i_0_16 ).
cnf(c_0_74,plain,
p(a),
i_0_28 ).
cnf(c_0_75,plain,
( p(X1)
| ~ p(X2)
| ~ p(crypt(X2,X1)) ),
i_0_15 ).
cnf(c_0_76,plain,
p(crypt(pin,pp)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_71])]) ).
cnf(c_0_77,negated_conjecture,
~ p(pp),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_74])]) ).
cnf(c_0_78,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_71])]),c_0_77]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.12 % Problem : SWV235+1 : TPTP v8.1.0. Released v3.2.0.
% 0.05/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n010.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 : Tue Jun 14 19:40:41 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.85/2.22 # ENIGMATIC: Solved by autoschedule:
% 7.85/2.22 # No SInE strategy applied
% 7.85/2.22 # Trying AutoSched0 for 150 seconds
% 7.85/2.22 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S070I
% 7.85/2.22 # and selection function SelectVGNonCR.
% 7.85/2.22 #
% 7.85/2.22 # Preprocessing time : 0.022 s
% 7.85/2.22 # Presaturation interreduction done
% 7.85/2.22
% 7.85/2.22 # Proof found!
% 7.85/2.22 # SZS status Theorem
% 7.85/2.22 # SZS output start CNFRefutation
% See solution above
% 7.85/2.22 # Training examples: 0 positive, 0 negative
% 7.85/2.22
% 7.85/2.22 # -------------------------------------------------
% 7.85/2.22 # User time : 0.081 s
% 7.85/2.22 # System time : 0.005 s
% 7.85/2.22 # Total time : 0.087 s
% 7.85/2.22 # Maximum resident set size: 7120 pages
% 7.85/2.22
%------------------------------------------------------------------------------