TSTP Solution File: HWV033-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : HWV033-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:51:19 EDT 2023
% Result : Unsatisfiable 0.66s 0.58s
% Output : CNFRefutation 0.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 30
% Syntax : Number of clauses : 122 ( 28 unt; 75 nHn; 101 RR)
% Number of literals : 329 ( 117 equ; 106 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 118 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_60,axiom,
( p_Reset(X1)
| gt(int_level(X1),n0)
| rd_level(plus(X1,n1)) = rd_level(X1)
| ~ p_Wr(X1)
| ~ p_Rd(X1) ),
file('/export/starexec/sandbox/tmp/tmp.lQldlodjHu/E---3.1_9444.p',axiom_60) ).
cnf(axiom_21,axiom,
level(X1) = int_level(X1),
file('/export/starexec/sandbox/tmp/tmp.lQldlodjHu/E---3.1_9444.p',axiom_21) ).
cnf(axiom_81,axiom,
( p_Reset(X1)
| p_Wr(X1)
| p_Rd(X1)
| rd_level(plus(X1,n1)) = rd_level(X1) ),
file('/export/starexec/sandbox/tmp/tmp.lQldlodjHu/E---3.1_9444.p',axiom_81) ).
cnf(axiom_33,axiom,
( p_Reset(X1)
| p_Rd(X1)
| rd_level(plus(X1,n1)) = rd_level(X1)
| ~ p_Wr(X1) ),
file('/export/starexec/sandbox/tmp/tmp.lQldlodjHu/E---3.1_9444.p',axiom_33) ).
cnf(axiom_77,axiom,
( p_Reset(X1)
| p_Wr(X1)
| gt(int_level(X1),n0)
| rd_level(plus(X1,n1)) = rd_level(X1)
| ~ p_Rd(X1) ),
file('/export/starexec/sandbox/tmp/tmp.lQldlodjHu/E---3.1_9444.p',axiom_77) ).
cnf(axiom_13,axiom,
( gt(X1,X3)
| ~ gt(X1,X2)
| ~ gt(X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.lQldlodjHu/E---3.1_9444.p',axiom_13) ).
cnf(axiom_15,axiom,
( X1 = n0
| gt(X1,n0) ),
file('/export/starexec/sandbox/tmp/tmp.lQldlodjHu/E---3.1_9444.p',axiom_15) ).
cnf(axiom_14,axiom,
( plus(X2,n1) = X1
| gt(X1,plus(X2,n1))
| ~ gt(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.lQldlodjHu/E---3.1_9444.p',axiom_14) ).
cnf(quest_2,negated_conjecture,
gt(rd_level(plus(t_139,n1)),minus(fifo_length,n1)),
file('/export/starexec/sandbox/tmp/tmp.lQldlodjHu/E---3.1_9444.p',quest_2) ).
cnf(axiom_1,axiom,
plus(X1,n1) != n0,
file('/export/starexec/sandbox/tmp/tmp.lQldlodjHu/E---3.1_9444.p',axiom_1) ).
cnf(axiom_18,axiom,
( X1 = X2
| plus(X1,n1) != plus(X2,n1) ),
file('/export/starexec/sandbox/tmp/tmp.lQldlodjHu/E---3.1_9444.p',axiom_18) ).
cnf(axiom_16,axiom,
( X1 = n0
| X1 = plus(y_27(X1),n1) ),
file('/export/starexec/sandbox/tmp/tmp.lQldlodjHu/E---3.1_9444.p',axiom_16) ).
cnf(axiom_4,axiom,
( plus(X3,X2) = X1
| def_10(X2,X1)
| minus(X1,X2) != X3 ),
file('/export/starexec/sandbox/tmp/tmp.lQldlodjHu/E---3.1_9444.p',axiom_4) ).
cnf(axiom_74,axiom,
( p_Reset(X1)
| p_Wr(X1)
| rd_level(plus(X1,n1)) = plus(rd_level(X1),n1)
| ~ p_Rd(X1)
| ~ gt(int_level(X1),n0)
| ~ gt(minus(fifo_length,n1),rd_level(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.lQldlodjHu/E---3.1_9444.p',axiom_74) ).
cnf(axiom_56,axiom,
( p_Reset(X1)
| rd_level(plus(X1,n1)) = plus(rd_level(X1),n1)
| ~ p_Wr(X1)
| ~ p_Rd(X1)
| ~ gt(int_level(X1),n0)
| ~ gt(minus(fifo_length,n1),rd_level(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.lQldlodjHu/E---3.1_9444.p',axiom_56) ).
cnf(quest_1,negated_conjecture,
~ gt(rd_level(t_139),minus(fifo_length,n1)),
file('/export/starexec/sandbox/tmp/tmp.lQldlodjHu/E---3.1_9444.p',quest_1) ).
cnf(axiom_28,axiom,
( rd_level(plus(X1,n1)) = n0
| ~ p_Reset(X1) ),
file('/export/starexec/sandbox/tmp/tmp.lQldlodjHu/E---3.1_9444.p',axiom_28) ).
cnf(axiom_17,axiom,
~ gt(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.lQldlodjHu/E---3.1_9444.p',axiom_17) ).
cnf(axiom_9,axiom,
( gt(X1,X2)
| ~ gt(plus(X1,n1),plus(X2,n1)) ),
file('/export/starexec/sandbox/tmp/tmp.lQldlodjHu/E---3.1_9444.p',axiom_9) ).
cnf(axiom_19,axiom,
plus(n0,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.lQldlodjHu/E---3.1_9444.p',axiom_19) ).
cnf(axiom_6,axiom,
( ~ def_10(X1,X2)
| ~ gt(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.lQldlodjHu/E---3.1_9444.p',axiom_6) ).
cnf(quest_3,negated_conjecture,
gt(fifo_length,n0),
file('/export/starexec/sandbox/tmp/tmp.lQldlodjHu/E---3.1_9444.p',quest_3) ).
cnf(axiom_8,axiom,
( gt(plus(X1,n1),plus(X2,n1))
| ~ gt(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.lQldlodjHu/E---3.1_9444.p',axiom_8) ).
cnf(axiom_12,axiom,
( gt(X1,X2)
| X2 = X1
| gt(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.lQldlodjHu/E---3.1_9444.p',axiom_12) ).
cnf(axiom_57,axiom,
( p_Reset(X1)
| gt(minus(fifo_length,n1),rd_level(X1))
| rd_level(plus(X1,n1)) = n0
| ~ p_Wr(X1)
| ~ p_Rd(X1)
| ~ gt(int_level(X1),n0) ),
file('/export/starexec/sandbox/tmp/tmp.lQldlodjHu/E---3.1_9444.p',axiom_57) ).
cnf(axiom_10,axiom,
( gt(X1,X2)
| X2 = X1
| ~ gt(plus(X1,n1),X2) ),
file('/export/starexec/sandbox/tmp/tmp.lQldlodjHu/E---3.1_9444.p',axiom_10) ).
cnf(axiom_3,axiom,
( gt(X1,minus(X1,n1))
| ~ gt(X1,n0) ),
file('/export/starexec/sandbox/tmp/tmp.lQldlodjHu/E---3.1_9444.p',axiom_3) ).
cnf(axiom_75,axiom,
( p_Reset(X1)
| p_Wr(X1)
| gt(minus(fifo_length,n1),rd_level(X1))
| rd_level(plus(X1,n1)) = n0
| ~ p_Rd(X1)
| ~ gt(int_level(X1),n0) ),
file('/export/starexec/sandbox/tmp/tmp.lQldlodjHu/E---3.1_9444.p',axiom_75) ).
cnf(axiom_5,axiom,
( minus(X1,X2) = X3
| def_10(X2,X1)
| plus(X3,X2) != X1 ),
file('/export/starexec/sandbox/tmp/tmp.lQldlodjHu/E---3.1_9444.p',axiom_5) ).
cnf(axiom_7,axiom,
( ~ def_10(X1,X2)
| X2 != X1 ),
file('/export/starexec/sandbox/tmp/tmp.lQldlodjHu/E---3.1_9444.p',axiom_7) ).
cnf(c_0_30,axiom,
( p_Reset(X1)
| gt(int_level(X1),n0)
| rd_level(plus(X1,n1)) = rd_level(X1)
| ~ p_Wr(X1)
| ~ p_Rd(X1) ),
axiom_60 ).
cnf(c_0_31,axiom,
level(X1) = int_level(X1),
axiom_21 ).
cnf(c_0_32,axiom,
( p_Reset(X1)
| p_Wr(X1)
| p_Rd(X1)
| rd_level(plus(X1,n1)) = rd_level(X1) ),
axiom_81 ).
cnf(c_0_33,axiom,
( p_Reset(X1)
| p_Rd(X1)
| rd_level(plus(X1,n1)) = rd_level(X1)
| ~ p_Wr(X1) ),
axiom_33 ).
cnf(c_0_34,axiom,
( p_Reset(X1)
| p_Wr(X1)
| gt(int_level(X1),n0)
| rd_level(plus(X1,n1)) = rd_level(X1)
| ~ p_Rd(X1) ),
axiom_77 ).
cnf(c_0_35,plain,
( rd_level(plus(X1,n1)) = rd_level(X1)
| p_Reset(X1)
| gt(level(X1),n0)
| ~ p_Wr(X1)
| ~ p_Rd(X1) ),
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,plain,
( rd_level(plus(X1,n1)) = rd_level(X1)
| p_Rd(X1)
| p_Reset(X1) ),
inference(csr,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,axiom,
( gt(X1,X3)
| ~ gt(X1,X2)
| ~ gt(X2,X3) ),
axiom_13 ).
cnf(c_0_38,axiom,
( X1 = n0
| gt(X1,n0) ),
axiom_15 ).
cnf(c_0_39,axiom,
( plus(X2,n1) = X1
| gt(X1,plus(X2,n1))
| ~ gt(X1,X2) ),
axiom_14 ).
cnf(c_0_40,negated_conjecture,
gt(rd_level(plus(t_139,n1)),minus(fifo_length,n1)),
quest_2 ).
cnf(c_0_41,plain,
( rd_level(plus(X1,n1)) = rd_level(X1)
| p_Reset(X1)
| p_Wr(X1)
| gt(level(X1),n0)
| ~ p_Rd(X1) ),
inference(rw,[status(thm)],[c_0_34,c_0_31]) ).
cnf(c_0_42,plain,
( rd_level(plus(X1,n1)) = rd_level(X1)
| p_Reset(X1)
| gt(level(X1),n0)
| ~ p_Wr(X1) ),
inference(csr,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_43,plain,
( X1 = n0
| gt(X2,n0)
| ~ gt(X2,X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,negated_conjecture,
( plus(minus(fifo_length,n1),n1) = rd_level(plus(t_139,n1))
| gt(rd_level(plus(t_139,n1)),plus(minus(fifo_length,n1),n1)) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,axiom,
plus(X1,n1) != n0,
axiom_1 ).
cnf(c_0_46,axiom,
( X1 = X2
| plus(X1,n1) != plus(X2,n1) ),
axiom_18 ).
cnf(c_0_47,axiom,
( X1 = n0
| X1 = plus(y_27(X1),n1) ),
axiom_16 ).
cnf(c_0_48,axiom,
( plus(X3,X2) = X1
| def_10(X2,X1)
| minus(X1,X2) != X3 ),
axiom_4 ).
cnf(c_0_49,axiom,
( p_Reset(X1)
| p_Wr(X1)
| rd_level(plus(X1,n1)) = plus(rd_level(X1),n1)
| ~ p_Rd(X1)
| ~ gt(int_level(X1),n0)
| ~ gt(minus(fifo_length,n1),rd_level(X1)) ),
axiom_74 ).
cnf(c_0_50,axiom,
( p_Reset(X1)
| rd_level(plus(X1,n1)) = plus(rd_level(X1),n1)
| ~ p_Wr(X1)
| ~ p_Rd(X1)
| ~ gt(int_level(X1),n0)
| ~ gt(minus(fifo_length,n1),rd_level(X1)) ),
axiom_56 ).
cnf(c_0_51,plain,
( rd_level(plus(X1,n1)) = rd_level(X1)
| p_Reset(X1)
| gt(level(X1),n0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_41,c_0_36]),c_0_42]) ).
cnf(c_0_52,negated_conjecture,
~ gt(rd_level(t_139),minus(fifo_length,n1)),
quest_1 ).
cnf(c_0_53,negated_conjecture,
( plus(minus(fifo_length,n1),n1) = rd_level(plus(t_139,n1))
| gt(rd_level(plus(t_139,n1)),n0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]) ).
cnf(c_0_54,axiom,
( rd_level(plus(X1,n1)) = n0
| ~ p_Reset(X1) ),
axiom_28 ).
cnf(c_0_55,axiom,
~ gt(X1,X1),
axiom_17 ).
cnf(c_0_56,axiom,
( gt(X1,X2)
| ~ gt(plus(X1,n1),plus(X2,n1)) ),
axiom_9 ).
cnf(c_0_57,axiom,
plus(n0,X1) = X1,
axiom_19 ).
cnf(c_0_58,plain,
y_27(plus(X1,n1)) = X1,
inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47])]),c_0_45]) ).
cnf(c_0_59,axiom,
( ~ def_10(X1,X2)
| ~ gt(X2,X1) ),
axiom_6 ).
cnf(c_0_60,plain,
( plus(minus(X1,X2),X2) = X1
| def_10(X2,X1) ),
inference(er,[status(thm)],[c_0_48]) ).
cnf(c_0_61,negated_conjecture,
gt(fifo_length,n0),
quest_3 ).
cnf(c_0_62,plain,
( rd_level(plus(X1,n1)) = plus(rd_level(X1),n1)
| p_Reset(X1)
| p_Wr(X1)
| ~ p_Rd(X1)
| ~ gt(level(X1),n0)
| ~ gt(minus(fifo_length,n1),rd_level(X1)) ),
inference(rw,[status(thm)],[c_0_49,c_0_31]) ).
cnf(c_0_63,plain,
( rd_level(plus(X1,n1)) = plus(rd_level(X1),n1)
| p_Reset(X1)
| ~ p_Wr(X1)
| ~ p_Rd(X1)
| ~ gt(level(X1),n0)
| ~ gt(minus(fifo_length,n1),rd_level(X1)) ),
inference(rw,[status(thm)],[c_0_50,c_0_31]) ).
cnf(c_0_64,negated_conjecture,
( p_Reset(t_139)
| gt(level(t_139),n0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_51]),c_0_52]) ).
cnf(c_0_65,negated_conjecture,
~ p_Reset(t_139),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_45]),c_0_55]) ).
cnf(c_0_66,negated_conjecture,
( p_Rd(t_139)
| p_Reset(t_139) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_36]),c_0_52]) ).
cnf(c_0_67,plain,
( X1 = n0
| gt(X2,y_27(X1))
| ~ gt(plus(X2,n1),X1) ),
inference(spm,[status(thm)],[c_0_56,c_0_47]) ).
cnf(c_0_68,plain,
( X1 = n0
| n1 = X1
| gt(X1,n1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_38]),c_0_57]),c_0_57]) ).
cnf(c_0_69,plain,
y_27(n1) = n0,
inference(spm,[status(thm)],[c_0_58,c_0_57]) ).
cnf(c_0_70,plain,
n0 != n1,
inference(spm,[status(thm)],[c_0_45,c_0_57]) ).
cnf(c_0_71,axiom,
( gt(plus(X1,n1),plus(X2,n1))
| ~ gt(X1,X2) ),
axiom_8 ).
cnf(c_0_72,plain,
( plus(minus(X1,X2),X2) = X1
| ~ gt(X1,X2) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_73,negated_conjecture,
( fifo_length = n1
| gt(fifo_length,n1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_61]),c_0_57]),c_0_57]) ).
cnf(c_0_74,plain,
( rd_level(plus(X1,n1)) = plus(rd_level(X1),n1)
| p_Reset(X1)
| ~ p_Rd(X1)
| ~ gt(minus(fifo_length,n1),rd_level(X1))
| ~ gt(level(X1),n0) ),
inference(csr,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_75,negated_conjecture,
gt(level(t_139),n0),
inference(sr,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_76,negated_conjecture,
p_Rd(t_139),
inference(sr,[status(thm)],[c_0_66,c_0_65]) ).
cnf(c_0_77,plain,
( plus(X1,n1) = n1
| gt(X1,n0) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69]),c_0_70]),c_0_45]) ).
cnf(c_0_78,negated_conjecture,
gt(plus(rd_level(plus(t_139,n1)),n1),plus(minus(fifo_length,n1),n1)),
inference(spm,[status(thm)],[c_0_71,c_0_40]) ).
cnf(c_0_79,negated_conjecture,
( plus(minus(fifo_length,n1),n1) = fifo_length
| fifo_length = n1 ),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_80,negated_conjecture,
( rd_level(plus(t_139,n1)) = plus(rd_level(t_139),n1)
| ~ gt(minus(fifo_length,n1),rd_level(t_139)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_76])]),c_0_65]) ).
cnf(c_0_81,axiom,
( gt(X1,X2)
| X2 = X1
| gt(X2,X1) ),
axiom_12 ).
cnf(c_0_82,plain,
( plus(X1,n1) = n1
| gt(plus(X1,n1),n1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_77]),c_0_57]) ).
cnf(c_0_83,axiom,
( p_Reset(X1)
| gt(minus(fifo_length,n1),rd_level(X1))
| rd_level(plus(X1,n1)) = n0
| ~ p_Wr(X1)
| ~ p_Rd(X1)
| ~ gt(int_level(X1),n0) ),
axiom_57 ).
cnf(c_0_84,axiom,
( gt(X1,X2)
| X2 = X1
| ~ gt(plus(X1,n1),X2) ),
axiom_10 ).
cnf(c_0_85,negated_conjecture,
( fifo_length = n1
| gt(plus(rd_level(plus(t_139,n1)),n1),fifo_length) ),
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_86,negated_conjecture,
( rd_level(plus(t_139,n1)) = plus(rd_level(t_139),n1)
| minus(fifo_length,n1) = rd_level(t_139) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_52]) ).
cnf(c_0_87,plain,
( plus(X1,n1) = n1
| gt(X2,n1)
| ~ gt(X2,plus(X1,n1)) ),
inference(spm,[status(thm)],[c_0_37,c_0_82]) ).
cnf(c_0_88,axiom,
( gt(X1,minus(X1,n1))
| ~ gt(X1,n0) ),
axiom_3 ).
cnf(c_0_89,axiom,
( p_Reset(X1)
| p_Wr(X1)
| gt(minus(fifo_length,n1),rd_level(X1))
| rd_level(plus(X1,n1)) = n0
| ~ p_Rd(X1)
| ~ gt(int_level(X1),n0) ),
axiom_75 ).
cnf(c_0_90,plain,
( rd_level(plus(X1,n1)) = n0
| p_Reset(X1)
| gt(minus(fifo_length,n1),rd_level(X1))
| ~ p_Wr(X1)
| ~ p_Rd(X1)
| ~ gt(level(X1),n0) ),
inference(rw,[status(thm)],[c_0_83,c_0_31]) ).
cnf(c_0_91,negated_conjecture,
( rd_level(plus(t_139,n1)) = fifo_length
| fifo_length = n1
| gt(rd_level(plus(t_139,n1)),fifo_length) ),
inference(spm,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_92,negated_conjecture,
( rd_level(plus(t_139,n1)) = plus(rd_level(t_139),n1)
| plus(rd_level(t_139),n1) = fifo_length
| fifo_length = n1 ),
inference(spm,[status(thm)],[c_0_79,c_0_86]) ).
cnf(c_0_93,plain,
( X1 = n0
| X1 = n1
| gt(X2,n1)
| ~ gt(X2,X1) ),
inference(spm,[status(thm)],[c_0_87,c_0_47]) ).
cnf(c_0_94,negated_conjecture,
gt(fifo_length,minus(fifo_length,n1)),
inference(spm,[status(thm)],[c_0_88,c_0_61]) ).
cnf(c_0_95,plain,
( gt(X1,n0)
| ~ gt(plus(X1,n1),n1) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_96,plain,
( rd_level(plus(X1,n1)) = n0
| p_Reset(X1)
| p_Wr(X1)
| gt(minus(fifo_length,n1),rd_level(X1))
| ~ p_Rd(X1)
| ~ gt(level(X1),n0) ),
inference(rw,[status(thm)],[c_0_89,c_0_31]) ).
cnf(c_0_97,plain,
( rd_level(plus(X1,n1)) = n0
| gt(minus(fifo_length,n1),rd_level(X1))
| ~ p_Rd(X1)
| ~ p_Wr(X1)
| ~ gt(level(X1),n0) ),
inference(csr,[status(thm)],[c_0_90,c_0_54]) ).
cnf(c_0_98,negated_conjecture,
( fifo_length = n1
| gt(X1,minus(fifo_length,n1))
| ~ gt(plus(X1,n1),fifo_length) ),
inference(spm,[status(thm)],[c_0_56,c_0_79]) ).
cnf(c_0_99,negated_conjecture,
( plus(rd_level(t_139),n1) = fifo_length
| fifo_length = n1
| gt(plus(rd_level(t_139),n1),fifo_length) ),
inference(spm,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_100,negated_conjecture,
( minus(fifo_length,n1) = n1
| minus(fifo_length,n1) = n0
| gt(fifo_length,n1) ),
inference(spm,[status(thm)],[c_0_93,c_0_94]) ).
cnf(c_0_101,negated_conjecture,
( fifo_length = n1
| gt(minus(fifo_length,n1),n0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_79]),c_0_73]) ).
cnf(c_0_102,plain,
( rd_level(plus(X1,n1)) = n0
| gt(minus(fifo_length,n1),rd_level(X1))
| ~ p_Rd(X1)
| ~ gt(level(X1),n0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_96,c_0_54]),c_0_97]) ).
cnf(c_0_103,negated_conjecture,
( minus(fifo_length,n1) = X1
| fifo_length = n1
| plus(X1,n1) != fifo_length ),
inference(spm,[status(thm)],[c_0_46,c_0_79]) ).
cnf(c_0_104,negated_conjecture,
( plus(rd_level(t_139),n1) = fifo_length
| fifo_length = n1 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_52]) ).
cnf(c_0_105,negated_conjecture,
( minus(fifo_length,n1) = n1
| gt(fifo_length,n1)
| ~ gt(rd_level(t_139),n0) ),
inference(spm,[status(thm)],[c_0_52,c_0_100]) ).
cnf(c_0_106,negated_conjecture,
( fifo_length = n1
| gt(X1,n0)
| ~ gt(X1,minus(fifo_length,n1)) ),
inference(spm,[status(thm)],[c_0_37,c_0_101]) ).
cnf(c_0_107,negated_conjecture,
( rd_level(plus(t_139,n1)) = n0
| gt(minus(fifo_length,n1),rd_level(t_139)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_75]),c_0_76])]) ).
cnf(c_0_108,negated_conjecture,
( minus(fifo_length,n1) = rd_level(t_139)
| fifo_length = n1 ),
inference(spm,[status(thm)],[c_0_103,c_0_104]) ).
cnf(c_0_109,axiom,
( minus(X1,X2) = X3
| def_10(X2,X1)
| plus(X3,X2) != X1 ),
axiom_5 ).
cnf(c_0_110,axiom,
( ~ def_10(X1,X2)
| X2 != X1 ),
axiom_7 ).
cnf(c_0_111,negated_conjecture,
( minus(fifo_length,n1) = n1
| rd_level(t_139) = n0
| gt(fifo_length,n1) ),
inference(spm,[status(thm)],[c_0_105,c_0_38]) ).
cnf(c_0_112,negated_conjecture,
( fifo_length = n1
| gt(rd_level(plus(t_139,n1)),n0) ),
inference(spm,[status(thm)],[c_0_106,c_0_40]) ).
cnf(c_0_113,negated_conjecture,
( rd_level(plus(t_139,n1)) = n0
| fifo_length = n1 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_55]) ).
cnf(c_0_114,plain,
( minus(plus(X1,X2),X2) = X1
| def_10(X2,plus(X1,X2)) ),
inference(er,[status(thm)],[c_0_109]) ).
cnf(c_0_115,plain,
~ def_10(X1,X1),
inference(er,[status(thm)],[c_0_110]) ).
cnf(c_0_116,negated_conjecture,
( rd_level(t_139) = n0
| gt(fifo_length,n1) ),
inference(spm,[status(thm)],[c_0_94,c_0_111]) ).
cnf(c_0_117,negated_conjecture,
fifo_length = n1,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_113]),c_0_55]) ).
cnf(c_0_118,plain,
minus(X1,X1) = n0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_57]),c_0_115]) ).
cnf(c_0_119,negated_conjecture,
rd_level(t_139) = n0,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_116,c_0_117]),c_0_55]) ).
cnf(c_0_120,negated_conjecture,
rd_level(plus(t_139,n1)) = n0,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_107,c_0_117]),c_0_118]),c_0_119]),c_0_55]) ).
cnf(c_0_121,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_117]),c_0_118]),c_0_57]),c_0_120]),c_0_120]),c_0_70]),c_0_55]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.16 % Problem : HWV033-1 : TPTP v8.1.2. Released v2.5.0.
% 0.06/0.16 % Command : run_E %s %d THM
% 0.12/0.37 % Computer : n027.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 : 8042.1875MB
% 0.12/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.37 % CPULimit : 2400
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Tue Oct 3 06:08:01 EDT 2023
% 0.12/0.37 % CPUTime :
% 0.17/0.49 Running first-order theorem proving
% 0.17/0.49 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/tmp/tmp.lQldlodjHu/E---3.1_9444.p
% 0.66/0.58 # Version: 3.1pre001
% 0.66/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.66/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.66/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.66/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.66/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.66/0.58 # Starting sh5l with 300s (1) cores
% 0.66/0.58 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 9522 completed with status 0
% 0.66/0.58 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.66/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.66/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.66/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.66/0.58 # No SInE strategy applied
% 0.66/0.58 # Search class: FGHSS-FFMS21-SFFFFFNN
% 0.66/0.58 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.66/0.58 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.66/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.66/0.58 # Starting new_bool_3 with 136s (1) cores
% 0.66/0.58 # Starting new_bool_1 with 136s (1) cores
% 0.66/0.58 # Starting sh5l with 136s (1) cores
% 0.66/0.58 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 9529 completed with status 0
% 0.66/0.58 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.66/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.66/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.66/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.66/0.58 # No SInE strategy applied
% 0.66/0.58 # Search class: FGHSS-FFMS21-SFFFFFNN
% 0.66/0.58 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.66/0.58 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.66/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.66/0.58 # Preprocessing time : 0.002 s
% 0.66/0.58 # Presaturation interreduction done
% 0.66/0.58
% 0.66/0.58 # Proof found!
% 0.66/0.58 # SZS status Unsatisfiable
% 0.66/0.58 # SZS output start CNFRefutation
% See solution above
% 0.66/0.58 # Parsed axioms : 93
% 0.66/0.58 # Removed by relevancy pruning/SinE : 0
% 0.66/0.58 # Initial clauses : 93
% 0.66/0.58 # Removed in clause preprocessing : 1
% 0.66/0.58 # Initial clauses in saturation : 92
% 0.66/0.58 # Processed clauses : 925
% 0.66/0.58 # ...of these trivial : 20
% 0.66/0.58 # ...subsumed : 386
% 0.66/0.58 # ...remaining for further processing : 519
% 0.66/0.58 # Other redundant clauses eliminated : 8
% 0.66/0.58 # Clauses deleted for lack of memory : 0
% 0.66/0.58 # Backward-subsumed : 53
% 0.66/0.58 # Backward-rewritten : 181
% 0.66/0.58 # Generated clauses : 3337
% 0.66/0.58 # ...of the previous two non-redundant : 2711
% 0.66/0.58 # ...aggressively subsumed : 0
% 0.66/0.58 # Contextual simplify-reflections : 68
% 0.66/0.58 # Paramodulations : 3320
% 0.66/0.58 # Factorizations : 4
% 0.66/0.58 # NegExts : 0
% 0.66/0.58 # Equation resolutions : 9
% 0.66/0.58 # Total rewrite steps : 1539
% 0.66/0.58 # Propositional unsat checks : 0
% 0.66/0.58 # Propositional check models : 0
% 0.66/0.58 # Propositional check unsatisfiable : 0
% 0.66/0.58 # Propositional clauses : 0
% 0.66/0.58 # Propositional clauses after purity: 0
% 0.66/0.58 # Propositional unsat core size : 0
% 0.66/0.58 # Propositional preprocessing time : 0.000
% 0.66/0.58 # Propositional encoding time : 0.000
% 0.66/0.58 # Propositional solver time : 0.000
% 0.66/0.58 # Success case prop preproc time : 0.000
% 0.66/0.58 # Success case prop encoding time : 0.000
% 0.66/0.58 # Success case prop solver time : 0.000
% 0.66/0.58 # Current number of processed clauses : 204
% 0.66/0.58 # Positive orientable unit clauses : 34
% 0.66/0.58 # Positive unorientable unit clauses: 0
% 0.66/0.58 # Negative unit clauses : 5
% 0.66/0.58 # Non-unit-clauses : 165
% 0.66/0.58 # Current number of unprocessed clauses: 1896
% 0.66/0.58 # ...number of literals in the above : 7232
% 0.66/0.58 # Current number of archived formulas : 0
% 0.66/0.58 # Current number of archived clauses : 313
% 0.66/0.58 # Clause-clause subsumption calls (NU) : 14389
% 0.66/0.58 # Rec. Clause-clause subsumption calls : 6044
% 0.66/0.58 # Non-unit clause-clause subsumptions : 457
% 0.66/0.58 # Unit Clause-clause subsumption calls : 1080
% 0.66/0.58 # Rewrite failures with RHS unbound : 0
% 0.66/0.58 # BW rewrite match attempts : 70
% 0.66/0.58 # BW rewrite match successes : 18
% 0.66/0.58 # Condensation attempts : 0
% 0.66/0.58 # Condensation successes : 0
% 0.66/0.58 # Termbank termtop insertions : 53265
% 0.66/0.58
% 0.66/0.58 # -------------------------------------------------
% 0.66/0.58 # User time : 0.076 s
% 0.66/0.58 # System time : 0.005 s
% 0.66/0.58 # Total time : 0.081 s
% 0.66/0.58 # Maximum resident set size: 1812 pages
% 0.66/0.58
% 0.66/0.58 # -------------------------------------------------
% 0.66/0.58 # User time : 0.373 s
% 0.66/0.58 # System time : 0.009 s
% 0.66/0.58 # Total time : 0.383 s
% 0.66/0.58 # Maximum resident set size: 1736 pages
% 0.66/0.58 % E---3.1 exiting
% 0.66/0.58 % E---3.1 exiting
%------------------------------------------------------------------------------