%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : HWV018-1 : TPTP v9.0.0. 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 : Wed Apr 9 06:46:46 PM UTC 2025
% Result : Unsatisfiable 12.09s 3.90s
% Output : CNFRefutation 12.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of formulae : 30 ( 16 unt; 0 typ; 0 def)
% Number of atoms : 66 ( 10 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 59 ( 23 ~; 36 |; 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 : 0 ( 0 >; 0 *; 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 : 10 ( 10 !; 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_944,axiom,
~ p_Reset(t_139),
file(unknown,unknown) ).
tff(f_940,axiom,
~ p_Rd(t_139),
file(unknown,unknown) ).
tff(f_136,axiom,
! [X_28] : ~ gt(X_28,X_28),
file(unknown,unknown) ).
tff(f_151,axiom,
! [X_t_33] :
( ( int_level(X_t_33) != fifo_length )
| p_Full(X_t_33) ),
file(unknown,unknown) ).
tff(f_949,axiom,
( ~ p_Full(plus(t_139,n1))
| ~ p_Wr_error(plus(t_139,n1)) ),
file(unknown,unknown) ).
tff(f_941,axiom,
p_Wr(t_139),
file(unknown,unknown) ).
tff(f_942,axiom,
p_Full(t_139),
file(unknown,unknown) ).
tff(f_156,axiom,
! [X_t_34] :
( ( int_level(X_t_34) = fifo_length )
| ~ p_Full(X_t_34) ),
file(unknown,unknown) ).
tff(f_365,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)) = int_level(X_t_42) ) ),
file(unknown,unknown) ).
tff(f_343,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))
| p_Wr_error(plus(X_t_42,n1)) ),
file(unknown,unknown) ).
tff(c_188,plain,
~ p_Reset(t_139),
inference(cnfTransformation,[status(thm)],[f_944]) ).
tff(c_182,plain,
~ p_Rd(t_139),
inference(cnfTransformation,[status(thm)],[f_940]) ).
tff(c_34,plain,
! [X_28_31] : ~ gt(X_28_31,X_28_31),
inference(cnfTransformation,[status(thm)],[f_136]) ).
tff(c_44,plain,
! [X_t_33_36] :
( p_Full(X_t_33_36)
| ( int_level(X_t_33_36) != fifo_length ) ),
inference(cnfTransformation,[status(thm)],[f_151]) ).
tff(c_190,plain,
( ~ p_Wr_error(plus(t_139,n1))
| ~ p_Full(plus(t_139,n1)) ),
inference(cnfTransformation,[status(thm)],[f_949]) ).
tff(c_359,plain,
~ p_Full(plus(t_139,n1)),
inference(splitLeft,[status(thm)],[c_190]) ).
tff(c_363,plain,
int_level(plus(t_139,n1)) != fifo_length,
inference(resolution,[status(thm)],[c_44,c_359]) ).
tff(c_184,plain,
p_Wr(t_139),
inference(cnfTransformation,[status(thm)],[f_941]) ).
tff(c_186,plain,
p_Full(t_139),
inference(cnfTransformation,[status(thm)],[f_942]) ).
tff(c_223,plain,
! [X_t_34_147] :
( ~ p_Full(X_t_34_147)
| ( int_level(X_t_34_147) = fifo_length ) ),
inference(cnfTransformation,[status(thm)],[f_156]) ).
tff(c_227,plain,
int_level(t_139) = fifo_length,
inference(resolution,[status(thm)],[c_186,c_223]) ).
tff(c_5091,plain,
! [X_t_42_322] :
( ( int_level(plus(X_t_42_322,n1)) = int_level(X_t_42_322) )
| gt(fifo_length,int_level(X_t_42_322))
| p_Rd(X_t_42_322)
| ~ p_Wr(X_t_42_322)
| p_Reset(X_t_42_322) ),
inference(cnfTransformation,[status(thm)],[f_365]) ).
tff(c_5115,plain,
( ( int_level(plus(t_139,n1)) = int_level(t_139) )
| gt(fifo_length,fifo_length)
| p_Rd(t_139)
| ~ p_Wr(t_139)
| p_Reset(t_139) ),
inference(superposition,[status(thm),theory(equality)],[c_227,c_5091]) ).
tff(c_5123,plain,
( ( int_level(plus(t_139,n1)) = fifo_length )
| gt(fifo_length,fifo_length)
| p_Rd(t_139)
| p_Reset(t_139) ),
inference(demodulation,[status(thm),theory(equality)],[c_184,c_227,c_5115]) ).
tff(c_5125,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_188,c_182,c_34,c_363,c_5123]) ).
tff(c_5126,plain,
~ p_Wr_error(plus(t_139,n1)),
inference(splitRight,[status(thm)],[c_190]) ).
tff(c_7421,plain,
! [X_t_42_420] :
( p_Wr_error(plus(X_t_42_420,n1))
| gt(fifo_length,int_level(X_t_42_420))
| p_Rd(X_t_42_420)
| ~ p_Wr(X_t_42_420)
| p_Reset(X_t_42_420) ),
inference(cnfTransformation,[status(thm)],[f_343]) ).
tff(c_7442,plain,
( p_Wr_error(plus(t_139,n1))
| gt(fifo_length,fifo_length)
| p_Rd(t_139)
| ~ p_Wr(t_139)
| p_Reset(t_139) ),
inference(superposition,[status(thm),theory(equality)],[c_227,c_7421]) ).
tff(c_7449,plain,
( p_Wr_error(plus(t_139,n1))
| gt(fifo_length,fifo_length)
| p_Rd(t_139)
| p_Reset(t_139) ),
inference(demodulation,[status(thm),theory(equality)],[c_184,c_7442]) ).
tff(c_7451,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_188,c_182,c_34,c_5126,c_7449]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14 % Problem : HWV018-1 : TPTP v9.0.0. Released v2.5.0.
% 0.09/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 : n014.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 : Mon Apr 7 22:56:04 EDT 2025
% 0.14/0.36 % CPUTime :
% 12.09/3.90 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 12.09/3.91
% 12.09/3.91 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------