%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWW959+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 : n005.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:27 PM UTC 2026
% Result : Theorem 0.15s 0.46s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 34 ( 13 unt; 0 def)
% Number of atoms : 79 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 84 ( 39 ~; 35 |; 5 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 4 con; 0-2 aty)
% Number of variables : 48 ( 19 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax165,axiom,
! [X107,X108,X109,X110] :
( ( pred_attacker(tuple_client_B_in_2(X110))
& pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X110,constr_pkey(name_skS))))
& pred_attacker(tuple_client_B_in_3(X108))
& pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X108,name_skB)))
& pred_attacker(tuple_client_B_in_5(X109))
& pred_eq_bitstring_bitstring(name_Nb(X107),constr_adec(X109,name_skB)) )
=> pred_attacker(tuple_client_B_out_6(name_objective)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax165) ).
fof(ax86,axiom,
! [X17,X18] : pred_eq_bitstring_bitstring(X17,X18),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax86) ).
fof(ax119,axiom,
! [X61] :
( pred_attacker(X61)
=> pred_attacker(tuple_client_B_in_5(X61)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax119) ).
fof(ax121,axiom,
! [X63] :
( pred_attacker(X63)
=> pred_attacker(tuple_client_B_in_3(X63)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax121) ).
fof(ax123,axiom,
! [X65] :
( pred_attacker(X65)
=> pred_attacker(tuple_client_B_in_2(X65)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax123) ).
fof(ax154,axiom,
! [X98] : pred_attacker(name_new0x2Dname(X98)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax154) ).
fof(co0,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co0) ).
fof(ax113,axiom,
! [X52] :
( pred_attacker(tuple_client_B_out_6(X52))
=> pred_attacker(X52) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax113) ).
fof(c_0_8,plain,
! [X222,X223,X224,X225] :
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(tuple_client_B_in_2(X225))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X225,constr_pkey(name_skS))))
| ~ pred_attacker(tuple_client_B_in_3(X223))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X223,name_skB)))
| ~ pred_attacker(tuple_client_B_in_5(X224))
| ~ pred_eq_bitstring_bitstring(name_Nb(X222),constr_adec(X224,name_skB)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax165])])]) ).
fof(c_0_9,plain,
! [X132,X133] : pred_eq_bitstring_bitstring(X132,X133),
inference(variable_rename,[status(thm)],[ax86]) ).
cnf(c_0_10,plain,
( ~ pred_attacker(tuple_client_B_in_2(X4))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X4,constr_pkey(name_skS))))
| ~ pred_attacker(tuple_client_B_in_3(X3))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X3,name_skB)))
| ~ pred_attacker(tuple_client_B_in_5(X2))
| ~ pred_eq_bitstring_bitstring(name_Nb(X1),constr_adec(X2,name_skB))
| pred_attacker(tuple_client_B_out_6(name_objective)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
pred_eq_bitstring_bitstring(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X176] :
( pred_attacker(tuple_client_B_in_5(X176))
| ~ pred_attacker(X176) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax119])])]) ).
cnf(c_0_13,plain,
( ~ pred_attacker(tuple_client_B_in_2(X4))
| ~ pred_attacker(tuple_client_B_in_3(X3))
| ~ pred_attacker(tuple_client_B_in_5(X2))
| pred_attacker(tuple_client_B_out_6(name_objective)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_11]),c_0_11])]) ).
cnf(c_0_14,plain,
( ~ pred_attacker(X1)
| pred_attacker(tuple_client_B_in_5(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_15,plain,
! [X178] :
( pred_attacker(tuple_client_B_in_3(X178))
| ~ pred_attacker(X178) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax121])])]) ).
cnf(c_0_16,plain,
( ~ pred_attacker(X3)
| ~ pred_attacker(tuple_client_B_in_2(X2))
| ~ pred_attacker(tuple_client_B_in_3(X1))
| pred_attacker(tuple_client_B_out_6(name_objective)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( ~ pred_attacker(X1)
| pred_attacker(tuple_client_B_in_3(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_18,plain,
! [X180] :
( pred_attacker(tuple_client_B_in_2(X180))
| ~ pred_attacker(X180) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax123])])]) ).
cnf(c_0_19,plain,
( ~ pred_attacker(X3)
| ~ pred_attacker(X2)
| ~ pred_attacker(tuple_client_B_in_2(X1))
| pred_attacker(tuple_client_B_out_6(name_objective)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
( ~ pred_attacker(X1)
| pred_attacker(tuple_client_B_in_2(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_21,plain,
! [X213] : pred_attacker(name_new0x2Dname(X213)),
inference(variable_rename,[status(thm)],[ax154]) ).
cnf(c_0_22,plain,
( ~ pred_attacker(X3)
| ~ pred_attacker(X2)
| ~ pred_attacker(X1)
| pred_attacker(tuple_client_B_out_6(name_objective)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
pred_attacker(name_new0x2Dname(X1)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_24,negated_conjecture,
~ pred_attacker(name_objective),
inference(assume_negation,[status(cth)],[co0]) ).
cnf(c_0_25,plain,
( ~ pred_attacker(X2)
| ~ pred_attacker(X1)
| pred_attacker(tuple_client_B_out_6(name_objective)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_26,negated_conjecture,
~ pred_attacker(name_objective),
inference(fof_simplification,[status(thm)],[c_0_24]) ).
fof(c_0_27,plain,
! [X167] :
( pred_attacker(X167)
| ~ pred_attacker(tuple_client_B_out_6(X167)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax113])])]) ).
cnf(c_0_28,plain,
( ~ pred_attacker(X1)
| pred_attacker(tuple_client_B_out_6(name_objective)) ),
inference(spm,[status(thm)],[c_0_25,c_0_23]) ).
fof(c_0_29,negated_conjecture,
~ pred_attacker(name_objective),
inference(fof_nnf,[status(thm)],[c_0_26]) ).
cnf(c_0_30,plain,
( ~ pred_attacker(tuple_client_B_out_6(X1))
| pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_31,plain,
pred_attacker(tuple_client_B_out_6(name_objective)),
inference(spm,[status(thm)],[c_0_28,c_0_23]) ).
cnf(c_0_32,negated_conjecture,
~ pred_attacker(name_objective),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_33,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW959+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 : n005.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:32 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.43 Running first-order theorem proving
% 0.15/0.43 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.15/0.46 % Version: 3.5.1
% 0.15/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.46 % Starting sh5l with 300s (1) cores
% 0.15/0.46 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3211194 completed with status 0
% 0.15/0.46 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.15/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.46 % No SInE strategy applied
% 0.15/0.46 % Search class: FGUSM-FFMM21-MFFFFFNN
% 0.15/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.15/0.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.15/0.46 % Starting new_bool_3 with 136s (1) cores
% 0.15/0.46 % Starting new_bool_1 with 136s (1) cores
% 0.15/0.46 % SubtermCWHack with pid 3211202 completed with status 0
% 0.15/0.46 % Result found by SubtermCWHack
% 0.15/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.46 % No SInE strategy applied
% 0.15/0.46 % Search class: FGUSM-FFMM21-MFFFFFNN
% 0.15/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.46 % Preprocessing time : 0.002 s
% 0.15/0.46
% 0.15/0.46 % Proof found!
% 0.15/0.46 % SZS status Theorem
% 0.15/0.46 % SZS output start CNFRefutation
% See solution above
% 0.15/0.46 % Parsed axioms : 169
% 0.15/0.46 % Removed by relevancy pruning/SinE : 0
% 0.15/0.46 % Initial clauses : 169
% 0.15/0.46 % Removed in clause preprocessing : 1
% 0.15/0.46 % Initial clauses in saturation : 168
% 0.15/0.46 % Processed clauses : 181
% 0.15/0.46 % ...of these trivial : 0
% 0.15/0.46 % ...subsumed : 5
% 0.15/0.46 % ...remaining for further processing : 176
% 0.15/0.46 % Other redundant clauses eliminated : 0
% 0.15/0.46 % Clauses deleted for lack of memory : 0
% 0.15/0.46 % Backward-subsumed : 5
% 0.15/0.46 % Backward-rewritten : 1
% 0.15/0.46 % Generated clauses : 196
% 0.15/0.46 % ...of the previous two non-redundant : 164
% 0.15/0.46 % ...aggressively subsumed : 0
% 0.15/0.46 % Contextual simplify-reflections : 0
% 0.15/0.46 % Paramodulations : 196
% 0.15/0.46 % Factorizations : 0
% 0.15/0.46 % NegExts : 0
% 0.15/0.46 % Equation resolutions : 0
% 0.15/0.46 % Disequality decompositions : 0
% 0.15/0.46 % Total rewrite steps : 5
% 0.15/0.46 % ...of those cached : 1
% 0.15/0.46 % Propositional unsat checks : 0
% 0.15/0.46 % Propositional check models : 0
% 0.15/0.46 % Propositional check unsatisfiable : 0
% 0.15/0.46 % Propositional clauses : 0
% 0.15/0.46 % Propositional clauses after purity: 0
% 0.15/0.46 % Propositional unsat core size : 0
% 0.15/0.46 % Propositional preprocessing time : 0.000
% 0.15/0.46 % Propositional encoding time : 0.000
% 0.15/0.46 % Propositional solver time : 0.000
% 0.15/0.46 % Success case prop preproc time : 0.000
% 0.15/0.46 % Success case prop encoding time : 0.000
% 0.15/0.46 % Success case prop solver time : 0.000
% 0.15/0.46 % Current number of processed clauses : 170
% 0.15/0.46 % Positive orientable unit clauses : 32
% 0.15/0.46 % Positive unorientable unit clauses: 0
% 0.15/0.46 % Negative unit clauses : 79
% 0.15/0.46 % Non-unit-clauses : 59
% 0.15/0.46 % Current number of unprocessed clauses: 151
% 0.15/0.46 % ...number of literals in the above : 428
% 0.15/0.46 % Current number of archived formulas : 0
% 0.15/0.46 % Current number of archived clauses : 7
% 0.15/0.46 % Clause-clause subsumption calls (NU) : 2758
% 0.15/0.46 % Rec. Clause-clause subsumption calls : 2549
% 0.15/0.46 % Non-unit clause-clause subsumptions : 10
% 0.15/0.46 % Unit Clause-clause subsumption calls : 479
% 0.15/0.46 % Rewrite failures with RHS unbound : 0
% 0.15/0.46 % BW rewrite match attempts : 1
% 0.15/0.46 % BW rewrite match successes : 1
% 0.15/0.46 % Condensation attempts : 0
% 0.15/0.46 % Condensation successes : 0
% 0.15/0.46 % Termbank termtop insertions : 8807
% 0.15/0.46 % Search garbage collected termcells : 1157
% 0.15/0.46
% 0.15/0.46 % -------------------------------------------------
% 0.15/0.46 % User time : 0.014 s
% 0.15/0.46 % System time : 0.004 s
% 0.15/0.46 % Total time : 0.018 s
% 0.15/0.46 % Maximum resident set size: 4016 pages
% 0.15/0.46
% 0.15/0.46 % -------------------------------------------------
% 0.15/0.46 % User time : 0.041 s
% 0.15/0.46 % System time : 0.024 s
% 0.15/0.46 % Total time : 0.066 s
% 0.15/0.46 % Maximum resident set size: 5120 pages
% 0.15/0.46 % E exiting
%------------------------------------------------------------------------------