%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWW965+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 : n004.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.14s 0.45s
% Output : CNFRefutation 0.14s
% 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(ax184,axiom,
! [X116,X117,X118,X119] :
( ( pred_attacker(tuple_client_B_in_2(X119))
& pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X119,constr_pkey(name_skS))))
& pred_attacker(tuple_client_B_in_3(X117))
& pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X117,name_skB)))
& pred_attacker(tuple_client_B_in_5(X118))
& pred_eq_bitstring_bitstring(name_Nb(X116),constr_adec(X118,name_skB)) )
=> pred_attacker(tuple_client_B_out_6(name_objective)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax184) ).
fof(ax103,axiom,
! [X24,X25] : pred_eq_bitstring_bitstring(X24,X25),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax103) ).
fof(ax137,axiom,
! [X70] :
( pred_attacker(X70)
=> pred_attacker(tuple_client_B_in_5(X70)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax137) ).
fof(ax139,axiom,
! [X72] :
( pred_attacker(X72)
=> pred_attacker(tuple_client_B_in_3(X72)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax139) ).
fof(ax141,axiom,
! [X74] :
( pred_attacker(X74)
=> pred_attacker(tuple_client_B_in_2(X74)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax141) ).
fof(ax173,axiom,
! [X107] : pred_attacker(name_new0x2Dname(X107)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax173) ).
fof(co0,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co0) ).
fof(ax131,axiom,
! [X61] :
( pred_attacker(tuple_client_B_out_6(X61))
=> pred_attacker(X61) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax131) ).
fof(c_0_8,plain,
! [X240,X241,X242,X243] :
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(tuple_client_B_in_2(X243))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X243,constr_pkey(name_skS))))
| ~ pred_attacker(tuple_client_B_in_3(X241))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X241,name_skB)))
| ~ pred_attacker(tuple_client_B_in_5(X242))
| ~ pred_eq_bitstring_bitstring(name_Nb(X240),constr_adec(X242,name_skB)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax184])])]) ).
fof(c_0_9,plain,
! [X148,X149] : pred_eq_bitstring_bitstring(X148,X149),
inference(variable_rename,[status(thm)],[ax103]) ).
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,
! [X194] :
( pred_attacker(tuple_client_B_in_5(X194))
| ~ pred_attacker(X194) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax137])])]) ).
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,
! [X196] :
( pred_attacker(tuple_client_B_in_3(X196))
| ~ pred_attacker(X196) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax139])])]) ).
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,
! [X198] :
( pred_attacker(tuple_client_B_in_2(X198))
| ~ pred_attacker(X198) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax141])])]) ).
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,
! [X231] : pred_attacker(name_new0x2Dname(X231)),
inference(variable_rename,[status(thm)],[ax173]) ).
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,
! [X185] :
( pred_attacker(X185)
| ~ pred_attacker(tuple_client_B_out_6(X185)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax131])])]) ).
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 : SWW965+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.36 % Computer : n004.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 10:20:34 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 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.45 % Version: 3.5.1
% 0.14/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.45 % Starting sh5l with 300s (1) cores
% 0.14/0.45 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2898463 completed with status 0
% 0.14/0.45 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.14/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.45 % No SInE strategy applied
% 0.14/0.45 % Search class: FGUSM-FFMM21-DFFFFFNN
% 0.14/0.45 % partial match(1): FGUSM-FFMF21-DFFFFFNN
% 0.14/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.14/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 169s (1) cores
% 0.14/0.45 % Starting new_bool_3 with 169s (1) cores
% 0.14/0.45 % Starting new_bool_1 with 169s (1) cores
% 0.14/0.45 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 2898477 completed with status 0
% 0.14/0.45 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.14/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.45 % No SInE strategy applied
% 0.14/0.45 % Search class: FGUSM-FFMM21-DFFFFFNN
% 0.14/0.45 % partial match(1): FGUSM-FFMF21-DFFFFFNN
% 0.14/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.14/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 169s (1) cores
% 0.14/0.45 % Preprocessing time : 0.002 s
% 0.14/0.45 % Presaturation interreduction done
% 0.14/0.45
% 0.14/0.45 % Proof found!
% 0.14/0.45 % SZS status Theorem
% 0.14/0.45 % SZS output start CNFRefutation
% See solution above
% 0.14/0.45 % Parsed axioms : 188
% 0.14/0.45 % Removed by relevancy pruning/SinE : 0
% 0.14/0.45 % Initial clauses : 188
% 0.14/0.45 % Removed in clause preprocessing : 1
% 0.14/0.45 % Initial clauses in saturation : 187
% 0.14/0.45 % Processed clauses : 397
% 0.14/0.45 % ...of these trivial : 1
% 0.14/0.45 % ...subsumed : 11
% 0.14/0.45 % ...remaining for further processing : 385
% 0.14/0.45 % Other redundant clauses eliminated : 0
% 0.14/0.45 % Clauses deleted for lack of memory : 0
% 0.14/0.45 % Backward-subsumed : 5
% 0.14/0.45 % Backward-rewritten : 1
% 0.14/0.45 % Generated clauses : 234
% 0.14/0.45 % ...of the previous two non-redundant : 192
% 0.14/0.45 % ...aggressively subsumed : 0
% 0.14/0.45 % Contextual simplify-reflections : 0
% 0.14/0.45 % Paramodulations : 234
% 0.14/0.45 % Factorizations : 0
% 0.14/0.45 % NegExts : 0
% 0.14/0.45 % Equation resolutions : 0
% 0.14/0.45 % Disequality decompositions : 0
% 0.14/0.45 % Total rewrite steps : 23
% 0.14/0.45 % ...of those cached : 7
% 0.14/0.45 % Propositional unsat checks : 0
% 0.14/0.45 % Propositional check models : 0
% 0.14/0.45 % Propositional check unsatisfiable : 0
% 0.14/0.45 % Propositional clauses : 0
% 0.14/0.45 % Propositional clauses after purity: 0
% 0.14/0.45 % Propositional unsat core size : 0
% 0.14/0.45 % Propositional preprocessing time : 0.000
% 0.14/0.45 % Propositional encoding time : 0.000
% 0.14/0.45 % Propositional solver time : 0.000
% 0.14/0.45 % Success case prop preproc time : 0.000
% 0.14/0.45 % Success case prop encoding time : 0.000
% 0.14/0.45 % Success case prop solver time : 0.000
% 0.14/0.45 % Current number of processed clauses : 192
% 0.14/0.45 % Positive orientable unit clauses : 37
% 0.14/0.45 % Positive unorientable unit clauses: 1
% 0.14/0.45 % Negative unit clauses : 92
% 0.14/0.45 % Non-unit-clauses : 62
% 0.14/0.45 % Current number of unprocessed clauses: 149
% 0.14/0.45 % ...number of literals in the above : 435
% 0.14/0.45 % Current number of archived formulas : 0
% 0.14/0.45 % Current number of archived clauses : 194
% 0.14/0.45 % Clause-clause subsumption calls (NU) : 5211
% 0.14/0.45 % Rec. Clause-clause subsumption calls : 5046
% 0.14/0.45 % Non-unit clause-clause subsumptions : 16
% 0.14/0.45 % Unit Clause-clause subsumption calls : 1398
% 0.14/0.45 % Rewrite failures with RHS unbound : 0
% 0.14/0.45 % BW rewrite match attempts : 13
% 0.14/0.45 % BW rewrite match successes : 11
% 0.14/0.45 % Condensation attempts : 0
% 0.14/0.45 % Condensation successes : 0
% 0.14/0.45 % Termbank termtop insertions : 10353
% 0.14/0.45 % Search garbage collected termcells : 1228
% 0.14/0.45
% 0.14/0.45 % -------------------------------------------------
% 0.14/0.45 % User time : 0.015 s
% 0.14/0.45 % System time : 0.005 s
% 0.14/0.45 % Total time : 0.020 s
% 0.14/0.45 % Maximum resident set size: 4092 pages
% 0.14/0.45
% 0.14/0.45 % -------------------------------------------------
% 0.14/0.45 % User time : 0.055 s
% 0.14/0.45 % System time : 0.019 s
% 0.14/0.45 % Total time : 0.075 s
% 0.14/0.45 % Maximum resident set size: 5120 pages
% 0.14/0.45 % E exiting
%------------------------------------------------------------------------------