%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWW951+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 : 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:26 PM UTC 2026
% Result : Theorem 0.10s 0.46s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 24 ( 9 unt; 0 def)
% Number of atoms : 44 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 39 ( 19 ~; 15 |; 1 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-1 aty)
% Number of variables : 20 ( 7 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax64,axiom,
! [X26,X27] :
( ( pred_attacker(tuple_T_in_1(X27))
& pred_attacker(tuple_T_in_3(X26)) )
=> pred_attacker(tuple_T_out_4(name_objective)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax64) ).
fof(ax49,axiom,
! [X15] :
( pred_attacker(X15)
=> pred_attacker(tuple_T_in_3(X15)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax49) ).
fof(ax51,axiom,
! [X17] :
( pred_attacker(X17)
=> pred_attacker(tuple_T_in_1(X17)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax51) ).
fof(co0,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co0) ).
fof(ax60,axiom,
pred_attacker(name_c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax60) ).
fof(ax46,axiom,
! [X12] :
( pred_attacker(tuple_T_out_4(X12))
=> pred_attacker(X12) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax46) ).
fof(c_0_6,plain,
! [X30,X31] :
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(tuple_T_in_1(X31))
| ~ pred_attacker(tuple_T_in_3(X30)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax64])])]) ).
fof(c_0_7,plain,
! [X44] :
( pred_attacker(tuple_T_in_3(X44))
| ~ pred_attacker(X44) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax49])])]) ).
cnf(c_0_8,plain,
( ~ pred_attacker(tuple_T_in_1(X2))
| ~ pred_attacker(tuple_T_in_3(X1))
| pred_attacker(tuple_T_out_4(name_objective)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( ~ pred_attacker(X1)
| pred_attacker(tuple_T_in_3(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X42] :
( pred_attacker(tuple_T_in_1(X42))
| ~ pred_attacker(X42) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax51])])]) ).
cnf(c_0_11,plain,
( ~ pred_attacker(X2)
| ~ pred_attacker(tuple_T_in_1(X1))
| pred_attacker(tuple_T_out_4(name_objective)) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
( ~ pred_attacker(X1)
| pred_attacker(tuple_T_in_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,negated_conjecture,
~ pred_attacker(name_objective),
inference(assume_negation,[status(cth)],[co0]) ).
cnf(c_0_14,plain,
( ~ pred_attacker(X2)
| ~ pred_attacker(X1)
| pred_attacker(tuple_T_out_4(name_objective)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
pred_attacker(name_c),
inference(split_conjunct,[status(thm)],[ax60]) ).
fof(c_0_16,negated_conjecture,
~ pred_attacker(name_objective),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_17,plain,
! [X41] :
( pred_attacker(X41)
| ~ pred_attacker(tuple_T_out_4(X41)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax46])])]) ).
cnf(c_0_18,plain,
( ~ pred_attacker(X1)
| pred_attacker(tuple_T_out_4(name_objective)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_19,negated_conjecture,
~ pred_attacker(name_objective),
inference(fof_nnf,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
( ~ pred_attacker(tuple_T_out_4(X1))
| pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,plain,
pred_attacker(tuple_T_out_4(name_objective)),
inference(spm,[status(thm)],[c_0_18,c_0_15]) ).
cnf(c_0_22,negated_conjecture,
~ pred_attacker(name_objective),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWW951+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n010.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 10:20:25 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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.10/0.46 % Version: 3.5.1
% 0.10/0.46 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.10/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.10/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.46 % Starting sh5l with 300s (1) cores
% 0.10/0.46 % sh5l with pid 656146 completed with status 0
% 0.10/0.46 % Result found by sh5l
% 0.10/0.46 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.10/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.10/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.46 % Starting sh5l with 300s (1) cores
% 0.10/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.10/0.46 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.10/0.46 % Search class: FHUSM-FFMM21-MFFFFFNN
% 0.10/0.46 % partial match(1): FHUSM-FFMF21-MFFFFFNN
% 0.10/0.46 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.46 % Starting SubtermCWHack with 28s (1) cores
% 0.10/0.46 % SubtermCWHack with pid 656154 completed with status 0
% 0.10/0.46 % Result found by SubtermCWHack
% 0.10/0.46 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.10/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.10/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.46 % Starting sh5l with 300s (1) cores
% 0.10/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.10/0.46 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.10/0.46 % Search class: FHUSM-FFMM21-MFFFFFNN
% 0.10/0.46 % partial match(1): FHUSM-FFMF21-MFFFFFNN
% 0.10/0.46 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.46 % Starting SubtermCWHack with 28s (1) cores
% 0.10/0.46 % Preprocessing time : 0.002 s
% 0.10/0.46
% 0.10/0.46 % Proof found!
% 0.10/0.46 % SZS status Theorem
% 0.10/0.46 % SZS output start CNFRefutation
% See solution above
% 0.10/0.46 % Parsed axioms : 66
% 0.10/0.46 % Removed by relevancy pruning/SinE : 6
% 0.10/0.46 % Initial clauses : 60
% 0.10/0.46 % Removed in clause preprocessing : 0
% 0.10/0.46 % Initial clauses in saturation : 60
% 0.10/0.46 % Processed clauses : 67
% 0.10/0.46 % ...of these trivial : 1
% 0.10/0.46 % ...subsumed : 2
% 0.10/0.46 % ...remaining for further processing : 64
% 0.10/0.46 % Other redundant clauses eliminated : 0
% 0.10/0.46 % Clauses deleted for lack of memory : 0
% 0.10/0.46 % Backward-subsumed : 3
% 0.10/0.46 % Backward-rewritten : 1
% 0.10/0.46 % Generated clauses : 55
% 0.10/0.46 % ...of the previous two non-redundant : 39
% 0.10/0.46 % ...aggressively subsumed : 0
% 0.10/0.46 % Contextual simplify-reflections : 0
% 0.10/0.46 % Paramodulations : 55
% 0.10/0.46 % Factorizations : 0
% 0.10/0.46 % NegExts : 0
% 0.10/0.46 % Equation resolutions : 0
% 0.10/0.46 % Disequality decompositions : 0
% 0.10/0.46 % Total rewrite steps : 18
% 0.10/0.46 % ...of those cached : 6
% 0.10/0.46 % Propositional unsat checks : 0
% 0.10/0.46 % Propositional check models : 0
% 0.10/0.46 % Propositional check unsatisfiable : 0
% 0.10/0.46 % Propositional clauses : 0
% 0.10/0.46 % Propositional clauses after purity: 0
% 0.10/0.46 % Propositional unsat core size : 0
% 0.10/0.46 % Propositional preprocessing time : 0.000
% 0.10/0.46 % Propositional encoding time : 0.000
% 0.10/0.46 % Propositional solver time : 0.000
% 0.10/0.46 % Success case prop preproc time : 0.000
% 0.10/0.46 % Success case prop encoding time : 0.000
% 0.10/0.46 % Success case prop solver time : 0.000
% 0.10/0.46 % Current number of processed clauses : 60
% 0.10/0.46 % Positive orientable unit clauses : 12
% 0.10/0.46 % Positive unorientable unit clauses: 1
% 0.10/0.46 % Negative unit clauses : 37
% 0.10/0.46 % Non-unit-clauses : 10
% 0.10/0.46 % Current number of unprocessed clauses: 32
% 0.10/0.46 % ...number of literals in the above : 61
% 0.10/0.46 % Current number of archived formulas : 0
% 0.10/0.46 % Current number of archived clauses : 4
% 0.10/0.46 % Clause-clause subsumption calls (NU) : 190
% 0.10/0.46 % Rec. Clause-clause subsumption calls : 180
% 0.10/0.46 % Non-unit clause-clause subsumptions : 5
% 0.10/0.46 % Unit Clause-clause subsumption calls : 10
% 0.10/0.46 % Rewrite failures with RHS unbound : 0
% 0.10/0.46 % BW rewrite match attempts : 6
% 0.10/0.46 % BW rewrite match successes : 5
% 0.10/0.46 % Condensation attempts : 0
% 0.10/0.46 % Condensation successes : 0
% 0.10/0.46 % Termbank termtop insertions : 2127
% 0.10/0.46 % Search garbage collected termcells : 305
% 0.10/0.46
% 0.10/0.46 % -------------------------------------------------
% 0.10/0.46 % User time : 0.009 s
% 0.10/0.46 % System time : 0.004 s
% 0.10/0.46 % Total time : 0.013 s
% 0.10/0.46 % Maximum resident set size: 3680 pages
% 0.10/0.46
% 0.10/0.46 % -------------------------------------------------
% 0.10/0.46 % User time : 0.011 s
% 0.10/0.46 % System time : 0.012 s
% 0.10/0.46 % Total time : 0.023 s
% 0.10/0.46 % Maximum resident set size: 4608 pages
% 0.10/0.46 % E exiting
%------------------------------------------------------------------------------