%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : HWV017-1 : 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 : n013.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.73s 0.51s
% Output : CNFRefutation 0.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 28
% Syntax : Number of clauses : 118 ( 37 unt; 45 nHn; 96 RR)
% Number of literals : 258 ( 92 equ; 94 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 132 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_4,axiom,
( minus(X1,X2) != X3
| def_10(X2,X1)
| plus(X3,X2) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_4) ).
cnf(axiom_6,axiom,
( ~ gt(X2,X1)
| ~ def_10(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_6) ).
cnf(axiom_8,axiom,
( ~ gt(X1,X2)
| gt(plus(X1,n1),plus(X2,n1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_8) ).
cnf(axiom_13,axiom,
( ~ gt(X2,X3)
| ~ gt(X1,X2)
| gt(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_13) ).
cnf(axiom_2,axiom,
gt(plus(X1,n1),n0),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_2) ).
cnf(axiom_19,axiom,
plus(n0,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_19) ).
cnf(axiom_9,axiom,
( ~ gt(plus(X1,n1),plus(X2,n1))
| gt(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_9) ).
cnf(quest_1,negated_conjecture,
~ gt(level(t_139),fifo_length),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_1) ).
cnf(axiom_3,axiom,
( ~ gt(X1,n0)
| gt(X1,minus(X1,n1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_3) ).
cnf(axiom_17,axiom,
~ gt(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_17) ).
cnf(axiom_16,axiom,
( X1 = plus(y_27(X1),n1)
| X1 = n0 ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_16) ).
cnf(axiom_12,axiom,
( gt(X2,X1)
| X2 = X1
| gt(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_12) ).
cnf(axiom_18,axiom,
( plus(X1,n1) != plus(X2,n1)
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_18) ).
cnf(axiom_1,axiom,
plus(X1,n1) != n0,
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_1) ).
cnf(axiom_10,axiom,
( ~ gt(plus(X1,n1),X2)
| X2 = X1
| gt(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_10) ).
cnf(axiom_23,axiom,
( ~ p_Full(X1)
| int_level(X1) = fifo_length ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_23) ).
cnf(axiom_71,axiom,
( ~ gt(int_level(X1),n0)
| ~ p_Rd(X1)
| int_level(plus(X1,n1)) = minus(int_level(X1),n1)
| p_Wr(X1)
| p_Reset(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_71) ).
cnf(axiom_21,axiom,
level(X1) = int_level(X1),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_21) ).
cnf(quest_5,negated_conjecture,
p_Full(plus(t_139,n1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_5) ).
cnf(quest_3,negated_conjecture,
~ p_Wr(t_139),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_3) ).
cnf(quest_4,negated_conjecture,
~ p_Reset(t_139),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_4) ).
cnf(quest_2,negated_conjecture,
p_Rd(t_139),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_2) ).
cnf(axiom_15,axiom,
( gt(X1,n0)
| X1 = n0 ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_15) ).
cnf(axiom_78,axiom,
( ~ p_Rd(X1)
| int_level(plus(X1,n1)) = int_level(X1)
| gt(int_level(X1),n0)
| p_Wr(X1)
| p_Reset(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_78) ).
cnf(axiom_82,axiom,
( int_level(plus(X1,n1)) = int_level(X1)
| p_Rd(X1)
| p_Wr(X1)
| p_Reset(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_82) ).
cnf(quest_6,negated_conjecture,
gt(fifo_length,n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_6) ).
cnf(axiom_5,axiom,
( plus(X3,X2) != X1
| def_10(X2,X1)
| minus(X1,X2) = X3 ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_5) ).
cnf(axiom_7,axiom,
( X2 != X1
| ~ def_10(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_7) ).
cnf(c_0_28,plain,
( minus(X1,X2) != X3
| def_10(X2,X1)
| plus(X3,X2) = X1 ),
inference(fof_simplification,[status(thm)],[axiom_4]) ).
cnf(c_0_29,plain,
( ~ gt(X2,X1)
| ~ def_10(X1,X2) ),
inference(fof_simplification,[status(thm)],[axiom_6]) ).
cnf(c_0_30,plain,
( minus(X1,X2) != X3
| def_10(X2,X1)
| plus(X3,X2) = X1 ),
c_0_28 ).
cnf(c_0_31,plain,
( ~ gt(X1,X2)
| gt(plus(X1,n1),plus(X2,n1)) ),
inference(fof_simplification,[status(thm)],[axiom_8]) ).
cnf(c_0_32,plain,
( ~ gt(X2,X1)
| ~ def_10(X1,X2) ),
c_0_29 ).
cnf(c_0_33,plain,
( def_10(X2,X1)
| plus(minus(X1,X2),X2) = X1 ),
inference(er,[status(thm)],[c_0_30]) ).
cnf(c_0_34,plain,
( ~ gt(X2,X3)
| ~ gt(X1,X2)
| gt(X1,X3) ),
inference(fof_simplification,[status(thm)],[axiom_13]) ).
cnf(c_0_35,axiom,
gt(plus(X1,n1),n0),
axiom_2 ).
cnf(c_0_36,axiom,
plus(n0,X1) = X1,
axiom_19 ).
cnf(c_0_37,plain,
( ~ gt(plus(X1,n1),plus(X2,n1))
| gt(X1,X2) ),
inference(fof_simplification,[status(thm)],[axiom_9]) ).
cnf(c_0_38,negated_conjecture,
~ gt(level(t_139),fifo_length),
inference(fof_simplification,[status(thm)],[quest_1]) ).
cnf(c_0_39,plain,
( ~ gt(X1,X2)
| gt(plus(X1,n1),plus(X2,n1)) ),
c_0_31 ).
cnf(c_0_40,plain,
( ~ gt(X1,X2)
| plus(minus(X1,X2),X2) = X1 ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_41,plain,
( ~ gt(X1,n0)
| gt(X1,minus(X1,n1)) ),
inference(fof_simplification,[status(thm)],[axiom_3]) ).
cnf(c_0_42,plain,
( ~ gt(X2,X3)
| ~ gt(X1,X2)
| gt(X1,X3) ),
c_0_34 ).
cnf(c_0_43,plain,
gt(n1,n0),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_44,plain,
~ gt(X1,X1),
inference(fof_simplification,[status(thm)],[axiom_17]) ).
cnf(c_0_45,plain,
( ~ gt(plus(X1,n1),plus(X2,n1))
| gt(X1,X2) ),
c_0_37 ).
cnf(c_0_46,axiom,
( X1 = plus(y_27(X1),n1)
| X1 = n0 ),
axiom_16 ).
cnf(c_0_47,negated_conjecture,
~ gt(level(t_139),fifo_length),
c_0_38 ).
cnf(c_0_48,axiom,
( gt(X2,X1)
| X2 = X1
| gt(X1,X2) ),
axiom_12 ).
cnf(c_0_49,plain,
( plus(X1,n1) != plus(X2,n1)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[axiom_18]) ).
cnf(c_0_50,plain,
plus(X1,n1) != n0,
inference(fof_simplification,[status(thm)],[axiom_1]) ).
cnf(c_0_51,plain,
( ~ gt(X2,n1)
| ~ gt(X1,minus(X2,n1))
| gt(plus(X1,n1),X2) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_52,plain,
( ~ gt(X1,n0)
| gt(X1,minus(X1,n1)) ),
c_0_41 ).
cnf(c_0_53,plain,
( ~ gt(X1,n1)
| gt(X1,n0) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_54,plain,
( ~ gt(plus(X1,n1),X2)
| X2 = X1
| gt(X1,X2) ),
inference(fof_simplification,[status(thm)],[axiom_10]) ).
cnf(c_0_55,plain,
~ gt(X1,X1),
c_0_44 ).
cnf(c_0_56,plain,
( ~ gt(plus(X2,n1),X1)
| gt(X2,y_27(X1))
| X1 = n0 ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_57,negated_conjecture,
( gt(fifo_length,level(t_139))
| level(t_139) = fifo_length ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_58,plain,
( plus(X1,n1) != plus(X2,n1)
| X1 = X2 ),
c_0_49 ).
cnf(c_0_59,plain,
plus(X1,n1) != n0,
c_0_50 ).
cnf(c_0_60,plain,
( ~ p_Full(X1)
| int_level(X1) = fifo_length ),
inference(fof_simplification,[status(thm)],[axiom_23]) ).
cnf(c_0_61,plain,
( ~ gt(X1,n1)
| gt(plus(X1,n1),X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]) ).
cnf(c_0_62,plain,
( ~ gt(plus(X1,n1),X2)
| X2 = X1
| gt(X1,X2) ),
c_0_54 ).
cnf(c_0_63,plain,
( ~ gt(plus(y_27(X1),n1),X1)
| X1 = n0 ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_64,negated_conjecture,
( ~ gt(X1,fifo_length)
| gt(X1,level(t_139))
| level(t_139) = fifo_length ),
inference(spm,[status(thm)],[c_0_42,c_0_57]) ).
cnf(c_0_65,plain,
y_27(plus(X1,n1)) = X1,
inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_46])]),c_0_59]) ).
cnf(c_0_66,plain,
( ~ gt(int_level(X1),n0)
| ~ p_Rd(X1)
| int_level(plus(X1,n1)) = minus(int_level(X1),n1)
| p_Wr(X1)
| p_Reset(X1) ),
inference(fof_simplification,[status(thm)],[axiom_71]) ).
cnf(c_0_67,plain,
( ~ p_Full(X1)
| int_level(X1) = fifo_length ),
c_0_60 ).
cnf(c_0_68,axiom,
level(X1) = int_level(X1),
axiom_21 ).
cnf(c_0_69,plain,
( ~ gt(plus(X1,n1),n1)
| gt(plus(X1,n1),X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_61]) ).
cnf(c_0_70,plain,
( ~ gt(X1,n0)
| gt(plus(X1,n1),n1) ),
inference(spm,[status(thm)],[c_0_39,c_0_36]) ).
cnf(c_0_71,plain,
( ~ gt(X1,plus(X2,n1))
| gt(X1,n0) ),
inference(spm,[status(thm)],[c_0_42,c_0_35]) ).
cnf(c_0_72,plain,
( ~ gt(n1,X1)
| gt(n0,X1)
| n0 = X1 ),
inference(spm,[status(thm)],[c_0_62,c_0_36]) ).
cnf(c_0_73,negated_conjecture,
( ~ gt(plus(y_27(level(t_139)),n1),fifo_length)
| level(t_139) = n0
| level(t_139) = fifo_length ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_74,plain,
( ~ gt(X1,n1)
| y_27(X1) = minus(X1,n1) ),
inference(spm,[status(thm)],[c_0_65,c_0_40]) ).
cnf(c_0_75,plain,
( ~ gt(int_level(X1),n0)
| ~ p_Rd(X1)
| int_level(plus(X1,n1)) = minus(int_level(X1),n1)
| p_Wr(X1)
| p_Reset(X1) ),
c_0_66 ).
cnf(c_0_76,plain,
( ~ p_Full(X1)
| level(X1) = fifo_length ),
inference(rw,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_77,negated_conjecture,
p_Full(plus(t_139,n1)),
quest_5 ).
cnf(c_0_78,plain,
( ~ gt(X1,n0)
| gt(plus(X1,n1),X1) ),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_79,negated_conjecture,
~ p_Wr(t_139),
inference(fof_simplification,[status(thm)],[quest_3]) ).
cnf(c_0_80,negated_conjecture,
~ p_Reset(t_139),
inference(fof_simplification,[status(thm)],[quest_4]) ).
cnf(c_0_81,plain,
~ gt(n1,plus(X1,n1)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_55]),c_0_59]) ).
cnf(c_0_82,negated_conjecture,
( ~ gt(level(t_139),n1)
| ~ gt(plus(minus(level(t_139),n1),n1),fifo_length)
| level(t_139) = fifo_length
| level(t_139) = n0 ),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_83,plain,
( ~ gt(level(X1),n0)
| ~ p_Rd(X1)
| p_Wr(X1)
| p_Reset(X1)
| level(plus(X1,n1)) = minus(level(X1),n1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_68]),c_0_68]),c_0_68]) ).
cnf(c_0_84,negated_conjecture,
level(plus(t_139,n1)) = fifo_length,
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_85,plain,
gt(plus(X1,n1),X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_78]),c_0_35])]) ).
cnf(c_0_86,negated_conjecture,
p_Rd(t_139),
quest_2 ).
cnf(c_0_87,negated_conjecture,
~ p_Wr(t_139),
c_0_79 ).
cnf(c_0_88,negated_conjecture,
~ p_Reset(t_139),
c_0_80 ).
cnf(c_0_89,axiom,
( gt(X1,n0)
| X1 = n0 ),
axiom_15 ).
cnf(c_0_90,plain,
( ~ gt(n1,X1)
| X1 = n0 ),
inference(spm,[status(thm)],[c_0_81,c_0_46]) ).
cnf(c_0_91,plain,
( ~ p_Rd(X1)
| int_level(plus(X1,n1)) = int_level(X1)
| gt(int_level(X1),n0)
| p_Wr(X1)
| p_Reset(X1) ),
inference(fof_simplification,[status(thm)],[axiom_78]) ).
cnf(c_0_92,negated_conjecture,
( ~ gt(level(t_139),n1)
| level(t_139) = n0
| level(t_139) = fifo_length ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_84]),c_0_85]),c_0_86])]),c_0_87]),c_0_88]),c_0_89]) ).
cnf(c_0_93,plain,
( gt(X1,n1)
| X1 = n0
| X1 = n1 ),
inference(spm,[status(thm)],[c_0_90,c_0_48]) ).
cnf(c_0_94,plain,
( ~ p_Rd(X1)
| int_level(plus(X1,n1)) = int_level(X1)
| gt(int_level(X1),n0)
| p_Wr(X1)
| p_Reset(X1) ),
c_0_91 ).
cnf(c_0_95,axiom,
( int_level(plus(X1,n1)) = int_level(X1)
| p_Rd(X1)
| p_Wr(X1)
| p_Reset(X1) ),
axiom_82 ).
cnf(c_0_96,negated_conjecture,
( level(t_139) = fifo_length
| level(t_139) = n0
| level(t_139) = n1 ),
inference(spm,[status(thm)],[c_0_92,c_0_93]) ).
cnf(c_0_97,negated_conjecture,
gt(fifo_length,n0),
quest_6 ).
cnf(c_0_98,plain,
( plus(X3,X2) != X1
| def_10(X2,X1)
| minus(X1,X2) = X3 ),
inference(fof_simplification,[status(thm)],[axiom_5]) ).
cnf(c_0_99,plain,
( X2 != X1
| ~ def_10(X1,X2) ),
inference(fof_simplification,[status(thm)],[axiom_7]) ).
cnf(c_0_100,plain,
( ~ gt(X1,n0)
| gt(X1,n1)
| X1 = n1 ),
inference(spm,[status(thm)],[c_0_62,c_0_70]) ).
cnf(c_0_101,plain,
( ~ p_Rd(X1)
| gt(level(X1),n0)
| p_Wr(X1)
| p_Reset(X1)
| level(plus(X1,n1)) = level(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_94,c_0_68]),c_0_68]),c_0_68]) ).
cnf(c_0_102,plain,
( p_Rd(X1)
| p_Wr(X1)
| p_Reset(X1)
| level(plus(X1,n1)) = level(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_95,c_0_68]),c_0_68]) ).
cnf(c_0_103,negated_conjecture,
( level(t_139) = n1
| level(t_139) = n0
| minus(fifo_length,n1) = fifo_length ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_96]),c_0_84]),c_0_86]),c_0_97])]),c_0_87]),c_0_88]) ).
cnf(c_0_104,plain,
( plus(X3,X2) != X1
| def_10(X2,X1)
| minus(X1,X2) = X3 ),
c_0_98 ).
cnf(c_0_105,plain,
( X2 != X1
| ~ def_10(X1,X2) ),
c_0_99 ).
cnf(c_0_106,negated_conjecture,
( gt(fifo_length,n1)
| fifo_length = n1 ),
inference(spm,[status(thm)],[c_0_100,c_0_97]) ).
cnf(c_0_107,plain,
( gt(level(X1),n0)
| p_Reset(X1)
| p_Wr(X1)
| level(plus(X1,n1)) = level(X1) ),
inference(csr,[status(thm)],[c_0_101,c_0_102]) ).
cnf(c_0_108,negated_conjecture,
( level(t_139) = n0
| level(t_139) = n1 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_103]),c_0_97])]),c_0_55]) ).
cnf(c_0_109,plain,
( def_10(X2,plus(X1,X2))
| minus(plus(X1,X2),X2) = X1 ),
inference(er,[status(thm)],[c_0_104]) ).
cnf(c_0_110,plain,
~ def_10(X1,X1),
inference(er,[status(thm)],[c_0_105]) ).
cnf(c_0_111,negated_conjecture,
( ~ gt(X1,fifo_length)
| gt(X1,n1)
| fifo_length = n1 ),
inference(spm,[status(thm)],[c_0_42,c_0_106]) ).
cnf(c_0_112,negated_conjecture,
( fifo_length = n0
| level(t_139) = n1 ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_84]),c_0_87]),c_0_88]),c_0_55]) ).
cnf(c_0_113,plain,
minus(X1,X1) = n0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_36]),c_0_110]) ).
cnf(c_0_114,negated_conjecture,
( gt(plus(fifo_length,n1),n1)
| fifo_length = n1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_61]),c_0_106]) ).
cnf(c_0_115,negated_conjecture,
fifo_length = n0,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_112]),c_0_113]),c_0_84]),c_0_86]),c_0_43])]),c_0_87]),c_0_88]) ).
cnf(c_0_116,plain,
n0 != n1,
inference(spm,[status(thm)],[c_0_59,c_0_36]) ).
cnf(c_0_117,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_114,c_0_115]),c_0_115]),c_0_36]),c_0_116]),c_0_55]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HWV017-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n013.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 20 20:47:51 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/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.73/0.51 % Version: 3.5.1
% 0.73/0.51 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.73/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.73/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.73/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.73/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.73/0.51 % Starting sh5l with 300s (1) cores
% 0.73/0.51 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3387419 completed with status 0
% 0.73/0.51 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.73/0.51 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.73/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.73/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.73/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.73/0.51 % No SInE strategy applied
% 0.73/0.51 % Search class: FGHSS-FFMS21-SFFFFFNN
% 0.73/0.51 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.73/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.73/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.73/0.51 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.73/0.51 % Starting new_bool_3 with 136s (1) cores
% 0.73/0.51 % Starting new_bool_1 with 136s (1) cores
% 0.73/0.51 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 3387428 completed with status 0
% 0.73/0.51 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.73/0.51 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.73/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.73/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.73/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.73/0.51 % No SInE strategy applied
% 0.73/0.51 % Search class: FGHSS-FFMS21-SFFFFFNN
% 0.73/0.51 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.73/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.73/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.73/0.51 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.73/0.51 % Preprocessing time : 0.002 s
% 0.73/0.51 % Presaturation interreduction done
% 0.73/0.51
% 0.73/0.51 % Proof found!
% 0.73/0.51 % SZS status Unsatisfiable
% 0.73/0.51 % SZS output start CNFRefutation
% See solution above
% 0.73/0.52 % Parsed axioms : 96
% 0.73/0.52 % Removed by relevancy pruning/SinE : 0
% 0.73/0.52 % Initial clauses : 96
% 0.73/0.52 % Removed in clause preprocessing : 1
% 0.73/0.52 % Initial clauses in saturation : 95
% 0.73/0.52 % Processed clauses : 654
% 0.73/0.52 % ...of these trivial : 1
% 0.73/0.52 % ...subsumed : 275
% 0.73/0.52 % ...remaining for further processing : 378
% 0.73/0.52 % Other redundant clauses eliminated : 10
% 0.73/0.52 % Clauses deleted for lack of memory : 0
% 0.73/0.52 % Backward-subsumed : 48
% 0.73/0.52 % Backward-rewritten : 70
% 0.73/0.52 % Generated clauses : 1808
% 0.73/0.52 % ...of the previous two non-redundant : 1334
% 0.73/0.52 % ...aggressively subsumed : 0
% 0.73/0.52 % Contextual simplify-reflections : 77
% 0.73/0.52 % Paramodulations : 1785
% 0.73/0.52 % Factorizations : 12
% 0.73/0.52 % NegExts : 0
% 0.73/0.52 % Equation resolutions : 11
% 0.73/0.52 % Disequality decompositions : 0
% 0.73/0.52 % Total rewrite steps : 716
% 0.73/0.52 % ...of those cached : 690
% 0.73/0.52 % Propositional unsat checks : 0
% 0.73/0.52 % Propositional check models : 0
% 0.73/0.52 % Propositional check unsatisfiable : 0
% 0.73/0.52 % Propositional clauses : 0
% 0.73/0.52 % Propositional clauses after purity: 0
% 0.73/0.52 % Propositional unsat core size : 0
% 0.73/0.52 % Propositional preprocessing time : 0.000
% 0.73/0.52 % Propositional encoding time : 0.000
% 0.73/0.52 % Propositional solver time : 0.000
% 0.73/0.52 % Success case prop preproc time : 0.000
% 0.73/0.52 % Success case prop encoding time : 0.000
% 0.73/0.52 % Success case prop solver time : 0.000
% 0.73/0.52 % Current number of processed clauses : 180
% 0.73/0.52 % Positive orientable unit clauses : 11
% 0.73/0.52 % Positive unorientable unit clauses: 0
% 0.73/0.52 % Negative unit clauses : 11
% 0.73/0.52 % Non-unit-clauses : 158
% 0.73/0.52 % Current number of unprocessed clauses: 769
% 0.73/0.52 % ...number of literals in the above : 3874
% 0.73/0.52 % Current number of archived formulas : 0
% 0.73/0.52 % Current number of archived clauses : 196
% 0.73/0.52 % Clause-clause subsumption calls (NU) : 11716
% 0.73/0.52 % Rec. Clause-clause subsumption calls : 2041
% 0.73/0.52 % Non-unit clause-clause subsumptions : 275
% 0.73/0.52 % Unit Clause-clause subsumption calls : 346
% 0.73/0.52 % Rewrite failures with RHS unbound : 0
% 0.73/0.52 % BW rewrite match attempts : 17
% 0.73/0.52 % BW rewrite match successes : 6
% 0.73/0.52 % Condensation attempts : 0
% 0.73/0.52 % Condensation successes : 0
% 0.73/0.52 % Termbank termtop insertions : 34293
% 0.73/0.52 % Search garbage collected termcells : 192
% 0.73/0.52
% 0.73/0.52 % -------------------------------------------------
% 0.73/0.52 % User time : 0.064 s
% 0.73/0.52 % System time : 0.007 s
% 0.73/0.52 % Total time : 0.071 s
% 0.73/0.52 % Maximum resident set size: 3704 pages
% 0.73/0.52
% 0.73/0.52 % -------------------------------------------------
% 0.73/0.52 % User time : 0.324 s
% 0.73/0.52 % System time : 0.027 s
% 0.73/0.52 % Total time : 0.350 s
% 0.73/0.52 % Maximum resident set size: 4864 pages
% 0.73/0.52 % E exiting
%------------------------------------------------------------------------------