%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : HWV017-2 : 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 : n026.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:48:46 PM UTC 2026
% Result : Unsatisfiable 0.15s 5.47s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of clauses : 39 ( 22 unt; 10 nHn; 35 RR)
% Number of literals : 83 ( 17 equ; 28 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_7,axiom,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTfull_(X1))
| fwork_DOTfifo_DOTrtl_DOTint__level_(X1) = fwork_DOTfifo_DOTrtl_DOTfifo__length_ ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV004-0.ax',axiom_7) ).
cnf(axiom_47,axiom,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| ~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n0)
| p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
| fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(X1,n1)) = fwork_DOTfifo_DOTrtl_DOTint__level_(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV004-0.ax',axiom_47) ).
cnf(axiom_61,axiom,
( ~ p_LES_EQU_(X1,f_SUB_(X1,n1))
| p_LES_EQU_(X1,n0) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV004-0.ax',axiom_61) ).
cnf(axiom_43,axiom,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
| p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n0)
| fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(X1,n1)) = f_SUB_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV004-0.ax',axiom_43) ).
cnf(quest_5,negated_conjecture,
p__pred_(fwork_DOTfifo_DOTrtl_DOTfull_(f_ADD_(t_206,n1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_5) ).
cnf(axiom_51,axiom,
( p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(X1,n1)) = fwork_DOTfifo_DOTrtl_DOTint__level_(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV004-0.ax',axiom_51) ).
cnf(quest_2,negated_conjecture,
~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(t_206)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_2) ).
cnf(quest_3,negated_conjecture,
~ p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(t_206)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_3) ).
cnf(quest_1,negated_conjecture,
p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTlevel_(t_206),fwork_DOTfifo_DOTrtl_DOTfifo__length_),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_1) ).
cnf(axiom_5,axiom,
fwork_DOTfifo_DOTrtl_DOTlevel_(X1) = fwork_DOTfifo_DOTrtl_DOTint__level_(X1),
file('/export/starexec/sandbox/benchmark/Axioms/HWV004-0.ax',axiom_5) ).
cnf(quest_4,negated_conjecture,
p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(t_206)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_4) ).
cnf(quest_6,negated_conjecture,
~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_6) ).
cnf(c_0_12,plain,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTfull_(X1))
| fwork_DOTfifo_DOTrtl_DOTint__level_(X1) = fwork_DOTfifo_DOTrtl_DOTfifo__length_ ),
inference(fof_simplification,[status(thm)],[axiom_7]) ).
cnf(c_0_13,plain,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| ~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n0)
| p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
| fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(X1,n1)) = fwork_DOTfifo_DOTrtl_DOTint__level_(X1) ),
inference(fof_simplification,[status(thm)],[axiom_47]) ).
cnf(c_0_14,plain,
( ~ p_LES_EQU_(X1,f_SUB_(X1,n1))
| p_LES_EQU_(X1,n0) ),
inference(fof_simplification,[status(thm)],[axiom_61]) ).
cnf(c_0_15,plain,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
| p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n0)
| fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(X1,n1)) = f_SUB_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n1) ),
inference(fof_simplification,[status(thm)],[axiom_43]) ).
cnf(c_0_16,plain,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTfull_(X1))
| fwork_DOTfifo_DOTrtl_DOTint__level_(X1) = fwork_DOTfifo_DOTrtl_DOTfifo__length_ ),
c_0_12 ).
cnf(c_0_17,negated_conjecture,
p__pred_(fwork_DOTfifo_DOTrtl_DOTfull_(f_ADD_(t_206,n1))),
quest_5 ).
cnf(c_0_18,plain,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| ~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n0)
| p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
| fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(X1,n1)) = fwork_DOTfifo_DOTrtl_DOTint__level_(X1) ),
c_0_13 ).
cnf(c_0_19,axiom,
( p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(X1,n1)) = fwork_DOTfifo_DOTrtl_DOTint__level_(X1) ),
axiom_51 ).
cnf(c_0_20,negated_conjecture,
~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(t_206)),
inference(fof_simplification,[status(thm)],[quest_2]) ).
cnf(c_0_21,negated_conjecture,
~ p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(t_206)),
inference(fof_simplification,[status(thm)],[quest_3]) ).
cnf(c_0_22,plain,
( ~ p_LES_EQU_(X1,f_SUB_(X1,n1))
| p_LES_EQU_(X1,n0) ),
c_0_14 ).
cnf(c_0_23,plain,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
| p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n0)
| fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(X1,n1)) = f_SUB_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n1) ),
c_0_15 ).
cnf(c_0_24,negated_conjecture,
p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTlevel_(t_206),fwork_DOTfifo_DOTrtl_DOTfifo__length_),
quest_1 ).
cnf(c_0_25,axiom,
fwork_DOTfifo_DOTrtl_DOTlevel_(X1) = fwork_DOTfifo_DOTrtl_DOTint__level_(X1),
axiom_5 ).
cnf(c_0_26,negated_conjecture,
fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(t_206,n1)) = fwork_DOTfifo_DOTrtl_DOTfifo__length_,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_27,plain,
( ~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n0)
| p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
| fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(X1,n1)) = fwork_DOTfifo_DOTrtl_DOTint__level_(X1) ),
inference(csr,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_28,negated_conjecture,
~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(t_206)),
c_0_20 ).
cnf(c_0_29,negated_conjecture,
~ p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(t_206)),
c_0_21 ).
cnf(c_0_30,plain,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| ~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(X1,n1)))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n0) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_31,negated_conjecture,
p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(t_206),fwork_DOTfifo_DOTrtl_DOTfifo__length_),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,negated_conjecture,
p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(t_206)),
quest_4 ).
cnf(c_0_33,negated_conjecture,
( ~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(t_206),n0)
| fwork_DOTfifo_DOTrtl_DOTint__level_(t_206) = fwork_DOTfifo_DOTrtl_DOTfifo__length_ ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29]) ).
cnf(c_0_34,negated_conjecture,
p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(t_206),n0),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_26]),c_0_31]),c_0_32])]),c_0_29]),c_0_28]) ).
cnf(c_0_35,negated_conjecture,
~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,n0),
inference(fof_simplification,[status(thm)],[quest_6]) ).
cnf(c_0_36,negated_conjecture,
fwork_DOTfifo_DOTrtl_DOTint__level_(t_206) = fwork_DOTfifo_DOTrtl_DOTfifo__length_,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
cnf(c_0_37,negated_conjecture,
~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,n0),
c_0_35 ).
cnf(c_0_38,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_36]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HWV017-2 : 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/5.37 % Computer : n026.cluster.edu
% 0.11/5.37 % Model : x86_64 x86_64
% 0.11/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.37 % Memory : 8046.5625MB
% 0.11/5.37 % OS : Linux 6.8.0-71-generic
% 0.11/5.37 % CPULimit : 300
% 0.11/5.37 % WCLimit : 300
% 0.11/5.37 % DateTime : Sun Sep 20 20:51:13 UTC 2026
% 0.11/5.38 % CPUTime :
% 0.11/5.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/5.42 Running first-order theorem proving
% 0.15/5.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.15/5.47 % Version: 3.5.1
% 0.15/5.47 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/5.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.47 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/5.47 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.47 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.47 % Starting sh5l with 300s (1) cores
% 0.15/5.47 % new_bool_3 with pid 576050 completed with status 0
% 0.15/5.47 % Result found by new_bool_3
% 0.15/5.47 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/5.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.47 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/5.47 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/5.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/5.47 % Search class: FGUSS-FFMS21-SFFFFFNN
% 0.15/5.47 % partial match(1): FGHSS-FFMS21-SFFFFFNN
% 0.15/5.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.47 % Starting SubtermCWHack with 31s (1) cores
% 0.15/5.47 % SubtermCWHack with pid 576053 completed with status 0
% 0.15/5.47 % Result found by SubtermCWHack
% 0.15/5.47 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/5.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.47 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/5.47 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/5.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/5.47 % Search class: FGUSS-FFMS21-SFFFFFNN
% 0.15/5.47 % partial match(1): FGHSS-FFMS21-SFFFFFNN
% 0.15/5.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.47 % Starting SubtermCWHack with 31s (1) cores
% 0.15/5.47 % Preprocessing time : 0.001 s
% 0.15/5.47
% 0.15/5.47 % Proof found!
% 0.15/5.47 % SZS status Unsatisfiable
% 0.15/5.47 % SZS output start CNFRefutation
% See solution above
% 0.15/5.48 % Parsed axioms : 139
% 0.15/5.48 % Removed by relevancy pruning/SinE : 107
% 0.15/5.48 % Initial clauses : 32
% 0.15/5.48 % Removed in clause preprocessing : 0
% 0.15/5.48 % Initial clauses in saturation : 32
% 0.15/5.48 % Processed clauses : 563
% 0.15/5.48 % ...of these trivial : 7
% 0.15/5.48 % ...subsumed : 359
% 0.15/5.48 % ...remaining for further processing : 197
% 0.15/5.48 % Other redundant clauses eliminated : 7
% 0.15/5.48 % Clauses deleted for lack of memory : 0
% 0.15/5.48 % Backward-subsumed : 12
% 0.15/5.48 % Backward-rewritten : 31
% 0.15/5.48 % Generated clauses : 2947
% 0.15/5.48 % ...of the previous two non-redundant : 2087
% 0.15/5.48 % ...aggressively subsumed : 0
% 0.15/5.48 % Contextual simplify-reflections : 3
% 0.15/5.48 % Paramodulations : 2881
% 0.15/5.48 % Factorizations : 58
% 0.15/5.48 % NegExts : 0
% 0.15/5.48 % Equation resolutions : 8
% 0.15/5.48 % Disequality decompositions : 0
% 0.15/5.48 % Total rewrite steps : 1013
% 0.15/5.48 % ...of those cached : 949
% 0.15/5.48 % Propositional unsat checks : 0
% 0.15/5.48 % Propositional check models : 0
% 0.15/5.48 % Propositional check unsatisfiable : 0
% 0.15/5.48 % Propositional clauses : 0
% 0.15/5.48 % Propositional clauses after purity: 0
% 0.15/5.48 % Propositional unsat core size : 0
% 0.15/5.48 % Propositional preprocessing time : 0.000
% 0.15/5.48 % Propositional encoding time : 0.000
% 0.15/5.48 % Propositional solver time : 0.000
% 0.15/5.48 % Success case prop preproc time : 0.000
% 0.15/5.48 % Success case prop encoding time : 0.000
% 0.15/5.48 % Success case prop solver time : 0.000
% 0.15/5.48 % Current number of processed clauses : 154
% 0.15/5.48 % Positive orientable unit clauses : 14
% 0.15/5.48 % Positive unorientable unit clauses: 0
% 0.15/5.48 % Negative unit clauses : 7
% 0.15/5.48 % Non-unit-clauses : 133
% 0.15/5.48 % Current number of unprocessed clauses: 1500
% 0.15/5.48 % ...number of literals in the above : 7191
% 0.15/5.48 % Current number of archived formulas : 0
% 0.15/5.48 % Current number of archived clauses : 43
% 0.15/5.48 % Clause-clause subsumption calls (NU) : 3436
% 0.15/5.48 % Rec. Clause-clause subsumption calls : 2405
% 0.15/5.48 % Non-unit clause-clause subsumptions : 346
% 0.15/5.48 % Unit Clause-clause subsumption calls : 37
% 0.15/5.48 % Rewrite failures with RHS unbound : 0
% 0.15/5.48 % BW rewrite match attempts : 12
% 0.15/5.48 % BW rewrite match successes : 10
% 0.15/5.48 % Condensation attempts : 0
% 0.15/5.48 % Condensation successes : 0
% 0.15/5.48 % Termbank termtop insertions : 39078
% 0.15/5.48 % Search garbage collected termcells : 516
% 0.15/5.48
% 0.15/5.48 % -------------------------------------------------
% 0.15/5.48 % User time : 0.030 s
% 0.15/5.48 % System time : 0.002 s
% 0.15/5.48 % Total time : 0.032 s
% 0.15/5.48 % Maximum resident set size: 3744 pages
% 0.15/5.48
% 0.15/5.48 % -------------------------------------------------
% 0.15/5.48 % User time : 0.035 s
% 0.15/5.48 % System time : 0.006 s
% 0.15/5.48 % Total time : 0.041 s
% 0.15/5.48 % Maximum resident set size: 4608 pages
% 0.15/5.48 % E exiting
%------------------------------------------------------------------------------