%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : HWV021-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:23 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.45s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 15
% Syntax : Number of clauses : 50 ( 22 unt; 9 nHn; 44 RR)
% Number of literals : 108 ( 15 equ; 64 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 55 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_70,axiom,
( ~ p_Rd_error(plus(X1,n1))
| ~ gt(int_level(X1),n0)
| ~ p_Rd(X1)
| p_Wr(X1)
| p_Reset(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_70) ).
cnf(axiom_30,axiom,
( ~ p_Rd_error(plus(X1,n1))
| ~ p_Reset(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_30) ).
cnf(axiom_13,axiom,
( ~ gt(X2,X3)
| ~ gt(X1,X2)
| gt(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_13) ).
cnf(axiom_10,axiom,
( ~ gt(plus(X1,n1),X2)
| X2 = X1
| gt(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_10) ).
cnf(axiom_52,axiom,
( ~ p_Rd_error(plus(X1,n1))
| ~ gt(int_level(X1),n0)
| ~ p_Rd(X1)
| ~ p_Wr(X1)
| p_Reset(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_52) ).
cnf(axiom_2,axiom,
gt(plus(X1,n1),n0),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_2) ).
cnf(axiom_19,axiom,
plus(n0,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_19) ).
cnf(axiom_17,axiom,
~ gt(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_17) ).
cnf(axiom_1,axiom,
plus(X1,n1) != n0,
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_1) ).
cnf(axiom_8,axiom,
( ~ gt(X1,X2)
| gt(plus(X1,n1),plus(X2,n1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_8) ).
cnf(quest_4,negated_conjecture,
~ p_Empty(t_139),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_4) ).
cnf(axiom_24,axiom,
( int_level(X1) != n0
| p_Empty(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_24) ).
cnf(quest_1,negated_conjecture,
p_Rd_error(plus(t_139,n1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_1) ).
cnf(quest_2,negated_conjecture,
p_Rd(t_139),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_2) ).
cnf(axiom_12,axiom,
( gt(X2,X1)
| X2 = X1
| gt(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_12) ).
cnf(c_0_15,plain,
( ~ p_Rd_error(plus(X1,n1))
| ~ gt(int_level(X1),n0)
| ~ p_Rd(X1)
| p_Wr(X1)
| p_Reset(X1) ),
inference(fof_simplification,[status(thm)],[axiom_70]) ).
cnf(c_0_16,plain,
( ~ p_Rd_error(plus(X1,n1))
| ~ p_Reset(X1) ),
inference(fof_simplification,[status(thm)],[axiom_30]) ).
cnf(c_0_17,plain,
( ~ gt(X2,X3)
| ~ gt(X1,X2)
| gt(X1,X3) ),
inference(fof_simplification,[status(thm)],[axiom_13]) ).
cnf(c_0_18,plain,
( ~ gt(plus(X1,n1),X2)
| X2 = X1
| gt(X1,X2) ),
inference(fof_simplification,[status(thm)],[axiom_10]) ).
cnf(c_0_19,plain,
( ~ p_Rd_error(plus(X1,n1))
| ~ gt(int_level(X1),n0)
| ~ p_Rd(X1)
| ~ p_Wr(X1)
| p_Reset(X1) ),
inference(fof_simplification,[status(thm)],[axiom_52]) ).
cnf(c_0_20,plain,
( ~ p_Rd_error(plus(X1,n1))
| ~ gt(int_level(X1),n0)
| ~ p_Rd(X1)
| p_Wr(X1)
| p_Reset(X1) ),
c_0_15 ).
cnf(c_0_21,plain,
( ~ p_Rd_error(plus(X1,n1))
| ~ p_Reset(X1) ),
c_0_16 ).
cnf(c_0_22,plain,
( ~ gt(X2,X3)
| ~ gt(X1,X2)
| gt(X1,X3) ),
c_0_17 ).
cnf(c_0_23,axiom,
gt(plus(X1,n1),n0),
axiom_2 ).
cnf(c_0_24,plain,
( ~ gt(plus(X1,n1),X2)
| X2 = X1
| gt(X1,X2) ),
c_0_18 ).
cnf(c_0_25,axiom,
plus(n0,X1) = X1,
axiom_19 ).
cnf(c_0_26,plain,
~ gt(X1,X1),
inference(fof_simplification,[status(thm)],[axiom_17]) ).
cnf(c_0_27,plain,
plus(X1,n1) != n0,
inference(fof_simplification,[status(thm)],[axiom_1]) ).
cnf(c_0_28,plain,
( ~ gt(X1,X2)
| gt(plus(X1,n1),plus(X2,n1)) ),
inference(fof_simplification,[status(thm)],[axiom_8]) ).
cnf(c_0_29,plain,
( ~ p_Rd_error(plus(X1,n1))
| ~ gt(int_level(X1),n0)
| ~ p_Rd(X1)
| ~ p_Wr(X1)
| p_Reset(X1) ),
c_0_19 ).
cnf(c_0_30,plain,
( ~ gt(int_level(X1),n0)
| ~ p_Rd_error(plus(X1,n1))
| ~ p_Rd(X1)
| p_Wr(X1) ),
inference(csr,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_31,negated_conjecture,
~ p_Empty(t_139),
inference(fof_simplification,[status(thm)],[quest_4]) ).
cnf(c_0_32,plain,
( int_level(X1) != n0
| p_Empty(X1) ),
inference(fof_simplification,[status(thm)],[axiom_24]) ).
cnf(c_0_33,plain,
( ~ gt(X1,plus(X2,n1))
| gt(X1,n0) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_34,plain,
( ~ gt(n1,X1)
| gt(n0,X1)
| n0 = X1 ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_35,plain,
~ gt(X1,X1),
c_0_26 ).
cnf(c_0_36,plain,
plus(X1,n1) != n0,
c_0_27 ).
cnf(c_0_37,plain,
( ~ gt(X1,X2)
| gt(plus(X1,n1),plus(X2,n1)) ),
c_0_28 ).
cnf(c_0_38,plain,
( ~ gt(int_level(X1),n0)
| ~ p_Rd_error(plus(X1,n1))
| ~ p_Rd(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_29,c_0_30]),c_0_21]) ).
cnf(c_0_39,negated_conjecture,
p_Rd_error(plus(t_139,n1)),
quest_1 ).
cnf(c_0_40,negated_conjecture,
p_Rd(t_139),
quest_2 ).
cnf(c_0_41,negated_conjecture,
~ p_Empty(t_139),
c_0_31 ).
cnf(c_0_42,plain,
( int_level(X1) != n0
| p_Empty(X1) ),
c_0_32 ).
cnf(c_0_43,plain,
~ gt(n1,plus(X1,n1)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36]) ).
cnf(c_0_44,plain,
( ~ gt(n0,X1)
| gt(n1,plus(X1,n1)) ),
inference(spm,[status(thm)],[c_0_37,c_0_25]) ).
cnf(c_0_45,negated_conjecture,
~ gt(int_level(t_139),n0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
cnf(c_0_46,axiom,
( gt(X2,X1)
| X2 = X1
| gt(X1,X2) ),
axiom_12 ).
cnf(c_0_47,negated_conjecture,
int_level(t_139) != n0,
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_48,plain,
~ gt(n0,X1),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_48]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HWV021-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n020.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 20 20:49:32 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.42 Running first-order theorem proving
% 0.14/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.14/0.45 % Version: 3.5.1
% 0.14/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.45 % Starting sh5l with 300s (1) cores
% 0.14/0.45 % new_bool_3 with pid 1206276 completed with status 0
% 0.14/0.45 % Result found by new_bool_3
% 0.14/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.45 % Search class: FGHSS-FFMS21-SFFFFFNN
% 0.14/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.45 % SubtermCWHack with pid 1206279 completed with status 0
% 0.14/0.45 % Result found by SubtermCWHack
% 0.14/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.45 % Search class: FGHSS-FFMS21-SFFFFFNN
% 0.14/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.45 % Preprocessing time : 0.002 s
% 0.14/0.45
% 0.14/0.45 % Proof found!
% 0.14/0.45 % SZS status Unsatisfiable
% 0.14/0.45 % SZS output start CNFRefutation
% See solution above
% 0.14/0.45 % Parsed axioms : 94
% 0.14/0.45 % Removed by relevancy pruning/SinE : 60
% 0.14/0.45 % Initial clauses : 34
% 0.14/0.45 % Removed in clause preprocessing : 0
% 0.14/0.45 % Initial clauses in saturation : 34
% 0.14/0.45 % Processed clauses : 166
% 0.14/0.45 % ...of these trivial : 4
% 0.14/0.45 % ...subsumed : 77
% 0.14/0.45 % ...remaining for further processing : 85
% 0.14/0.45 % Other redundant clauses eliminated : 0
% 0.14/0.45 % Clauses deleted for lack of memory : 0
% 0.14/0.45 % Backward-subsumed : 8
% 0.14/0.45 % Backward-rewritten : 1
% 0.14/0.45 % Generated clauses : 404
% 0.14/0.45 % ...of the previous two non-redundant : 268
% 0.14/0.45 % ...aggressively subsumed : 0
% 0.14/0.45 % Contextual simplify-reflections : 9
% 0.14/0.45 % Paramodulations : 399
% 0.14/0.45 % Factorizations : 4
% 0.14/0.45 % NegExts : 0
% 0.14/0.45 % Equation resolutions : 1
% 0.14/0.45 % Disequality decompositions : 0
% 0.14/0.45 % Total rewrite steps : 120
% 0.14/0.45 % ...of those cached : 104
% 0.14/0.45 % Propositional unsat checks : 0
% 0.14/0.45 % Propositional check models : 0
% 0.14/0.45 % Propositional check unsatisfiable : 0
% 0.14/0.45 % Propositional clauses : 0
% 0.14/0.45 % Propositional clauses after purity: 0
% 0.14/0.45 % Propositional unsat core size : 0
% 0.14/0.45 % Propositional preprocessing time : 0.000
% 0.14/0.45 % Propositional encoding time : 0.000
% 0.14/0.45 % Propositional solver time : 0.000
% 0.14/0.45 % Success case prop preproc time : 0.000
% 0.14/0.45 % Success case prop encoding time : 0.000
% 0.14/0.45 % Success case prop solver time : 0.000
% 0.14/0.45 % Current number of processed clauses : 76
% 0.14/0.45 % Positive orientable unit clauses : 7
% 0.14/0.45 % Positive unorientable unit clauses: 0
% 0.14/0.45 % Negative unit clauses : 9
% 0.14/0.45 % Non-unit-clauses : 60
% 0.14/0.45 % Current number of unprocessed clauses: 133
% 0.14/0.45 % ...number of literals in the above : 510
% 0.14/0.45 % Current number of archived formulas : 0
% 0.14/0.45 % Current number of archived clauses : 9
% 0.14/0.45 % Clause-clause subsumption calls (NU) : 458
% 0.14/0.45 % Rec. Clause-clause subsumption calls : 294
% 0.14/0.45 % Non-unit clause-clause subsumptions : 80
% 0.14/0.45 % Unit Clause-clause subsumption calls : 11
% 0.14/0.45 % Rewrite failures with RHS unbound : 0
% 0.14/0.45 % BW rewrite match attempts : 4
% 0.14/0.45 % BW rewrite match successes : 1
% 0.14/0.45 % Condensation attempts : 0
% 0.14/0.45 % Condensation successes : 0
% 0.14/0.45 % Termbank termtop insertions : 7094
% 0.14/0.45 % Search garbage collected termcells : 302
% 0.14/0.45
% 0.14/0.45 % -------------------------------------------------
% 0.14/0.45 % User time : 0.012 s
% 0.14/0.45 % System time : 0.002 s
% 0.14/0.45 % Total time : 0.014 s
% 0.14/0.45 % Maximum resident set size: 3704 pages
% 0.14/0.45
% 0.14/0.45 % -------------------------------------------------
% 0.14/0.45 % User time : 0.015 s
% 0.14/0.45 % System time : 0.005 s
% 0.14/0.45 % Total time : 0.019 s
% 0.14/0.45 % Maximum resident set size: 4864 pages
% 0.14/0.45 % E exiting
%------------------------------------------------------------------------------