%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWW955+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 : n010.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.14s 0.43s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of formulae : 44 ( 18 unt; 0 def)
% Number of atoms : 74 ( 6 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 56 ( 26 ~; 22 |; 1 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-2 aty)
% Number of variables : 42 ( 2 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax67,axiom,
! [X22] :
( pred_attacker(tuple_A_out_3(X22))
=> pred_attacker(X22) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax67) ).
fof(ax78,axiom,
! [X33] :
( pred_attacker(tuple_A_in_2(X33))
=> pred_attacker(tuple_A_out_3(constr_comm_dec(X33,name_Ka))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax78) ).
fof(ax79,axiom,
! [X34] :
( pred_attacker(tuple_A_in_2(X34))
=> pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax79) ).
fof(ax70,axiom,
! [X25] :
( pred_attacker(X25)
=> pred_attacker(tuple_A_in_2(X25)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax70) ).
fof(ax46,axiom,
! [X3,X4] : constr_comm_dec(constr_comm_enc(X4,X3),X3) = X4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax46) ).
fof(ax69,axiom,
! [X24] :
( pred_attacker(tuple_A_out_1(X24))
=> pred_attacker(X24) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax69) ).
fof(co0,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co0) ).
fof(ax50,axiom,
! [X7,X8] :
( ( pred_attacker(X8)
& pred_attacker(X7) )
=> pred_attacker(constr_dec(X7,X8)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax50) ).
fof(ax45,axiom,
! [X1,X2] : constr_dec(constr_enc(X2,X1),X1) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax45) ).
fof(ax65,axiom,
! [X20] :
( pred_attacker(tuple_A_out_4(X20))
=> pred_attacker(X20) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax65) ).
fof(ax77,axiom,
pred_attacker(tuple_A_out_1(constr_comm_enc(name_m_9,name_Ka))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax77) ).
fof(c_0_11,plain,
! [X54] :
( pred_attacker(X54)
| ~ pred_attacker(tuple_A_out_3(X54)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax67])])]) ).
fof(c_0_12,plain,
! [X37] :
( pred_attacker(tuple_A_out_3(constr_comm_dec(X37,name_Ka)))
| ~ pred_attacker(tuple_A_in_2(X37)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax78])])]) ).
fof(c_0_13,plain,
! [X36] :
( pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9)))
| ~ pred_attacker(tuple_A_in_2(X36)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax79])])]) ).
fof(c_0_14,plain,
! [X45] :
( pred_attacker(tuple_A_in_2(X45))
| ~ pred_attacker(X45) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax70])])]) ).
cnf(c_0_15,plain,
( ~ pred_attacker(tuple_A_out_3(X1))
| pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( ~ pred_attacker(tuple_A_in_2(X1))
| pred_attacker(tuple_A_out_3(constr_comm_dec(X1,name_Ka))) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_17,plain,
! [X49,X50] : constr_comm_dec(constr_comm_enc(X50,X49),X49) = X50,
inference(variable_rename,[status(thm)],[ax46]) ).
cnf(c_0_18,plain,
( ~ pred_attacker(tuple_A_in_2(X1))
| pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9))) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( ~ pred_attacker(X1)
| pred_attacker(tuple_A_in_2(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( ~ pred_attacker(tuple_A_in_2(X1))
| pred_attacker(constr_comm_dec(X1,name_Ka)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
constr_comm_dec(constr_comm_enc(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_22,plain,
! [X48] :
( pred_attacker(X48)
| ~ pred_attacker(tuple_A_out_1(X48)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax69])])]) ).
fof(c_0_23,negated_conjecture,
~ pred_attacker(name_objective),
inference(assume_negation,[status(cth)],[co0]) ).
fof(c_0_24,plain,
! [X61,X62] :
( pred_attacker(constr_dec(X61,X62))
| ~ pred_attacker(X62)
| ~ pred_attacker(X61) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax50])])]) ).
fof(c_0_25,plain,
! [X41,X42] : constr_dec(constr_enc(X42,X41),X41) = X42,
inference(variable_rename,[status(thm)],[ax45]) ).
fof(c_0_26,plain,
! [X40] :
( pred_attacker(X40)
| ~ pred_attacker(tuple_A_out_4(X40)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax65])])]) ).
cnf(c_0_27,plain,
( ~ pred_attacker(X1)
| pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9))) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_28,plain,
pred_attacker(tuple_A_out_1(constr_comm_enc(name_m_9,name_Ka))),
inference(split_conjunct,[status(thm)],[ax77]) ).
cnf(c_0_29,plain,
( ~ pred_attacker(tuple_A_in_2(constr_comm_enc(X1,name_Ka)))
| pred_attacker(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_30,plain,
( ~ pred_attacker(tuple_A_out_1(X1))
| pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_31,negated_conjecture,
~ pred_attacker(name_objective),
inference(fof_simplification,[status(thm)],[c_0_23]) ).
cnf(c_0_32,plain,
( ~ pred_attacker(X2)
| ~ pred_attacker(X1)
| pred_attacker(constr_dec(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_33,plain,
constr_dec(constr_enc(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_34,plain,
( ~ pred_attacker(tuple_A_out_4(X1))
| pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_35,plain,
pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9))),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_36,plain,
( ~ pred_attacker(constr_comm_enc(X1,name_Ka))
| pred_attacker(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_19]) ).
cnf(c_0_37,plain,
pred_attacker(constr_comm_enc(name_m_9,name_Ka)),
inference(spm,[status(thm)],[c_0_30,c_0_28]) ).
fof(c_0_38,negated_conjecture,
~ pred_attacker(name_objective),
inference(fof_nnf,[status(thm)],[c_0_31]) ).
cnf(c_0_39,plain,
( ~ pred_attacker(X2)
| ~ pred_attacker(constr_enc(X1,X2))
| pred_attacker(X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_40,plain,
pred_attacker(constr_enc(name_objective,name_m_9)),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,plain,
pred_attacker(name_m_9),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,negated_conjecture,
~ pred_attacker(name_objective),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_43,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW955+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.12/0.36 % Computer : n010.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8046.5625MB
% 0.12/0.36 % OS : Linux 6.8.0-71-generic
% 0.12/0.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 300
% 0.12/0.36 % DateTime : Mon Sep 21 10:20:40 UTC 2026
% 0.12/0.36 % CPUTime :
% 0.12/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.43 % Version: 3.5.1
% 0.14/0.43 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 % Starting sh5l with 300s (1) cores
% 0.14/0.43 % sh5l with pid 656955 completed with status 0
% 0.14/0.43 % Result found by sh5l
% 0.14/0.43 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 % Starting sh5l with 300s (1) cores
% 0.14/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/0.43 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.43 % Search class: FHUSS-FFMM21-SFFFFFNN
% 0.14/0.43 % partial match(1): FHUSS-FFMM21-MFFFFFNN
% 0.14/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.43 % SubtermCWHack with pid 656957 completed with status 0
% 0.14/0.43 % Result found by SubtermCWHack
% 0.14/0.43 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 % Starting sh5l with 300s (1) cores
% 0.14/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/0.43 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.43 % Search class: FHUSS-FFMM21-SFFFFFNN
% 0.14/0.43 % partial match(1): FHUSS-FFMM21-MFFFFFNN
% 0.14/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.43 % Preprocessing time : 0.002 s
% 0.14/0.43
% 0.14/0.43 % Proof found!
% 0.14/0.43 % SZS status Theorem
% 0.14/0.43 % SZS output start CNFRefutation
% See solution above
% 0.14/0.43 % Parsed axioms : 82
% 0.14/0.43 % Removed by relevancy pruning/SinE : 8
% 0.14/0.43 % Initial clauses : 74
% 0.14/0.43 % Removed in clause preprocessing : 0
% 0.14/0.43 % Initial clauses in saturation : 74
% 0.14/0.43 % Processed clauses : 85
% 0.14/0.43 % ...of these trivial : 0
% 0.14/0.43 % ...subsumed : 0
% 0.14/0.43 % ...remaining for further processing : 85
% 0.14/0.43 % Other redundant clauses eliminated : 0
% 0.14/0.43 % Clauses deleted for lack of memory : 0
% 0.14/0.43 % Backward-subsumed : 1
% 0.14/0.43 % Backward-rewritten : 1
% 0.14/0.43 % Generated clauses : 39
% 0.14/0.43 % ...of the previous two non-redundant : 30
% 0.14/0.43 % ...aggressively subsumed : 0
% 0.14/0.43 % Contextual simplify-reflections : 0
% 0.14/0.43 % Paramodulations : 39
% 0.14/0.43 % Factorizations : 0
% 0.14/0.43 % NegExts : 0
% 0.14/0.43 % Equation resolutions : 0
% 0.14/0.43 % Disequality decompositions : 0
% 0.14/0.43 % Total rewrite steps : 2
% 0.14/0.43 % ...of those cached : 0
% 0.14/0.43 % Propositional unsat checks : 0
% 0.14/0.43 % Propositional check models : 0
% 0.14/0.43 % Propositional check unsatisfiable : 0
% 0.14/0.43 % Propositional clauses : 0
% 0.14/0.43 % Propositional clauses after purity: 0
% 0.14/0.43 % Propositional unsat core size : 0
% 0.14/0.43 % Propositional preprocessing time : 0.000
% 0.14/0.43 % Propositional encoding time : 0.000
% 0.14/0.43 % Propositional solver time : 0.000
% 0.14/0.43 % Success case prop preproc time : 0.000
% 0.14/0.43 % Success case prop encoding time : 0.000
% 0.14/0.43 % Success case prop solver time : 0.000
% 0.14/0.43 % Current number of processed clauses : 83
% 0.14/0.43 % Positive orientable unit clauses : 13
% 0.14/0.43 % Positive unorientable unit clauses: 0
% 0.14/0.43 % Negative unit clauses : 46
% 0.14/0.43 % Non-unit-clauses : 24
% 0.14/0.43 % Current number of unprocessed clauses: 6
% 0.14/0.43 % ...number of literals in the above : 17
% 0.14/0.43 % Current number of archived formulas : 0
% 0.14/0.43 % Current number of archived clauses : 2
% 0.14/0.43 % Clause-clause subsumption calls (NU) : 229
% 0.14/0.43 % Rec. Clause-clause subsumption calls : 214
% 0.14/0.43 % Non-unit clause-clause subsumptions : 1
% 0.14/0.43 % Unit Clause-clause subsumption calls : 79
% 0.14/0.43 % Rewrite failures with RHS unbound : 0
% 0.14/0.43 % BW rewrite match attempts : 1
% 0.14/0.43 % BW rewrite match successes : 1
% 0.14/0.43 % Condensation attempts : 0
% 0.14/0.43 % Condensation successes : 0
% 0.14/0.43 % Termbank termtop insertions : 2742
% 0.14/0.43 % Search garbage collected termcells : 438
% 0.14/0.43
% 0.14/0.43 % -------------------------------------------------
% 0.14/0.43 % User time : 0.006 s
% 0.14/0.43 % System time : 0.002 s
% 0.14/0.43 % Total time : 0.007 s
% 0.14/0.43 % Maximum resident set size: 3696 pages
% 0.14/0.43
% 0.14/0.43 % -------------------------------------------------
% 0.14/0.43 % User time : 0.011 s
% 0.14/0.43 % System time : 0.003 s
% 0.14/0.43 % Total time : 0.014 s
% 0.14/0.43 % Maximum resident set size: 4864 pages
% 0.14/0.43 % E exiting
%------------------------------------------------------------------------------