%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : HWV022-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 : n004.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.48s 0.49s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 14
% Syntax : Number of clauses : 49 ( 24 unt; 10 nHn; 44 RR)
% Number of literals : 89 ( 26 equ; 36 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 41 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_63,axiom,
( f_ADD_(X3,X1) != X2
| f_SUB_(X2,X1) = X3
| def_89(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV004-0.ax',axiom_63) ).
cnf(axiom_18,axiom,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTint__level_(X1))
| fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(X1,n1)) = f_ADD_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV004-0.ax',axiom_18) ).
cnf(axiom_66,axiom,
( ~ p_LES_EQU_(f_ADD_(X1,n1),f_ADD_(X2,n1))
| p_LES_EQU_(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV004-0.ax',axiom_66) ).
cnf(axiom_65,axiom,
( ~ def_89(X2,X1)
| p_LES_EQU_(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV004-0.ax',axiom_65) ).
cnf(quest_1,negated_conjecture,
f_ADD_(fwork_DOTfifo_DOTrtl_DOTlevel_(t_206),n1) = fwork_DOTfifo_DOTrtl_DOTfifo__length_,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_1) ).
cnf(axiom_60,axiom,
~ p_LES_EQU_(f_ADD_(X1,n1),n0),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV004-0.ax',axiom_60) ).
cnf(quest_5,negated_conjecture,
fwork_DOTfifo_DOTrtl_DOTlevel_(f_ADD_(t_206,n1)) != fwork_DOTfifo_DOTrtl_DOTfifo__length_,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_5) ).
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_3,negated_conjecture,
~ p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(t_206)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_3) ).
cnf(quest_4,negated_conjecture,
~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(t_206)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_4) ).
cnf(axiom_73,axiom,
( ~ p_LES_EQU_(X1,n0)
| X1 = n0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV004-0.ax',axiom_73) ).
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(quest_2,negated_conjecture,
p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(t_206)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_2) ).
cnf(axiom_77,axiom,
f_ADD_(n0,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/HWV004-0.ax',axiom_77) ).
cnf(c_0_14,plain,
( f_ADD_(X3,X1) != X2
| f_SUB_(X2,X1) = X3
| def_89(X1,X2) ),
inference(fof_simplification,[status(thm)],[axiom_63]) ).
cnf(c_0_15,plain,
( f_ADD_(X3,X1) != X2
| f_SUB_(X2,X1) = X3
| def_89(X1,X2) ),
c_0_14 ).
cnf(c_0_16,plain,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTint__level_(X1))
| fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(X1,n1)) = f_ADD_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n1) ),
inference(fof_simplification,[status(thm)],[axiom_18]) ).
cnf(c_0_17,plain,
( ~ p_LES_EQU_(f_ADD_(X1,n1),f_ADD_(X2,n1))
| p_LES_EQU_(X1,X2) ),
inference(fof_simplification,[status(thm)],[axiom_66]) ).
cnf(c_0_18,plain,
( ~ def_89(X2,X1)
| p_LES_EQU_(X1,X2) ),
inference(fof_simplification,[status(thm)],[axiom_65]) ).
cnf(c_0_19,plain,
( def_89(X2,f_ADD_(X1,X2))
| f_SUB_(f_ADD_(X1,X2),X2) = X1 ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
f_ADD_(fwork_DOTfifo_DOTrtl_DOTlevel_(t_206),n1) = fwork_DOTfifo_DOTrtl_DOTfifo__length_,
quest_1 ).
cnf(c_0_21,plain,
~ p_LES_EQU_(f_ADD_(X1,n1),n0),
inference(fof_simplification,[status(thm)],[axiom_60]) ).
cnf(c_0_22,negated_conjecture,
fwork_DOTfifo_DOTrtl_DOTlevel_(f_ADD_(t_206,n1)) != fwork_DOTfifo_DOTrtl_DOTfifo__length_,
inference(fof_simplification,[status(thm)],[quest_5]) ).
cnf(c_0_23,plain,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTint__level_(X1))
| fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(X1,n1)) = f_ADD_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n1) ),
c_0_16 ).
cnf(c_0_24,axiom,
fwork_DOTfifo_DOTrtl_DOTlevel_(X1) = fwork_DOTfifo_DOTrtl_DOTint__level_(X1),
axiom_5 ).
cnf(c_0_25,negated_conjecture,
~ p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(t_206)),
inference(fof_simplification,[status(thm)],[quest_3]) ).
cnf(c_0_26,negated_conjecture,
~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(t_206)),
inference(fof_simplification,[status(thm)],[quest_4]) ).
cnf(c_0_27,plain,
( ~ p_LES_EQU_(X1,n0)
| X1 = n0 ),
inference(fof_simplification,[status(thm)],[axiom_73]) ).
cnf(c_0_28,plain,
( ~ p_LES_EQU_(f_ADD_(X1,n1),f_ADD_(X2,n1))
| p_LES_EQU_(X1,X2) ),
c_0_17 ).
cnf(c_0_29,plain,
( ~ p_LES_EQU_(X1,f_SUB_(X1,n1))
| p_LES_EQU_(X1,n0) ),
inference(fof_simplification,[status(thm)],[axiom_61]) ).
cnf(c_0_30,plain,
( ~ def_89(X2,X1)
| p_LES_EQU_(X1,X2) ),
c_0_18 ).
cnf(c_0_31,negated_conjecture,
( def_89(n1,fwork_DOTfifo_DOTrtl_DOTfifo__length_)
| f_SUB_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,n1) = fwork_DOTfifo_DOTrtl_DOTlevel_(t_206) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_32,plain,
~ p_LES_EQU_(f_ADD_(X1,n1),n0),
c_0_21 ).
cnf(c_0_33,negated_conjecture,
fwork_DOTfifo_DOTrtl_DOTlevel_(f_ADD_(t_206,n1)) != fwork_DOTfifo_DOTrtl_DOTfifo__length_,
c_0_22 ).
cnf(c_0_34,plain,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
| p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTlevel_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| fwork_DOTfifo_DOTrtl_DOTlevel_(f_ADD_(X1,n1)) = f_ADD_(fwork_DOTfifo_DOTrtl_DOTlevel_(X1),n1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_24]),c_0_24]) ).
cnf(c_0_35,negated_conjecture,
p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(t_206)),
quest_2 ).
cnf(c_0_36,negated_conjecture,
~ p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(t_206)),
c_0_25 ).
cnf(c_0_37,negated_conjecture,
~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(t_206)),
c_0_26 ).
cnf(c_0_38,plain,
( ~ p_LES_EQU_(X1,n0)
| X1 = n0 ),
c_0_27 ).
cnf(c_0_39,negated_conjecture,
( ~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,f_ADD_(X1,n1))
| p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTlevel_(t_206),X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_20]) ).
cnf(c_0_40,axiom,
f_ADD_(n0,X1) = X1,
axiom_77 ).
cnf(c_0_41,plain,
( ~ p_LES_EQU_(X1,f_SUB_(X1,n1))
| p_LES_EQU_(X1,n0) ),
c_0_29 ).
cnf(c_0_42,negated_conjecture,
( p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,n1)
| f_SUB_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,n1) = fwork_DOTfifo_DOTrtl_DOTlevel_(t_206) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_43,negated_conjecture,
~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,n0),
inference(spm,[status(thm)],[c_0_32,c_0_20]) ).
cnf(c_0_44,negated_conjecture,
p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTlevel_(t_206)),
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_33,c_0_34]),c_0_20]),c_0_35])]),c_0_36]),c_0_37]) ).
cnf(c_0_45,negated_conjecture,
( ~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,n1)
| fwork_DOTfifo_DOTrtl_DOTlevel_(t_206) = n0 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_46,negated_conjecture,
( ~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTlevel_(t_206))
| p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,n1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_47,negated_conjecture,
~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,n1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_43]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_44])]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HWV022-2 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n004.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 20 20:48:34 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/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.48/0.49 % Version: 3.5.1
% 0.48/0.49 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.48/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/0.49 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.48/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.48/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.48/0.49 % Starting sh5l with 300s (1) cores
% 0.48/0.49 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1468410 completed with status 0
% 0.48/0.49 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.48/0.49 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.48/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/0.49 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.48/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.48/0.49 % No SInE strategy applied
% 0.48/0.49 % Search class: FGHSM-FSLS31-MFFFFFNN
% 0.48/0.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.48/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.48/0.49 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.48/0.49 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 244s (1) cores
% 0.48/0.49 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S06DI with 136s (1) cores
% 0.48/0.49 % Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 136s (1) cores
% 0.48/0.49 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 1468419 completed with status 0
% 0.48/0.49 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.48/0.49 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.48/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/0.49 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.48/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.48/0.49 % No SInE strategy applied
% 0.48/0.49 % Search class: FGHSM-FSLS31-MFFFFFNN
% 0.48/0.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.48/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.48/0.49 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.48/0.49 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 244s (1) cores
% 0.48/0.49 % Preprocessing time : 0.003 s
% 0.48/0.49 % Presaturation interreduction done
% 0.48/0.49
% 0.48/0.49 % Proof found!
% 0.48/0.49 % SZS status Unsatisfiable
% 0.48/0.49 % SZS output start CNFRefutation
% See solution above
% 0.48/0.49 % Parsed axioms : 138
% 0.48/0.49 % Removed by relevancy pruning/SinE : 0
% 0.48/0.49 % Initial clauses : 138
% 0.48/0.49 % Removed in clause preprocessing : 1
% 0.48/0.49 % Initial clauses in saturation : 137
% 0.48/0.49 % Processed clauses : 517
% 0.48/0.49 % ...of these trivial : 1
% 0.48/0.49 % ...subsumed : 103
% 0.48/0.49 % ...remaining for further processing : 412
% 0.48/0.49 % Other redundant clauses eliminated : 10
% 0.48/0.49 % Clauses deleted for lack of memory : 0
% 0.48/0.49 % Backward-subsumed : 52
% 0.48/0.49 % Backward-rewritten : 12
% 0.48/0.49 % Generated clauses : 759
% 0.48/0.49 % ...of the previous two non-redundant : 625
% 0.48/0.49 % ...aggressively subsumed : 0
% 0.48/0.49 % Contextual simplify-reflections : 41
% 0.48/0.49 % Paramodulations : 747
% 0.48/0.49 % Factorizations : 0
% 0.48/0.49 % NegExts : 0
% 0.48/0.49 % Equation resolutions : 11
% 0.48/0.49 % Disequality decompositions : 0
% 0.48/0.49 % Total rewrite steps : 126
% 0.48/0.49 % ...of those cached : 94
% 0.48/0.49 % Propositional unsat checks : 0
% 0.48/0.49 % Propositional check models : 0
% 0.48/0.49 % Propositional check unsatisfiable : 0
% 0.48/0.49 % Propositional clauses : 0
% 0.48/0.49 % Propositional clauses after purity: 0
% 0.48/0.49 % Propositional unsat core size : 0
% 0.48/0.49 % Propositional preprocessing time : 0.000
% 0.48/0.49 % Propositional encoding time : 0.000
% 0.48/0.49 % Propositional solver time : 0.000
% 0.48/0.49 % Success case prop preproc time : 0.000
% 0.48/0.49 % Success case prop encoding time : 0.000
% 0.48/0.49 % Success case prop solver time : 0.000
% 0.48/0.49 % Current number of processed clauses : 217
% 0.48/0.49 % Positive orientable unit clauses : 30
% 0.48/0.49 % Positive unorientable unit clauses: 0
% 0.48/0.49 % Negative unit clauses : 15
% 0.48/0.49 % Non-unit-clauses : 172
% 0.48/0.49 % Current number of unprocessed clauses: 367
% 0.48/0.49 % ...number of literals in the above : 1415
% 0.48/0.49 % Current number of archived formulas : 0
% 0.48/0.49 % Current number of archived clauses : 191
% 0.48/0.49 % Clause-clause subsumption calls (NU) : 13293
% 0.48/0.49 % Rec. Clause-clause subsumption calls : 4421
% 0.48/0.49 % Non-unit clause-clause subsumptions : 148
% 0.48/0.49 % Unit Clause-clause subsumption calls : 391
% 0.48/0.49 % Rewrite failures with RHS unbound : 0
% 0.48/0.49 % BW rewrite match attempts : 10
% 0.48/0.49 % BW rewrite match successes : 5
% 0.48/0.49 % Condensation attempts : 0
% 0.48/0.49 % Condensation successes : 0
% 0.48/0.49 % Termbank termtop insertions : 17276
% 0.48/0.49 % Search garbage collected termcells : 244
% 0.48/0.49
% 0.48/0.49 % -------------------------------------------------
% 0.48/0.49 % User time : 0.045 s
% 0.48/0.49 % System time : 0.008 s
% 0.48/0.49 % Total time : 0.053 s
% 0.48/0.49 % Maximum resident set size: 3744 pages
% 0.48/0.49
% 0.48/0.49 % -------------------------------------------------
% 0.48/0.49 % User time : 0.181 s
% 0.48/0.49 % System time : 0.025 s
% 0.48/0.49 % Total time : 0.206 s
% 0.48/0.49 % Maximum resident set size: 4608 pages
% 0.48/0.49 % E exiting
%------------------------------------------------------------------------------