%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWW950+1 : TPTP v9.2.1. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n015.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.31s 1.74s
% Output : CNFRefutation 1.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of formulae : 42 ( 17 unt; 0 def)
% Number of atoms : 77 ( 7 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 64 ( 29 ~; 27 |; 2 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 43 ( 7 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax46,axiom,
! [X2] : constr_xor(X2,constr_ZERO) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax46) ).
fof(ax47,axiom,
! [X3,X4] : constr_xor(X3,X4) = constr_xor(X4,X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax47) ).
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(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(ax57,axiom,
! [X14] :
( pred_attacker(tuple_T_out_2(X14))
=> pred_attacker(X14) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax57) ).
fof(ax53,axiom,
pred_attacker(constr_ZERO),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax53) ).
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_11,plain,
! [X64] : constr_xor(X64,constr_ZERO) = X64,
inference(variable_rename,[status(thm)],[ax46]) ).
fof(c_0_12,plain,
! [X65,X66] : constr_xor(X65,X66) = constr_xor(X66,X65),
inference(variable_rename,[status(thm)],[ax47]) ).
fof(c_0_13,plain,
! [X92,X93] :
( ~ pred_attacker(tuple_T_in_3(X92,constr_h(constr_xor(X92,constr_xor(name_k0x30,name_ki)))))
| ~ pred_attacker(tuple_T_in_1(X93))
| pred_attacker(tuple_T_out_4(name_objective)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax74])]) ).
fof(c_0_14,plain,
! [X77,X78] :
( ~ pred_attacker(X77)
| ~ pred_attacker(X78)
| pred_attacker(tuple_T_in_3(X77,X78)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax58])]) ).
fof(c_0_15,plain,
! [X91] :
( ~ pred_attacker(tuple_T_in_1(X91))
| pred_attacker(tuple_T_out_2(constr_h(constr_xor(X91,constr_xor(name_k0x30,name_ki))))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax73])]) ).
cnf(c_0_16,plain,
constr_xor(X1,constr_ZERO) = X1,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
constr_xor(X1,X2) = constr_xor(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,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_13]) ).
cnf(c_0_19,plain,
( pred_attacker(tuple_T_in_3(X1,X2))
| ~ pred_attacker(X1)
| ~ pred_attacker(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_20,plain,
! [X76] :
( ~ pred_attacker(tuple_T_out_2(X76))
| pred_attacker(X76) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])]) ).
cnf(c_0_21,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_15]) ).
cnf(c_0_22,plain,
constr_xor(constr_ZERO,X1) = X1,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,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_18,c_0_19]) ).
cnf(c_0_24,plain,
pred_attacker(constr_ZERO),
inference(split_conjunct,[status(thm)],[ax53]) ).
cnf(c_0_25,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_T_out_2(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,plain,
( pred_attacker(tuple_T_out_2(constr_h(constr_xor(name_k0x30,name_ki))))
| ~ pred_attacker(tuple_T_in_1(constr_ZERO)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(constr_h(constr_xor(name_k0x30,name_ki)))
| ~ pred_attacker(tuple_T_in_1(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_22]),c_0_24])]) ).
cnf(c_0_28,plain,
( pred_attacker(constr_h(constr_xor(name_k0x30,name_ki)))
| ~ pred_attacker(tuple_T_in_1(constr_ZERO)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
fof(c_0_29,plain,
! [X83] :
( ~ pred_attacker(X83)
| pred_attacker(tuple_T_in_1(X83)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax61])]) ).
cnf(c_0_30,plain,
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(tuple_T_in_1(constr_ZERO))
| ~ pred_attacker(tuple_T_in_1(X1)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,plain,
( pred_attacker(tuple_T_in_1(X1))
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_32,plain,
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(tuple_T_in_1(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_24])]) ).
fof(c_0_33,plain,
! [X90] : pred_attacker(name_new0x2Dname(X90)),
inference(variable_rename,[status(thm)],[ax72]) ).
fof(c_0_34,plain,
! [X74] :
( ~ pred_attacker(tuple_T_out_4(X74))
| pred_attacker(X74) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])]) ).
cnf(c_0_35,plain,
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_31]) ).
cnf(c_0_36,plain,
pred_attacker(name_new0x2Dname(X1)),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
fof(c_0_37,negated_conjecture,
~ pred_attacker(name_objective),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co0])]) ).
cnf(c_0_38,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_T_out_4(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_39,plain,
pred_attacker(tuple_T_out_4(name_objective)),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,negated_conjecture,
~ pred_attacker(name_objective),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_41,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWW950+1 : TPTP v9.2.1. Released v7.4.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n015.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue May 5 07:36:17 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.35 % start to proof: theBenchmark
% 1.31/1.74 % Version : CSE_E---1.7
% 1.31/1.74 % Problem : theBenchmark.p
% 1.31/1.74 % SZS status Theorem for theBenchmark.p
% 1.31/1.74 % SZS output start CNFRefutation
% See solution above
% 1.31/1.74 % Total time : 1.375s
%------------------------------------------------------------------------------