%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : HWV023-2 : 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 : n018.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.03s 0.44s
% Output : CNFRefutation 0.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 15
% Syntax : Number of clauses : 48 ( 27 unt; 12 nHn; 36 RR)
% Number of literals : 84 ( 23 equ; 32 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-2 aty)
% Number of variables : 40 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_71,axiom,
( ~ p_LES_EQU_(X1,X2)
| p_LES_EQU_(X1,X3)
| p_LES_EQU_(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV004-0.ax',axiom_71) ).
cnf(axiom_73,axiom,
( ~ p_LES_EQU_(X1,n0)
| X1 = n0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV004-0.ax',axiom_73) ).
cnf(axiom_75,axiom,
p_LES_EQU_(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV004-0.ax',axiom_75) ).
cnf(axiom_68,axiom,
( ~ p_LES_EQU_(X2,X1)
| p_LES_EQU_(f_ADD_(X2,n1),X1)
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV004-0.ax',axiom_68) ).
cnf(axiom_60,axiom,
~ p_LES_EQU_(f_ADD_(X1,n1),n0),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV004-0.ax',axiom_60) ).
cnf(axiom_61,axiom,
( ~ p_LES_EQU_(X1,f_SUB_(X1,n1))
| p_LES_EQU_(X1,n0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV004-0.ax',axiom_61) ).
cnf(axiom_77,axiom,
f_ADD_(n0,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/HWV004-0.ax',axiom_77) ).
cnf(quest_5,negated_conjecture,
~ p__pred_(fwork_DOTfifo_DOTrtl_DOTempty_(f_ADD_(t_206,n1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_5) ).
cnf(axiom_8,axiom,
( fwork_DOTfifo_DOTrtl_DOTint__level_(X1) != n0
| p__pred_(fwork_DOTfifo_DOTrtl_DOTempty_(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV004-0.ax',axiom_8) ).
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/sandbox2/benchmark/Axioms/HWV004-0.ax',axiom_43) ).
cnf(quest_1,negated_conjecture,
fwork_DOTfifo_DOTrtl_DOTlevel_(t_206) = n1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_1) ).
cnf(axiom_5,axiom,
fwork_DOTfifo_DOTrtl_DOTlevel_(X1) = fwork_DOTfifo_DOTrtl_DOTint__level_(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV004-0.ax',axiom_5) ).
cnf(quest_4,negated_conjecture,
~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(t_206)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_4) ).
cnf(quest_3,negated_conjecture,
~ p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(t_206)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_3) ).
cnf(quest_2,negated_conjecture,
p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(t_206)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_2) ).
cnf(c_0_15,plain,
( ~ p_LES_EQU_(X1,X2)
| p_LES_EQU_(X1,X3)
| p_LES_EQU_(X3,X2) ),
inference(fof_simplification,[status(thm)],[axiom_71]) ).
cnf(c_0_16,plain,
( ~ p_LES_EQU_(X1,n0)
| X1 = n0 ),
inference(fof_simplification,[status(thm)],[axiom_73]) ).
cnf(c_0_17,plain,
( ~ p_LES_EQU_(X1,X2)
| p_LES_EQU_(X1,X3)
| p_LES_EQU_(X3,X2) ),
c_0_15 ).
cnf(c_0_18,axiom,
p_LES_EQU_(X1,X1),
axiom_75 ).
cnf(c_0_19,plain,
( ~ p_LES_EQU_(X2,X1)
| p_LES_EQU_(f_ADD_(X2,n1),X1)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[axiom_68]) ).
cnf(c_0_20,plain,
( ~ p_LES_EQU_(X1,n0)
| X1 = n0 ),
c_0_16 ).
cnf(c_0_21,plain,
( p_LES_EQU_(X2,X1)
| p_LES_EQU_(X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
~ p_LES_EQU_(f_ADD_(X1,n1),n0),
inference(fof_simplification,[status(thm)],[axiom_60]) ).
cnf(c_0_23,plain,
( ~ p_LES_EQU_(X1,f_SUB_(X1,n1))
| p_LES_EQU_(X1,n0) ),
inference(fof_simplification,[status(thm)],[axiom_61]) ).
cnf(c_0_24,plain,
( ~ p_LES_EQU_(X2,X1)
| p_LES_EQU_(f_ADD_(X2,n1),X1)
| X1 = X2 ),
c_0_19 ).
cnf(c_0_25,axiom,
f_ADD_(n0,X1) = X1,
axiom_77 ).
cnf(c_0_26,plain,
( p_LES_EQU_(n0,X1)
| X1 = n0 ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
~ p_LES_EQU_(f_ADD_(X1,n1),n0),
c_0_22 ).
cnf(c_0_28,negated_conjecture,
~ p__pred_(fwork_DOTfifo_DOTrtl_DOTempty_(f_ADD_(t_206,n1))),
inference(fof_simplification,[status(thm)],[quest_5]) ).
cnf(c_0_29,plain,
( fwork_DOTfifo_DOTrtl_DOTint__level_(X1) != n0
| p__pred_(fwork_DOTfifo_DOTrtl_DOTempty_(X1)) ),
inference(fof_simplification,[status(thm)],[axiom_8]) ).
cnf(c_0_30,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_31,negated_conjecture,
fwork_DOTfifo_DOTrtl_DOTlevel_(t_206) = n1,
quest_1 ).
cnf(c_0_32,axiom,
fwork_DOTfifo_DOTrtl_DOTlevel_(X1) = fwork_DOTfifo_DOTrtl_DOTint__level_(X1),
axiom_5 ).
cnf(c_0_33,plain,
( ~ p_LES_EQU_(X1,f_SUB_(X1,n1))
| p_LES_EQU_(X1,n0) ),
c_0_23 ).
cnf(c_0_34,plain,
( p_LES_EQU_(n1,X1)
| X1 = n0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_35,plain,
~ p_LES_EQU_(n1,n0),
inference(spm,[status(thm)],[c_0_27,c_0_25]) ).
cnf(c_0_36,negated_conjecture,
~ p__pred_(fwork_DOTfifo_DOTrtl_DOTempty_(f_ADD_(t_206,n1))),
c_0_28 ).
cnf(c_0_37,plain,
( fwork_DOTfifo_DOTrtl_DOTint__level_(X1) != n0
| p__pred_(fwork_DOTfifo_DOTrtl_DOTempty_(X1)) ),
c_0_29 ).
cnf(c_0_38,negated_conjecture,
~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(t_206)),
inference(fof_simplification,[status(thm)],[quest_4]) ).
cnf(c_0_39,negated_conjecture,
~ p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(t_206)),
inference(fof_simplification,[status(thm)],[quest_3]) ).
cnf(c_0_40,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_30 ).
cnf(c_0_41,negated_conjecture,
fwork_DOTfifo_DOTrtl_DOTint__level_(t_206) = n1,
inference(rw,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_42,plain,
f_SUB_(n1,n1) = n0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_43,negated_conjecture,
p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(t_206)),
quest_2 ).
cnf(c_0_44,negated_conjecture,
fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(t_206,n1)) != n0,
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_45,negated_conjecture,
~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(t_206)),
c_0_38 ).
cnf(c_0_46,negated_conjecture,
~ p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(t_206)),
c_0_39 ).
cnf(c_0_47,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[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_40,c_0_41]),c_0_42]),c_0_43])]),c_0_44]),c_0_35]),c_0_45]),c_0_46]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : HWV023-2 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n018.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Sun Sep 20 20:50:58 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.03/0.41 Running first-order theorem proving
% 0.03/0.41 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.03/0.44 % Version: 3.5.1
% 0.03/0.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.03/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.03/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.03/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.03/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.03/0.44 % Starting sh5l with 300s (1) cores
% 0.03/0.44 % new_bool_3 with pid 173793 completed with status 0
% 0.03/0.44 % Result found by new_bool_3
% 0.03/0.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.03/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.03/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.03/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.03/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.03/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.03/0.44 % Search class: FGUSS-FFMS21-SFFFFFNN
% 0.03/0.44 % partial match(1): FGHSS-FFMS21-SFFFFFNN
% 0.03/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.03/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.03/0.44 % SubtermCWHack with pid 173796 completed with status 0
% 0.03/0.44 % Result found by SubtermCWHack
% 0.03/0.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.03/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.03/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.03/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.03/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.03/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.03/0.44 % Search class: FGUSS-FFMS21-SFFFFFNN
% 0.03/0.44 % partial match(1): FGHSS-FFMS21-SFFFFFNN
% 0.03/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.03/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.03/0.44 % Preprocessing time : 0.002 s
% 0.03/0.44
% 0.03/0.44 % Proof found!
% 0.03/0.44 % SZS status Unsatisfiable
% 0.03/0.44 % SZS output start CNFRefutation
% See solution above
% 0.03/0.44 % Parsed axioms : 138
% 0.03/0.44 % Removed by relevancy pruning/SinE : 109
% 0.03/0.44 % Initial clauses : 29
% 0.03/0.44 % Removed in clause preprocessing : 0
% 0.03/0.44 % Initial clauses in saturation : 29
% 0.03/0.44 % Processed clauses : 99
% 0.03/0.44 % ...of these trivial : 1
% 0.03/0.44 % ...subsumed : 39
% 0.03/0.44 % ...remaining for further processing : 59
% 0.03/0.44 % Other redundant clauses eliminated : 0
% 0.03/0.44 % Clauses deleted for lack of memory : 0
% 0.03/0.44 % Backward-subsumed : 7
% 0.03/0.44 % Backward-rewritten : 5
% 0.03/0.44 % Generated clauses : 220
% 0.03/0.44 % ...of the previous two non-redundant : 163
% 0.03/0.44 % ...aggressively subsumed : 0
% 0.03/0.44 % Contextual simplify-reflections : 2
% 0.03/0.44 % Paramodulations : 201
% 0.03/0.44 % Factorizations : 18
% 0.03/0.44 % NegExts : 0
% 0.03/0.44 % Equation resolutions : 1
% 0.03/0.44 % Disequality decompositions : 0
% 0.03/0.44 % Total rewrite steps : 69
% 0.03/0.44 % ...of those cached : 45
% 0.03/0.44 % Propositional unsat checks : 0
% 0.03/0.44 % Propositional check models : 0
% 0.03/0.44 % Propositional check unsatisfiable : 0
% 0.03/0.44 % Propositional clauses : 0
% 0.03/0.44 % Propositional clauses after purity: 0
% 0.03/0.44 % Propositional unsat core size : 0
% 0.03/0.44 % Propositional preprocessing time : 0.000
% 0.03/0.44 % Propositional encoding time : 0.000
% 0.03/0.44 % Propositional solver time : 0.000
% 0.03/0.44 % Success case prop preproc time : 0.000
% 0.03/0.44 % Success case prop encoding time : 0.000
% 0.03/0.44 % Success case prop solver time : 0.000
% 0.03/0.44 % Current number of processed clauses : 47
% 0.03/0.44 % Positive orientable unit clauses : 8
% 0.03/0.44 % Positive unorientable unit clauses: 0
% 0.03/0.44 % Negative unit clauses : 8
% 0.03/0.44 % Non-unit-clauses : 31
% 0.03/0.44 % Current number of unprocessed clauses: 91
% 0.03/0.44 % ...number of literals in the above : 304
% 0.03/0.44 % Current number of archived formulas : 0
% 0.03/0.44 % Current number of archived clauses : 12
% 0.03/0.44 % Clause-clause subsumption calls (NU) : 183
% 0.03/0.44 % Rec. Clause-clause subsumption calls : 129
% 0.03/0.44 % Non-unit clause-clause subsumptions : 36
% 0.03/0.44 % Unit Clause-clause subsumption calls : 12
% 0.03/0.44 % Rewrite failures with RHS unbound : 0
% 0.03/0.44 % BW rewrite match attempts : 6
% 0.03/0.44 % BW rewrite match successes : 6
% 0.03/0.44 % Condensation attempts : 0
% 0.03/0.44 % Condensation successes : 0
% 0.03/0.44 % Termbank termtop insertions : 4321
% 0.03/0.44 % Search garbage collected termcells : 523
% 0.03/0.44
% 0.03/0.44 % -------------------------------------------------
% 0.03/0.44 % User time : 0.007 s
% 0.03/0.44 % System time : 0.002 s
% 0.03/0.44 % Total time : 0.009 s
% 0.03/0.44 % Maximum resident set size: 3708 pages
% 0.03/0.44
% 0.03/0.44 % -------------------------------------------------
% 0.03/0.44 % User time : 0.012 s
% 0.03/0.44 % System time : 0.006 s
% 0.03/0.44 % Total time : 0.018 s
% 0.03/0.44 % Maximum resident set size: 4608 pages
% 0.03/0.44 % E exiting
%------------------------------------------------------------------------------