TSTP Solution File: HWV009-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : HWV009-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 : n020.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:23 EDT 2023
% Result : Unsatisfiable 6.53s 2.51s
% Output : CNFRefutation 6.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 29
% Syntax : Number of formulae : 46 ( 13 unt; 23 typ; 0 def)
% Number of atoms : 36 ( 8 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 30 ( 17 ~; 13 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 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 : 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_939,axiom,
p_Reset(t_139),
file(unknown,unknown) ).
tff(f_171,axiom,
! [X_t_37] :
( ~ p_Reset(X_t_37)
| ( int_level(plus(X_t_37,n1)) = n0 ) ),
file(unknown,unknown) ).
tff(f_146,axiom,
! [X_t_32] : ( level(X_t_32) = int_level(X_t_32) ),
file(unknown,unknown) ).
tff(f_945,axiom,
( ( level(plus(t_139,n1)) != n0 )
| p_Wr_error(plus(t_139,n1))
| p_Rd_error(plus(t_139,n1)) ),
file(unknown,unknown) ).
tff(f_193,axiom,
! [X_t_37] :
( ~ p_Reset(X_t_37)
| ~ p_Rd_error(plus(X_t_37,n1)) ),
file(unknown,unknown) ).
tff(f_187,axiom,
! [X_t_37] :
( ~ p_Reset(X_t_37)
| ~ p_Wr_error(plus(X_t_37,n1)) ),
file(unknown,unknown) ).
tff(c_182,plain,
p_Reset(t_139),
inference(cnfTransformation,[status(thm)],[f_939]) ).
tff(c_52,plain,
! [X_t_37_40] :
( ( int_level(plus(X_t_37_40,n1)) = n0 )
| ~ p_Reset(X_t_37_40) ),
inference(cnfTransformation,[status(thm)],[f_171]) ).
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_184,plain,
( p_Rd_error(plus(t_139,n1))
| p_Wr_error(plus(t_139,n1))
| ( level(plus(t_139,n1)) != n0 ) ),
inference(cnfTransformation,[status(thm)],[f_945]) ).
tff(c_185,plain,
( p_Rd_error(plus(t_139,n1))
| p_Wr_error(plus(t_139,n1))
| ( int_level(plus(t_139,n1)) != n0 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_42,c_184]) ).
tff(c_2385,plain,
int_level(plus(t_139,n1)) != n0,
inference(splitLeft,[status(thm)],[c_185]) ).
tff(c_2391,plain,
~ p_Reset(t_139),
inference(superposition,[status(thm),theory(equality)],[c_52,c_2385]) ).
tff(c_2396,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_182,c_2391]) ).
tff(c_2397,plain,
( p_Wr_error(plus(t_139,n1))
| p_Rd_error(plus(t_139,n1)) ),
inference(splitRight,[status(thm)],[c_185]) ).
tff(c_2423,plain,
p_Rd_error(plus(t_139,n1)),
inference(splitLeft,[status(thm)],[c_2397]) ).
tff(c_60,plain,
! [X_t_37_44] :
( ~ p_Rd_error(plus(X_t_37_44,n1))
| ~ p_Reset(X_t_37_44) ),
inference(cnfTransformation,[status(thm)],[f_193]) ).
tff(c_2478,plain,
~ p_Reset(t_139),
inference(resolution,[status(thm)],[c_2423,c_60]) ).
tff(c_2486,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_182,c_2478]) ).
tff(c_2487,plain,
p_Wr_error(plus(t_139,n1)),
inference(splitRight,[status(thm)],[c_2397]) ).
tff(c_58,plain,
! [X_t_37_43] :
( ~ p_Wr_error(plus(X_t_37_43,n1))
| ~ p_Reset(X_t_37_43) ),
inference(cnfTransformation,[status(thm)],[f_187]) ).
tff(c_2497,plain,
~ p_Reset(t_139),
inference(resolution,[status(thm)],[c_2487,c_58]) ).
tff(c_2505,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_182,c_2497]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : HWV009-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/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.17/0.36 % Computer : n020.cluster.edu
% 0.17/0.36 % Model : x86_64 x86_64
% 0.17/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.36 % Memory : 8042.1875MB
% 0.17/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.36 % CPULimit : 300
% 0.17/0.36 % WCLimit : 300
% 0.17/0.36 % DateTime : Fri Aug 4 00:01:52 EDT 2023
% 0.17/0.36 % CPUTime :
% 6.53/2.51 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.53/2.51
% 6.53/2.51 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.53/2.54
% 6.53/2.54 Inference rules
% 6.53/2.54 ----------------------
% 6.53/2.54 #Ref : 2
% 6.53/2.54 #Sup : 482
% 6.53/2.54 #Fact : 2
% 6.53/2.54 #Define : 0
% 6.53/2.54 #Split : 6
% 6.53/2.54 #Chain : 0
% 6.53/2.54 #Close : 0
% 6.53/2.54
% 6.53/2.54 Ordering : KBO
% 6.53/2.54
% 6.53/2.54 Simplification rules
% 6.53/2.54 ----------------------
% 6.53/2.54 #Subsume : 138
% 6.53/2.54 #Demod : 92
% 6.53/2.54 #Tautology : 149
% 6.53/2.54 #SimpNegUnit : 100
% 6.53/2.54 #BackRed : 2
% 6.53/2.54
% 6.53/2.54 #Partial instantiations: 0
% 6.53/2.54 #Strategies tried : 1
% 6.53/2.54
% 6.53/2.54 Timing (in seconds)
% 6.53/2.54 ----------------------
% 6.53/2.54 Preprocessing : 0.72
% 6.53/2.54 Parsing : 0.37
% 6.53/2.54 CNF conversion : 0.05
% 6.53/2.54 Main loop : 0.76
% 6.53/2.54 Inferencing : 0.23
% 6.53/2.54 Reduction : 0.22
% 6.53/2.54 Demodulation : 0.14
% 6.53/2.54 BG Simplification : 0.06
% 6.53/2.54 Subsumption : 0.22
% 6.53/2.54 Abstraction : 0.03
% 6.53/2.54 MUC search : 0.00
% 6.53/2.54 Cooper : 0.00
% 6.53/2.54 Total : 1.52
% 6.53/2.54 Index Insertion : 0.00
% 6.53/2.54 Index Deletion : 0.00
% 6.53/2.54 Index Matching : 0.00
% 6.53/2.54 BG Taut test : 0.00
%------------------------------------------------------------------------------