%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : HWV025-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n011.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 12:47:24 PM UTC 2026
% Result : Unsatisfiable 0.13s 0.42s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 32 ( 9 unt; 17 nHn; 32 RR)
% Number of literals : 96 ( 0 equ; 40 neg)
% Maximal clause size : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_50,axiom,
( ~ p_Rd_error(X1)
| ~ p_Wr(X1)
| p_Rd_error(plus(X1,n1))
| p_Rd(X1)
| p_Reset(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_50) ).
cnf(axiom_86,axiom,
( ~ p_Rd_error(X1)
| p_Rd_error(plus(X1,n1))
| p_Rd(X1)
| p_Wr(X1)
| p_Reset(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_86) ).
cnf(axiom_85,axiom,
( ~ p_Rd_error(plus(X1,n1))
| p_Rd_error(X1)
| p_Rd(X1)
| p_Wr(X1)
| p_Reset(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_85) ).
cnf(axiom_30,axiom,
( ~ p_Rd_error(plus(X1,n1))
| ~ p_Reset(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_30) ).
cnf(quest_1,negated_conjecture,
~ p_Rd(t_139),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_1) ).
cnf(quest_2,negated_conjecture,
~ p_Reset(t_139),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_2) ).
cnf(axiom_49,axiom,
( ~ p_Rd_error(plus(X1,n1))
| ~ p_Wr(X1)
| p_Rd_error(X1)
| p_Rd(X1)
| p_Reset(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_49) ).
cnf(quest_3,negated_conjecture,
( ~ p_Rd_error(plus(t_139,n1))
| ~ p_Rd_error(t_139) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_3) ).
cnf(quest_4,negated_conjecture,
( p_Rd_error(plus(t_139,n1))
| p_Rd_error(t_139) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_4) ).
cnf(c_0_9,plain,
( ~ p_Rd_error(X1)
| ~ p_Wr(X1)
| p_Rd_error(plus(X1,n1))
| p_Rd(X1)
| p_Reset(X1) ),
inference(fof_simplification,[status(thm)],[axiom_50]) ).
cnf(c_0_10,plain,
( ~ p_Rd_error(X1)
| p_Rd_error(plus(X1,n1))
| p_Rd(X1)
| p_Wr(X1)
| p_Reset(X1) ),
inference(fof_simplification,[status(thm)],[axiom_86]) ).
cnf(c_0_11,plain,
( ~ p_Rd_error(plus(X1,n1))
| p_Rd_error(X1)
| p_Rd(X1)
| p_Wr(X1)
| p_Reset(X1) ),
inference(fof_simplification,[status(thm)],[axiom_85]) ).
cnf(c_0_12,plain,
( ~ p_Rd_error(plus(X1,n1))
| ~ p_Reset(X1) ),
inference(fof_simplification,[status(thm)],[axiom_30]) ).
cnf(c_0_13,negated_conjecture,
~ p_Rd(t_139),
inference(fof_simplification,[status(thm)],[quest_1]) ).
cnf(c_0_14,plain,
( ~ p_Rd_error(X1)
| ~ p_Wr(X1)
| p_Rd_error(plus(X1,n1))
| p_Rd(X1)
| p_Reset(X1) ),
c_0_9 ).
cnf(c_0_15,plain,
( ~ p_Rd_error(X1)
| p_Rd_error(plus(X1,n1))
| p_Rd(X1)
| p_Wr(X1)
| p_Reset(X1) ),
c_0_10 ).
cnf(c_0_16,negated_conjecture,
~ p_Reset(t_139),
inference(fof_simplification,[status(thm)],[quest_2]) ).
cnf(c_0_17,plain,
( ~ p_Rd_error(plus(X1,n1))
| ~ p_Wr(X1)
| p_Rd_error(X1)
| p_Rd(X1)
| p_Reset(X1) ),
inference(fof_simplification,[status(thm)],[axiom_49]) ).
cnf(c_0_18,plain,
( ~ p_Rd_error(plus(X1,n1))
| p_Rd_error(X1)
| p_Rd(X1)
| p_Wr(X1)
| p_Reset(X1) ),
c_0_11 ).
cnf(c_0_19,plain,
( ~ p_Rd_error(plus(X1,n1))
| ~ p_Reset(X1) ),
c_0_12 ).
cnf(c_0_20,negated_conjecture,
( ~ p_Rd_error(plus(t_139,n1))
| ~ p_Rd_error(t_139) ),
inference(fof_simplification,[status(thm)],[quest_3]) ).
cnf(c_0_21,negated_conjecture,
~ p_Rd(t_139),
c_0_13 ).
cnf(c_0_22,plain,
( ~ p_Rd_error(X1)
| p_Reset(X1)
| p_Rd_error(plus(X1,n1))
| p_Rd(X1) ),
inference(csr,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_23,negated_conjecture,
~ p_Reset(t_139),
c_0_16 ).
cnf(c_0_24,negated_conjecture,
( p_Rd_error(plus(t_139,n1))
| p_Rd_error(t_139) ),
quest_4 ).
cnf(c_0_25,plain,
( ~ p_Rd_error(plus(X1,n1))
| ~ p_Wr(X1)
| p_Rd_error(X1)
| p_Rd(X1)
| p_Reset(X1) ),
c_0_17 ).
cnf(c_0_26,plain,
( ~ p_Rd_error(plus(X1,n1))
| p_Rd_error(X1)
| p_Wr(X1)
| p_Rd(X1) ),
inference(csr,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_27,negated_conjecture,
( ~ p_Rd_error(plus(t_139,n1))
| ~ p_Rd_error(t_139) ),
c_0_20 ).
cnf(c_0_28,negated_conjecture,
p_Rd_error(plus(t_139,n1)),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24]) ).
cnf(c_0_29,plain,
( ~ p_Rd_error(plus(X1,n1))
| p_Rd_error(X1)
| p_Rd(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_25,c_0_26]),c_0_19]) ).
cnf(c_0_30,negated_conjecture,
~ p_Rd_error(t_139),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_29]),c_0_28])]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HWV025-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.34 % Computer : n011.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.34 % DateTime : Sun Sep 20 20:48:55 UTC 2026
% 0.08/0.34 % CPUTime :
% 0.08/0.34 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/0.39 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.13/0.42 % Version: 3.5.1
% 0.13/0.42 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.42 % Starting sh5l with 300s (1) cores
% 0.13/0.42 % new_bool_3 with pid 157158 completed with status 0
% 0.13/0.42 % Result found by new_bool_3
% 0.13/0.42 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.42 % Search class: FGHSS-FFMF21-SFFFFFNN
% 0.13/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.42 % SubtermCWHack with pid 157171 completed with status 0
% 0.13/0.42 % Result found by SubtermCWHack
% 0.13/0.42 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.42 % Search class: FGHSS-FFMF21-SFFFFFNN
% 0.13/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.42 % Preprocessing time : 0.001 s
% 0.13/0.42
% 0.13/0.42 % Proof found!
% 0.13/0.42 % SZS status Unsatisfiable
% 0.13/0.42 % SZS output start CNFRefutation
% See solution above
% 0.13/0.42 % Parsed axioms : 94
% 0.13/0.42 % Removed by relevancy pruning/SinE : 62
% 0.13/0.42 % Initial clauses : 32
% 0.13/0.42 % Removed in clause preprocessing : 0
% 0.13/0.42 % Initial clauses in saturation : 32
% 0.13/0.42 % Processed clauses : 88
% 0.13/0.42 % ...of these trivial : 0
% 0.13/0.42 % ...subsumed : 30
% 0.13/0.42 % ...remaining for further processing : 58
% 0.13/0.42 % Other redundant clauses eliminated : 0
% 0.13/0.42 % Clauses deleted for lack of memory : 0
% 0.13/0.42 % Backward-subsumed : 7
% 0.13/0.42 % Backward-rewritten : 2
% 0.13/0.42 % Generated clauses : 171
% 0.13/0.42 % ...of the previous two non-redundant : 127
% 0.13/0.42 % ...aggressively subsumed : 0
% 0.13/0.42 % Contextual simplify-reflections : 5
% 0.13/0.42 % Paramodulations : 168
% 0.13/0.42 % Factorizations : 2
% 0.13/0.42 % NegExts : 0
% 0.13/0.42 % Equation resolutions : 1
% 0.13/0.42 % Disequality decompositions : 0
% 0.13/0.42 % Total rewrite steps : 38
% 0.13/0.42 % ...of those cached : 26
% 0.13/0.42 % Propositional unsat checks : 0
% 0.13/0.42 % Propositional check models : 0
% 0.13/0.42 % Propositional check unsatisfiable : 0
% 0.13/0.42 % Propositional clauses : 0
% 0.13/0.42 % Propositional clauses after purity: 0
% 0.13/0.42 % Propositional unsat core size : 0
% 0.13/0.42 % Propositional preprocessing time : 0.000
% 0.13/0.42 % Propositional encoding time : 0.000
% 0.13/0.42 % Propositional solver time : 0.000
% 0.13/0.42 % Success case prop preproc time : 0.000
% 0.13/0.42 % Success case prop encoding time : 0.000
% 0.13/0.42 % Success case prop solver time : 0.000
% 0.13/0.42 % Current number of processed clauses : 49
% 0.13/0.42 % Positive orientable unit clauses : 6
% 0.13/0.42 % Positive unorientable unit clauses: 0
% 0.13/0.42 % Negative unit clauses : 8
% 0.13/0.42 % Non-unit-clauses : 35
% 0.13/0.42 % Current number of unprocessed clauses: 69
% 0.13/0.42 % ...number of literals in the above : 227
% 0.13/0.42 % Current number of archived formulas : 0
% 0.13/0.42 % Current number of archived clauses : 9
% 0.13/0.42 % Clause-clause subsumption calls (NU) : 117
% 0.13/0.42 % Rec. Clause-clause subsumption calls : 99
% 0.13/0.42 % Non-unit clause-clause subsumptions : 29
% 0.13/0.42 % Unit Clause-clause subsumption calls : 10
% 0.13/0.42 % Rewrite failures with RHS unbound : 0
% 0.13/0.42 % BW rewrite match attempts : 5
% 0.13/0.42 % BW rewrite match successes : 2
% 0.13/0.42 % Condensation attempts : 0
% 0.13/0.42 % Condensation successes : 0
% 0.13/0.42 % Termbank termtop insertions : 4011
% 0.13/0.42 % Search garbage collected termcells : 308
% 0.13/0.42
% 0.13/0.42 % -------------------------------------------------
% 0.13/0.42 % User time : 0.009 s
% 0.13/0.42 % System time : 0.001 s
% 0.13/0.42 % Total time : 0.010 s
% 0.13/0.42 % Maximum resident set size: 3704 pages
% 0.13/0.42
% 0.13/0.42 % -------------------------------------------------
% 0.13/0.42 % User time : 0.014 s
% 0.13/0.42 % System time : 0.005 s
% 0.13/0.42 % Total time : 0.019 s
% 0.13/0.42 % Maximum resident set size: 4864 pages
% 0.13/0.42 % E exiting
%------------------------------------------------------------------------------