%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWB003+2 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n007.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 02:37:49 PM UTC 2026
% Result : Theorem 0.10s 0.42s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 7 ( 7 unt; 0 def)
% Number of atoms : 7 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 4 ( 1 sgn 1 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(testcase_conclusion_fullish_003_Blank_Nodes_for_Literals,conjecture,
? [X1] : iext(uri_ex_p,uri_ex_s,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_conclusion_fullish_003_Blank_Nodes_for_Literals) ).
fof(testcase_premise_fullish_003_Blank_Nodes_for_Literals,axiom,
iext(uri_ex_p,uri_ex_s,literal_plain(dat_str_foo)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_premise_fullish_003_Blank_Nodes_for_Literals) ).
fof(c_0_2,negated_conjecture,
~ ? [X1] : iext(uri_ex_p,uri_ex_s,X1),
inference(assume_negation,[status(cth)],[testcase_conclusion_fullish_003_Blank_Nodes_for_Literals]) ).
fof(c_0_3,negated_conjecture,
! [X2] : ~ iext(uri_ex_p,uri_ex_s,X2),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
cnf(c_0_4,plain,
iext(uri_ex_p,uri_ex_s,literal_plain(dat_str_foo)),
inference(split_conjunct,[status(thm)],[testcase_premise_fullish_003_Blank_Nodes_for_Literals]) ).
cnf(c_0_5,negated_conjecture,
~ iext(uri_ex_p,uri_ex_s,X1),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
$false,
inference(sr,[status(thm)],[c_0_4,c_0_5]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWB003+2 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n007.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 07:34:51 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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.10/0.42 % Version: 3.5.1
% 0.10/0.42 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.42 % Starting sh5l with 300s (1) cores
% 0.10/0.42 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 547583 completed with status 0
% 0.10/0.42 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.10/0.42 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.42 % No SInE strategy applied
% 0.10/0.42 % Search class: FUUNF-FFSF11-SFFFFFNN
% 0.10/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.10/0.42 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.10/0.42 % Starting new_bool_3 with 136s (1) cores
% 0.10/0.42 % Starting new_bool_1 with 136s (1) cores
% 0.10/0.42 % new_bool_3 with pid 547590 completed with status 0
% 0.10/0.42 % Result found by new_bool_3
% 0.10/0.42 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.42 % No SInE strategy applied
% 0.10/0.42 % Search class: FUUNF-FFSF11-SFFFFFNN
% 0.10/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.10/0.42 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.10/0.42 % Starting new_bool_3 with 136s (1) cores
% 0.10/0.42 % Preprocessing time : 0.001 s
% 0.10/0.42 % Presaturation interreduction done
% 0.10/0.42
% 0.10/0.42 % Proof found!
% 0.10/0.42 % SZS status Theorem
% 0.10/0.42 % SZS output start CNFRefutation
% See solution above
% 0.10/0.42 % Parsed axioms : 2
% 0.10/0.42 % Removed by relevancy pruning/SinE : 0
% 0.10/0.42 % Initial clauses : 2
% 0.10/0.42 % Removed in clause preprocessing : 0
% 0.10/0.42 % Initial clauses in saturation : 2
% 0.10/0.42 % Processed clauses : 2
% 0.10/0.42 % ...of these trivial : 0
% 0.10/0.42 % ...subsumed : 0
% 0.10/0.42 % ...remaining for further processing : 1
% 0.10/0.42 % Other redundant clauses eliminated : 0
% 0.10/0.42 % Clauses deleted for lack of memory : 0
% 0.10/0.42 % Backward-subsumed : 0
% 0.10/0.42 % Backward-rewritten : 0
% 0.10/0.42 % Generated clauses : 0
% 0.10/0.42 % ...of the previous two non-redundant : 0
% 0.10/0.42 % ...aggressively subsumed : 0
% 0.10/0.42 % Contextual simplify-reflections : 0
% 0.10/0.42 % Paramodulations : 0
% 0.10/0.42 % Factorizations : 0
% 0.10/0.42 % NegExts : 0
% 0.10/0.42 % Equation resolutions : 0
% 0.10/0.42 % Disequality decompositions : 0
% 0.10/0.42 % Total rewrite steps : 0
% 0.10/0.42 % ...of those cached : 0
% 0.10/0.42 % Propositional unsat checks : 0
% 0.10/0.42 % Propositional check models : 0
% 0.10/0.42 % Propositional check unsatisfiable : 0
% 0.10/0.42 % Propositional clauses : 0
% 0.10/0.42 % Propositional clauses after purity: 0
% 0.10/0.42 % Propositional unsat core size : 0
% 0.10/0.42 % Propositional preprocessing time : 0.000
% 0.10/0.42 % Propositional encoding time : 0.000
% 0.10/0.42 % Propositional solver time : 0.000
% 0.10/0.42 % Success case prop preproc time : 0.000
% 0.10/0.42 % Success case prop encoding time : 0.000
% 0.10/0.42 % Success case prop solver time : 0.000
% 0.10/0.42 % Current number of processed clauses : 1
% 0.10/0.42 % Positive orientable unit clauses : 0
% 0.10/0.42 % Positive unorientable unit clauses: 0
% 0.10/0.42 % Negative unit clauses : 1
% 0.10/0.42 % Non-unit-clauses : 0
% 0.10/0.42 % Current number of unprocessed clauses: 0
% 0.10/0.42 % ...number of literals in the above : 0
% 0.10/0.42 % Current number of archived formulas : 0
% 0.10/0.42 % Current number of archived clauses : 0
% 0.10/0.42 % Clause-clause subsumption calls (NU) : 0
% 0.10/0.42 % Rec. Clause-clause subsumption calls : 0
% 0.10/0.42 % Non-unit clause-clause subsumptions : 0
% 0.10/0.42 % Unit Clause-clause subsumption calls : 0
% 0.10/0.42 % Rewrite failures with RHS unbound : 0
% 0.10/0.42 % BW rewrite match attempts : 0
% 0.10/0.42 % BW rewrite match successes : 0
% 0.10/0.42 % Condensation attempts : 0
% 0.10/0.42 % Condensation successes : 0
% 0.10/0.42 % Termbank termtop insertions : 74
% 0.10/0.42 % Search garbage collected termcells : 7
% 0.10/0.42
% 0.10/0.42 % -------------------------------------------------
% 0.10/0.42 % User time : 0.002 s
% 0.10/0.42 % System time : 0.001 s
% 0.10/0.42 % Total time : 0.003 s
% 0.10/0.42 % Maximum resident set size: 3628 pages
% 0.10/0.42
% 0.10/0.42 % -------------------------------------------------
% 0.10/0.42 % User time : 0.007 s
% 0.10/0.42 % System time : 0.009 s
% 0.10/0.42 % Total time : 0.015 s
% 0.10/0.42 % Maximum resident set size: 4864 pages
% 0.10/0.42 % E exiting
%------------------------------------------------------------------------------