TSTP Solution File: HWV026-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : HWV026-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 : n006.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.00s 2.42s
% Output : CNFRefutation 6.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 29
% Syntax : Number of formulae : 44 ( 10 unt; 23 typ; 0 def)
% Number of atoms : 42 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 36 ( 15 ~; 21 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 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 : 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 > 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_Wr(t_139),
file(unknown,unknown) ).
tff(f_947,axiom,
( ~ p_Wr_error(t_139)
| ~ p_Wr_error(plus(t_139,n1)) ),
file(unknown,unknown) ).
tff(f_950,axiom,
( p_Wr_error(t_139)
| p_Wr_error(plus(t_139,n1)) ),
file(unknown,unknown) ).
tff(f_927,axiom,
! [X_t_42] :
( p_Reset(X_t_42)
| p_Wr(X_t_42)
| ~ p_Wr_error(plus(X_t_42,n1))
| p_Wr_error(X_t_42) ),
file(unknown,unknown) ).
tff(f_936,axiom,
! [X_t_42] :
( p_Reset(X_t_42)
| p_Wr(X_t_42)
| p_Wr_error(plus(X_t_42,n1))
| ~ p_Wr_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_Wr(t_139),
inference(cnfTransformation,[status(thm)],[f_940]) ).
tff(c_186,plain,
( ~ p_Wr_error(plus(t_139,n1))
| ~ p_Wr_error(t_139) ),
inference(cnfTransformation,[status(thm)],[f_947]) ).
tff(c_239,plain,
~ p_Wr_error(t_139),
inference(splitLeft,[status(thm)],[c_186]) ).
tff(c_188,plain,
( p_Wr_error(plus(t_139,n1))
| p_Wr_error(t_139) ),
inference(cnfTransformation,[status(thm)],[f_950]) ).
tff(c_246,plain,
p_Wr_error(plus(t_139,n1)),
inference(negUnitSimplification,[status(thm)],[c_239,c_188]) ).
tff(c_950,plain,
! [X_t_42_211] :
( p_Wr_error(X_t_42_211)
| ~ p_Wr_error(plus(X_t_42_211,n1))
| p_Wr(X_t_42_211)
| p_Reset(X_t_42_211) ),
inference(cnfTransformation,[status(thm)],[f_927]) ).
tff(c_963,plain,
( p_Wr_error(t_139)
| p_Wr(t_139)
| p_Reset(t_139) ),
inference(resolution,[status(thm)],[c_246,c_950]) ).
tff(c_972,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_184,c_182,c_239,c_963]) ).
tff(c_974,plain,
p_Wr_error(t_139),
inference(splitRight,[status(thm)],[c_186]) ).
tff(c_1749,plain,
! [X_t_42_273] :
( ~ p_Wr_error(X_t_42_273)
| p_Wr_error(plus(X_t_42_273,n1))
| p_Wr(X_t_42_273)
| p_Reset(X_t_42_273) ),
inference(cnfTransformation,[status(thm)],[f_936]) ).
tff(c_973,plain,
~ p_Wr_error(plus(t_139,n1)),
inference(splitRight,[status(thm)],[c_186]) ).
tff(c_1758,plain,
( ~ p_Wr_error(t_139)
| p_Wr(t_139)
| p_Reset(t_139) ),
inference(resolution,[status(thm)],[c_1749,c_973]) ).
tff(c_1774,plain,
( p_Wr(t_139)
| p_Reset(t_139) ),
inference(demodulation,[status(thm),theory(equality)],[c_974,c_1758]) ).
tff(c_1776,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_184,c_182,c_1774]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : HWV026-1 : TPTP v8.1.2. Released v2.5.0.
% 0.13/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.14/0.36 % Computer : n006.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:57:14 EDT 2023
% 0.14/0.36 % CPUTime :
% 6.00/2.42 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.00/2.42
% 6.00/2.42 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.25/2.45
% 6.25/2.45 Inference rules
% 6.25/2.45 ----------------------
% 6.25/2.45 #Ref : 2
% 6.25/2.45 #Sup : 350
% 6.25/2.45 #Fact : 4
% 6.25/2.45 #Define : 0
% 6.25/2.45 #Split : 6
% 6.25/2.45 #Chain : 0
% 6.25/2.45 #Close : 0
% 6.25/2.45
% 6.25/2.45 Ordering : KBO
% 6.25/2.45
% 6.25/2.45 Simplification rules
% 6.25/2.45 ----------------------
% 6.25/2.45 #Subsume : 93
% 6.25/2.45 #Demod : 29
% 6.25/2.45 #Tautology : 83
% 6.25/2.45 #SimpNegUnit : 28
% 6.25/2.45 #BackRed : 0
% 6.25/2.45
% 6.25/2.45 #Partial instantiations: 0
% 6.25/2.45 #Strategies tried : 1
% 6.25/2.45
% 6.25/2.45 Timing (in seconds)
% 6.25/2.45 ----------------------
% 6.25/2.45 Preprocessing : 0.73
% 6.25/2.45 Parsing : 0.38
% 6.25/2.45 CNF conversion : 0.05
% 6.25/2.45 Main loop : 0.65
% 6.25/2.45 Inferencing : 0.21
% 6.25/2.45 Reduction : 0.18
% 6.25/2.45 Demodulation : 0.12
% 6.25/2.45 BG Simplification : 0.06
% 6.25/2.45 Subsumption : 0.17
% 6.25/2.45 Abstraction : 0.02
% 6.25/2.45 MUC search : 0.00
% 6.25/2.45 Cooper : 0.00
% 6.25/2.45 Total : 1.43
% 6.25/2.45 Index Insertion : 0.00
% 6.25/2.45 Index Deletion : 0.00
% 6.25/2.45 Index Matching : 0.00
% 6.25/2.45 BG Taut test : 0.00
%------------------------------------------------------------------------------