%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWW955+1 : TPTP v9.2.1. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 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 : 300s
% DateTime : Tue May 5 05:33:27 PM UTC 2026
% Result : Theorem 1.28s 1.72s
% Output : CNFRefutation 1.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of formulae : 45 ( 19 unt; 0 def)
% Number of atoms : 75 ( 6 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 55 ( 25 ~; 22 |; 1 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 3 con; 0-2 aty)
% Number of variables : 45 ( 3 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax79,axiom,
! [X34] :
( pred_attacker(tuple_A_in_2(X34))
=> pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax79) ).
fof(ax70,axiom,
! [X25] :
( pred_attacker(X25)
=> pred_attacker(tuple_A_in_2(X25)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax70) ).
fof(ax67,axiom,
! [X22] :
( pred_attacker(tuple_A_out_3(X22))
=> pred_attacker(X22) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax67) ).
fof(ax78,axiom,
! [X33] :
( pred_attacker(tuple_A_in_2(X33))
=> pred_attacker(tuple_A_out_3(constr_comm_dec(X33,name_Ka))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax78) ).
fof(ax76,axiom,
! [X32] : pred_attacker(name_new0x2Dname(X32)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax76) ).
fof(ax46,axiom,
! [X3,X4] : constr_comm_dec(constr_comm_enc(X4,X3),X3) = X4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax46) ).
fof(ax50,axiom,
! [X7,X8] :
( ( pred_attacker(X7)
& pred_attacker(X8) )
=> pred_attacker(constr_dec(X7,X8)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax50) ).
fof(ax45,axiom,
! [X1,X2] : constr_dec(constr_enc(X2,X1),X1) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax45) ).
fof(ax65,axiom,
! [X20] :
( pred_attacker(tuple_A_out_4(X20))
=> pred_attacker(X20) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax65) ).
fof(ax69,axiom,
! [X24] :
( pred_attacker(tuple_A_out_1(X24))
=> pred_attacker(X24) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax69) ).
fof(co0,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co0) ).
fof(ax77,axiom,
pred_attacker(tuple_A_out_1(constr_comm_enc(name_m_9,name_Ka))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax77) ).
fof(c_0_12,plain,
! [X104] :
( ~ pred_attacker(tuple_A_in_2(X104))
| pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax79])]) ).
fof(c_0_13,plain,
! [X95] :
( ~ pred_attacker(X95)
| pred_attacker(tuple_A_in_2(X95)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax70])]) ).
fof(c_0_14,plain,
! [X92] :
( ~ pred_attacker(tuple_A_out_3(X92))
| pred_attacker(X92) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax67])]) ).
fof(c_0_15,plain,
! [X103] :
( ~ pred_attacker(tuple_A_in_2(X103))
| pred_attacker(tuple_A_out_3(constr_comm_dec(X103,name_Ka))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax78])]) ).
cnf(c_0_16,plain,
( pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9)))
| ~ pred_attacker(tuple_A_in_2(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( pred_attacker(tuple_A_in_2(X1))
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,plain,
! [X102] : pred_attacker(name_new0x2Dname(X102)),
inference(variable_rename,[status(thm)],[ax76]) ).
cnf(c_0_19,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_A_out_3(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( pred_attacker(tuple_A_out_3(constr_comm_dec(X1,name_Ka)))
| ~ pred_attacker(tuple_A_in_2(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_21,plain,
! [X73,X74] : constr_comm_dec(constr_comm_enc(X74,X73),X73) = X74,
inference(variable_rename,[status(thm)],[ax46]) ).
fof(c_0_22,plain,
! [X77,X78] :
( ~ pred_attacker(X77)
| ~ pred_attacker(X78)
| pred_attacker(constr_dec(X77,X78)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax50])]) ).
fof(c_0_23,plain,
! [X71,X72] : constr_dec(constr_enc(X72,X71),X71) = X72,
inference(variable_rename,[status(thm)],[ax45]) ).
fof(c_0_24,plain,
! [X90] :
( ~ pred_attacker(tuple_A_out_4(X90))
| pred_attacker(X90) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax65])]) ).
cnf(c_0_25,plain,
( pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9)))
| ~ pred_attacker(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_26,plain,
pred_attacker(name_new0x2Dname(X1)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,plain,
( pred_attacker(constr_comm_dec(X1,name_Ka))
| ~ pred_attacker(tuple_A_in_2(X1)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_28,plain,
constr_comm_dec(constr_comm_enc(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_29,plain,
! [X94] :
( ~ pred_attacker(tuple_A_out_1(X94))
| pred_attacker(X94) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax69])]) ).
cnf(c_0_30,plain,
( pred_attacker(constr_dec(X1,X2))
| ~ pred_attacker(X1)
| ~ pred_attacker(X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,plain,
constr_dec(constr_enc(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_A_out_4(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_33,plain,
pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9))),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
fof(c_0_34,negated_conjecture,
~ pred_attacker(name_objective),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co0])]) ).
cnf(c_0_35,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_A_in_2(constr_comm_enc(X1,name_Ka))) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_36,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_A_out_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_37,plain,
pred_attacker(tuple_A_out_1(constr_comm_enc(name_m_9,name_Ka))),
inference(split_conjunct,[status(thm)],[ax77]) ).
cnf(c_0_38,plain,
( pred_attacker(X1)
| ~ pred_attacker(constr_enc(X1,X2))
| ~ pred_attacker(X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_39,plain,
pred_attacker(constr_enc(name_objective,name_m_9)),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_40,negated_conjecture,
~ pred_attacker(name_objective),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_41,plain,
( pred_attacker(X1)
| ~ pred_attacker(constr_comm_enc(X1,name_Ka)) ),
inference(spm,[status(thm)],[c_0_35,c_0_17]) ).
cnf(c_0_42,plain,
pred_attacker(constr_comm_enc(name_m_9,name_Ka)),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,plain,
~ pred_attacker(name_m_9),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_44,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWW955+1 : TPTP v9.2.1. Released v7.4.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.14/0.33 % Computer : n010.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Tue May 5 07:36:21 EDT 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 1.28/1.72 % Version : CSE_E---1.7
% 1.28/1.72 % Problem : theBenchmark.p
% 1.28/1.72 % SZS status Theorem for theBenchmark.p
% 1.28/1.72 % SZS output start CNFRefutation
% See solution above
% 1.28/1.72 % Total time : 1.371s
%------------------------------------------------------------------------------