%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : HWV016-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 : n005.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:21 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.46s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 20
% Syntax : Number of clauses : 74 ( 27 unt; 30 nHn; 58 RR)
% Number of literals : 172 ( 38 equ; 66 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; 4 con; 0-2 aty)
% Number of variables : 75 ( 9 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_66,axiom,
( ~ p_LES_EQU_(f_ADD_(X1,n1),f_ADD_(X2,n1))
| p_LES_EQU_(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV004-0.ax',axiom_66) ).
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_67,axiom,
( ~ p_LES_EQU_(X1,X2)
| p_LES_EQU_(f_ADD_(X1,n1),f_ADD_(X2,n1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV004-0.ax',axiom_67) ).
cnf(axiom_77,axiom,
f_ADD_(n0,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/HWV004-0.ax',axiom_77) ).
cnf(axiom_59,axiom,
f_ADD_(X1,n1) != n0,
file('/export/starexec/sandbox/benchmark/Axioms/HWV004-0.ax',axiom_59) ).
cnf(axiom_9,axiom,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTempty_(X1))
| fwork_DOTfifo_DOTrtl_DOTint__level_(X1) = n0 ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV004-0.ax',axiom_9) ).
cnf(axiom_72,axiom,
( ~ p_LES_EQU_(X2,f_ADD_(X1,n1))
| p_LES_EQU_(X2,X1)
| f_ADD_(X1,n1) = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV004-0.ax',axiom_72) ).
cnf(quest_4,negated_conjecture,
p__pred_(fwork_DOTfifo_DOTrtl_DOTempty_(f_ADD_(t_206,n1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_4) ).
cnf(axiom_36,axiom,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| ~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n0)
| p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(X1,n1)) = f_ADD_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV004-0.ax',axiom_36) ).
cnf(quest_2,negated_conjecture,
~ p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(t_206)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_2) ).
cnf(axiom_23,axiom,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
| ~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTint__level_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(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_23) ).
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/sandbox/benchmark/Axioms/HWV004-0.ax',axiom_18) ).
cnf(axiom_31,axiom,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n0)
| 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_31) ).
cnf(quest_3,negated_conjecture,
p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(t_206)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_3) ).
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(axiom_60,axiom,
~ p_LES_EQU_(f_ADD_(X1,n1),n0),
file('/export/starexec/sandbox/benchmark/Axioms/HWV004-0.ax',axiom_60) ).
cnf(quest_5,negated_conjecture,
~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_5) ).
cnf(c_0_20,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_21,plain,
( ~ p_LES_EQU_(X1,n0)
| X1 = n0 ),
inference(fof_simplification,[status(thm)],[axiom_73]) ).
cnf(c_0_22,plain,
( ~ p_LES_EQU_(X1,X2)
| p_LES_EQU_(X1,X3)
| p_LES_EQU_(X3,X2) ),
c_0_20 ).
cnf(c_0_23,axiom,
p_LES_EQU_(X1,X1),
axiom_75 ).
cnf(c_0_24,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_25,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_26,plain,
( ~ p_LES_EQU_(X1,n0)
| X1 = n0 ),
c_0_21 ).
cnf(c_0_27,plain,
( p_LES_EQU_(X2,X1)
| p_LES_EQU_(X1,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
( ~ p_LES_EQU_(X1,X2)
| p_LES_EQU_(f_ADD_(X1,n1),f_ADD_(X2,n1)) ),
inference(fof_simplification,[status(thm)],[axiom_67]) ).
cnf(c_0_29,plain,
( ~ p_LES_EQU_(f_ADD_(X1,n1),f_ADD_(X2,n1))
| p_LES_EQU_(X1,X2) ),
c_0_24 ).
cnf(c_0_30,axiom,
f_ADD_(n0,X1) = X1,
axiom_77 ).
cnf(c_0_31,plain,
( ~ p_LES_EQU_(X2,X1)
| p_LES_EQU_(f_ADD_(X2,n1),X1)
| X1 = X2 ),
c_0_25 ).
cnf(c_0_32,plain,
( p_LES_EQU_(n0,X1)
| X1 = n0 ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,plain,
f_ADD_(X1,n1) != n0,
inference(fof_simplification,[status(thm)],[axiom_59]) ).
cnf(c_0_34,plain,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTempty_(X1))
| fwork_DOTfifo_DOTrtl_DOTint__level_(X1) = n0 ),
inference(fof_simplification,[status(thm)],[axiom_9]) ).
cnf(c_0_35,plain,
( ~ p_LES_EQU_(X2,f_ADD_(X1,n1))
| p_LES_EQU_(X2,X1)
| f_ADD_(X1,n1) = X2 ),
inference(fof_simplification,[status(thm)],[axiom_72]) ).
cnf(c_0_36,plain,
( ~ p_LES_EQU_(X1,X2)
| p_LES_EQU_(f_ADD_(X1,n1),f_ADD_(X2,n1)) ),
c_0_28 ).
cnf(c_0_37,plain,
( ~ p_LES_EQU_(n1,f_ADD_(X1,n1))
| p_LES_EQU_(n0,X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_38,plain,
( p_LES_EQU_(n1,X1)
| X1 = n0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_30]),c_0_32]) ).
cnf(c_0_39,plain,
f_ADD_(X1,n1) != n0,
c_0_33 ).
cnf(c_0_40,plain,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTempty_(X1))
| fwork_DOTfifo_DOTrtl_DOTint__level_(X1) = n0 ),
c_0_34 ).
cnf(c_0_41,negated_conjecture,
p__pred_(fwork_DOTfifo_DOTrtl_DOTempty_(f_ADD_(t_206,n1))),
quest_4 ).
cnf(c_0_42,plain,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| ~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n0)
| p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(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_36]) ).
cnf(c_0_43,negated_conjecture,
~ p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(t_206)),
inference(fof_simplification,[status(thm)],[quest_2]) ).
cnf(c_0_44,plain,
( ~ p_LES_EQU_(X2,f_ADD_(X1,n1))
| p_LES_EQU_(X2,X1)
| f_ADD_(X1,n1) = X2 ),
c_0_35 ).
cnf(c_0_45,plain,
( ~ p_LES_EQU_(n0,X1)
| p_LES_EQU_(n1,f_ADD_(X1,n1)) ),
inference(spm,[status(thm)],[c_0_36,c_0_30]) ).
cnf(c_0_46,plain,
p_LES_EQU_(n0,X1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_47,plain,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
| ~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTint__level_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(X1,n1)) = fwork_DOTfifo_DOTrtl_DOTint__level_(X1) ),
inference(fof_simplification,[status(thm)],[axiom_23]) ).
cnf(c_0_48,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_49,plain,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n0)
| fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(X1,n1)) = fwork_DOTfifo_DOTrtl_DOTint__level_(X1) ),
inference(fof_simplification,[status(thm)],[axiom_31]) ).
cnf(c_0_50,negated_conjecture,
fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(t_206,n1)) = n0,
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_51,plain,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| ~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n0)
| p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(X1,n1)) = f_ADD_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n1) ),
c_0_42 ).
cnf(c_0_52,negated_conjecture,
p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(t_206)),
quest_3 ).
cnf(c_0_53,negated_conjecture,
~ p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(t_206)),
c_0_43 ).
cnf(c_0_54,plain,
( p_LES_EQU_(n1,X1)
| f_ADD_(X1,n1) = n1 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_38]),c_0_39]) ).
cnf(c_0_55,plain,
p_LES_EQU_(n1,f_ADD_(X1,n1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46])]) ).
cnf(c_0_56,plain,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
| ~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTint__level_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(X1,n1)) = fwork_DOTfifo_DOTrtl_DOTint__level_(X1) ),
c_0_47 ).
cnf(c_0_57,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_58,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_48 ).
cnf(c_0_59,plain,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(X1),n0)
| fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(X1,n1)) = fwork_DOTfifo_DOTrtl_DOTint__level_(X1) ),
c_0_49 ).
cnf(c_0_60,plain,
~ p_LES_EQU_(f_ADD_(X1,n1),n0),
inference(fof_simplification,[status(thm)],[axiom_60]) ).
cnf(c_0_61,negated_conjecture,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(t_206))
| ~ 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(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52])]),c_0_39]),c_0_53]) ).
cnf(c_0_62,plain,
( p_LES_EQU_(X1,X2)
| p_LES_EQU_(n1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_54]),c_0_55])]) ).
cnf(c_0_63,plain,
( ~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTint__level_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(X1,n1)) = fwork_DOTfifo_DOTrtl_DOTint__level_(X1) ),
inference(csr,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_64,negated_conjecture,
( p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(t_206))
| p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTint__level_(t_206)) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_58]),c_0_52])]),c_0_39]),c_0_53]) ).
cnf(c_0_65,negated_conjecture,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(t_206))
| fwork_DOTfifo_DOTrtl_DOTint__level_(t_206) = n0 ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_59]),c_0_52])]),c_0_53]),c_0_26]) ).
cnf(c_0_66,plain,
~ p_LES_EQU_(f_ADD_(X1,n1),n0),
c_0_60 ).
cnf(c_0_67,negated_conjecture,
~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,n0),
inference(fof_simplification,[status(thm)],[quest_5]) ).
cnf(c_0_68,negated_conjecture,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(t_206))
| p_LES_EQU_(n1,fwork_DOTfifo_DOTrtl_DOTint__level_(t_206)) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_69,negated_conjecture,
fwork_DOTfifo_DOTrtl_DOTint__level_(t_206) = n0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_63]),c_0_53]),c_0_64]),c_0_65]) ).
cnf(c_0_70,plain,
~ p_LES_EQU_(n1,n0),
inference(spm,[status(thm)],[c_0_66,c_0_30]) ).
cnf(c_0_71,negated_conjecture,
~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,n0),
c_0_67 ).
cnf(c_0_72,negated_conjecture,
~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(t_206)),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_69]),c_0_70]) ).
cnf(c_0_73,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_69]),c_0_71]),c_0_72]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HWV016-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.10/0.36 % Computer : n005.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 20 20:48:33 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.10/0.46 % Version: 3.5.1
% 0.10/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.46 % Starting sh5l with 300s (1) cores
% 0.10/0.46 % sh5l with pid 1746871 completed with status 0
% 0.10/0.46 % Result found by sh5l
% 0.10/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.46 % Starting sh5l with 300s (1) cores
% 0.10/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.10/0.46 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.10/0.46 % Search class: FGHSM-FFMS31-MFFFFFNN
% 0.10/0.46 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.46 % Starting SubtermCWHack with 28s (1) cores
% 0.10/0.46 % SubtermCWHack with pid 1746879 completed with status 0
% 0.10/0.46 % Result found by SubtermCWHack
% 0.10/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.46 % Starting sh5l with 300s (1) cores
% 0.10/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.10/0.46 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.10/0.46 % Search class: FGHSM-FFMS31-MFFFFFNN
% 0.10/0.46 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.46 % Starting SubtermCWHack with 28s (1) cores
% 0.10/0.46 % Preprocessing time : 0.002 s
% 0.10/0.46
% 0.10/0.46 % Proof found!
% 0.10/0.46 % SZS status Unsatisfiable
% 0.10/0.46 % SZS output start CNFRefutation
% See solution above
% 0.10/0.46 % Parsed axioms : 138
% 0.10/0.46 % Removed by relevancy pruning/SinE : 55
% 0.10/0.46 % Initial clauses : 83
% 0.10/0.46 % Removed in clause preprocessing : 0
% 0.10/0.46 % Initial clauses in saturation : 83
% 0.10/0.46 % Processed clauses : 300
% 0.10/0.46 % ...of these trivial : 8
% 0.10/0.46 % ...subsumed : 143
% 0.10/0.46 % ...remaining for further processing : 148
% 0.10/0.46 % Other redundant clauses eliminated : 1
% 0.10/0.46 % Clauses deleted for lack of memory : 0
% 0.10/0.46 % Backward-subsumed : 14
% 0.10/0.46 % Backward-rewritten : 16
% 0.10/0.46 % Generated clauses : 991
% 0.10/0.46 % ...of the previous two non-redundant : 682
% 0.10/0.46 % ...aggressively subsumed : 0
% 0.10/0.46 % Contextual simplify-reflections : 14
% 0.10/0.46 % Paramodulations : 963
% 0.10/0.46 % Factorizations : 26
% 0.10/0.46 % NegExts : 0
% 0.10/0.46 % Equation resolutions : 2
% 0.10/0.46 % Disequality decompositions : 0
% 0.10/0.46 % Total rewrite steps : 373
% 0.10/0.46 % ...of those cached : 328
% 0.10/0.46 % Propositional unsat checks : 0
% 0.10/0.46 % Propositional check models : 0
% 0.10/0.46 % Propositional check unsatisfiable : 0
% 0.10/0.46 % Propositional clauses : 0
% 0.10/0.46 % Propositional clauses after purity: 0
% 0.10/0.46 % Propositional unsat core size : 0
% 0.10/0.46 % Propositional preprocessing time : 0.000
% 0.10/0.46 % Propositional encoding time : 0.000
% 0.10/0.46 % Propositional solver time : 0.000
% 0.10/0.46 % Success case prop preproc time : 0.000
% 0.10/0.46 % Success case prop encoding time : 0.000
% 0.10/0.46 % Success case prop solver time : 0.000
% 0.10/0.46 % Current number of processed clauses : 117
% 0.10/0.46 % Positive orientable unit clauses : 18
% 0.10/0.46 % Positive unorientable unit clauses: 0
% 0.10/0.46 % Negative unit clauses : 7
% 0.10/0.46 % Non-unit-clauses : 92
% 0.10/0.46 % Current number of unprocessed clauses: 448
% 0.10/0.46 % ...number of literals in the above : 1897
% 0.10/0.46 % Current number of archived formulas : 0
% 0.10/0.46 % Current number of archived clauses : 30
% 0.10/0.46 % Clause-clause subsumption calls (NU) : 1042
% 0.10/0.46 % Rec. Clause-clause subsumption calls : 754
% 0.10/0.46 % Non-unit clause-clause subsumptions : 153
% 0.10/0.46 % Unit Clause-clause subsumption calls : 22
% 0.10/0.46 % Rewrite failures with RHS unbound : 0
% 0.10/0.46 % BW rewrite match attempts : 10
% 0.10/0.46 % BW rewrite match successes : 10
% 0.10/0.46 % Condensation attempts : 0
% 0.10/0.46 % Condensation successes : 0
% 0.10/0.46 % Termbank termtop insertions : 15689
% 0.10/0.46 % Search garbage collected termcells : 354
% 0.10/0.46
% 0.10/0.46 % -------------------------------------------------
% 0.10/0.46 % User time : 0.025 s
% 0.10/0.46 % System time : 0.004 s
% 0.10/0.46 % Total time : 0.029 s
% 0.10/0.46 % Maximum resident set size: 3744 pages
% 0.10/0.46
% 0.10/0.46 % -------------------------------------------------
% 0.10/0.46 % User time : 0.029 s
% 0.10/0.46 % System time : 0.010 s
% 0.10/0.46 % Total time : 0.038 s
% 0.10/0.46 % Maximum resident set size: 4864 pages
% 0.10/0.46 % E exiting
%------------------------------------------------------------------------------