TSTP Solution File: SWW950+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SWW950+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 : n001.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.20s 0.60s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 31
% Syntax : Number of formulae : 57 ( 8 unt; 22 typ; 0 def)
% Number of atoms : 73 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 69 ( 31 ~; 29 |; 2 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 14 ( 10 >; 4 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 12 con; 0-2 aty)
% Number of variables : 40 ( 10 sgn; 20 !; 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_k0x30: $i ).
tff(decl_30,type,
name_ki: $i ).
tff(decl_31,type,
name_objective: $i ).
tff(decl_32,type,
constr_xor: ( $i * $i ) > $i ).
tff(decl_33,type,
pred_attacker: $i > $o ).
tff(decl_34,type,
tuple_true: $i ).
tff(decl_35,type,
constr_h: $i > $i ).
tff(decl_36,type,
tuple_false: $i ).
tff(decl_37,type,
tuple_T_out_4: $i > $i ).
tff(decl_38,type,
tuple_T_out_2: $i > $i ).
tff(decl_39,type,
tuple_T_in_3: ( $i * $i ) > $i ).
tff(decl_40,type,
tuple_T_in_1: $i > $i ).
tff(decl_41,type,
pred_mess: ( $i * $i ) > $o ).
tff(decl_42,type,
pred_equal: ( $i * $i ) > $o ).
tff(decl_43,type,
name_new0x2Dname: $i > $i ).
fof(ax74,axiom,
! [X30,X31] :
( ( pred_attacker(tuple_T_in_3(X30,constr_h(constr_xor(X30,constr_xor(name_k0x30,name_ki)))))
& pred_attacker(tuple_T_in_1(X31)) )
=> pred_attacker(tuple_T_out_4(name_objective)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax74) ).
fof(ax58,axiom,
! [X15,X16] :
( ( pred_attacker(X15)
& pred_attacker(X16) )
=> pred_attacker(tuple_T_in_3(X15,X16)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax58) ).
fof(ax57,axiom,
! [X14] :
( pred_attacker(tuple_T_out_2(X14))
=> pred_attacker(X14) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax57) ).
fof(ax73,axiom,
! [X29] :
( pred_attacker(tuple_T_in_1(X29))
=> pred_attacker(tuple_T_out_2(constr_h(constr_xor(X29,constr_xor(name_k0x30,name_ki))))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax73) ).
fof(ax62,axiom,
! [X22] :
( pred_attacker(tuple_T_in_1(X22))
=> pred_attacker(X22) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax62) ).
fof(ax61,axiom,
! [X21] :
( pred_attacker(X21)
=> pred_attacker(tuple_T_in_1(X21)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax61) ).
fof(ax72,axiom,
! [X28] : pred_attacker(name_new0x2Dname(X28)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax72) ).
fof(ax55,axiom,
! [X12] :
( pred_attacker(tuple_T_out_4(X12))
=> pred_attacker(X12) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax55) ).
fof(co0,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co0) ).
fof(c_0_9,plain,
! [X61,X62] :
( ~ pred_attacker(tuple_T_in_3(X61,constr_h(constr_xor(X61,constr_xor(name_k0x30,name_ki)))))
| ~ pred_attacker(tuple_T_in_1(X62))
| pred_attacker(tuple_T_out_4(name_objective)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax74])]) ).
fof(c_0_10,plain,
! [X46,X47] :
( ~ pred_attacker(X46)
| ~ pred_attacker(X47)
| pred_attacker(tuple_T_in_3(X46,X47)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax58])]) ).
fof(c_0_11,plain,
! [X45] :
( ~ pred_attacker(tuple_T_out_2(X45))
| pred_attacker(X45) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])]) ).
fof(c_0_12,plain,
! [X60] :
( ~ pred_attacker(tuple_T_in_1(X60))
| pred_attacker(tuple_T_out_2(constr_h(constr_xor(X60,constr_xor(name_k0x30,name_ki))))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax73])]) ).
cnf(c_0_13,plain,
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(tuple_T_in_3(X1,constr_h(constr_xor(X1,constr_xor(name_k0x30,name_ki)))))
| ~ pred_attacker(tuple_T_in_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( pred_attacker(tuple_T_in_3(X1,X2))
| ~ pred_attacker(X1)
| ~ pred_attacker(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_T_out_2(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( pred_attacker(tuple_T_out_2(constr_h(constr_xor(X1,constr_xor(name_k0x30,name_ki)))))
| ~ pred_attacker(tuple_T_in_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_17,plain,
! [X53] :
( ~ pred_attacker(tuple_T_in_1(X53))
| pred_attacker(X53) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax62])]) ).
cnf(c_0_18,plain,
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(constr_h(constr_xor(X1,constr_xor(name_k0x30,name_ki))))
| ~ pred_attacker(tuple_T_in_1(X2))
| ~ pred_attacker(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
( pred_attacker(constr_h(constr_xor(X1,constr_xor(name_k0x30,name_ki))))
| ~ pred_attacker(tuple_T_in_1(X1)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_T_in_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_21,plain,
! [X52] :
( ~ pred_attacker(X52)
| pred_attacker(tuple_T_in_1(X52)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax61])]) ).
cnf(c_0_22,plain,
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(tuple_T_in_1(X1))
| ~ pred_attacker(tuple_T_in_1(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_23,plain,
( pred_attacker(tuple_T_in_1(X1))
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_24,plain,
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(tuple_T_in_1(X1))
| ~ pred_attacker(X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_25,plain,
! [X59] : pred_attacker(name_new0x2Dname(X59)),
inference(variable_rename,[status(thm)],[ax72]) ).
cnf(c_0_26,plain,
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(X1)
| ~ pred_attacker(X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_23]) ).
cnf(c_0_27,plain,
pred_attacker(name_new0x2Dname(X1)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_28,plain,
! [X43] :
( ~ pred_attacker(tuple_T_out_4(X43))
| pred_attacker(X43) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])]) ).
cnf(c_0_29,plain,
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
fof(c_0_30,negated_conjecture,
~ pred_attacker(name_objective),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co0])]) ).
cnf(c_0_31,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_T_out_4(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_32,plain,
pred_attacker(tuple_T_out_4(name_objective)),
inference(spm,[status(thm)],[c_0_29,c_0_27]) ).
cnf(c_0_33,negated_conjecture,
~ pred_attacker(name_objective),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_34,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWW950+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.16/0.34 % Computer : n001.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Sun Aug 27 18:53:33 EDT 2023
% 0.16/0.34 % CPUTime :
% 0.20/0.57 start to proof: theBenchmark
% 0.20/0.60 % Version : CSE_E---1.5
% 0.20/0.60 % Problem : theBenchmark.p
% 0.20/0.60 % Proof found
% 0.20/0.60 % SZS status Theorem for theBenchmark.p
% 0.20/0.60 % SZS output start Proof
% See solution above
% 0.20/0.61 % Total time : 0.021000 s
% 0.20/0.61 % SZS output end Proof
% 0.20/0.61 % Total time : 0.024000 s
%------------------------------------------------------------------------------