%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWW961+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 : n001.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:28 PM UTC 2026
% Result : Theorem 0.31s 0.63s
% Output : CNFRefutation 0.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 36 ( 15 unt; 0 def)
% Number of atoms : 81 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 87 ( 42 ~; 35 |; 5 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 5 con; 0-2 aty)
% Number of variables : 51 ( 22 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax173,axiom,
! [X122,X123,X124,X125] :
( ( pred_attacker(tuple_client_B_in_2(X125))
& pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X125,constr_pkey(name_skS))))
& pred_attacker(tuple_client_B_in_3(X123))
& pred_eq_bitstring_bitstring(name_A,constr_assoc_pair_2_get_1(constr_adec(X123,name_skB)))
& pred_attacker(tuple_client_B_in_5(X124))
& pred_eq_bitstring_bitstring(name_Nb(X122),constr_adec(X124,name_skB)) )
=> pred_attacker(tuple_client_B_out_6(name_objective)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax173) ).
fof(ax89,axiom,
! [X24,X25] : pred_eq_bitstring_bitstring(X24,X25),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax89) ).
fof(ax120,axiom,
! [X66] :
( pred_attacker(X66)
=> pred_attacker(tuple_client_B_in_5(X66)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax120) ).
fof(ax122,axiom,
! [X68] :
( pred_attacker(X68)
=> pred_attacker(tuple_client_B_in_3(X68)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax122) ).
fof(co0,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co0) ).
fof(ax124,axiom,
! [X70] :
( pred_attacker(X70)
=> pred_attacker(tuple_client_B_in_2(X70)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax124) ).
fof(ax114,axiom,
! [X57] :
( pred_attacker(tuple_client_B_out_6(X57))
=> pred_attacker(X57) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax114) ).
fof(ax162,axiom,
! [X113] : pred_attacker(name_new0x2Dname(X113)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax162) ).
fof(ax151,axiom,
pred_attacker(constr_CONST_0x30),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax151) ).
fof(c_0_9,plain,
! [X252,X253,X254,X255] :
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(tuple_client_B_in_2(X255))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X255,constr_pkey(name_skS))))
| ~ pred_attacker(tuple_client_B_in_3(X253))
| ~ pred_eq_bitstring_bitstring(name_A,constr_assoc_pair_2_get_1(constr_adec(X253,name_skB)))
| ~ pred_attacker(tuple_client_B_in_5(X254))
| ~ pred_eq_bitstring_bitstring(name_Nb(X252),constr_adec(X254,name_skB)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax173])])]) ).
fof(c_0_10,plain,
! [X154,X155] : pred_eq_bitstring_bitstring(X154,X155),
inference(variable_rename,[status(thm)],[ax89]) ).
cnf(c_0_11,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_assoc_pair_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_9]) ).
cnf(c_0_12,plain,
pred_eq_bitstring_bitstring(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X196] :
( pred_attacker(tuple_client_B_in_5(X196))
| ~ pred_attacker(X196) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax120])])]) ).
cnf(c_0_14,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_11,c_0_12]),c_0_12]),c_0_12])]) ).
cnf(c_0_15,plain,
( ~ pred_attacker(X1)
| pred_attacker(tuple_client_B_in_5(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_16,plain,
! [X198] :
( pred_attacker(tuple_client_B_in_3(X198))
| ~ pred_attacker(X198) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax122])])]) ).
fof(c_0_17,negated_conjecture,
~ pred_attacker(name_objective),
inference(assume_negation,[status(cth)],[co0]) ).
cnf(c_0_18,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_14,c_0_15]) ).
cnf(c_0_19,plain,
( ~ pred_attacker(X1)
| pred_attacker(tuple_client_B_in_3(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_20,plain,
! [X200] :
( pred_attacker(tuple_client_B_in_2(X200))
| ~ pred_attacker(X200) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax124])])]) ).
fof(c_0_21,negated_conjecture,
~ pred_attacker(name_objective),
inference(fof_simplification,[status(thm)],[c_0_17]) ).
fof(c_0_22,plain,
! [X187] :
( pred_attacker(X187)
| ~ pred_attacker(tuple_client_B_out_6(X187)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax114])])]) ).
cnf(c_0_23,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_18,c_0_19]) ).
cnf(c_0_24,plain,
( ~ pred_attacker(X1)
| pred_attacker(tuple_client_B_in_2(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_25,negated_conjecture,
~ pred_attacker(name_objective),
inference(fof_nnf,[status(thm)],[c_0_21]) ).
cnf(c_0_26,plain,
( ~ pred_attacker(tuple_client_B_out_6(X1))
| pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,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_23,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
~ pred_attacker(name_objective),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_29,plain,
! [X243] : pred_attacker(name_new0x2Dname(X243)),
inference(variable_rename,[status(thm)],[ax162]) ).
cnf(c_0_30,plain,
( ~ pred_attacker(X3)
| ~ pred_attacker(X2)
| ~ pred_attacker(X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_31,plain,
pred_attacker(name_new0x2Dname(X1)),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_32,plain,
( ~ pred_attacker(X2)
| ~ pred_attacker(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_33,plain,
pred_attacker(constr_CONST_0x30),
inference(split_conjunct,[status(thm)],[ax151]) ).
cnf(c_0_34,plain,
~ pred_attacker(X1),
inference(spm,[status(thm)],[c_0_32,c_0_31]) ).
cnf(c_0_35,plain,
$false,
inference(sr,[status(thm)],[c_0_33,c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWW961+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.46 % Computer : n001.cluster.edu
% 0.20/0.46 % Model : x86_64 x86_64
% 0.20/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.46 % Memory : 8046.5625MB
% 0.20/0.46 % OS : Linux 6.8.0-71-generic
% 0.20/0.46 % CPULimit : 300
% 0.20/0.46 % WCLimit : 300
% 0.20/0.46 % DateTime : Mon Sep 21 10:26:14 UTC 2026
% 0.20/0.47 % CPUTime :
% 0.20/0.47 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.54 Running first-order theorem proving
% 0.24/0.54 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.31/0.63 % Version: 3.5.1
% 0.31/0.63 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.31/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.31/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.31/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.31/0.63 % Starting sh5l with 300s (1) cores
% 0.31/0.63 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2883836 completed with status 0
% 0.31/0.63 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.31/0.63 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.31/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.31/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.31/0.63 % No SInE strategy applied
% 0.31/0.63 % Search class: FGUSM-FFMM21-MFFFFFNN
% 0.31/0.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.31/0.63 % Starting SubtermCWHack with 136s (1) cores
% 0.31/0.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.31/0.63 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.31/0.63 % Starting new_bool_3 with 136s (1) cores
% 0.31/0.63 % Starting new_bool_1 with 136s (1) cores
% 0.31/0.63 % new_bool_1 with pid 2883844 completed with status 0
% 0.31/0.63 % Result found by new_bool_1
% 0.31/0.63 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.31/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.31/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.31/0.63 % No SInE strategy applied
% 0.31/0.63 % Search class: FGUSM-FFMM21-MFFFFFNN
% 0.31/0.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.31/0.63 % Starting SubtermCWHack with 136s (1) cores
% 0.31/0.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.31/0.63 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.31/0.63 % Starting new_bool_3 with 136s (1) cores
% 0.31/0.63 % Starting new_bool_1 with 136s (1) cores
% 0.31/0.63 % Preprocessing time : 0.004 s
% 0.31/0.63 % Presaturation interreduction done
% 0.31/0.63
% 0.31/0.63 % Proof found!
% 0.31/0.63 % SZS status Theorem
% 0.31/0.63 % SZS output start CNFRefutation
% See solution above
% 0.31/0.63 % Parsed axioms : 177
% 0.31/0.63 % Removed by relevancy pruning/SinE : 0
% 0.31/0.63 % Initial clauses : 177
% 0.31/0.63 % Removed in clause preprocessing : 1
% 0.31/0.63 % Initial clauses in saturation : 176
% 0.31/0.63 % Processed clauses : 368
% 0.31/0.63 % ...of these trivial : 0
% 0.31/0.63 % ...subsumed : 7
% 0.31/0.63 % ...remaining for further processing : 361
% 0.31/0.63 % Other redundant clauses eliminated : 0
% 0.31/0.63 % Clauses deleted for lack of memory : 0
% 0.31/0.63 % Backward-subsumed : 72
% 0.31/0.63 % Backward-rewritten : 0
% 0.31/0.63 % Generated clauses : 436
% 0.31/0.63 % ...of the previous two non-redundant : 383
% 0.31/0.63 % ...aggressively subsumed : 0
% 0.31/0.63 % Contextual simplify-reflections : 0
% 0.31/0.63 % Paramodulations : 416
% 0.31/0.63 % Factorizations : 0
% 0.31/0.63 % NegExts : 0
% 0.31/0.63 % Equation resolutions : 0
% 0.31/0.63 % Disequality decompositions : 0
% 0.31/0.63 % Total rewrite steps : 11
% 0.31/0.63 % ...of those cached : 1
% 0.31/0.63 % Propositional unsat checks : 0
% 0.31/0.63 % Propositional check models : 0
% 0.31/0.63 % Propositional check unsatisfiable : 0
% 0.31/0.63 % Propositional clauses : 0
% 0.31/0.63 % Propositional clauses after purity: 0
% 0.31/0.63 % Propositional unsat core size : 0
% 0.31/0.63 % Propositional preprocessing time : 0.000
% 0.31/0.63 % Propositional encoding time : 0.000
% 0.31/0.63 % Propositional solver time : 0.000
% 0.31/0.63 % Success case prop preproc time : 0.000
% 0.31/0.63 % Success case prop encoding time : 0.000
% 0.31/0.63 % Success case prop solver time : 0.000
% 0.31/0.63 % Current number of processed clauses : 93
% 0.31/0.63 % Positive orientable unit clauses : 14
% 0.31/0.63 % Positive unorientable unit clauses: 0
% 0.31/0.63 % Negative unit clauses : 79
% 0.31/0.63 % Non-unit-clauses : 0
% 0.31/0.63 % Current number of unprocessed clauses: 367
% 0.31/0.63 % ...number of literals in the above : 1091
% 0.31/0.63 % Current number of archived formulas : 0
% 0.31/0.63 % Current number of archived clauses : 269
% 0.31/0.63 % Clause-clause subsumption calls (NU) : 6183
% 0.31/0.63 % Rec. Clause-clause subsumption calls : 5867
% 0.31/0.63 % Non-unit clause-clause subsumptions : 26
% 0.31/0.63 % Unit Clause-clause subsumption calls : 1577
% 0.31/0.63 % Rewrite failures with RHS unbound : 0
% 0.31/0.63 % BW rewrite match attempts : 0
% 0.31/0.63 % BW rewrite match successes : 0
% 0.31/0.63 % Condensation attempts : 0
% 0.31/0.63 % Condensation successes : 0
% 0.31/0.63 % Termbank termtop insertions : 11629
% 0.31/0.63 % Search garbage collected termcells : 1224
% 0.31/0.63
% 0.31/0.63 % -------------------------------------------------
% 0.31/0.63 % User time : 0.039 s
% 0.31/0.63 % System time : 0.008 s
% 0.31/0.63 % Total time : 0.047 s
% 0.31/0.63 % Maximum resident set size: 4044 pages
% 0.31/0.63
% 0.31/0.63 % -------------------------------------------------
% 0.31/0.63 % User time : 0.081 s
% 0.31/0.63 % System time : 0.028 s
% 0.31/0.63 % Total time : 0.109 s
% 0.31/0.63 % Maximum resident set size: 5120 pages
% 0.31/0.63 % E exiting
%------------------------------------------------------------------------------