%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWW950+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 : n026.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:13:05 PM UTC 2026
% Result : Theorem 0.26s 0.58s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of formulae : 52 ( 25 unt; 0 def)
% Number of atoms : 89 ( 15 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 70 ( 33 ~; 29 |; 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 : 65 ( 8 sgn 32 !; 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(ax57,axiom,
! [X14] :
( pred_attacker(tuple_T_out_2(X14))
=> pred_attacker(X14) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax57) ).
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(ax48,axiom,
! [X5,X6,X7] : constr_xor(X5,constr_xor(X6,X7)) = constr_xor(constr_xor(X5,X6),X7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax48) ).
fof(ax45,axiom,
! [X1] : constr_xor(X1,X1) = constr_ZERO,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax45) ).
fof(ax74,axiom,
! [X30,X31] :
( ( pred_attacker(tuple_T_in_1(X31))
& pred_attacker(tuple_T_in_3(X30,constr_h(constr_xor(X30,constr_xor(name_k0x30,name_ki))))) )
=> pred_attacker(tuple_T_out_4(name_objective)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax74) ).
fof(ax58,axiom,
! [X15,X16] :
( ( pred_attacker(X16)
& pred_attacker(X15) )
=> pred_attacker(tuple_T_in_3(X15,X16)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax58) ).
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(co0,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co0) ).
fof(ax55,axiom,
! [X12] :
( pred_attacker(tuple_T_out_4(X12))
=> pred_attacker(X12) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax55) ).
fof(c_0_12,plain,
! [X33] : constr_xor(X33,constr_ZERO) = X33,
inference(variable_rename,[status(thm)],[ax46]) ).
fof(c_0_13,plain,
! [X34,X35] : constr_xor(X34,X35) = constr_xor(X35,X34),
inference(variable_rename,[status(thm)],[ax47]) ).
fof(c_0_14,plain,
! [X45] :
( pred_attacker(X45)
| ~ pred_attacker(tuple_T_out_2(X45)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])])]) ).
fof(c_0_15,plain,
! [X60] :
( pred_attacker(tuple_T_out_2(constr_h(constr_xor(X60,constr_xor(name_k0x30,name_ki)))))
| ~ pred_attacker(tuple_T_in_1(X60)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax73])])]) ).
fof(c_0_16,plain,
! [X36,X37,X38] : constr_xor(X36,constr_xor(X37,X38)) = constr_xor(constr_xor(X36,X37),X38),
inference(variable_rename,[status(thm)],[ax48]) ).
fof(c_0_17,plain,
! [X32] : constr_xor(X32,X32) = constr_ZERO,
inference(variable_rename,[status(thm)],[ax45]) ).
cnf(c_0_18,plain,
constr_xor(X1,constr_ZERO) = X1,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
constr_xor(X1,X2) = constr_xor(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( ~ pred_attacker(tuple_T_out_2(X1))
| pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
( ~ pred_attacker(tuple_T_in_1(X1))
| pred_attacker(tuple_T_out_2(constr_h(constr_xor(X1,constr_xor(name_k0x30,name_ki))))) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
constr_xor(X1,constr_xor(X2,X3)) = constr_xor(constr_xor(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
constr_xor(X1,X1) = constr_ZERO,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
constr_xor(constr_ZERO,X1) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
( ~ pred_attacker(tuple_T_in_1(X1))
| pred_attacker(constr_h(constr_xor(X1,constr_xor(name_k0x30,name_ki)))) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
constr_xor(X1,constr_xor(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_27,plain,
( ~ pred_attacker(tuple_T_in_1(X1))
| pred_attacker(constr_h(constr_xor(name_k0x30,constr_xor(name_ki,X1)))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_19]),c_0_22]) ).
cnf(c_0_28,plain,
constr_xor(X1,constr_xor(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_26,c_0_19]) ).
fof(c_0_29,plain,
! [X61,X62] :
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(tuple_T_in_1(X62))
| ~ pred_attacker(tuple_T_in_3(X61,constr_h(constr_xor(X61,constr_xor(name_k0x30,name_ki))))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax74])])]) ).
fof(c_0_30,plain,
! [X46,X47] :
( pred_attacker(tuple_T_in_3(X46,X47))
| ~ pred_attacker(X47)
| ~ pred_attacker(X46) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax58])])]) ).
cnf(c_0_31,plain,
( ~ pred_attacker(tuple_T_in_1(constr_xor(X1,name_ki)))
| pred_attacker(constr_h(constr_xor(name_k0x30,X1))) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
fof(c_0_32,plain,
! [X52] :
( pred_attacker(tuple_T_in_1(X52))
| ~ pred_attacker(X52) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax61])])]) ).
cnf(c_0_33,plain,
( ~ pred_attacker(tuple_T_in_1(X2))
| ~ pred_attacker(tuple_T_in_3(X1,constr_h(constr_xor(X1,constr_xor(name_k0x30,name_ki)))))
| pred_attacker(tuple_T_out_4(name_objective)) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_34,plain,
( ~ pred_attacker(X2)
| ~ pred_attacker(X1)
| pred_attacker(tuple_T_in_3(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_35,plain,
( ~ pred_attacker(tuple_T_in_1(constr_xor(X1,constr_xor(name_k0x30,name_ki))))
| pred_attacker(constr_h(X1)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_28]),c_0_22]) ).
cnf(c_0_36,plain,
( ~ pred_attacker(X1)
| pred_attacker(tuple_T_in_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_37,plain,
( ~ pred_attacker(X1)
| ~ pred_attacker(tuple_T_in_1(X2))
| ~ pred_attacker(constr_h(constr_xor(X1,constr_xor(name_k0x30,name_ki))))
| pred_attacker(tuple_T_out_4(name_objective)) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,plain,
( ~ pred_attacker(constr_xor(X1,constr_xor(name_k0x30,name_ki)))
| pred_attacker(constr_h(X1)) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,plain,
( ~ pred_attacker(X2)
| ~ pred_attacker(tuple_T_in_1(X1))
| pred_attacker(tuple_T_out_4(name_objective)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_22]),c_0_23]),c_0_18])]) ).
fof(c_0_40,plain,
! [X59] : pred_attacker(name_new0x2Dname(X59)),
inference(variable_rename,[status(thm)],[ax72]) ).
fof(c_0_41,negated_conjecture,
~ pred_attacker(name_objective),
inference(assume_negation,[status(cth)],[co0]) ).
cnf(c_0_42,plain,
( ~ pred_attacker(X2)
| ~ pred_attacker(X1)
| pred_attacker(tuple_T_out_4(name_objective)) ),
inference(spm,[status(thm)],[c_0_39,c_0_36]) ).
cnf(c_0_43,plain,
pred_attacker(name_new0x2Dname(X1)),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
fof(c_0_44,negated_conjecture,
~ pred_attacker(name_objective),
inference(fof_simplification,[status(thm)],[c_0_41]) ).
fof(c_0_45,plain,
! [X43] :
( pred_attacker(X43)
| ~ pred_attacker(tuple_T_out_4(X43)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])])]) ).
cnf(c_0_46,plain,
( ~ pred_attacker(X1)
| pred_attacker(tuple_T_out_4(name_objective)) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
fof(c_0_47,negated_conjecture,
~ pred_attacker(name_objective),
inference(fof_nnf,[status(thm)],[c_0_44]) ).
cnf(c_0_48,plain,
( ~ pred_attacker(tuple_T_out_4(X1))
| pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_49,plain,
pred_attacker(tuple_T_out_4(name_objective)),
inference(spm,[status(thm)],[c_0_46,c_0_43]) ).
cnf(c_0_50,negated_conjecture,
~ pred_attacker(name_objective),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_51,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWW950+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.44 % Computer : n026.cluster.edu
% 0.17/0.44 % Model : x86_64 x86_64
% 0.17/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.44 % Memory : 8046.5625MB
% 0.17/0.44 % OS : Linux 6.8.0-71-generic
% 0.17/0.45 % CPULimit : 300
% 0.17/0.45 % WCLimit : 300
% 0.17/0.45 % DateTime : Mon Sep 21 10:22:51 UTC 2026
% 0.17/0.45 % CPUTime :
% 0.17/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.50 Running first-order theorem proving
% 0.17/0.50 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.26/0.58 % Version: 3.5.1
% 0.26/0.58 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.26/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.26/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.58 % Starting sh5l with 300s (1) cores
% 0.26/0.58 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 2020631 completed with status 0
% 0.26/0.58 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.26/0.58 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.26/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.26/0.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.58 % No SInE strategy applied
% 0.26/0.58 % Search class: FHUSM-FFMM21-MFFFFFNN
% 0.26/0.58 % partial match(1): FHUSM-FFMF21-MFFFFFNN
% 0.26/0.58 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.58 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.26/0.58 % Starting G-E--_100_C18_F1_PI_AE_Q4_CS_SP_S0Y with 212s (1) cores
% 0.26/0.58 % Starting H----_042_B03_F1_AE_Q4_SP_S2S with 136s (1) cores
% 0.26/0.58 % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.26/0.58 % SubtermCWHack with pid 2020638 completed with status 0
% 0.26/0.58 % Result found by SubtermCWHack
% 0.26/0.58 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.26/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.26/0.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.58 % No SInE strategy applied
% 0.26/0.58 % Search class: FHUSM-FFMM21-MFFFFFNN
% 0.26/0.58 % partial match(1): FHUSM-FFMF21-MFFFFFNN
% 0.26/0.58 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.58 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.58 % Preprocessing time : 0.001 s
% 0.26/0.58
% 0.26/0.58 % Proof found!
% 0.26/0.58 % SZS status Theorem
% 0.26/0.58 % SZS output start CNFRefutation
% See solution above
% 0.26/0.58 % Parsed axioms : 76
% 0.26/0.58 % Removed by relevancy pruning/SinE : 0
% 0.26/0.58 % Initial clauses : 76
% 0.26/0.58 % Removed in clause preprocessing : 0
% 0.26/0.58 % Initial clauses in saturation : 76
% 0.26/0.58 % Processed clauses : 323
% 0.26/0.58 % ...of these trivial : 8
% 0.26/0.58 % ...subsumed : 184
% 0.26/0.58 % ...remaining for further processing : 131
% 0.26/0.58 % Other redundant clauses eliminated : 0
% 0.26/0.58 % Clauses deleted for lack of memory : 0
% 0.26/0.58 % Backward-subsumed : 10
% 0.26/0.58 % Backward-rewritten : 3
% 0.26/0.58 % Generated clauses : 998
% 0.26/0.58 % ...of the previous two non-redundant : 828
% 0.26/0.58 % ...aggressively subsumed : 0
% 0.26/0.58 % Contextual simplify-reflections : 0
% 0.26/0.58 % Paramodulations : 998
% 0.26/0.58 % Factorizations : 0
% 0.26/0.58 % NegExts : 0
% 0.26/0.58 % Equation resolutions : 0
% 0.26/0.58 % Disequality decompositions : 0
% 0.26/0.58 % Total rewrite steps : 702
% 0.26/0.58 % ...of those cached : 508
% 0.26/0.58 % Propositional unsat checks : 0
% 0.26/0.58 % Propositional check models : 0
% 0.26/0.58 % Propositional check unsatisfiable : 0
% 0.26/0.58 % Propositional clauses : 0
% 0.26/0.58 % Propositional clauses after purity: 0
% 0.26/0.58 % Propositional unsat core size : 0
% 0.26/0.58 % Propositional preprocessing time : 0.000
% 0.26/0.58 % Propositional encoding time : 0.000
% 0.26/0.58 % Propositional solver time : 0.000
% 0.26/0.58 % Success case prop preproc time : 0.000
% 0.26/0.58 % Success case prop encoding time : 0.000
% 0.26/0.58 % Success case prop solver time : 0.000
% 0.26/0.58 % Current number of processed clauses : 118
% 0.26/0.58 % Positive orientable unit clauses : 20
% 0.26/0.58 % Positive unorientable unit clauses: 4
% 0.26/0.58 % Negative unit clauses : 46
% 0.26/0.58 % Non-unit-clauses : 48
% 0.26/0.58 % Current number of unprocessed clauses: 577
% 0.26/0.58 % ...number of literals in the above : 1253
% 0.26/0.58 % Current number of archived formulas : 0
% 0.26/0.58 % Current number of archived clauses : 13
% 0.26/0.58 % Clause-clause subsumption calls (NU) : 2509
% 0.26/0.58 % Rec. Clause-clause subsumption calls : 2456
% 0.26/0.58 % Non-unit clause-clause subsumptions : 137
% 0.26/0.58 % Unit Clause-clause subsumption calls : 104
% 0.26/0.58 % Rewrite failures with RHS unbound : 0
% 0.26/0.58 % BW rewrite match attempts : 54
% 0.26/0.58 % BW rewrite match successes : 44
% 0.26/0.58 % Condensation attempts : 0
% 0.26/0.58 % Condensation successes : 0
% 0.26/0.58 % Termbank termtop insertions : 12241
% 0.26/0.58 % Search garbage collected termcells : 369
% 0.26/0.58
% 0.26/0.58 % -------------------------------------------------
% 0.26/0.58 % User time : 0.026 s
% 0.26/0.58 % System time : 0.006 s
% 0.26/0.58 % Total time : 0.032 s
% 0.26/0.58 % Maximum resident set size: 3688 pages
% 0.26/0.58
% 0.26/0.58 % -------------------------------------------------
% 0.26/0.58 % User time : 0.099 s
% 0.26/0.58 % System time : 0.019 s
% 0.26/0.58 % Total time : 0.118 s
% 0.26/0.58 % Maximum resident set size: 4608 pages
% 0.26/0.58 % E exiting
%------------------------------------------------------------------------------