TSTP Solution File: HWV022-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : HWV022-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n005.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 : Tue Aug 22 10:42:28 EDT 2023
% Result : Unsatisfiable 10.75s 3.53s
% Output : CNFRefutation 10.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 38
% Syntax : Number of formulae : 84 ( 34 unt; 23 typ; 0 def)
% Number of atoms : 108 ( 41 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 85 ( 38 ~; 47 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 27 ( 19 >; 8 *; 0 +; 0 <<)
% Number of predicates : 14 ( 12 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 33 (; 33 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ p_Mem > p_Data_out > p_Data_in > gt > def_10 > p_Wr_error > p_Wr > p_Reset > p_Rd_error > p_Rd > p_Full > p_Empty > plus > minus > #nlpp > y_27 > wr_level > rd_level > level > int_level > t_139 > n1 > n0 > fifo_length
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(p_Data_out,type,
p_Data_out: ( $i * $i ) > $o ).
tff(rd_level,type,
rd_level: $i > $i ).
tff(p_Mem,type,
p_Mem: ( $i * $i * $i ) > $o ).
tff(p_Rd_error,type,
p_Rd_error: $i > $o ).
tff(fifo_length,type,
fifo_length: $i ).
tff(p_Wr,type,
p_Wr: $i > $o ).
tff(def_10,type,
def_10: ( $i * $i ) > $o ).
tff(y_27,type,
y_27: $i > $i ).
tff(t_139,type,
t_139: $i ).
tff(n1,type,
n1: $i ).
tff(plus,type,
plus: ( $i * $i ) > $i ).
tff(wr_level,type,
wr_level: $i > $i ).
tff(int_level,type,
int_level: $i > $i ).
tff(p_Full,type,
p_Full: $i > $o ).
tff(n0,type,
n0: $i ).
tff(p_Reset,type,
p_Reset: $i > $o ).
tff(gt,type,
gt: ( $i * $i ) > $o ).
tff(p_Empty,type,
p_Empty: $i > $o ).
tff(p_Wr_error,type,
p_Wr_error: $i > $o ).
tff(p_Data_in,type,
p_Data_in: ( $i * $i ) > $o ).
tff(level,type,
level: $i > $i ).
tff(p_Rd,type,
p_Rd: $i > $o ).
tff(minus,type,
minus: ( $i * $i ) > $i ).
tff(f_944,axiom,
~ p_Reset(t_139),
file(unknown,unknown) ).
tff(f_941,axiom,
~ p_Rd(t_139),
file(unknown,unknown) ).
tff(f_146,axiom,
! [X_t_32] : ( level(X_t_32) = int_level(X_t_32) ),
file(unknown,unknown) ).
tff(f_946,axiom,
level(plus(t_139,n1)) != fifo_length,
file(unknown,unknown) ).
tff(f_942,axiom,
p_Wr(t_139),
file(unknown,unknown) ).
tff(f_939,axiom,
plus(level(t_139),n1) = fifo_length,
file(unknown,unknown) ).
tff(f_49,axiom,
! [X_1] : gt(plus(X_1,n1),n0),
file(unknown,unknown) ).
tff(f_143,axiom,
! [X_31] : ( plus(n0,X_31) = X_31 ),
file(unknown,unknown) ).
tff(f_141,axiom,
! [X_29,Y_30] :
( ( plus(X_29,n1) != plus(Y_30,n1) )
| ( X_29 = Y_30 ) ),
file(unknown,unknown) ).
tff(f_129,axiom,
! [X_25] :
( ( X_25 = n0 )
| gt(X_25,n0) ),
file(unknown,unknown) ).
tff(f_85,axiom,
! [Y_12,X_11] :
( ~ gt(Y_12,X_11)
| gt(plus(Y_12,n1),plus(X_11,n1)) ),
file(unknown,unknown) ).
tff(f_74,axiom,
! [Y_4,X_3] :
( ~ def_10(Y_4,X_3)
| ~ gt(X_3,Y_4) ),
file(unknown,unknown) ).
tff(f_68,axiom,
! [X_3,Y_4,Z_5] :
( ( minus(X_3,Y_4) = Z_5 )
| ( plus(Z_5,Y_4) != X_3 )
| def_10(Y_4,X_3) ),
file(unknown,unknown) ).
tff(f_54,axiom,
! [X_2] :
( ~ gt(X_2,n0)
| gt(X_2,minus(X_2,n1)) ),
file(unknown,unknown) ).
tff(f_239,axiom,
! [X_t_42] :
( p_Reset(X_t_42)
| ~ p_Wr(X_t_42)
| p_Rd(X_t_42)
| ~ gt(fifo_length,int_level(X_t_42))
| ( int_level(plus(X_t_42,n1)) = plus(int_level(X_t_42),n1) ) ),
file(unknown,unknown) ).
tff(c_188,plain,
~ p_Reset(t_139),
inference(cnfTransformation,[status(thm)],[f_944]) ).
tff(c_184,plain,
~ p_Rd(t_139),
inference(cnfTransformation,[status(thm)],[f_941]) ).
tff(c_42,plain,
! [X_t_32_35] : ( level(X_t_32_35) = int_level(X_t_32_35) ),
inference(cnfTransformation,[status(thm)],[f_146]) ).
tff(c_190,plain,
level(plus(t_139,n1)) != fifo_length,
inference(cnfTransformation,[status(thm)],[f_946]) ).
tff(c_191,plain,
int_level(plus(t_139,n1)) != fifo_length,
inference(demodulation,[status(thm),theory(equality)],[c_42,c_190]) ).
tff(c_186,plain,
p_Wr(t_139),
inference(cnfTransformation,[status(thm)],[f_942]) ).
tff(c_182,plain,
plus(level(t_139),n1) = fifo_length,
inference(cnfTransformation,[status(thm)],[f_939]) ).
tff(c_192,plain,
plus(int_level(t_139),n1) = fifo_length,
inference(demodulation,[status(thm),theory(equality)],[c_42,c_182]) ).
tff(c_244,plain,
! [X_1_150] : gt(plus(X_1_150,n1),n0),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_246,plain,
gt(fifo_length,n0),
inference(superposition,[status(thm),theory(equality)],[c_192,c_244]) ).
tff(c_38,plain,
! [X_31_34] : ( plus(n0,X_31_34) = X_31_34 ),
inference(cnfTransformation,[status(thm)],[f_143]) ).
tff(c_404,plain,
! [Y_30_168,X_29_169] :
( ( Y_30_168 = X_29_169 )
| ( plus(Y_30_168,n1) != plus(X_29_169,n1) ) ),
inference(cnfTransformation,[status(thm)],[f_141]) ).
tff(c_425,plain,
! [X_29_170] :
( ( n0 = X_29_170 )
| ( plus(X_29_170,n1) != n1 ) ),
inference(superposition,[status(thm),theory(equality)],[c_38,c_404]) ).
tff(c_431,plain,
( ( int_level(t_139) = n0 )
| ( n1 != fifo_length ) ),
inference(superposition,[status(thm),theory(equality)],[c_192,c_425]) ).
tff(c_438,plain,
n1 != fifo_length,
inference(splitLeft,[status(thm)],[c_431]) ).
tff(c_30,plain,
! [X_25_29] :
( gt(X_25_29,n0)
| ( n0 = X_25_29 ) ),
inference(cnfTransformation,[status(thm)],[f_129]) ).
tff(c_823,plain,
! [Y_12_196,X_11_197] :
( gt(plus(Y_12_196,n1),plus(X_11_197,n1))
| ~ gt(Y_12_196,X_11_197) ),
inference(cnfTransformation,[status(thm)],[f_85]) ).
tff(c_1009,plain,
! [Y_12_207] :
( gt(plus(Y_12_207,n1),n1)
| ~ gt(Y_12_207,n0) ),
inference(superposition,[status(thm),theory(equality)],[c_38,c_823]) ).
tff(c_1032,plain,
( gt(fifo_length,n1)
| ~ gt(int_level(t_139),n0) ),
inference(superposition,[status(thm),theory(equality)],[c_192,c_1009]) ).
tff(c_1046,plain,
~ gt(int_level(t_139),n0),
inference(splitLeft,[status(thm)],[c_1032]) ).
tff(c_1074,plain,
int_level(t_139) = n0,
inference(resolution,[status(thm)],[c_30,c_1046]) ).
tff(c_1101,plain,
plus(n0,n1) = fifo_length,
inference(demodulation,[status(thm),theory(equality)],[c_1074,c_192]) ).
tff(c_1220,plain,
n1 = fifo_length,
inference(superposition,[status(thm),theory(equality)],[c_1101,c_38]) ).
tff(c_1239,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_438,c_1220]) ).
tff(c_1240,plain,
gt(fifo_length,n1),
inference(splitRight,[status(thm)],[c_1032]) ).
tff(c_12,plain,
! [X_3_11,Y_4_10] :
( ~ gt(X_3_11,Y_4_10)
| ~ def_10(Y_4_10,X_3_11) ),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_1258,plain,
~ def_10(n1,fifo_length),
inference(resolution,[status(thm)],[c_1240,c_12]) ).
tff(c_1550,plain,
! [Y_4_220,Z_5_221] :
( def_10(Y_4_220,plus(Z_5_221,Y_4_220))
| ( minus(plus(Z_5_221,Y_4_220),Y_4_220) = Z_5_221 ) ),
inference(cnfTransformation,[status(thm)],[f_68]) ).
tff(c_1563,plain,
( def_10(n1,fifo_length)
| ( minus(plus(int_level(t_139),n1),n1) = int_level(t_139) ) ),
inference(superposition,[status(thm),theory(equality)],[c_192,c_1550]) ).
tff(c_1568,plain,
( def_10(n1,fifo_length)
| ( minus(fifo_length,n1) = int_level(t_139) ) ),
inference(demodulation,[status(thm),theory(equality)],[c_192,c_1563]) ).
tff(c_1569,plain,
minus(fifo_length,n1) = int_level(t_139),
inference(negUnitSimplification,[status(thm)],[c_1258,c_1568]) ).
tff(c_6,plain,
! [X_2_3] :
( gt(X_2_3,minus(X_2_3,n1))
| ~ gt(X_2_3,n0) ),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_1605,plain,
( gt(fifo_length,int_level(t_139))
| ~ gt(fifo_length,n0) ),
inference(superposition,[status(thm),theory(equality)],[c_1569,c_6]) ).
tff(c_1613,plain,
gt(fifo_length,int_level(t_139)),
inference(demodulation,[status(thm),theory(equality)],[c_246,c_1605]) ).
tff(c_5984,plain,
! [X_t_42_334] :
( ( plus(int_level(X_t_42_334),n1) = int_level(plus(X_t_42_334,n1)) )
| ~ gt(fifo_length,int_level(X_t_42_334))
| p_Rd(X_t_42_334)
| ~ p_Wr(X_t_42_334)
| p_Reset(X_t_42_334) ),
inference(cnfTransformation,[status(thm)],[f_239]) ).
tff(c_6009,plain,
( ( plus(int_level(t_139),n1) = int_level(plus(t_139,n1)) )
| p_Rd(t_139)
| ~ p_Wr(t_139)
| p_Reset(t_139) ),
inference(resolution,[status(thm)],[c_1613,c_5984]) ).
tff(c_6029,plain,
( ( int_level(plus(t_139,n1)) = fifo_length )
| p_Rd(t_139)
| p_Reset(t_139) ),
inference(demodulation,[status(thm),theory(equality)],[c_186,c_192,c_6009]) ).
tff(c_6031,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_188,c_184,c_191,c_6029]) ).
tff(c_6033,plain,
n1 = fifo_length,
inference(splitRight,[status(thm)],[c_431]) ).
tff(c_6049,plain,
int_level(plus(t_139,fifo_length)) != fifo_length,
inference(demodulation,[status(thm),theory(equality)],[c_6033,c_191]) ).
tff(c_6032,plain,
int_level(t_139) = n0,
inference(splitRight,[status(thm)],[c_431]) ).
tff(c_70,plain,
! [X_t_42_52] :
( ( plus(int_level(X_t_42_52),n1) = int_level(plus(X_t_42_52,n1)) )
| ~ gt(fifo_length,int_level(X_t_42_52))
| p_Rd(X_t_42_52)
| ~ p_Wr(X_t_42_52)
| p_Reset(X_t_42_52) ),
inference(cnfTransformation,[status(thm)],[f_239]) ).
tff(c_12352,plain,
! [X_t_42_531] :
( ( plus(int_level(X_t_42_531),fifo_length) = int_level(plus(X_t_42_531,fifo_length)) )
| ~ gt(fifo_length,int_level(X_t_42_531))
| p_Rd(X_t_42_531)
| ~ p_Wr(X_t_42_531)
| p_Reset(X_t_42_531) ),
inference(demodulation,[status(thm),theory(equality)],[c_6033,c_6033,c_70]) ).
tff(c_12381,plain,
( ( plus(int_level(t_139),fifo_length) = int_level(plus(t_139,fifo_length)) )
| ~ gt(fifo_length,n0)
| p_Rd(t_139)
| ~ p_Wr(t_139)
| p_Reset(t_139) ),
inference(superposition,[status(thm),theory(equality)],[c_6032,c_12352]) ).
tff(c_12391,plain,
( ( int_level(plus(t_139,fifo_length)) = fifo_length )
| p_Rd(t_139)
| p_Reset(t_139) ),
inference(demodulation,[status(thm),theory(equality)],[c_186,c_246,c_38,c_6032,c_12381]) ).
tff(c_12393,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_188,c_184,c_6049,c_12391]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : HWV022-1 : TPTP v8.1.2. Released v2.5.0.
% 0.00/0.15 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.14/0.36 % Computer : n005.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 23:46:11 EDT 2023
% 0.14/0.37 % CPUTime :
% 10.75/3.53 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.75/3.54
% 10.75/3.54 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 10.85/3.57
% 10.85/3.57 Inference rules
% 10.85/3.57 ----------------------
% 10.85/3.57 #Ref : 5
% 10.85/3.57 #Sup : 2694
% 10.85/3.57 #Fact : 4
% 10.85/3.57 #Define : 0
% 10.85/3.57 #Split : 21
% 10.85/3.57 #Chain : 0
% 10.85/3.57 #Close : 0
% 10.85/3.57
% 10.85/3.57 Ordering : KBO
% 10.85/3.57
% 10.85/3.57 Simplification rules
% 10.85/3.57 ----------------------
% 10.85/3.57 #Subsume : 927
% 10.85/3.57 #Demod : 783
% 10.85/3.57 #Tautology : 752
% 10.85/3.57 #SimpNegUnit : 629
% 10.85/3.57 #BackRed : 27
% 10.85/3.57
% 10.85/3.57 #Partial instantiations: 0
% 10.85/3.57 #Strategies tried : 1
% 10.85/3.57
% 10.85/3.57 Timing (in seconds)
% 10.85/3.57 ----------------------
% 10.85/3.57 Preprocessing : 0.72
% 10.85/3.57 Parsing : 0.37
% 10.85/3.58 CNF conversion : 0.05
% 10.85/3.58 Main loop : 1.77
% 10.85/3.58 Inferencing : 0.63
% 10.85/3.58 Reduction : 0.52
% 10.85/3.58 Demodulation : 0.32
% 10.85/3.58 BG Simplification : 0.08
% 10.85/3.58 Subsumption : 0.44
% 10.85/3.58 Abstraction : 0.06
% 10.85/3.58 MUC search : 0.00
% 10.85/3.58 Cooper : 0.00
% 10.85/3.58 Total : 2.54
% 10.85/3.58 Index Insertion : 0.00
% 10.85/3.58 Index Deletion : 0.00
% 10.85/3.58 Index Matching : 0.00
% 10.85/3.58 BG Taut test : 0.00
%------------------------------------------------------------------------------