%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : HWV021-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 : n017.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:48 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.46s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of clauses : 49 ( 18 unt; 18 nHn; 38 RR)
% Number of literals : 113 ( 20 equ; 52 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 : 10 ( 10 usr; 3 con; 0-2 aty)
% Number of variables : 53 ( 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/sandbox/benchmark/Axioms/HWV004-0.ax',axiom_71) ).
cnf(axiom_73,axiom,
( ~ p_LES_EQU_(X1,n0)
| X1 = n0 ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV004-0.ax',axiom_73) ).
cnf(axiom_75,axiom,
p_LES_EQU_(X1,X1),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/HWV004-0.ax',axiom_68) ).
cnf(axiom_46,axiom,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd__error_(f_ADD_(X1,n1)))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
| p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n0) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV004-0.ax',axiom_46) ).
cnf(axiom_14,axiom,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd__error_(f_ADD_(X1,n1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV004-0.ax',axiom_14) ).
cnf(axiom_77,axiom,
f_ADD_(n0,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/HWV004-0.ax',axiom_77) ).
cnf(axiom_34,axiom,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd__error_(f_ADD_(X1,n1)))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n0) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV004-0.ax',axiom_34) ).
cnf(axiom_70,axiom,
( ~ p_LES_EQU_(X2,X1)
| ~ p_LES_EQU_(X1,X2)
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV004-0.ax',axiom_70) ).
cnf(quest_4,negated_conjecture,
~ p__pred_(fwork_DOTfifo_DOTrtl_DOTempty_(t_206)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_4) ).
cnf(axiom_8,axiom,
( fwork_DOTfifo_DOTrtl_DOTint__level_(X1) != n0
| p__pred_(fwork_DOTfifo_DOTrtl_DOTempty_(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV004-0.ax',axiom_8) ).
cnf(axiom_60,axiom,
~ p_LES_EQU_(f_ADD_(X1,n1),n0),
file('/export/starexec/sandbox/benchmark/Axioms/HWV004-0.ax',axiom_60) ).
cnf(quest_1,negated_conjecture,
p__pred_(fwork_DOTfifo_DOTrtl_DOTrd__error_(f_ADD_(t_206,n1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_1) ).
cnf(quest_3,negated_conjecture,
p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(t_206)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_3) ).
cnf(c_0_14,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_15,plain,
( ~ p_LES_EQU_(X1,n0)
| X1 = n0 ),
inference(fof_simplification,[status(thm)],[axiom_73]) ).
cnf(c_0_16,plain,
( ~ p_LES_EQU_(X1,X2)
| p_LES_EQU_(X1,X3)
| p_LES_EQU_(X3,X2) ),
c_0_14 ).
cnf(c_0_17,axiom,
p_LES_EQU_(X1,X1),
axiom_75 ).
cnf(c_0_18,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_19,plain,
( ~ p_LES_EQU_(X1,n0)
| X1 = n0 ),
c_0_15 ).
cnf(c_0_20,plain,
( p_LES_EQU_(X2,X1)
| p_LES_EQU_(X1,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd__error_(f_ADD_(X1,n1)))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
| p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n0) ),
inference(fof_simplification,[status(thm)],[axiom_46]) ).
cnf(c_0_22,plain,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd__error_(f_ADD_(X1,n1))) ),
inference(fof_simplification,[status(thm)],[axiom_14]) ).
cnf(c_0_23,plain,
( ~ p_LES_EQU_(X2,X1)
| p_LES_EQU_(f_ADD_(X2,n1),X1)
| X1 = X2 ),
c_0_18 ).
cnf(c_0_24,axiom,
f_ADD_(n0,X1) = X1,
axiom_77 ).
cnf(c_0_25,plain,
( p_LES_EQU_(n0,X1)
| X1 = n0 ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd__error_(f_ADD_(X1,n1)))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n0) ),
inference(fof_simplification,[status(thm)],[axiom_34]) ).
cnf(c_0_27,plain,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd__error_(f_ADD_(X1,n1)))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
| p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n0) ),
c_0_21 ).
cnf(c_0_28,plain,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd__error_(f_ADD_(X1,n1))) ),
c_0_22 ).
cnf(c_0_29,plain,
( ~ p_LES_EQU_(X2,X1)
| ~ p_LES_EQU_(X1,X2)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[axiom_70]) ).
cnf(c_0_30,plain,
( p_LES_EQU_(n1,X1)
| X1 = n0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_31,plain,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd__error_(f_ADD_(X1,n1)))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n0) ),
c_0_26 ).
cnf(c_0_32,plain,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd__error_(f_ADD_(X1,n1)))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
| p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n0) ),
inference(csr,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
~ p__pred_(fwork_DOTfifo_DOTrtl_DOTempty_(t_206)),
inference(fof_simplification,[status(thm)],[quest_4]) ).
cnf(c_0_34,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_35,plain,
~ p_LES_EQU_(f_ADD_(X1,n1),n0),
inference(fof_simplification,[status(thm)],[axiom_60]) ).
cnf(c_0_36,plain,
( ~ p_LES_EQU_(X2,X1)
| ~ p_LES_EQU_(X1,X2)
| X1 = X2 ),
c_0_29 ).
cnf(c_0_37,plain,
( p_LES_EQU_(X2,X1)
| p_LES_EQU_(n1,X2)
| X1 = n0 ),
inference(spm,[status(thm)],[c_0_16,c_0_30]) ).
cnf(c_0_38,plain,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd__error_(f_ADD_(X1,n1)))
| p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_31,c_0_32]),c_0_28]) ).
cnf(c_0_39,negated_conjecture,
p__pred_(fwork_DOTfifo_DOTrtl_DOTrd__error_(f_ADD_(t_206,n1))),
quest_1 ).
cnf(c_0_40,negated_conjecture,
p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(t_206)),
quest_3 ).
cnf(c_0_41,negated_conjecture,
~ p__pred_(fwork_DOTfifo_DOTrtl_DOTempty_(t_206)),
c_0_33 ).
cnf(c_0_42,plain,
( fwork_DOTfifo_DOTrtl_DOTint__level_(X1) != n0
| p__pred_(fwork_DOTfifo_DOTrtl_DOTempty_(X1)) ),
c_0_34 ).
cnf(c_0_43,plain,
~ p_LES_EQU_(f_ADD_(X1,n1),n0),
c_0_35 ).
cnf(c_0_44,plain,
( ~ p_LES_EQU_(X1,X2)
| p_LES_EQU_(n1,X2)
| X1 = X2
| X1 = n0 ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_45,negated_conjecture,
p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(t_206),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,negated_conjecture,
fwork_DOTfifo_DOTrtl_DOTint__level_(t_206) != n0,
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,plain,
~ p_LES_EQU_(n1,n0),
inference(spm,[status(thm)],[c_0_43,c_0_24]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HWV021-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/0.37 % Computer : n017.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:43:56 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/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.15/0.46 % Version: 3.5.1
% 0.15/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.46 % Starting sh5l with 300s (1) cores
% 0.15/0.46 % new_bool_3 with pid 611399 completed with status 0
% 0.15/0.46 % Result found by new_bool_3
% 0.15/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.46 % Search class: FGHSS-FFMS21-SFFFFFNN
% 0.15/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.46 % SubtermCWHack with pid 611402 completed with status 0
% 0.15/0.46 % Result found by SubtermCWHack
% 0.15/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.46 % Search class: FGHSS-FFMS21-SFFFFFNN
% 0.15/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.46 % Preprocessing time : 0.002 s
% 0.15/0.46
% 0.15/0.46 % Proof found!
% 0.15/0.46 % SZS status Unsatisfiable
% 0.15/0.46 % SZS output start CNFRefutation
% See solution above
% 0.15/0.46 % Parsed axioms : 137
% 0.15/0.46 % Removed by relevancy pruning/SinE : 101
% 0.15/0.46 % Initial clauses : 36
% 0.15/0.46 % Removed in clause preprocessing : 0
% 0.15/0.46 % Initial clauses in saturation : 36
% 0.15/0.46 % Processed clauses : 210
% 0.15/0.46 % ...of these trivial : 10
% 0.15/0.46 % ...subsumed : 103
% 0.15/0.46 % ...remaining for further processing : 97
% 0.15/0.46 % Other redundant clauses eliminated : 0
% 0.15/0.46 % Clauses deleted for lack of memory : 0
% 0.15/0.46 % Backward-subsumed : 11
% 0.15/0.46 % Backward-rewritten : 7
% 0.15/0.46 % Generated clauses : 746
% 0.15/0.46 % ...of the previous two non-redundant : 486
% 0.15/0.46 % ...aggressively subsumed : 0
% 0.15/0.46 % Contextual simplify-reflections : 10
% 0.15/0.46 % Paramodulations : 697
% 0.15/0.46 % Factorizations : 48
% 0.15/0.46 % NegExts : 0
% 0.15/0.46 % Equation resolutions : 1
% 0.15/0.46 % Disequality decompositions : 0
% 0.15/0.46 % Total rewrite steps : 296
% 0.15/0.46 % ...of those cached : 249
% 0.15/0.46 % Propositional unsat checks : 0
% 0.15/0.46 % Propositional check models : 0
% 0.15/0.46 % Propositional check unsatisfiable : 0
% 0.15/0.46 % Propositional clauses : 0
% 0.15/0.46 % Propositional clauses after purity: 0
% 0.15/0.46 % Propositional unsat core size : 0
% 0.15/0.46 % Propositional preprocessing time : 0.000
% 0.15/0.46 % Propositional encoding time : 0.000
% 0.15/0.46 % Propositional solver time : 0.000
% 0.15/0.46 % Success case prop preproc time : 0.000
% 0.15/0.46 % Success case prop encoding time : 0.000
% 0.15/0.46 % Success case prop solver time : 0.000
% 0.15/0.46 % Current number of processed clauses : 79
% 0.15/0.46 % Positive orientable unit clauses : 11
% 0.15/0.46 % Positive unorientable unit clauses: 0
% 0.15/0.46 % Negative unit clauses : 7
% 0.15/0.46 % Non-unit-clauses : 61
% 0.15/0.46 % Current number of unprocessed clauses: 283
% 0.15/0.46 % ...number of literals in the above : 1191
% 0.15/0.46 % Current number of archived formulas : 0
% 0.15/0.46 % Current number of archived clauses : 18
% 0.15/0.46 % Clause-clause subsumption calls (NU) : 760
% 0.15/0.46 % Rec. Clause-clause subsumption calls : 553
% 0.15/0.46 % Non-unit clause-clause subsumptions : 115
% 0.15/0.46 % Unit Clause-clause subsumption calls : 17
% 0.15/0.46 % Rewrite failures with RHS unbound : 0
% 0.15/0.46 % BW rewrite match attempts : 8
% 0.15/0.46 % BW rewrite match successes : 6
% 0.15/0.46 % Condensation attempts : 0
% 0.15/0.46 % Condensation successes : 0
% 0.15/0.46 % Termbank termtop insertions : 11317
% 0.15/0.46 % Search garbage collected termcells : 503
% 0.15/0.46
% 0.15/0.46 % -------------------------------------------------
% 0.15/0.46 % User time : 0.017 s
% 0.15/0.46 % System time : 0.002 s
% 0.15/0.46 % Total time : 0.019 s
% 0.15/0.46 % Maximum resident set size: 3744 pages
% 0.15/0.46
% 0.15/0.46 % -------------------------------------------------
% 0.15/0.46 % User time : 0.022 s
% 0.15/0.46 % System time : 0.006 s
% 0.15/0.46 % Total time : 0.028 s
% 0.15/0.46 % Maximum resident set size: 4864 pages
% 0.15/0.46 % E exiting
%------------------------------------------------------------------------------