TSTP Solution File: SWW956+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SWW956+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 : n021.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:20 EDT 2023
% Result : Theorem 0.20s 0.58s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 38
% Syntax : Number of formulae : 63 ( 14 unt; 28 typ; 0 def)
% Number of atoms : 60 ( 3 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 47 ( 22 ~; 18 |; 1 &)
% ( 0 <=>; 6 =>; 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 ( 15 >; 8 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 25 ( 25 usr; 13 con; 0-2 aty)
% Number of variables : 34 ( 1 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,
name_G_8: $i ).
tff(decl_28,type,
name_Na: $i ).
tff(decl_29,type,
name_Nb: $i ).
tff(decl_30,type,
name_P_7: $i ).
tff(decl_31,type,
name_c: $i ).
tff(decl_32,type,
name_objective: $i ).
tff(decl_33,type,
constr_enc: ( $i * $i ) > $i ).
tff(decl_34,type,
constr_dec: ( $i * $i ) > $i ).
tff(decl_35,type,
constr_exp: ( $i * $i ) > $i ).
tff(decl_36,type,
constr_mod: ( $i * $i ) > $i ).
tff(decl_37,type,
tuple_true: $i ).
tff(decl_38,type,
pred_attacker: $i > $o ).
tff(decl_39,type,
tuple_false: $i ).
tff(decl_40,type,
tuple_B_out_3: $i > $i ).
tff(decl_41,type,
tuple_B_in_2: $i > $i ).
tff(decl_42,type,
tuple_B_in_1: ( $i * $i ) > $i ).
tff(decl_43,type,
tuple_A_out_4: $i > $i ).
tff(decl_44,type,
tuple_A_out_2: $i > $i ).
tff(decl_45,type,
tuple_A_out_1: ( $i * $i ) > $i ).
tff(decl_46,type,
tuple_A_in_3: $i > $i ).
tff(decl_47,type,
pred_mess: ( $i * $i ) > $o ).
tff(decl_48,type,
pred_equal: ( $i * $i ) > $o ).
tff(decl_49,type,
name_new0x2Dname: $i > $i ).
fof(ax62,axiom,
! [X13,X14] :
( ( pred_attacker(X13)
& pred_attacker(X14) )
=> pred_attacker(constr_dec(X13,X14)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax62) ).
fof(ax55,axiom,
! [X1,X2] : constr_dec(constr_enc(X2,X1),X1) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax55) ).
fof(ax76,axiom,
! [X26] :
( pred_attacker(tuple_A_out_4(X26))
=> pred_attacker(X26) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax76) ).
fof(ax91,axiom,
! [X43] :
( pred_attacker(tuple_A_in_3(X43))
=> pred_attacker(tuple_A_out_4(constr_enc(name_objective,constr_mod(constr_exp(X43,name_Na),name_P_7)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax91) ).
fof(co0,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co0) ).
fof(ax78,axiom,
! [X28] :
( pred_attacker(tuple_A_out_2(X28))
=> pred_attacker(X28) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax78) ).
fof(ax90,axiom,
pred_attacker(tuple_A_out_2(constr_mod(constr_exp(name_G_8,name_Na),name_P_7))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax90) ).
fof(ax81,axiom,
! [X33,X34] :
( pred_attacker(tuple_A_out_1(X33,X34))
=> pred_attacker(X34) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax81) ).
fof(ax82,axiom,
! [X35] :
( pred_attacker(X35)
=> pred_attacker(tuple_A_in_3(X35)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax82) ).
fof(ax89,axiom,
pred_attacker(tuple_A_out_1(name_P_7,name_G_8)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax89) ).
fof(c_0_10,plain,
! [X59,X60] :
( ~ pred_attacker(X59)
| ~ pred_attacker(X60)
| pred_attacker(constr_dec(X59,X60)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax62])]) ).
fof(c_0_11,plain,
! [X47,X48] : constr_dec(constr_enc(X48,X47),X47) = X48,
inference(variable_rename,[status(thm)],[ax55]) ).
fof(c_0_12,plain,
! [X72] :
( ~ pred_attacker(tuple_A_out_4(X72))
| pred_attacker(X72) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax76])]) ).
fof(c_0_13,plain,
! [X89] :
( ~ pred_attacker(tuple_A_in_3(X89))
| pred_attacker(tuple_A_out_4(constr_enc(name_objective,constr_mod(constr_exp(X89,name_Na),name_P_7)))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax91])]) ).
cnf(c_0_14,plain,
( pred_attacker(constr_dec(X1,X2))
| ~ pred_attacker(X1)
| ~ pred_attacker(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
constr_dec(constr_enc(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_A_out_4(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( pred_attacker(tuple_A_out_4(constr_enc(name_objective,constr_mod(constr_exp(X1,name_Na),name_P_7))))
| ~ pred_attacker(tuple_A_in_3(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,negated_conjecture,
~ pred_attacker(name_objective),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co0])]) ).
fof(c_0_19,plain,
! [X74] :
( ~ pred_attacker(tuple_A_out_2(X74))
| pred_attacker(X74) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax78])]) ).
cnf(c_0_20,plain,
( pred_attacker(X1)
| ~ pred_attacker(constr_enc(X1,X2))
| ~ pred_attacker(X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
( pred_attacker(constr_enc(name_objective,constr_mod(constr_exp(X1,name_Na),name_P_7)))
| ~ pred_attacker(tuple_A_in_3(X1)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,negated_conjecture,
~ pred_attacker(name_objective),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_A_out_2(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,plain,
pred_attacker(tuple_A_out_2(constr_mod(constr_exp(name_G_8,name_Na),name_P_7))),
inference(split_conjunct,[status(thm)],[ax90]) ).
fof(c_0_25,plain,
! [X79,X80] :
( ~ pred_attacker(tuple_A_out_1(X79,X80))
| pred_attacker(X80) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])]) ).
cnf(c_0_26,plain,
( ~ pred_attacker(constr_mod(constr_exp(X1,name_Na),name_P_7))
| ~ pred_attacker(tuple_A_in_3(X1)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_27,plain,
pred_attacker(constr_mod(constr_exp(name_G_8,name_Na),name_P_7)),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
fof(c_0_28,plain,
! [X81] :
( ~ pred_attacker(X81)
| pred_attacker(tuple_A_in_3(X81)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])]) ).
cnf(c_0_29,plain,
( pred_attacker(X2)
| ~ pred_attacker(tuple_A_out_1(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,plain,
pred_attacker(tuple_A_out_1(name_P_7,name_G_8)),
inference(split_conjunct,[status(thm)],[ax89]) ).
cnf(c_0_31,plain,
~ pred_attacker(tuple_A_in_3(name_G_8)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
( pred_attacker(tuple_A_in_3(X1))
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_33,plain,
pred_attacker(name_G_8),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWW956+1 : TPTP v8.1.2. Released v7.4.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n021.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 : 300
% 0.13/0.34 % DateTime : Sun Aug 27 18:01:27 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.56 start to proof: theBenchmark
% 0.20/0.58 % Version : CSE_E---1.5
% 0.20/0.58 % Problem : theBenchmark.p
% 0.20/0.58 % Proof found
% 0.20/0.58 % SZS status Theorem for theBenchmark.p
% 0.20/0.58 % SZS output start Proof
% See solution above
% 0.20/0.59 % Total time : 0.010000 s
% 0.20/0.59 % SZS output end Proof
% 0.20/0.59 % Total time : 0.014000 s
%------------------------------------------------------------------------------