TSTP Solution File: HWV028-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : HWV028-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 : n014.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:30 EDT 2023
% Result : Unsatisfiable 4.27s 2.15s
% Output : CNFRefutation 4.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 30
% Syntax : Number of formulae : 43 ( 14 unt; 23 typ; 0 def)
% Number of atoms : 28 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 19 ( 11 ~; 8 |; 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 : 13 (; 13 !; 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_940,axiom,
gt(level(plus(t_139,n1)),fifo_length),
file(unknown,unknown) ).
tff(f_941,axiom,
gt(fifo_length,n0),
file(unknown,unknown) ).
tff(f_118,axiom,
! [Z_21,Y_20,X_19] :
( ~ gt(Z_21,Y_20)
| gt(Z_21,X_19)
| ~ gt(Y_20,X_19) ),
file(unknown,unknown) ).
tff(f_136,axiom,
! [X_28] : ~ gt(X_28,X_28),
file(unknown,unknown) ).
tff(c_182,plain,
p_Reset(t_139),
inference(cnfTransformation,[status(thm)],[f_939]) ).
tff(c_276,plain,
! [X_t_37_157] :
( ( int_level(plus(X_t_37_157,n1)) = n0 )
| ~ p_Reset(X_t_37_157) ),
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,
gt(level(plus(t_139,n1)),fifo_length),
inference(cnfTransformation,[status(thm)],[f_940]) ).
tff(c_187,plain,
gt(int_level(plus(t_139,n1)),fifo_length),
inference(demodulation,[status(thm),theory(equality)],[c_42,c_184]) ).
tff(c_282,plain,
( gt(n0,fifo_length)
| ~ p_Reset(t_139) ),
inference(superposition,[status(thm),theory(equality)],[c_276,c_187]) ).
tff(c_292,plain,
gt(n0,fifo_length),
inference(demodulation,[status(thm),theory(equality)],[c_182,c_282]) ).
tff(c_186,plain,
gt(fifo_length,n0),
inference(cnfTransformation,[status(thm)],[f_941]) ).
tff(c_484,plain,
! [Y_20_179,X_19_180,Z_21_181] :
( ~ gt(Y_20_179,X_19_180)
| gt(Z_21_181,X_19_180)
| ~ gt(Z_21_181,Y_20_179) ),
inference(cnfTransformation,[status(thm)],[f_118]) ).
tff(c_515,plain,
! [Z_21_182] :
( gt(Z_21_182,n0)
| ~ gt(Z_21_182,fifo_length) ),
inference(resolution,[status(thm)],[c_186,c_484]) ).
tff(c_34,plain,
! [X_28_31] : ~ gt(X_28_31,X_28_31),
inference(cnfTransformation,[status(thm)],[f_136]) ).
tff(c_524,plain,
~ gt(n0,fifo_length),
inference(resolution,[status(thm)],[c_515,c_34]) ).
tff(c_530,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_292,c_524]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : HWV028-1 : TPTP v8.1.2. Released v2.5.0.
% 0.00/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 : n014.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:54:03 EDT 2023
% 0.13/0.35 % CPUTime :
% 4.27/2.15 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.27/2.15
% 4.27/2.15 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.27/2.18
% 4.27/2.18 Inference rules
% 4.27/2.18 ----------------------
% 4.27/2.18 #Ref : 1
% 4.27/2.18 #Sup : 74
% 4.27/2.18 #Fact : 2
% 4.27/2.18 #Define : 0
% 4.27/2.18 #Split : 1
% 4.27/2.18 #Chain : 0
% 4.27/2.18 #Close : 0
% 4.27/2.18
% 4.27/2.18 Ordering : KBO
% 4.27/2.18
% 4.27/2.18 Simplification rules
% 4.27/2.18 ----------------------
% 4.27/2.18 #Subsume : 17
% 4.27/2.18 #Demod : 6
% 4.27/2.18 #Tautology : 24
% 4.27/2.18 #SimpNegUnit : 2
% 4.27/2.18 #BackRed : 0
% 4.27/2.18
% 4.27/2.18 #Partial instantiations: 0
% 4.27/2.18 #Strategies tried : 1
% 4.27/2.18
% 4.27/2.18 Timing (in seconds)
% 4.27/2.18 ----------------------
% 4.27/2.18 Preprocessing : 0.73
% 4.27/2.18 Parsing : 0.37
% 4.27/2.18 CNF conversion : 0.05
% 4.27/2.18 Main loop : 0.39
% 4.27/2.18 Inferencing : 0.10
% 4.27/2.18 Reduction : 0.13
% 4.27/2.18 Demodulation : 0.09
% 4.27/2.18 BG Simplification : 0.05
% 4.27/2.18 Subsumption : 0.12
% 4.27/2.18 Abstraction : 0.02
% 4.27/2.18 MUC search : 0.00
% 4.27/2.18 Cooper : 0.00
% 4.27/2.18 Total : 1.17
% 4.27/2.18 Index Insertion : 0.00
% 4.27/2.18 Index Deletion : 0.00
% 4.27/2.18 Index Matching : 0.00
% 4.27/2.18 BG Taut test : 0.00
%------------------------------------------------------------------------------