TSTP Solution File: SWW949+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SWW949+1 : TPTP v8.1.2. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n012.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 4.04s 4.10s
% Output : CNFRefutation 4.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 48
% Syntax : Number of formulae : 100 ( 36 unt; 32 typ; 0 def)
% Number of atoms : 115 ( 20 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 86 ( 39 ~; 37 |; 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 : 23 ( 17 >; 6 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 29 ( 29 usr; 15 con; 0-2 aty)
% Number of variables : 93 ( 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_objective: $i ).
tff(decl_30,type,
name_r1: $i ).
tff(decl_31,type,
name_r1_from_1st: $i ).
tff(decl_32,type,
name_r2_from_1st: $i ).
tff(decl_33,type,
name_t: $i ).
tff(decl_34,type,
name_u: $i ).
tff(decl_35,type,
constr_xor: ( $i * $i ) > $i ).
tff(decl_36,type,
pred_attacker: $i > $o ).
tff(decl_37,type,
tuple_true: $i ).
tff(decl_38,type,
tuple_knowledge_from_1st_round_out_3: $i > $i ).
tff(decl_39,type,
tuple_knowledge_from_1st_round_out_2: ( $i * $i ) > $i ).
tff(decl_40,type,
tuple_knowledge_from_1st_round_out_1: $i > $i ).
tff(decl_41,type,
tuple_false: $i ).
tff(decl_42,type,
constr_f: ( $i * $i ) > $i ).
tff(decl_43,type,
constr_cyc_shr_quart_len: $i > $i ).
tff(decl_44,type,
constr_cyc_shr_half_len: $i > $i ).
tff(decl_45,type,
constr_cyc_shl_quart_len: $i > $i ).
tff(decl_46,type,
constr_cyc_shl_half_len: $i > $i ).
tff(decl_47,type,
tuple_R_out_4: $i > $i ).
tff(decl_48,type,
tuple_R_out_3: $i > $i ).
tff(decl_49,type,
tuple_R_out_1: $i > $i ).
tff(decl_50,type,
tuple_R_in_2: ( $i * $i ) > $i ).
tff(decl_51,type,
pred_mess: ( $i * $i ) > $o ).
tff(decl_52,type,
pred_equal: ( $i * $i ) > $o ).
tff(decl_53,type,
name_new0x2Dname: $i > $i ).
fof(ax79,axiom,
! [X2] : constr_xor(X2,constr_ZERO) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax79) ).
fof(ax80,axiom,
! [X3,X4] : constr_xor(X3,X4) = constr_xor(X4,X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax80) ).
fof(ax81,axiom,
! [X5,X6,X7] : constr_xor(X5,constr_xor(X6,X7)) = constr_xor(constr_xor(X5,X6),X7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax81) ).
fof(ax78,axiom,
! [X1] : constr_xor(X1,X1) = constr_ZERO,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax78) ).
fof(ax122,axiom,
! [X45] :
( pred_attacker(tuple_R_in_2(X45,constr_f(constr_xor(name_r1,constr_xor(X45,name_t)),name_t)))
=> pred_attacker(tuple_R_out_4(name_objective)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax122) ).
fof(ax104,axiom,
! [X32,X33] :
( ( pred_attacker(X32)
& pred_attacker(X33) )
=> pred_attacker(tuple_R_in_2(X32,X33)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax104) ).
fof(ax82,axiom,
! [X8,X9] :
( ( pred_attacker(X8)
& pred_attacker(X9) )
=> pred_attacker(constr_xor(X8,X9)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax82) ).
fof(ax88,axiom,
! [X16,X17] :
( pred_attacker(tuple_knowledge_from_1st_round_out_2(X16,X17))
=> pred_attacker(X17) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax88) ).
fof(ax118,axiom,
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/sandbox2/benchmark/theBenchmark.p',ax118) ).
fof(ax87,axiom,
! [X14,X15] :
( pred_attacker(tuple_knowledge_from_1st_round_out_2(X14,X15))
=> pred_attacker(X14) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax87) ).
fof(ax103,axiom,
! [X31] :
( pred_attacker(tuple_R_out_1(X31))
=> pred_attacker(X31) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax103) ).
fof(ax90,axiom,
! [X19] :
( pred_attacker(tuple_knowledge_from_1st_round_out_1(X19))
=> pred_attacker(X19) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax90) ).
fof(ax120,axiom,
pred_attacker(tuple_R_out_1(name_r1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax120) ).
fof(ax117,axiom,
pred_attacker(tuple_knowledge_from_1st_round_out_1(name_r1_from_1st)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax117) ).
fof(ax99,axiom,
! [X27] :
( pred_attacker(tuple_R_out_4(X27))
=> pred_attacker(X27) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax99) ).
fof(co0,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co0) ).
fof(c_0_16,plain,
! [X47] : constr_xor(X47,constr_ZERO) = X47,
inference(variable_rename,[status(thm)],[ax79]) ).
fof(c_0_17,plain,
! [X48,X49] : constr_xor(X48,X49) = constr_xor(X49,X48),
inference(variable_rename,[status(thm)],[ax80]) ).
fof(c_0_18,plain,
! [X50,X51,X52] : constr_xor(X50,constr_xor(X51,X52)) = constr_xor(constr_xor(X50,X51),X52),
inference(variable_rename,[status(thm)],[ax81]) ).
fof(c_0_19,plain,
! [X46] : constr_xor(X46,X46) = constr_ZERO,
inference(variable_rename,[status(thm)],[ax78]) ).
cnf(c_0_20,plain,
constr_xor(X1,constr_ZERO) = X1,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
constr_xor(X1,X2) = constr_xor(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
constr_xor(X1,constr_xor(X2,X3)) = constr_xor(constr_xor(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
constr_xor(X1,X1) = constr_ZERO,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,plain,
constr_xor(constr_ZERO,X1) = X1,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
fof(c_0_25,plain,
! [X90] :
( ~ pred_attacker(tuple_R_in_2(X90,constr_f(constr_xor(name_r1,constr_xor(X90,name_t)),name_t)))
| pred_attacker(tuple_R_out_4(name_objective)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax122])]) ).
fof(c_0_26,plain,
! [X77,X78] :
( ~ pred_attacker(X77)
| ~ pred_attacker(X78)
| pred_attacker(tuple_R_in_2(X77,X78)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax104])]) ).
cnf(c_0_27,plain,
constr_xor(X1,constr_xor(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_28,plain,
constr_xor(X1,constr_xor(X2,constr_xor(X1,X2))) = constr_ZERO,
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_29,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))) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,plain,
( pred_attacker(tuple_R_in_2(X1,X2))
| ~ pred_attacker(X1)
| ~ pred_attacker(X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,plain,
constr_xor(X1,constr_xor(X2,X3)) = constr_xor(X2,constr_xor(X3,X1)),
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_32,plain,
constr_xor(X1,constr_xor(X2,X1)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_20]) ).
fof(c_0_33,plain,
! [X53,X54] :
( ~ pred_attacker(X53)
| ~ pred_attacker(X54)
| pred_attacker(constr_xor(X53,X54)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])]) ).
cnf(c_0_34,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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_35,plain,
constr_xor(X1,constr_xor(X2,constr_xor(X1,X3))) = constr_xor(X2,X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_32]),c_0_22]) ).
fof(c_0_36,plain,
! [X61,X62] :
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X61,X62))
| pred_attacker(X62) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax88])]) ).
cnf(c_0_37,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))),
inference(split_conjunct,[status(thm)],[ax118]) ).
cnf(c_0_38,plain,
( pred_attacker(constr_xor(X1,X2))
| ~ pred_attacker(X1)
| ~ pred_attacker(X2) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_39,plain,
( pred_attacker(tuple_R_out_4(name_objective))
| ~ pred_attacker(constr_f(constr_xor(name_t,constr_xor(X1,X2)),name_t))
| ~ pred_attacker(constr_xor(X1,constr_xor(name_r1,X2))) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
constr_xor(X1,constr_xor(X2,constr_xor(X3,X1))) = constr_xor(X2,X3),
inference(spm,[status(thm)],[c_0_32,c_0_22]) ).
cnf(c_0_41,plain,
constr_xor(X1,constr_xor(X2,X3)) = constr_xor(X3,constr_xor(X2,X1)),
inference(spm,[status(thm)],[c_0_31,c_0_21]) ).
cnf(c_0_42,plain,
( pred_attacker(X2)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_43,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_37,c_0_21]) ).
cnf(c_0_44,plain,
( pred_attacker(X1)
| ~ pred_attacker(constr_xor(X2,X1))
| ~ pred_attacker(X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_27]) ).
cnf(c_0_45,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_38,c_0_22]) ).
fof(c_0_46,plain,
! [X59,X60] :
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X59,X60))
| pred_attacker(X59) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax87])]) ).
fof(c_0_47,plain,
! [X76] :
( ~ pred_attacker(tuple_R_out_1(X76))
| pred_attacker(X76) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax103])]) ).
fof(c_0_48,plain,
! [X64] :
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_1(X64))
| pred_attacker(X64) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax90])]) ).
cnf(c_0_49,plain,
( pred_attacker(tuple_R_out_4(name_objective))
| ~ pred_attacker(constr_xor(X1,constr_xor(name_t,constr_xor(X2,name_r1))))
| ~ pred_attacker(constr_f(constr_xor(X1,X2),name_t)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_50,plain,
pred_attacker(constr_f(constr_xor(name_r2_from_1st,name_r1_from_1st),name_t)),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_51,plain,
( pred_attacker(constr_xor(X1,X2))
| ~ pred_attacker(constr_xor(X3,X1))
| ~ pred_attacker(X3)
| ~ pred_attacker(X2) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_52,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_53,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_R_out_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_54,plain,
pred_attacker(tuple_R_out_1(name_r1)),
inference(split_conjunct,[status(thm)],[ax120]) ).
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_48]) ).
cnf(c_0_56,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_1(name_r1_from_1st)),
inference(split_conjunct,[status(thm)],[ax117]) ).
fof(c_0_57,plain,
! [X72] :
( ~ pred_attacker(tuple_R_out_4(X72))
| pred_attacker(X72) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax99])]) ).
cnf(c_0_58,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(spm,[status(thm)],[c_0_49,c_0_50]),c_0_21]),c_0_31]),c_0_22]),c_0_21]) ).
cnf(c_0_59,plain,
( pred_attacker(constr_xor(X1,constr_xor(X2,constr_xor(X3,X4))))
| ~ pred_attacker(constr_xor(X1,X3))
| ~ pred_attacker(X2)
| ~ pred_attacker(X4) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_35]),c_0_22]),c_0_22]) ).
cnf(c_0_60,plain,
pred_attacker(constr_xor(name_t,name_r2_from_1st)),
inference(spm,[status(thm)],[c_0_52,c_0_43]) ).
cnf(c_0_61,plain,
pred_attacker(name_r1),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_62,plain,
pred_attacker(name_r1_from_1st),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
fof(c_0_63,negated_conjecture,
~ pred_attacker(name_objective),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co0])]) ).
cnf(c_0_64,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_R_out_4(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_65,plain,
pred_attacker(tuple_R_out_4(name_objective)),
inference(cn,[status(thm)],[inference(rw,[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_62])]) ).
cnf(c_0_66,negated_conjecture,
~ pred_attacker(name_objective),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_67,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWW949+1 : TPTP v8.1.2. Released v7.4.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34 % Computer : n012.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sun Aug 27 20:16:40 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.20/0.57 start to proof: theBenchmark
% 4.04/4.10 % Version : CSE_E---1.5
% 4.04/4.10 % Problem : theBenchmark.p
% 4.04/4.10 % Proof found
% 4.04/4.10 % SZS status Theorem for theBenchmark.p
% 4.04/4.10 % SZS output start Proof
% See solution above
% 4.04/4.11 % Total time : 3.522000 s
% 4.04/4.11 % SZS output end Proof
% 4.04/4.11 % Total time : 3.525000 s
%------------------------------------------------------------------------------