TSTP Solution File: HWV025-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : HWV025-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 : n002.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:29 EDT 2023
% Result : Unsatisfiable 6.77s 2.57s
% Output : CNFRefutation 7.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 31
% Syntax : Number of formulae : 53 ( 12 unt; 23 typ; 0 def)
% Number of atoms : 81 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 78 ( 27 ~; 51 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 27 ( 19 >; 8 *; 0 +; 0 <<)
% Number of predicates : 13 ( 12 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 8 (; 8 !; 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_942,axiom,
~ p_Reset(t_139),
file(unknown,unknown) ).
tff(f_940,axiom,
~ p_Rd(t_139),
file(unknown,unknown) ).
tff(f_947,axiom,
( ~ p_Rd_error(t_139)
| ~ p_Rd_error(plus(t_139,n1)) ),
file(unknown,unknown) ).
tff(f_950,axiom,
( p_Rd_error(t_139)
| p_Rd_error(plus(t_139,n1)) ),
file(unknown,unknown) ).
tff(f_429,axiom,
! [X_t_42] :
( p_Reset(X_t_42)
| ~ p_Wr(X_t_42)
| p_Rd(X_t_42)
| ~ p_Rd_error(plus(X_t_42,n1))
| p_Rd_error(X_t_42) ),
file(unknown,unknown) ).
tff(f_889,axiom,
! [X_t_42] :
( p_Reset(X_t_42)
| p_Wr(X_t_42)
| p_Rd(X_t_42)
| ~ p_Rd_error(plus(X_t_42,n1))
| p_Rd_error(X_t_42) ),
file(unknown,unknown) ).
tff(f_900,axiom,
! [X_t_42] :
( p_Reset(X_t_42)
| p_Wr(X_t_42)
| p_Rd(X_t_42)
| p_Rd_error(plus(X_t_42,n1))
| ~ p_Rd_error(X_t_42) ),
file(unknown,unknown) ).
tff(f_441,axiom,
! [X_t_42] :
( p_Reset(X_t_42)
| ~ p_Wr(X_t_42)
| p_Rd(X_t_42)
| p_Rd_error(plus(X_t_42,n1))
| ~ p_Rd_error(X_t_42) ),
file(unknown,unknown) ).
tff(c_184,plain,
~ p_Reset(t_139),
inference(cnfTransformation,[status(thm)],[f_942]) ).
tff(c_182,plain,
~ p_Rd(t_139),
inference(cnfTransformation,[status(thm)],[f_940]) ).
tff(c_186,plain,
( ~ p_Rd_error(plus(t_139,n1))
| ~ p_Rd_error(t_139) ),
inference(cnfTransformation,[status(thm)],[f_947]) ).
tff(c_239,plain,
~ p_Rd_error(t_139),
inference(splitLeft,[status(thm)],[c_186]) ).
tff(c_188,plain,
( p_Rd_error(plus(t_139,n1))
| p_Rd_error(t_139) ),
inference(cnfTransformation,[status(thm)],[f_950]) ).
tff(c_246,plain,
p_Rd_error(plus(t_139,n1)),
inference(negUnitSimplification,[status(thm)],[c_239,c_188]) ).
tff(c_1583,plain,
! [X_t_42_229] :
( p_Rd_error(X_t_42_229)
| ~ p_Rd_error(plus(X_t_42_229,n1))
| p_Rd(X_t_42_229)
| ~ p_Wr(X_t_42_229)
| p_Reset(X_t_42_229) ),
inference(cnfTransformation,[status(thm)],[f_429]) ).
tff(c_1593,plain,
( p_Rd_error(t_139)
| p_Rd(t_139)
| ~ p_Wr(t_139)
| p_Reset(t_139) ),
inference(resolution,[status(thm)],[c_246,c_1583]) ).
tff(c_1600,plain,
~ p_Wr(t_139),
inference(negUnitSimplification,[status(thm)],[c_184,c_182,c_239,c_1593]) ).
tff(c_2240,plain,
! [X_t_42_251] :
( p_Rd_error(X_t_42_251)
| ~ p_Rd_error(plus(X_t_42_251,n1))
| p_Rd(X_t_42_251)
| p_Wr(X_t_42_251)
| p_Reset(X_t_42_251) ),
inference(cnfTransformation,[status(thm)],[f_889]) ).
tff(c_2253,plain,
( p_Rd_error(t_139)
| p_Rd(t_139)
| p_Wr(t_139)
| p_Reset(t_139) ),
inference(resolution,[status(thm)],[c_246,c_2240]) ).
tff(c_2262,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_184,c_1600,c_182,c_239,c_2253]) ).
tff(c_2264,plain,
p_Rd_error(t_139),
inference(splitRight,[status(thm)],[c_186]) ).
tff(c_3521,plain,
! [X_t_42_334] :
( ~ p_Rd_error(X_t_42_334)
| p_Rd_error(plus(X_t_42_334,n1))
| p_Rd(X_t_42_334)
| p_Wr(X_t_42_334)
| p_Reset(X_t_42_334) ),
inference(cnfTransformation,[status(thm)],[f_900]) ).
tff(c_2263,plain,
~ p_Rd_error(plus(t_139,n1)),
inference(splitRight,[status(thm)],[c_186]) ).
tff(c_3527,plain,
( ~ p_Rd_error(t_139)
| p_Rd(t_139)
| p_Wr(t_139)
| p_Reset(t_139) ),
inference(resolution,[status(thm)],[c_3521,c_2263]) ).
tff(c_3542,plain,
( p_Rd(t_139)
| p_Wr(t_139)
| p_Reset(t_139) ),
inference(demodulation,[status(thm),theory(equality)],[c_2264,c_3527]) ).
tff(c_3543,plain,
p_Wr(t_139),
inference(negUnitSimplification,[status(thm)],[c_184,c_182,c_3542]) ).
tff(c_3815,plain,
! [X_t_42_341] :
( ~ p_Rd_error(X_t_42_341)
| p_Rd_error(plus(X_t_42_341,n1))
| p_Rd(X_t_42_341)
| ~ p_Wr(X_t_42_341)
| p_Reset(X_t_42_341) ),
inference(cnfTransformation,[status(thm)],[f_441]) ).
tff(c_3821,plain,
( ~ p_Rd_error(t_139)
| p_Rd(t_139)
| ~ p_Wr(t_139)
| p_Reset(t_139) ),
inference(resolution,[status(thm)],[c_3815,c_2263]) ).
tff(c_3836,plain,
( p_Rd(t_139)
| p_Reset(t_139) ),
inference(demodulation,[status(thm),theory(equality)],[c_3543,c_2264,c_3821]) ).
tff(c_3838,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_184,c_182,c_3836]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : HWV025-1 : TPTP v8.1.2. Released v2.5.0.
% 0.14/0.15 % 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.14/0.36 % Computer : n002.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 : Fri Aug 4 00:02:31 EDT 2023
% 0.14/0.36 % CPUTime :
% 6.77/2.57 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.77/2.58
% 6.77/2.58 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.20/2.61
% 7.20/2.61 Inference rules
% 7.20/2.61 ----------------------
% 7.20/2.61 #Ref : 4
% 7.20/2.61 #Sup : 765
% 7.20/2.61 #Fact : 4
% 7.20/2.61 #Define : 0
% 7.20/2.61 #Split : 8
% 7.20/2.61 #Chain : 0
% 7.20/2.61 #Close : 0
% 7.20/2.61
% 7.20/2.61 Ordering : KBO
% 7.20/2.61
% 7.20/2.61 Simplification rules
% 7.20/2.61 ----------------------
% 7.20/2.61 #Subsume : 225
% 7.20/2.61 #Demod : 122
% 7.20/2.61 #Tautology : 223
% 7.20/2.61 #SimpNegUnit : 151
% 7.20/2.61 #BackRed : 3
% 7.20/2.61
% 7.20/2.61 #Partial instantiations: 0
% 7.20/2.61 #Strategies tried : 1
% 7.20/2.61
% 7.20/2.61 Timing (in seconds)
% 7.20/2.61 ----------------------
% 7.20/2.61 Preprocessing : 0.71
% 7.20/2.61 Parsing : 0.37
% 7.20/2.61 CNF conversion : 0.05
% 7.20/2.61 Main loop : 0.83
% 7.20/2.61 Inferencing : 0.30
% 7.20/2.61 Reduction : 0.23
% 7.20/2.61 Demodulation : 0.14
% 7.20/2.61 BG Simplification : 0.06
% 7.20/2.61 Subsumption : 0.19
% 7.20/2.61 Abstraction : 0.03
% 7.20/2.61 MUC search : 0.00
% 7.20/2.61 Cooper : 0.00
% 7.20/2.61 Total : 1.59
% 7.20/2.61 Index Insertion : 0.00
% 7.20/2.61 Index Deletion : 0.00
% 7.20/2.61 Index Matching : 0.00
% 7.20/2.61 BG Taut test : 0.00
%------------------------------------------------------------------------------