%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWW961+1 : TPTP v9.3.1. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n009.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:07 PM UTC 2026
% Result : Theorem 0.23s 0.57s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 17 unt; 0 def)
% Number of atoms : 25 ( 7 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 11 ( 7 ~; 3 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 29 ( 7 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax83,axiom,
! [X12,X13] : constr_assoc_pair_2_get_1_bitstring(tuple_assoc_pair(X12,X13)) = X13,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax83) ).
fof(ax82,axiom,
! [X9,X10,X11] : tuple_assoc_pair(X9,tuple_assoc_pair(X10,X11)) = tuple_assoc_pair(tuple_assoc_pair(X9,X10),X11),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax82) ).
fof(co0,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co0) ).
fof(ax143,axiom,
! [X94,X95] :
( pred_attacker(tuple_assoc_pair(X94,X95))
=> pred_attacker(X94) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax143) ).
fof(ax162,axiom,
! [X113] : pred_attacker(name_new0x2Dname(X113)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax162) ).
fof(c_0_5,plain,
! [X142,X143] : constr_assoc_pair_2_get_1_bitstring(tuple_assoc_pair(X142,X143)) = X143,
inference(variable_rename,[status(thm)],[ax83]) ).
fof(c_0_6,plain,
! [X139,X140,X141] : tuple_assoc_pair(X139,tuple_assoc_pair(X140,X141)) = tuple_assoc_pair(tuple_assoc_pair(X139,X140),X141),
inference(variable_rename,[status(thm)],[ax82]) ).
fof(c_0_7,negated_conjecture,
~ pred_attacker(name_objective),
inference(assume_negation,[status(cth)],[co0]) ).
fof(c_0_8,plain,
! [X224,X225] :
( pred_attacker(X224)
| ~ pred_attacker(tuple_assoc_pair(X224,X225)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax143])])]) ).
cnf(c_0_9,plain,
constr_assoc_pair_2_get_1_bitstring(tuple_assoc_pair(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
tuple_assoc_pair(X1,tuple_assoc_pair(X2,X3)) = tuple_assoc_pair(tuple_assoc_pair(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_11,negated_conjecture,
~ pred_attacker(name_objective),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( ~ pred_attacker(tuple_assoc_pair(X1,X2))
| pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
tuple_assoc_pair(X1,X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_9]) ).
fof(c_0_14,plain,
! [X243] : pred_attacker(name_new0x2Dname(X243)),
inference(variable_rename,[status(thm)],[ax162]) ).
fof(c_0_15,negated_conjecture,
~ pred_attacker(name_objective),
inference(fof_nnf,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( ~ pred_attacker(X2)
| pred_attacker(X1) ),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
pred_attacker(name_new0x2Dname(X1)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,negated_conjecture,
~ pred_attacker(name_objective),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
pred_attacker(X1),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]),
[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/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.45 % Computer : n009.cluster.edu
% 0.19/0.45 % Model : x86_64 x86_64
% 0.19/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45 % Memory : 8046.5625MB
% 0.19/0.45 % OS : Linux 6.8.0-71-generic
% 0.19/0.45 % CPULimit : 300
% 0.19/0.45 % WCLimit : 300
% 0.19/0.45 % DateTime : Mon Sep 21 10:20:42 UTC 2026
% 0.19/0.46 % CPUTime :
% 0.19/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.51 Running first-order theorem proving
% 0.19/0.51 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.23/0.57 % Version: 3.5.1
% 0.23/0.57 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.57 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.57 % Starting sh5l with 300s (1) cores
% 0.23/0.57 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1505846 completed with status 0
% 0.23/0.57 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.23/0.57 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.57 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.57 % No SInE strategy applied
% 0.23/0.57 % Search class: FGUSM-FFMM21-MFFFFFNN
% 0.23/0.57 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.57 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.57 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.23/0.57 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.23/0.57 % Starting new_bool_3 with 136s (1) cores
% 0.23/0.57 % Starting new_bool_1 with 136s (1) cores
% 0.23/0.57 % SubtermCWHack with pid 1505852 completed with status 0
% 0.23/0.57 % Result found by SubtermCWHack
% 0.23/0.57 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.57 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.57 % No SInE strategy applied
% 0.23/0.57 % Search class: FGUSM-FFMM21-MFFFFFNN
% 0.23/0.57 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.57 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.57 % Preprocessing time : 0.004 s
% 0.23/0.57
% 0.23/0.57 % Proof found!
% 0.23/0.57 % SZS status Theorem
% 0.23/0.57 % SZS output start CNFRefutation
% See solution above
% 0.23/0.57 % Parsed axioms : 177
% 0.23/0.57 % Removed by relevancy pruning/SinE : 0
% 0.23/0.57 % Initial clauses : 177
% 0.23/0.57 % Removed in clause preprocessing : 1
% 0.23/0.57 % Initial clauses in saturation : 176
% 0.23/0.57 % Processed clauses : 186
% 0.23/0.57 % ...of these trivial : 0
% 0.23/0.57 % ...subsumed : 7
% 0.23/0.57 % ...remaining for further processing : 179
% 0.23/0.57 % Other redundant clauses eliminated : 0
% 0.23/0.57 % Clauses deleted for lack of memory : 0
% 0.23/0.57 % Backward-subsumed : 59
% 0.23/0.57 % Backward-rewritten : 31
% 0.23/0.57 % Generated clauses : 74
% 0.23/0.57 % ...of the previous two non-redundant : 46
% 0.23/0.57 % ...aggressively subsumed : 0
% 0.23/0.57 % Contextual simplify-reflections : 0
% 0.23/0.57 % Paramodulations : 74
% 0.23/0.57 % Factorizations : 0
% 0.23/0.57 % NegExts : 0
% 0.23/0.57 % Equation resolutions : 0
% 0.23/0.57 % Disequality decompositions : 0
% 0.23/0.57 % Total rewrite steps : 35
% 0.23/0.57 % ...of those cached : 0
% 0.23/0.57 % Propositional unsat checks : 0
% 0.23/0.57 % Propositional check models : 0
% 0.23/0.57 % Propositional check unsatisfiable : 0
% 0.23/0.57 % Propositional clauses : 0
% 0.23/0.57 % Propositional clauses after purity: 0
% 0.23/0.57 % Propositional unsat core size : 0
% 0.23/0.57 % Propositional preprocessing time : 0.000
% 0.23/0.57 % Propositional encoding time : 0.000
% 0.23/0.57 % Propositional solver time : 0.000
% 0.23/0.57 % Success case prop preproc time : 0.000
% 0.23/0.57 % Success case prop encoding time : 0.000
% 0.23/0.57 % Success case prop solver time : 0.000
% 0.23/0.57 % Current number of processed clauses : 89
% 0.23/0.57 % Positive orientable unit clauses : 11
% 0.23/0.57 % Positive unorientable unit clauses: 0
% 0.23/0.57 % Negative unit clauses : 78
% 0.23/0.57 % Non-unit-clauses : 0
% 0.23/0.57 % Current number of unprocessed clauses: 35
% 0.23/0.57 % ...number of literals in the above : 52
% 0.23/0.57 % Current number of archived formulas : 0
% 0.23/0.57 % Current number of archived clauses : 91
% 0.23/0.57 % Clause-clause subsumption calls (NU) : 2729
% 0.23/0.57 % Rec. Clause-clause subsumption calls : 2669
% 0.23/0.57 % Non-unit clause-clause subsumptions : 66
% 0.23/0.57 % Unit Clause-clause subsumption calls : 649
% 0.23/0.57 % Rewrite failures with RHS unbound : 0
% 0.23/0.57 % BW rewrite match attempts : 28
% 0.23/0.57 % BW rewrite match successes : 28
% 0.23/0.57 % Condensation attempts : 0
% 0.23/0.57 % Condensation successes : 0
% 0.23/0.57 % Termbank termtop insertions : 8055
% 0.23/0.57 % Search garbage collected termcells : 1224
% 0.23/0.57
% 0.23/0.57 % -------------------------------------------------
% 0.23/0.57 % User time : 0.019 s
% 0.23/0.57 % System time : 0.010 s
% 0.23/0.57 % Total time : 0.029 s
% 0.23/0.57 % Maximum resident set size: 3788 pages
% 0.23/0.57
% 0.23/0.57 % -------------------------------------------------
% 0.23/0.57 % User time : 0.051 s
% 0.23/0.57 % System time : 0.023 s
% 0.23/0.57 % Total time : 0.074 s
% 0.23/0.57 % Maximum resident set size: 4864 pages
% 0.23/0.57 % E exiting
%------------------------------------------------------------------------------