TSTP Solution File: HWV013-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : HWV013-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 : n017.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:25 EDT 2023
% Result : Unsatisfiable 10.20s 3.47s
% Output : CNFRefutation 10.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 30
% Syntax : Number of formulae : 42 ( 15 unt; 23 typ; 0 def)
% Number of atoms : 32 ( 9 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 25 ( 12 ~; 13 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 3 ( 2 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 : 4 (; 4 !; 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 > x_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(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(x_139,type,
x_139: $i ).
tff(level,type,
level: $i > $i ).
tff(p_Rd,type,
p_Rd: $i > $o ).
tff(minus,type,
minus: ( $i * $i ) > $i ).
tff(f_940,axiom,
~ p_Reset(x_139),
file(unknown,unknown) ).
tff(f_943,axiom,
~ p_Rd(x_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(x_139,n1)) != plus(level(x_139),n1),
file(unknown,unknown) ).
tff(f_944,axiom,
p_Wr(x_139),
file(unknown,unknown) ).
tff(f_941,axiom,
gt(fifo_length,level(x_139)),
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_182,plain,
~ p_Reset(x_139),
inference(cnfTransformation,[status(thm)],[f_940]) ).
tff(c_186,plain,
~ p_Rd(x_139),
inference(cnfTransformation,[status(thm)],[f_943]) ).
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,
plus(level(x_139),n1) != level(plus(x_139,n1)),
inference(cnfTransformation,[status(thm)],[f_946]) ).
tff(c_192,plain,
plus(int_level(x_139),n1) != int_level(plus(x_139,n1)),
inference(demodulation,[status(thm),theory(equality)],[c_42,c_42,c_190]) ).
tff(c_188,plain,
p_Wr(x_139),
inference(cnfTransformation,[status(thm)],[f_944]) ).
tff(c_184,plain,
gt(fifo_length,level(x_139)),
inference(cnfTransformation,[status(thm)],[f_941]) ).
tff(c_191,plain,
gt(fifo_length,int_level(x_139)),
inference(demodulation,[status(thm),theory(equality)],[c_42,c_184]) ).
tff(c_9705,plain,
! [X_t_42_484] :
( ( plus(int_level(X_t_42_484),n1) = int_level(plus(X_t_42_484,n1)) )
| ~ gt(fifo_length,int_level(X_t_42_484))
| p_Rd(X_t_42_484)
| ~ p_Wr(X_t_42_484)
| p_Reset(X_t_42_484) ),
inference(cnfTransformation,[status(thm)],[f_239]) ).
tff(c_9741,plain,
( ( plus(int_level(x_139),n1) = int_level(plus(x_139,n1)) )
| p_Rd(x_139)
| ~ p_Wr(x_139)
| p_Reset(x_139) ),
inference(resolution,[status(thm)],[c_191,c_9705]) ).
tff(c_9757,plain,
( ( plus(int_level(x_139),n1) = int_level(plus(x_139,n1)) )
| p_Rd(x_139)
| p_Reset(x_139) ),
inference(demodulation,[status(thm),theory(equality)],[c_188,c_9741]) ).
tff(c_9759,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_182,c_186,c_192,c_9757]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : HWV013-1 : TPTP v8.1.2. Released v2.5.0.
% 0.00/0.14 % 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.35 % Computer : n017.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 23:30:37 EDT 2023
% 0.13/0.35 % CPUTime :
% 10.20/3.47 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.20/3.47
% 10.20/3.47 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 10.47/3.50
% 10.47/3.50 Inference rules
% 10.47/3.50 ----------------------
% 10.47/3.50 #Ref : 5
% 10.47/3.50 #Sup : 2160
% 10.47/3.50 #Fact : 2
% 10.47/3.50 #Define : 0
% 10.47/3.50 #Split : 23
% 10.47/3.50 #Chain : 0
% 10.47/3.50 #Close : 0
% 10.47/3.50
% 10.47/3.50 Ordering : KBO
% 10.47/3.50
% 10.47/3.50 Simplification rules
% 10.47/3.50 ----------------------
% 10.47/3.50 #Subsume : 754
% 10.47/3.50 #Demod : 468
% 10.47/3.50 #Tautology : 485
% 10.47/3.50 #SimpNegUnit : 523
% 10.47/3.50 #BackRed : 54
% 10.47/3.50
% 10.47/3.50 #Partial instantiations: 0
% 10.47/3.50 #Strategies tried : 1
% 10.47/3.50
% 10.47/3.50 Timing (in seconds)
% 10.47/3.50 ----------------------
% 10.47/3.50 Preprocessing : 0.72
% 10.47/3.50 Parsing : 0.37
% 10.47/3.50 CNF conversion : 0.05
% 10.47/3.50 Main loop : 1.66
% 10.47/3.50 Inferencing : 0.58
% 10.47/3.50 Reduction : 0.49
% 10.47/3.50 Demodulation : 0.28
% 10.47/3.50 BG Simplification : 0.08
% 10.47/3.50 Subsumption : 0.40
% 10.47/3.50 Abstraction : 0.05
% 10.47/3.50 MUC search : 0.00
% 10.47/3.50 Cooper : 0.00
% 10.47/3.50 Total : 2.42
% 10.47/3.50 Index Insertion : 0.00
% 10.47/3.50 Index Deletion : 0.00
% 10.47/3.50 Index Matching : 0.00
% 10.47/3.50 BG Taut test : 0.00
%------------------------------------------------------------------------------