TSTP Solution File: SWW948+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SWW948+1 : TPTP v8.1.2. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n028.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 : 300s
% DateTime : Fri Sep 1 00:19:18 EDT 2023
% Result : Theorem 0.21s 0.66s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 43
% Syntax : Number of formulae : 88 ( 32 unt; 27 typ; 0 def)
% Number of atoms : 99 ( 15 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 70 ( 32 ~; 28 |; 2 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 18 ( 13 >; 5 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 24 ( 24 usr; 14 con; 0-2 aty)
% Number of variables : 67 ( 2 sgn; 38 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
constr_CONST_0x30: $i ).
tff(decl_23,type,
constr_CONST_1: $i ).
tff(decl_24,type,
constr_CONST_2: $i ).
tff(decl_25,type,
constr_CONST_3: $i ).
tff(decl_26,type,
constr_CONST_4: $i ).
tff(decl_27,type,
constr_ZERO: $i ).
tff(decl_28,type,
name_c: $i ).
tff(decl_29,type,
name_k: $i ).
tff(decl_30,type,
name_objective_R: $i ).
tff(decl_31,type,
name_r0x30: $i ).
tff(decl_32,type,
name_r0x30_from_1st: $i ).
tff(decl_33,type,
name_r1_from_1st: $i ).
tff(decl_34,type,
constr_xor: ( $i * $i ) > $i ).
tff(decl_35,type,
pred_attacker: $i > $o ).
tff(decl_36,type,
tuple_true: $i ).
tff(decl_37,type,
tuple_knowledge_from_1st_round_out_3: $i > $i ).
tff(decl_38,type,
tuple_knowledge_from_1st_round_out_2: ( $i * $i ) > $i ).
tff(decl_39,type,
tuple_knowledge_from_1st_round_out_1: $i > $i ).
tff(decl_40,type,
constr_h: $i > $i ).
tff(decl_41,type,
tuple_false: $i ).
tff(decl_42,type,
tuple_R_out_4: $i > $i ).
tff(decl_43,type,
tuple_R_out_3: $i > $i ).
tff(decl_44,type,
tuple_R_out_1: $i > $i ).
tff(decl_45,type,
tuple_R_in_2: ( $i * $i ) > $i ).
tff(decl_46,type,
pred_mess: ( $i * $i ) > $o ).
tff(decl_47,type,
pred_equal: ( $i * $i ) > $o ).
tff(decl_48,type,
name_new0x2Dname: $i > $i ).
fof(ax106,axiom,
! [X40] :
( pred_attacker(tuple_R_in_2(X40,constr_h(constr_xor(constr_xor(name_r0x30,X40),name_k))))
=> pred_attacker(tuple_R_out_4(name_objective_R)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax106) ).
fof(ax69,axiom,
! [X5,X6,X7] : constr_xor(X5,constr_xor(X6,X7)) = constr_xor(constr_xor(X5,X6),X7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax69) ).
fof(ax88,axiom,
! [X27,X28] :
( ( pred_attacker(X27)
& pred_attacker(X28) )
=> pred_attacker(tuple_R_in_2(X27,X28)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax88) ).
fof(ax68,axiom,
! [X3,X4] : constr_xor(X3,X4) = constr_xor(X4,X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax68) ).
fof(ax67,axiom,
! [X2] : constr_xor(X2,constr_ZERO) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax67) ).
fof(ax66,axiom,
! [X1] : constr_xor(X1,X1) = constr_ZERO,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax66) ).
fof(ax76,axiom,
! [X16,X17] :
( pred_attacker(tuple_knowledge_from_1st_round_out_2(X16,X17))
=> pred_attacker(X17) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax76) ).
fof(ax102,axiom,
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/benchmark/theBenchmark.p',ax102) ).
fof(ax83,axiom,
! [X22] :
( pred_attacker(tuple_R_out_4(X22))
=> pred_attacker(X22) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax83) ).
fof(co0,conjecture,
pred_attacker(name_objective_R),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co0) ).
fof(ax87,axiom,
! [X26] :
( pred_attacker(tuple_R_out_1(X26))
=> pred_attacker(X26) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax87) ).
fof(ax70,axiom,
! [X8,X9] :
( ( pred_attacker(X8)
& pred_attacker(X9) )
=> pred_attacker(constr_xor(X8,X9)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax70) ).
fof(ax104,axiom,
pred_attacker(tuple_R_out_1(name_r0x30)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax104) ).
fof(ax75,axiom,
! [X14,X15] :
( pred_attacker(tuple_knowledge_from_1st_round_out_2(X14,X15))
=> pred_attacker(X14) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax75) ).
fof(ax78,axiom,
! [X19] :
( pred_attacker(tuple_knowledge_from_1st_round_out_1(X19))
=> pred_attacker(X19) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax78) ).
fof(ax101,axiom,
pred_attacker(tuple_knowledge_from_1st_round_out_1(name_r0x30_from_1st)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax101) ).
fof(c_0_16,plain,
! [X80] :
( ~ pred_attacker(tuple_R_in_2(X80,constr_h(constr_xor(constr_xor(name_r0x30,X80),name_k))))
| pred_attacker(tuple_R_out_4(name_objective_R)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax106])]) ).
fof(c_0_17,plain,
! [X45,X46,X47] : constr_xor(X45,constr_xor(X46,X47)) = constr_xor(constr_xor(X45,X46),X47),
inference(variable_rename,[status(thm)],[ax69]) ).
cnf(c_0_18,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)))) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,plain,
constr_xor(X1,constr_xor(X2,X3)) = constr_xor(constr_xor(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_20,plain,
! [X67,X68] :
( ~ pred_attacker(X67)
| ~ pred_attacker(X68)
| pred_attacker(tuple_R_in_2(X67,X68)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax88])]) ).
fof(c_0_21,plain,
! [X43,X44] : constr_xor(X43,X44) = constr_xor(X44,X43),
inference(variable_rename,[status(thm)],[ax68]) ).
fof(c_0_22,plain,
! [X42] : constr_xor(X42,constr_ZERO) = X42,
inference(variable_rename,[status(thm)],[ax67]) ).
cnf(c_0_23,plain,
( pred_attacker(tuple_R_out_4(name_objective_R))
| ~ pred_attacker(tuple_R_in_2(X1,constr_h(constr_xor(name_r0x30,constr_xor(X1,name_k))))) ),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
( pred_attacker(tuple_R_in_2(X1,X2))
| ~ pred_attacker(X1)
| ~ pred_attacker(X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,plain,
constr_xor(X1,X2) = constr_xor(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_26,plain,
! [X41] : constr_xor(X41,X41) = constr_ZERO,
inference(variable_rename,[status(thm)],[ax66]) ).
cnf(c_0_27,plain,
constr_xor(X1,constr_ZERO) = X1,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_28,plain,
! [X56,X57] :
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X56,X57))
| pred_attacker(X57) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax76])]) ).
cnf(c_0_29,plain,
( pred_attacker(tuple_R_out_4(name_objective_R))
| ~ pred_attacker(constr_h(constr_xor(name_r0x30,constr_xor(X1,name_k))))
| ~ pred_attacker(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
constr_xor(X1,constr_xor(X2,X3)) = constr_xor(X2,constr_xor(X3,X1)),
inference(spm,[status(thm)],[c_0_19,c_0_25]) ).
cnf(c_0_31,plain,
constr_xor(X1,X1) = constr_ZERO,
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_32,plain,
constr_xor(constr_ZERO,X1) = X1,
inference(spm,[status(thm)],[c_0_27,c_0_25]) ).
cnf(c_0_33,plain,
( pred_attacker(X2)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_34,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)))),
inference(split_conjunct,[status(thm)],[ax102]) ).
cnf(c_0_35,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_29,c_0_30]) ).
cnf(c_0_36,plain,
constr_xor(X1,constr_xor(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_31]),c_0_32]) ).
cnf(c_0_37,plain,
pred_attacker(constr_h(constr_xor(constr_xor(name_r0x30_from_1st,name_r1_from_1st),name_k))),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
fof(c_0_38,plain,
! [X62] :
( ~ pred_attacker(tuple_R_out_4(X62))
| pred_attacker(X62) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])]) ).
cnf(c_0_39,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_35,c_0_36]) ).
cnf(c_0_40,plain,
pred_attacker(constr_h(constr_xor(name_k,constr_xor(name_r0x30_from_1st,name_r1_from_1st)))),
inference(spm,[status(thm)],[c_0_37,c_0_25]) ).
fof(c_0_41,negated_conjecture,
~ pred_attacker(name_objective_R),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co0])]) ).
fof(c_0_42,plain,
! [X66] :
( ~ pred_attacker(tuple_R_out_1(X66))
| pred_attacker(X66) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax87])]) ).
cnf(c_0_43,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_R_out_4(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_44,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_39,c_0_40]) ).
cnf(c_0_45,negated_conjecture,
~ pred_attacker(name_objective_R),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
fof(c_0_46,plain,
! [X48,X49] :
( ~ pred_attacker(X48)
| ~ pred_attacker(X49)
| pred_attacker(constr_xor(X48,X49)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax70])]) ).
cnf(c_0_47,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_R_out_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_48,plain,
pred_attacker(tuple_R_out_1(name_r0x30)),
inference(split_conjunct,[status(thm)],[ax104]) ).
fof(c_0_49,plain,
! [X54,X55] :
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X54,X55))
| pred_attacker(X54) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax75])]) ).
fof(c_0_50,plain,
! [X59] :
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_1(X59))
| pred_attacker(X59) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax78])]) ).
cnf(c_0_51,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_43,c_0_44]),c_0_45]) ).
cnf(c_0_52,plain,
( pred_attacker(constr_xor(X1,X2))
| ~ pred_attacker(X1)
| ~ pred_attacker(X2) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_53,plain,
pred_attacker(name_r0x30),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_54,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_55,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_56,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_1(name_r0x30_from_1st)),
inference(split_conjunct,[status(thm)],[ax101]) ).
cnf(c_0_57,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_51,c_0_52]),c_0_53])]) ).
cnf(c_0_58,plain,
pred_attacker(name_r1_from_1st),
inference(spm,[status(thm)],[c_0_54,c_0_34]) ).
cnf(c_0_59,plain,
pred_attacker(name_r0x30_from_1st),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_60,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_52]),c_0_58]),c_0_59])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWW948+1 : TPTP v8.1.2. Released v7.4.0.
% 0.00/0.14 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.15/0.34 % Computer : n028.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Sun Aug 27 21:00:54 EDT 2023
% 0.15/0.34 % CPUTime :
% 0.21/0.58 start to proof: theBenchmark
% 0.21/0.66 % Version : CSE_E---1.5
% 0.21/0.66 % Problem : theBenchmark.p
% 0.21/0.66 % Proof found
% 0.21/0.66 % SZS status Theorem for theBenchmark.p
% 0.21/0.66 % SZS output start Proof
% See solution above
% 0.21/0.66 % Total time : 0.071000 s
% 0.21/0.66 % SZS output end Proof
% 0.21/0.66 % Total time : 0.074000 s
%------------------------------------------------------------------------------