TSTP Solution File: HWV023-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : HWV023-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/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n009.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 7.92s 2.98s
% Output : CNFRefutation 7.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 35
% Syntax : Number of formulae : 56 ( 22 unt; 23 typ; 0 def)
% Number of atoms : 55 ( 21 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 41 ( 19 ~; 22 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 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 : 21 (; 21 !; 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_Wr(t_139),
file(unknown,unknown) ).
tff(f_161,axiom,
! [X_t_35] :
( ( int_level(X_t_35) != n0 )
| p_Empty(X_t_35) ),
file(unknown,unknown) ).
tff(f_946,axiom,
~ p_Empty(plus(t_139,n1)),
file(unknown,unknown) ).
tff(f_942,axiom,
p_Rd(t_139),
file(unknown,unknown) ).
tff(f_143,axiom,
! [X_31] : ( plus(n0,X_31) = X_31 ),
file(unknown,unknown) ).
tff(f_49,axiom,
! [X_1] : gt(plus(X_1,n1),n0),
file(unknown,unknown) ).
tff(f_80,axiom,
! [Y_4,X_3] :
( ~ def_10(Y_4,X_3)
| ( 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_146,axiom,
! [X_t_32] : ( level(X_t_32) = int_level(X_t_32) ),
file(unknown,unknown) ).
tff(f_939,axiom,
level(t_139) = n1,
file(unknown,unknown) ).
tff(f_720,axiom,
! [X_t_42] :
( p_Reset(X_t_42)
| p_Wr(X_t_42)
| ~ p_Rd(X_t_42)
| ~ gt(int_level(X_t_42),n0)
| ( int_level(plus(X_t_42,n1)) = minus(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_Wr(t_139),
inference(cnfTransformation,[status(thm)],[f_941]) ).
tff(c_246,plain,
! [X_t_35_149] :
( p_Empty(X_t_35_149)
| ( int_level(X_t_35_149) != n0 ) ),
inference(cnfTransformation,[status(thm)],[f_161]) ).
tff(c_190,plain,
~ p_Empty(plus(t_139,n1)),
inference(cnfTransformation,[status(thm)],[f_946]) ).
tff(c_254,plain,
int_level(plus(t_139,n1)) != n0,
inference(resolution,[status(thm)],[c_246,c_190]) ).
tff(c_186,plain,
p_Rd(t_139),
inference(cnfTransformation,[status(thm)],[f_942]) ).
tff(c_38,plain,
! [X_31_34] : ( plus(n0,X_31_34) = X_31_34 ),
inference(cnfTransformation,[status(thm)],[f_143]) ).
tff(c_255,plain,
! [X_1_150] : gt(plus(X_1_150,n1),n0),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_259,plain,
gt(n1,n0),
inference(superposition,[status(thm),theory(equality)],[c_38,c_255]) ).
tff(c_14,plain,
! [Y_4_12] : ~ def_10(Y_4_12,Y_4_12),
inference(cnfTransformation,[status(thm)],[f_80]) ).
tff(c_1322,plain,
! [Y_4_221,Z_5_222] :
( def_10(Y_4_221,plus(Z_5_222,Y_4_221))
| ( minus(plus(Z_5_222,Y_4_221),Y_4_221) = Z_5_222 ) ),
inference(cnfTransformation,[status(thm)],[f_68]) ).
tff(c_1337,plain,
! [X_31_34] :
( def_10(X_31_34,X_31_34)
| ( minus(plus(n0,X_31_34),X_31_34) = n0 ) ),
inference(superposition,[status(thm),theory(equality)],[c_38,c_1322]) ).
tff(c_1340,plain,
! [X_31_34] :
( def_10(X_31_34,X_31_34)
| ( minus(X_31_34,X_31_34) = n0 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_38,c_1337]) ).
tff(c_1341,plain,
! [X_31_34] : ( minus(X_31_34,X_31_34) = n0 ),
inference(negUnitSimplification,[status(thm)],[c_14,c_1340]) ).
tff(c_212,plain,
! [X_t_32_144] : ( level(X_t_32_144) = int_level(X_t_32_144) ),
inference(cnfTransformation,[status(thm)],[f_146]) ).
tff(c_182,plain,
level(t_139) = n1,
inference(cnfTransformation,[status(thm)],[f_939]) ).
tff(c_218,plain,
int_level(t_139) = n1,
inference(superposition,[status(thm),theory(equality)],[c_212,c_182]) ).
tff(c_7068,plain,
! [X_t_42_368] :
( ( minus(int_level(X_t_42_368),n1) = int_level(plus(X_t_42_368,n1)) )
| ~ gt(int_level(X_t_42_368),n0)
| ~ p_Rd(X_t_42_368)
| p_Wr(X_t_42_368)
| p_Reset(X_t_42_368) ),
inference(cnfTransformation,[status(thm)],[f_720]) ).
tff(c_7125,plain,
( ( minus(int_level(t_139),n1) = int_level(plus(t_139,n1)) )
| ~ gt(n1,n0)
| ~ p_Rd(t_139)
| p_Wr(t_139)
| p_Reset(t_139) ),
inference(superposition,[status(thm),theory(equality)],[c_218,c_7068]) ).
tff(c_7149,plain,
( ( int_level(plus(t_139,n1)) = n0 )
| p_Wr(t_139)
| p_Reset(t_139) ),
inference(demodulation,[status(thm),theory(equality)],[c_186,c_259,c_1341,c_218,c_7125]) ).
tff(c_7151,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_188,c_184,c_254,c_7149]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : HWV023-1 : TPTP v8.1.2. Released v2.5.0.
% 0.11/0.13 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.34 % Computer : n009.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 : Thu Aug 3 23:37:54 EDT 2023
% 0.13/0.35 % CPUTime :
% 7.92/2.98 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.92/2.98
% 7.92/2.98 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.92/3.01
% 7.92/3.01 Inference rules
% 7.92/3.01 ----------------------
% 7.92/3.01 #Ref : 2
% 7.92/3.01 #Sup : 1525
% 7.92/3.01 #Fact : 2
% 7.92/3.01 #Define : 0
% 7.92/3.01 #Split : 12
% 7.92/3.01 #Chain : 0
% 7.92/3.01 #Close : 0
% 7.92/3.01
% 7.92/3.01 Ordering : KBO
% 7.92/3.01
% 7.92/3.01 Simplification rules
% 7.92/3.01 ----------------------
% 7.92/3.01 #Subsume : 577
% 7.92/3.01 #Demod : 363
% 7.92/3.01 #Tautology : 406
% 7.92/3.01 #SimpNegUnit : 314
% 7.92/3.01 #BackRed : 2
% 7.92/3.01
% 7.92/3.01 #Partial instantiations: 0
% 7.92/3.01 #Strategies tried : 1
% 7.92/3.01
% 7.92/3.01 Timing (in seconds)
% 7.92/3.01 ----------------------
% 7.92/3.02 Preprocessing : 0.71
% 7.92/3.02 Parsing : 0.36
% 7.92/3.02 CNF conversion : 0.05
% 7.92/3.02 Main loop : 1.23
% 7.92/3.02 Inferencing : 0.44
% 7.92/3.02 Reduction : 0.36
% 7.92/3.02 Demodulation : 0.22
% 7.92/3.02 BG Simplification : 0.07
% 7.92/3.02 Subsumption : 0.30
% 7.92/3.02 Abstraction : 0.04
% 7.92/3.02 MUC search : 0.00
% 7.92/3.02 Cooper : 0.00
% 7.92/3.02 Total : 1.99
% 7.92/3.02 Index Insertion : 0.00
% 7.92/3.02 Index Deletion : 0.00
% 7.92/3.02 Index Matching : 0.00
% 7.92/3.02 BG Taut test : 0.00
%------------------------------------------------------------------------------