TSTP Solution File: HWV033-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : HWV033-1 : TPTP v8.2.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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 : 300s
% WCLimit : 300s
% DateTime : Mon May 20 21:37:02 EDT 2024
% Result : Unsatisfiable 0.87s 0.57s
% Output : CNFRefutation 0.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 30
% Syntax : Number of clauses : 144 ( 31 unt; 86 nHn; 123 RR)
% Number of literals : 399 ( 135 equ; 140 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 : 152 ( 3 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/benchmark/Axioms/HWV003-0.ax',axiom_60) ).
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/benchmark/Axioms/HWV003-0.ax',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/benchmark/Axioms/HWV003-0.ax',axiom_77) ).
cnf(axiom_21,axiom,
level(X1) = int_level(X1),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',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/benchmark/Axioms/HWV003-0.ax',axiom_81) ).
cnf(axiom_13,axiom,
( gt(X1,X3)
| ~ gt(X1,X2)
| ~ gt(X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_13) ).
cnf(axiom_14,axiom,
( plus(X2,n1) = X1
| gt(X1,plus(X2,n1))
| ~ gt(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_14) ).
cnf(axiom_15,axiom,
( X1 = n0
| gt(X1,n0) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_15) ).
cnf(quest_2,negated_conjecture,
gt(rd_level(plus(t_139,n1)),minus(fifo_length,n1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_2) ).
cnf(axiom_1,axiom,
plus(X1,n1) != n0,
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_1) ).
cnf(axiom_18,axiom,
( X1 = X2
| plus(X1,n1) != plus(X2,n1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_18) ).
cnf(axiom_4,axiom,
( plus(X3,X2) = X1
| def_10(X2,X1)
| minus(X1,X2) != X3 ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',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/benchmark/Axioms/HWV003-0.ax',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/benchmark/Axioms/HWV003-0.ax',axiom_56) ).
cnf(quest_1,negated_conjecture,
~ gt(rd_level(t_139),minus(fifo_length,n1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_1) ).
cnf(axiom_28,axiom,
( rd_level(plus(X1,n1)) = n0
| ~ p_Reset(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_28) ).
cnf(axiom_17,axiom,
~ gt(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_17) ).
cnf(axiom_9,axiom,
( gt(X1,X2)
| ~ gt(plus(X1,n1),plus(X2,n1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_9) ).
cnf(axiom_16,axiom,
( X1 = n0
| X1 = plus(y_27(X1),n1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_16) ).
cnf(axiom_6,axiom,
( ~ def_10(X1,X2)
| ~ gt(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_6) ).
cnf(axiom_19,axiom,
plus(n0,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_19) ).
cnf(axiom_8,axiom,
( gt(plus(X1,n1),plus(X2,n1))
| ~ gt(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_8) ).
cnf(quest_3,negated_conjecture,
gt(fifo_length,n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_3) ).
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/benchmark/Axioms/HWV003-0.ax',axiom_57) ).
cnf(axiom_10,axiom,
( gt(X1,X2)
| X2 = X1
| ~ gt(plus(X1,n1),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_10) ).
cnf(axiom_12,axiom,
( gt(X1,X2)
| X2 = X1
| gt(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_12) ).
cnf(axiom_3,axiom,
( gt(X1,minus(X1,n1))
| ~ gt(X1,n0) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',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/benchmark/Axioms/HWV003-0.ax',axiom_75) ).
cnf(axiom_5,axiom,
( minus(X1,X2) = X3
| def_10(X2,X1)
| plus(X3,X2) != X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_5) ).
cnf(axiom_7,axiom,
( ~ def_10(X1,X2)
| X2 != X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_7) ).
cnf(c_0_30,plain,
( p_Reset(X1)
| gt(int_level(X1),n0)
| rd_level(plus(X1,n1)) = rd_level(X1)
| ~ p_Wr(X1)
| ~ p_Rd(X1) ),
inference(fof_simplification,[status(thm)],[axiom_60]) ).
cnf(c_0_31,plain,
( p_Reset(X1)
| p_Rd(X1)
| rd_level(plus(X1,n1)) = rd_level(X1)
| ~ p_Wr(X1) ),
inference(fof_simplification,[status(thm)],[axiom_33]) ).
cnf(c_0_32,plain,
( p_Reset(X1)
| p_Wr(X1)
| gt(int_level(X1),n0)
| rd_level(plus(X1,n1)) = rd_level(X1)
| ~ p_Rd(X1) ),
inference(fof_simplification,[status(thm)],[axiom_77]) ).
cnf(c_0_33,plain,
( p_Reset(X1)
| gt(int_level(X1),n0)
| rd_level(plus(X1,n1)) = rd_level(X1)
| ~ p_Wr(X1)
| ~ p_Rd(X1) ),
c_0_30 ).
cnf(c_0_34,axiom,
level(X1) = int_level(X1),
axiom_21 ).
cnf(c_0_35,axiom,
( p_Reset(X1)
| p_Wr(X1)
| p_Rd(X1)
| rd_level(plus(X1,n1)) = rd_level(X1) ),
axiom_81 ).
cnf(c_0_36,plain,
( p_Reset(X1)
| p_Rd(X1)
| rd_level(plus(X1,n1)) = rd_level(X1)
| ~ p_Wr(X1) ),
c_0_31 ).
cnf(c_0_37,plain,
( gt(X1,X3)
| ~ gt(X1,X2)
| ~ gt(X2,X3) ),
inference(fof_simplification,[status(thm)],[axiom_13]) ).
cnf(c_0_38,plain,
( plus(X2,n1) = X1
| gt(X1,plus(X2,n1))
| ~ gt(X1,X2) ),
inference(fof_simplification,[status(thm)],[axiom_14]) ).
cnf(c_0_39,plain,
( p_Reset(X1)
| p_Wr(X1)
| gt(int_level(X1),n0)
| rd_level(plus(X1,n1)) = rd_level(X1)
| ~ p_Rd(X1) ),
c_0_32 ).
cnf(c_0_40,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_33,c_0_34]) ).
cnf(c_0_41,plain,
( rd_level(plus(X1,n1)) = rd_level(X1)
| p_Rd(X1)
| p_Reset(X1) ),
inference(csr,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,plain,
( gt(X1,X3)
| ~ gt(X1,X2)
| ~ gt(X2,X3) ),
c_0_37 ).
cnf(c_0_43,axiom,
( X1 = n0
| gt(X1,n0) ),
axiom_15 ).
cnf(c_0_44,plain,
( plus(X2,n1) = X1
| gt(X1,plus(X2,n1))
| ~ gt(X1,X2) ),
c_0_38 ).
cnf(c_0_45,negated_conjecture,
gt(rd_level(plus(t_139,n1)),minus(fifo_length,n1)),
quest_2 ).
cnf(c_0_46,plain,
plus(X1,n1) != n0,
inference(fof_simplification,[status(thm)],[axiom_1]) ).
cnf(c_0_47,plain,
( X1 = X2
| plus(X1,n1) != plus(X2,n1) ),
inference(fof_simplification,[status(thm)],[axiom_18]) ).
cnf(c_0_48,plain,
( plus(X3,X2) = X1
| def_10(X2,X1)
| minus(X1,X2) != X3 ),
inference(fof_simplification,[status(thm)],[axiom_4]) ).
cnf(c_0_49,plain,
( 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)) ),
inference(fof_simplification,[status(thm)],[axiom_74]) ).
cnf(c_0_50,plain,
( 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)) ),
inference(fof_simplification,[status(thm)],[axiom_56]) ).
cnf(c_0_51,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_39,c_0_34]) ).
cnf(c_0_52,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_40,c_0_41]) ).
cnf(c_0_53,negated_conjecture,
~ gt(rd_level(t_139),minus(fifo_length,n1)),
inference(fof_simplification,[status(thm)],[quest_1]) ).
cnf(c_0_54,plain,
( X1 = n0
| gt(X2,n0)
| ~ gt(X2,X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_55,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_44,c_0_45]) ).
cnf(c_0_56,plain,
plus(X1,n1) != n0,
c_0_46 ).
cnf(c_0_57,plain,
( rd_level(plus(X1,n1)) = n0
| ~ p_Reset(X1) ),
inference(fof_simplification,[status(thm)],[axiom_28]) ).
cnf(c_0_58,plain,
~ gt(X1,X1),
inference(fof_simplification,[status(thm)],[axiom_17]) ).
cnf(c_0_59,plain,
( gt(X1,X2)
| ~ gt(plus(X1,n1),plus(X2,n1)) ),
inference(fof_simplification,[status(thm)],[axiom_9]) ).
cnf(c_0_60,plain,
( X1 = X2
| plus(X1,n1) != plus(X2,n1) ),
c_0_47 ).
cnf(c_0_61,axiom,
( X1 = n0
| X1 = plus(y_27(X1),n1) ),
axiom_16 ).
cnf(c_0_62,plain,
( ~ def_10(X1,X2)
| ~ gt(X2,X1) ),
inference(fof_simplification,[status(thm)],[axiom_6]) ).
cnf(c_0_63,plain,
( plus(X3,X2) = X1
| def_10(X2,X1)
| minus(X1,X2) != X3 ),
c_0_48 ).
cnf(c_0_64,plain,
( 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)) ),
c_0_49 ).
cnf(c_0_65,plain,
( 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)) ),
c_0_50 ).
cnf(c_0_66,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_51,c_0_41]),c_0_52]) ).
cnf(c_0_67,negated_conjecture,
~ gt(rd_level(t_139),minus(fifo_length,n1)),
c_0_53 ).
cnf(c_0_68,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_54,c_0_55]),c_0_56]) ).
cnf(c_0_69,plain,
( rd_level(plus(X1,n1)) = n0
| ~ p_Reset(X1) ),
c_0_57 ).
cnf(c_0_70,plain,
~ gt(X1,X1),
c_0_58 ).
cnf(c_0_71,plain,
( gt(X1,X2)
| ~ gt(plus(X1,n1),plus(X2,n1)) ),
c_0_59 ).
cnf(c_0_72,axiom,
plus(n0,X1) = X1,
axiom_19 ).
cnf(c_0_73,plain,
y_27(plus(X1,n1)) = X1,
inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61])]),c_0_56]) ).
cnf(c_0_74,plain,
( gt(plus(X1,n1),plus(X2,n1))
| ~ gt(X1,X2) ),
inference(fof_simplification,[status(thm)],[axiom_8]) ).
cnf(c_0_75,plain,
( ~ def_10(X1,X2)
| ~ gt(X2,X1) ),
c_0_62 ).
cnf(c_0_76,plain,
( plus(minus(X1,X2),X2) = X1
| def_10(X2,X1) ),
inference(er,[status(thm)],[c_0_63]) ).
cnf(c_0_77,negated_conjecture,
gt(fifo_length,n0),
quest_3 ).
cnf(c_0_78,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_64,c_0_34]) ).
cnf(c_0_79,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_65,c_0_34]) ).
cnf(c_0_80,negated_conjecture,
( p_Reset(t_139)
| gt(level(t_139),n0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_66]),c_0_67]) ).
cnf(c_0_81,negated_conjecture,
~ p_Reset(t_139),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_56]),c_0_70]) ).
cnf(c_0_82,negated_conjecture,
( p_Rd(t_139)
| p_Reset(t_139) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_41]),c_0_67]) ).
cnf(c_0_83,plain,
( X1 = n0
| gt(X2,y_27(X1))
| ~ gt(plus(X2,n1),X1) ),
inference(spm,[status(thm)],[c_0_71,c_0_61]) ).
cnf(c_0_84,plain,
( X1 = n0
| n1 = X1
| gt(X1,n1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_43]),c_0_72]),c_0_72]) ).
cnf(c_0_85,plain,
y_27(n1) = n0,
inference(spm,[status(thm)],[c_0_73,c_0_72]) ).
cnf(c_0_86,plain,
n0 != n1,
inference(spm,[status(thm)],[c_0_56,c_0_72]) ).
cnf(c_0_87,plain,
( gt(plus(X1,n1),plus(X2,n1))
| ~ gt(X1,X2) ),
c_0_74 ).
cnf(c_0_88,plain,
( plus(minus(X1,X2),X2) = X1
| ~ gt(X1,X2) ),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_89,negated_conjecture,
( fifo_length = n1
| gt(fifo_length,n1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_77]),c_0_72]),c_0_72]) ).
cnf(c_0_90,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_78,c_0_79]) ).
cnf(c_0_91,negated_conjecture,
gt(level(t_139),n0),
inference(sr,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_92,negated_conjecture,
p_Rd(t_139),
inference(sr,[status(thm)],[c_0_82,c_0_81]) ).
cnf(c_0_93,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_83,c_0_84]),c_0_85]),c_0_86]),c_0_56]) ).
cnf(c_0_94,plain,
( 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) ),
inference(fof_simplification,[status(thm)],[axiom_57]) ).
cnf(c_0_95,plain,
( gt(X1,X2)
| X2 = X1
| ~ gt(plus(X1,n1),X2) ),
inference(fof_simplification,[status(thm)],[axiom_10]) ).
cnf(c_0_96,negated_conjecture,
gt(plus(rd_level(plus(t_139,n1)),n1),plus(minus(fifo_length,n1),n1)),
inference(spm,[status(thm)],[c_0_87,c_0_45]) ).
cnf(c_0_97,negated_conjecture,
( plus(minus(fifo_length,n1),n1) = fifo_length
| fifo_length = n1 ),
inference(spm,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_98,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_90,c_0_91]),c_0_92])]),c_0_81]) ).
cnf(c_0_99,axiom,
( gt(X1,X2)
| X2 = X1
| gt(X2,X1) ),
axiom_12 ).
cnf(c_0_100,plain,
( plus(X1,n1) = n1
| gt(plus(X1,n1),n1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_93]),c_0_72]) ).
cnf(c_0_101,plain,
( gt(X1,minus(X1,n1))
| ~ gt(X1,n0) ),
inference(fof_simplification,[status(thm)],[axiom_3]) ).
cnf(c_0_102,plain,
( 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) ),
inference(fof_simplification,[status(thm)],[axiom_75]) ).
cnf(c_0_103,plain,
( 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) ),
c_0_94 ).
cnf(c_0_104,plain,
( gt(X1,X2)
| X2 = X1
| ~ gt(plus(X1,n1),X2) ),
c_0_95 ).
cnf(c_0_105,negated_conjecture,
( fifo_length = n1
| gt(plus(rd_level(plus(t_139,n1)),n1),fifo_length) ),
inference(spm,[status(thm)],[c_0_96,c_0_97]) ).
cnf(c_0_106,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_98,c_0_99]),c_0_67]) ).
cnf(c_0_107,plain,
( plus(X1,n1) = n1
| gt(X2,n1)
| ~ gt(X2,plus(X1,n1)) ),
inference(spm,[status(thm)],[c_0_42,c_0_100]) ).
cnf(c_0_108,plain,
( gt(X1,minus(X1,n1))
| ~ gt(X1,n0) ),
c_0_101 ).
cnf(c_0_109,plain,
( 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) ),
c_0_102 ).
cnf(c_0_110,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_103,c_0_34]) ).
cnf(c_0_111,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_104,c_0_105]) ).
cnf(c_0_112,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_97,c_0_106]) ).
cnf(c_0_113,plain,
( X1 = n0
| X1 = n1
| gt(X2,n1)
| ~ gt(X2,X1) ),
inference(spm,[status(thm)],[c_0_107,c_0_61]) ).
cnf(c_0_114,negated_conjecture,
gt(fifo_length,minus(fifo_length,n1)),
inference(spm,[status(thm)],[c_0_108,c_0_77]) ).
cnf(c_0_115,plain,
( gt(X1,n0)
| ~ gt(plus(X1,n1),n1) ),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_116,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_109,c_0_34]) ).
cnf(c_0_117,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_110,c_0_69]) ).
cnf(c_0_118,negated_conjecture,
( fifo_length = n1
| gt(X1,minus(fifo_length,n1))
| ~ gt(plus(X1,n1),fifo_length) ),
inference(spm,[status(thm)],[c_0_71,c_0_97]) ).
cnf(c_0_119,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_111,c_0_112]) ).
cnf(c_0_120,negated_conjecture,
( minus(fifo_length,n1) = n1
| minus(fifo_length,n1) = n0
| gt(fifo_length,n1) ),
inference(spm,[status(thm)],[c_0_113,c_0_114]) ).
cnf(c_0_121,negated_conjecture,
( fifo_length = n1
| gt(minus(fifo_length,n1),n0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_97]),c_0_89]) ).
cnf(c_0_122,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_116,c_0_69]),c_0_117]) ).
cnf(c_0_123,negated_conjecture,
( minus(fifo_length,n1) = X1
| fifo_length = n1
| plus(X1,n1) != fifo_length ),
inference(spm,[status(thm)],[c_0_60,c_0_97]) ).
cnf(c_0_124,negated_conjecture,
( plus(rd_level(t_139),n1) = fifo_length
| fifo_length = n1 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_119]),c_0_67]) ).
cnf(c_0_125,plain,
( minus(X1,X2) = X3
| def_10(X2,X1)
| plus(X3,X2) != X1 ),
inference(fof_simplification,[status(thm)],[axiom_5]) ).
cnf(c_0_126,plain,
( ~ def_10(X1,X2)
| X2 != X1 ),
inference(fof_simplification,[status(thm)],[axiom_7]) ).
cnf(c_0_127,negated_conjecture,
( minus(fifo_length,n1) = n1
| gt(fifo_length,n1)
| ~ gt(rd_level(t_139),n0) ),
inference(spm,[status(thm)],[c_0_67,c_0_120]) ).
cnf(c_0_128,negated_conjecture,
( fifo_length = n1
| gt(X1,n0)
| ~ gt(X1,minus(fifo_length,n1)) ),
inference(spm,[status(thm)],[c_0_42,c_0_121]) ).
cnf(c_0_129,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_122,c_0_91]),c_0_92])]) ).
cnf(c_0_130,negated_conjecture,
( minus(fifo_length,n1) = rd_level(t_139)
| fifo_length = n1 ),
inference(spm,[status(thm)],[c_0_123,c_0_124]) ).
cnf(c_0_131,plain,
( minus(X1,X2) = X3
| def_10(X2,X1)
| plus(X3,X2) != X1 ),
c_0_125 ).
cnf(c_0_132,plain,
( ~ def_10(X1,X2)
| X2 != X1 ),
c_0_126 ).
cnf(c_0_133,negated_conjecture,
( minus(fifo_length,n1) = n1
| rd_level(t_139) = n0
| gt(fifo_length,n1) ),
inference(spm,[status(thm)],[c_0_127,c_0_43]) ).
cnf(c_0_134,negated_conjecture,
( fifo_length = n1
| gt(rd_level(plus(t_139,n1)),n0) ),
inference(spm,[status(thm)],[c_0_128,c_0_45]) ).
cnf(c_0_135,negated_conjecture,
( rd_level(plus(t_139,n1)) = n0
| fifo_length = n1 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_129,c_0_130]),c_0_70]) ).
cnf(c_0_136,plain,
( minus(plus(X1,X2),X2) = X1
| def_10(X2,plus(X1,X2)) ),
inference(er,[status(thm)],[c_0_131]) ).
cnf(c_0_137,plain,
~ def_10(X1,X1),
inference(er,[status(thm)],[c_0_132]) ).
cnf(c_0_138,negated_conjecture,
( rd_level(t_139) = n0
| gt(fifo_length,n1) ),
inference(spm,[status(thm)],[c_0_114,c_0_133]) ).
cnf(c_0_139,negated_conjecture,
fifo_length = n1,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_135]),c_0_70]) ).
cnf(c_0_140,plain,
minus(X1,X1) = n0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_136,c_0_72]),c_0_137]) ).
cnf(c_0_141,negated_conjecture,
rd_level(t_139) = n0,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_138,c_0_139]),c_0_70]) ).
cnf(c_0_142,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_129,c_0_139]),c_0_140]),c_0_141]),c_0_70]) ).
cnf(c_0_143,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_68,c_0_139]),c_0_140]),c_0_72]),c_0_142]),c_0_142]),c_0_86]),c_0_70]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : HWV033-1 : TPTP v8.2.0. Released v2.5.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 12:05:07 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.87/0.57 # Version: 3.1.0
% 0.87/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.87/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.87/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.87/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.87/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.87/0.57 # Starting sh5l with 300s (1) cores
% 0.87/0.57 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 20369 completed with status 0
% 0.87/0.57 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.87/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.87/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.87/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.87/0.57 # No SInE strategy applied
% 0.87/0.57 # Search class: FGHSS-FFMS21-SFFFFFNN
% 0.87/0.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.87/0.57 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.87/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.87/0.57 # Starting new_bool_3 with 136s (1) cores
% 0.87/0.57 # Starting new_bool_1 with 136s (1) cores
% 0.87/0.57 # Starting sh5l with 136s (1) cores
% 0.87/0.57 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 20375 completed with status 0
% 0.87/0.57 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.87/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.87/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.87/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.87/0.57 # No SInE strategy applied
% 0.87/0.57 # Search class: FGHSS-FFMS21-SFFFFFNN
% 0.87/0.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.87/0.57 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.87/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.87/0.57 # Preprocessing time : 0.002 s
% 0.87/0.57 # Presaturation interreduction done
% 0.87/0.57
% 0.87/0.57 # Proof found!
% 0.87/0.57 # SZS status Unsatisfiable
% 0.87/0.57 # SZS output start CNFRefutation
% See solution above
% 0.87/0.57 # Parsed axioms : 93
% 0.87/0.57 # Removed by relevancy pruning/SinE : 0
% 0.87/0.57 # Initial clauses : 93
% 0.87/0.57 # Removed in clause preprocessing : 1
% 0.87/0.57 # Initial clauses in saturation : 92
% 0.87/0.57 # Processed clauses : 925
% 0.87/0.57 # ...of these trivial : 20
% 0.87/0.57 # ...subsumed : 386
% 0.87/0.57 # ...remaining for further processing : 519
% 0.87/0.57 # Other redundant clauses eliminated : 8
% 0.87/0.57 # Clauses deleted for lack of memory : 0
% 0.87/0.57 # Backward-subsumed : 53
% 0.87/0.57 # Backward-rewritten : 181
% 0.87/0.57 # Generated clauses : 3337
% 0.87/0.57 # ...of the previous two non-redundant : 2711
% 0.87/0.57 # ...aggressively subsumed : 0
% 0.87/0.57 # Contextual simplify-reflections : 68
% 0.87/0.57 # Paramodulations : 3320
% 0.87/0.57 # Factorizations : 4
% 0.87/0.57 # NegExts : 0
% 0.87/0.57 # Equation resolutions : 9
% 0.87/0.57 # Disequality decompositions : 0
% 0.87/0.57 # Total rewrite steps : 1539
% 0.87/0.57 # ...of those cached : 1429
% 0.87/0.57 # Propositional unsat checks : 0
% 0.87/0.57 # Propositional check models : 0
% 0.87/0.57 # Propositional check unsatisfiable : 0
% 0.87/0.57 # Propositional clauses : 0
% 0.87/0.57 # Propositional clauses after purity: 0
% 0.87/0.57 # Propositional unsat core size : 0
% 0.87/0.57 # Propositional preprocessing time : 0.000
% 0.87/0.57 # Propositional encoding time : 0.000
% 0.87/0.57 # Propositional solver time : 0.000
% 0.87/0.57 # Success case prop preproc time : 0.000
% 0.87/0.57 # Success case prop encoding time : 0.000
% 0.87/0.57 # Success case prop solver time : 0.000
% 0.87/0.57 # Current number of processed clauses : 204
% 0.87/0.57 # Positive orientable unit clauses : 34
% 0.87/0.57 # Positive unorientable unit clauses: 0
% 0.87/0.57 # Negative unit clauses : 5
% 0.87/0.57 # Non-unit-clauses : 165
% 0.87/0.57 # Current number of unprocessed clauses: 1896
% 0.87/0.57 # ...number of literals in the above : 7232
% 0.87/0.57 # Current number of archived formulas : 0
% 0.87/0.57 # Current number of archived clauses : 313
% 0.87/0.57 # Clause-clause subsumption calls (NU) : 14389
% 0.87/0.57 # Rec. Clause-clause subsumption calls : 6044
% 0.87/0.57 # Non-unit clause-clause subsumptions : 457
% 0.87/0.57 # Unit Clause-clause subsumption calls : 1080
% 0.87/0.57 # Rewrite failures with RHS unbound : 0
% 0.87/0.57 # BW rewrite match attempts : 70
% 0.87/0.57 # BW rewrite match successes : 18
% 0.87/0.57 # Condensation attempts : 0
% 0.87/0.57 # Condensation successes : 0
% 0.87/0.57 # Termbank termtop insertions : 54027
% 0.87/0.57 # Search garbage collected termcells : 188
% 0.87/0.57
% 0.87/0.57 # -------------------------------------------------
% 0.87/0.57 # User time : 0.069 s
% 0.87/0.57 # System time : 0.008 s
% 0.87/0.57 # Total time : 0.077 s
% 0.87/0.57 # Maximum resident set size: 1824 pages
% 0.87/0.57
% 0.87/0.57 # -------------------------------------------------
% 0.87/0.57 # User time : 0.385 s
% 0.87/0.57 # System time : 0.015 s
% 0.87/0.57 # Total time : 0.400 s
% 0.87/0.57 # Maximum resident set size: 1768 pages
% 0.87/0.57 % E---3.1 exiting
%------------------------------------------------------------------------------