%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWW967+1 : TPTP v9.3.1. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 03:11:29 PM UTC 2026
% Result : Theorem 0.14s 0.50s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 43 ( 14 unt; 0 def)
% Number of atoms : 111 ( 0 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 126 ( 58 ~; 54 |; 7 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 4 con; 0-3 aty)
% Number of variables : 75 ( 32 sgn 32 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax171,axiom,
! [X207,X208,X209,X210,X211] :
( ( pred_attacker(tuple_client_A_in_2(X209))
& pred_eq_bitstring_bitstring(name_Na(X207),constr_tuple_4_get_0x30(constr_cbc_dec_4(X209,name_Kas)))
& pred_eq_bitstring_bitstring(name_B,constr_tuple_4_get_1(constr_cbc_dec_4(X209,name_Kas)))
& pred_attacker(tuple_client_A_in_4(X210))
& pred_attacker(tuple_client_A_in_6(X208))
& pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_cbc_dec_2(X208,name_Kas)))
& pred_attacker(tuple_client_A_in_8(X211))
& pred_eq_bitstring_bitstring(tuple_succ(name_Na0x27(X210,X209,X207)),constr_cbc_dec_1(X211,constr_tuple_2_get_0x30_bitstring(constr_cbc_dec_2(X208,name_Kas)))) )
=> pred_attacker(tuple_client_A_out_9(name_objective)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax171) ).
fof(ax83,axiom,
! [X63,X64] : pred_eq_bitstring_bitstring(X63,X64),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax83) ).
fof(ax120,axiom,
! [X117] :
( pred_attacker(X117)
=> pred_attacker(tuple_client_A_in_8(X117)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax120) ).
fof(ax122,axiom,
! [X119] :
( pred_attacker(X119)
=> pred_attacker(tuple_client_A_in_6(X119)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax122) ).
fof(ax124,axiom,
! [X121] :
( pred_attacker(X121)
=> pred_attacker(tuple_client_A_in_4(X121)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax124) ).
fof(ax126,axiom,
! [X123] :
( pred_attacker(X123)
=> pred_attacker(tuple_client_A_in_2(X123)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax126) ).
fof(ax119,axiom,
! [X114,X115,X116] :
( pred_attacker(tuple_client_A_out_1(X114,X115,X116))
=> pred_attacker(X116) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax119) ).
fof(ax167,axiom,
! [X197] : pred_attacker(tuple_client_A_out_1(name_A,name_B,name_Na(X197))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax167) ).
fof(co0,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co0) ).
fof(ax109,axiom,
! [X98] :
( pred_attacker(tuple_client_A_out_9(X98))
=> pred_attacker(X98) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax109) ).
fof(c_0_10,plain,
! [X240,X241,X242,X243,X244] :
( pred_attacker(tuple_client_A_out_9(name_objective))
| ~ pred_attacker(tuple_client_A_in_2(X242))
| ~ pred_eq_bitstring_bitstring(name_Na(X240),constr_tuple_4_get_0x30(constr_cbc_dec_4(X242,name_Kas)))
| ~ pred_eq_bitstring_bitstring(name_B,constr_tuple_4_get_1(constr_cbc_dec_4(X242,name_Kas)))
| ~ pred_attacker(tuple_client_A_in_4(X243))
| ~ pred_attacker(tuple_client_A_in_6(X241))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_cbc_dec_2(X241,name_Kas)))
| ~ pred_attacker(tuple_client_A_in_8(X244))
| ~ pred_eq_bitstring_bitstring(tuple_succ(name_Na0x27(X243,X242,X240)),constr_cbc_dec_1(X244,constr_tuple_2_get_0x30_bitstring(constr_cbc_dec_2(X241,name_Kas)))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax171])])]) ).
fof(c_0_11,plain,
! [X261,X262] : pred_eq_bitstring_bitstring(X261,X262),
inference(variable_rename,[status(thm)],[ax83]) ).
cnf(c_0_12,plain,
( ~ pred_attacker(tuple_client_A_in_2(X2))
| ~ pred_eq_bitstring_bitstring(name_Na(X3),constr_tuple_4_get_0x30(constr_cbc_dec_4(X2,name_Kas)))
| ~ pred_eq_bitstring_bitstring(name_B,constr_tuple_4_get_1(constr_cbc_dec_4(X2,name_Kas)))
| ~ pred_attacker(tuple_client_A_in_4(X1))
| ~ pred_attacker(tuple_client_A_in_6(X5))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_cbc_dec_2(X5,name_Kas)))
| ~ pred_attacker(tuple_client_A_in_8(X4))
| ~ pred_eq_bitstring_bitstring(tuple_succ(name_Na0x27(X1,X2,X3)),constr_cbc_dec_1(X4,constr_tuple_2_get_0x30_bitstring(constr_cbc_dec_2(X5,name_Kas))))
| pred_attacker(tuple_client_A_out_9(name_objective)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
pred_eq_bitstring_bitstring(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
! [X321] :
( pred_attacker(tuple_client_A_in_8(X321))
| ~ pred_attacker(X321) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax120])])]) ).
cnf(c_0_15,plain,
( ~ pred_attacker(tuple_client_A_in_2(X4))
| ~ pred_attacker(tuple_client_A_in_4(X3))
| ~ pred_attacker(tuple_client_A_in_6(X2))
| ~ pred_attacker(tuple_client_A_in_8(X1))
| pred_attacker(tuple_client_A_out_9(name_objective)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_13]),c_0_13]),c_0_13])]) ).
cnf(c_0_16,plain,
( ~ pred_attacker(X1)
| pred_attacker(tuple_client_A_in_8(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_17,plain,
! [X314] :
( pred_attacker(tuple_client_A_in_6(X314))
| ~ pred_attacker(X314) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax122])])]) ).
cnf(c_0_18,plain,
( ~ pred_attacker(X4)
| ~ pred_attacker(tuple_client_A_in_2(X3))
| ~ pred_attacker(tuple_client_A_in_4(X2))
| ~ pred_attacker(tuple_client_A_in_6(X1))
| pred_attacker(tuple_client_A_out_9(name_objective)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
( ~ pred_attacker(X1)
| pred_attacker(tuple_client_A_in_6(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_20,plain,
! [X300] :
( pred_attacker(tuple_client_A_in_4(X300))
| ~ pred_attacker(X300) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax124])])]) ).
cnf(c_0_21,plain,
( ~ pred_attacker(X4)
| ~ pred_attacker(X3)
| ~ pred_attacker(tuple_client_A_in_2(X2))
| ~ pred_attacker(tuple_client_A_in_4(X1))
| pred_attacker(tuple_client_A_out_9(name_objective)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
( ~ pred_attacker(X1)
| pred_attacker(tuple_client_A_in_4(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_23,plain,
! [X259] :
( pred_attacker(tuple_client_A_in_2(X259))
| ~ pred_attacker(X259) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax126])])]) ).
fof(c_0_24,plain,
! [X228,X229,X230] :
( pred_attacker(X230)
| ~ pred_attacker(tuple_client_A_out_1(X228,X229,X230)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax119])])]) ).
fof(c_0_25,plain,
! [X218] : pred_attacker(tuple_client_A_out_1(name_A,name_B,name_Na(X218))),
inference(variable_rename,[status(thm)],[ax167]) ).
cnf(c_0_26,plain,
( ~ pred_attacker(X4)
| ~ pred_attacker(X3)
| ~ pred_attacker(X2)
| ~ pred_attacker(tuple_client_A_in_2(X1))
| pred_attacker(tuple_client_A_out_9(name_objective)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
( ~ pred_attacker(X1)
| pred_attacker(tuple_client_A_in_2(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,plain,
( ~ pred_attacker(tuple_client_A_out_1(X1,X2,X3))
| pred_attacker(X3) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,plain,
pred_attacker(tuple_client_A_out_1(name_A,name_B,name_Na(X1))),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,plain,
( ~ pred_attacker(X4)
| ~ pred_attacker(X3)
| ~ pred_attacker(X2)
| ~ pred_attacker(X1)
| pred_attacker(tuple_client_A_out_9(name_objective)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
pred_attacker(name_Na(X1)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
( ~ pred_attacker(X3)
| ~ pred_attacker(X2)
| ~ pred_attacker(X1)
| pred_attacker(tuple_client_A_out_9(name_objective)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
fof(c_0_33,negated_conjecture,
~ pred_attacker(name_objective),
inference(assume_negation,[status(cth)],[co0]) ).
cnf(c_0_34,plain,
( ~ pred_attacker(X2)
| ~ pred_attacker(X1)
| pred_attacker(tuple_client_A_out_9(name_objective)) ),
inference(spm,[status(thm)],[c_0_32,c_0_31]) ).
fof(c_0_35,negated_conjecture,
~ pred_attacker(name_objective),
inference(fof_simplification,[status(thm)],[c_0_33]) ).
fof(c_0_36,plain,
! [X320] :
( pred_attacker(X320)
| ~ pred_attacker(tuple_client_A_out_9(X320)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax109])])]) ).
cnf(c_0_37,plain,
( ~ pred_attacker(X1)
| pred_attacker(tuple_client_A_out_9(name_objective)) ),
inference(spm,[status(thm)],[c_0_34,c_0_31]) ).
fof(c_0_38,negated_conjecture,
~ pred_attacker(name_objective),
inference(fof_nnf,[status(thm)],[c_0_35]) ).
cnf(c_0_39,plain,
( ~ pred_attacker(tuple_client_A_out_9(X1))
| pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_40,plain,
pred_attacker(tuple_client_A_out_9(name_objective)),
inference(spm,[status(thm)],[c_0_37,c_0_31]) ).
cnf(c_0_41,negated_conjecture,
~ pred_attacker(name_objective),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_42,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW967+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n011.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 10:20:56 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.44 Running first-order theorem proving
% 0.14/0.44 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.50 % Version: 3.5.1
% 0.14/0.50 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.50 % Starting sh5l with 300s (1) cores
% 0.14/0.50 % sh5l with pid 1655978 completed with status 0
% 0.14/0.50 % Result found by sh5l
% 0.14/0.50 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.50 % Starting sh5l with 300s (1) cores
% 0.14/0.50 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/0.50 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.50 % Search class: FHUSM-FFMM31-DFFFFFNN
% 0.14/0.50 % partial match(1): FHUSM-FFMM21-DFFFFFNN
% 0.14/0.50 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.50 % Starting SubtermCWHack with 28s (1) cores
% 0.14/0.50 % SubtermCWHack with pid 1655985 completed with status 0
% 0.14/0.50 % Result found by SubtermCWHack
% 0.14/0.50 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.50 % Starting sh5l with 300s (1) cores
% 0.14/0.50 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/0.50 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.50 % Search class: FHUSM-FFMM31-DFFFFFNN
% 0.14/0.50 % partial match(1): FHUSM-FFMM21-DFFFFFNN
% 0.14/0.50 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.50 % Starting SubtermCWHack with 28s (1) cores
% 0.14/0.50 % Preprocessing time : 0.002 s
% 0.14/0.50
% 0.14/0.50 % Proof found!
% 0.14/0.50 % SZS status Theorem
% 0.14/0.50 % SZS output start CNFRefutation
% See solution above
% 0.14/0.51 % Parsed axioms : 175
% 0.14/0.51 % Removed by relevancy pruning/SinE : 48
% 0.14/0.51 % Initial clauses : 127
% 0.14/0.51 % Removed in clause preprocessing : 0
% 0.14/0.51 % Initial clauses in saturation : 127
% 0.14/0.51 % Processed clauses : 151
% 0.14/0.51 % ...of these trivial : 0
% 0.14/0.51 % ...subsumed : 0
% 0.14/0.51 % ...remaining for further processing : 151
% 0.14/0.51 % Other redundant clauses eliminated : 0
% 0.14/0.51 % Clauses deleted for lack of memory : 0
% 0.14/0.51 % Backward-subsumed : 7
% 0.14/0.51 % Backward-rewritten : 1
% 0.14/0.51 % Generated clauses : 188
% 0.14/0.51 % ...of the previous two non-redundant : 172
% 0.14/0.51 % ...aggressively subsumed : 0
% 0.14/0.51 % Contextual simplify-reflections : 0
% 0.14/0.51 % Paramodulations : 188
% 0.14/0.51 % Factorizations : 0
% 0.14/0.51 % NegExts : 0
% 0.14/0.51 % Equation resolutions : 0
% 0.14/0.51 % Disequality decompositions : 0
% 0.14/0.51 % Total rewrite steps : 23
% 0.14/0.51 % ...of those cached : 10
% 0.14/0.51 % Propositional unsat checks : 0
% 0.14/0.51 % Propositional check models : 0
% 0.14/0.51 % Propositional check unsatisfiable : 0
% 0.14/0.51 % Propositional clauses : 0
% 0.14/0.51 % Propositional clauses after purity: 0
% 0.14/0.51 % Propositional unsat core size : 0
% 0.14/0.51 % Propositional preprocessing time : 0.000
% 0.14/0.51 % Propositional encoding time : 0.000
% 0.14/0.51 % Propositional solver time : 0.000
% 0.14/0.51 % Success case prop preproc time : 0.000
% 0.14/0.51 % Success case prop encoding time : 0.000
% 0.14/0.51 % Success case prop solver time : 0.000
% 0.14/0.51 % Current number of processed clauses : 143
% 0.14/0.51 % Positive orientable unit clauses : 25
% 0.14/0.51 % Positive unorientable unit clauses: 0
% 0.14/0.51 % Negative unit clauses : 67
% 0.14/0.51 % Non-unit-clauses : 51
% 0.14/0.51 % Current number of unprocessed clauses: 148
% 0.14/0.51 % ...number of literals in the above : 511
% 0.14/0.51 % Current number of archived formulas : 0
% 0.14/0.51 % Current number of archived clauses : 8
% 0.14/0.51 % Clause-clause subsumption calls (NU) : 2403
% 0.14/0.51 % Rec. Clause-clause subsumption calls : 1480
% 0.14/0.51 % Non-unit clause-clause subsumptions : 7
% 0.14/0.51 % Unit Clause-clause subsumption calls : 900
% 0.14/0.51 % Rewrite failures with RHS unbound : 0
% 0.14/0.51 % BW rewrite match attempts : 1
% 0.14/0.51 % BW rewrite match successes : 1
% 0.14/0.51 % Condensation attempts : 0
% 0.14/0.51 % Condensation successes : 0
% 0.14/0.51 % Termbank termtop insertions : 8073
% 0.14/0.51 % Search garbage collected termcells : 1279
% 0.14/0.51
% 0.14/0.51 % -------------------------------------------------
% 0.14/0.51 % User time : 0.016 s
% 0.14/0.51 % System time : 0.006 s
% 0.14/0.51 % Total time : 0.021 s
% 0.14/0.51 % Maximum resident set size: 4152 pages
% 0.14/0.51
% 0.14/0.51 % -------------------------------------------------
% 0.14/0.51 % User time : 0.019 s
% 0.14/0.51 % System time : 0.011 s
% 0.14/0.51 % Total time : 0.030 s
% 0.14/0.51 % Maximum resident set size: 5120 pages
% 0.14/0.51 % E exiting
%------------------------------------------------------------------------------