TSTP Solution File: HWV010-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : HWV010-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 : n019.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:24 EDT 2023
% Result : Unsatisfiable 4.21s 2.31s
% Output : CNFRefutation 4.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 28
% Syntax : Number of formulae : 43 ( 10 unt; 23 typ; 0 def)
% Number of atoms : 30 ( 16 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 23 ( 13 ~; 10 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 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 : 14 ( 12 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 6 (; 6 !; 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_146,axiom,
! [X_t_32] : ( level(X_t_32) = int_level(X_t_32) ),
file(unknown,unknown) ).
tff(f_943,axiom,
( ~ p_Empty(t_139)
| ( level(t_139) != n0 ) ),
file(unknown,unknown) ).
tff(f_946,axiom,
( p_Empty(t_139)
| ( level(t_139) = n0 ) ),
file(unknown,unknown) ).
tff(f_161,axiom,
! [X_t_35] :
( ( int_level(X_t_35) != n0 )
| p_Empty(X_t_35) ),
file(unknown,unknown) ).
tff(f_166,axiom,
! [X_t_36] :
( ( int_level(X_t_36) = n0 )
| ~ p_Empty(X_t_36) ),
file(unknown,unknown) ).
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_182,plain,
( ( level(t_139) != n0 )
| ~ p_Empty(t_139) ),
inference(cnfTransformation,[status(thm)],[f_943]) ).
tff(c_186,plain,
( ( int_level(t_139) != n0 )
| ~ p_Empty(t_139) ),
inference(demodulation,[status(thm),theory(equality)],[c_42,c_182]) ).
tff(c_213,plain,
~ p_Empty(t_139),
inference(splitLeft,[status(thm)],[c_186]) ).
tff(c_184,plain,
( ( level(t_139) = n0 )
| p_Empty(t_139) ),
inference(cnfTransformation,[status(thm)],[f_946]) ).
tff(c_185,plain,
( ( int_level(t_139) = n0 )
| p_Empty(t_139) ),
inference(demodulation,[status(thm),theory(equality)],[c_42,c_184]) ).
tff(c_242,plain,
int_level(t_139) = n0,
inference(negUnitSimplification,[status(thm)],[c_213,c_185]) ).
tff(c_233,plain,
! [X_t_35_150] :
( p_Empty(X_t_35_150)
| ( int_level(X_t_35_150) != n0 ) ),
inference(cnfTransformation,[status(thm)],[f_161]) ).
tff(c_241,plain,
int_level(t_139) != n0,
inference(resolution,[status(thm)],[c_233,c_213]) ).
tff(c_248,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_242,c_241]) ).
tff(c_249,plain,
int_level(t_139) != n0,
inference(splitRight,[status(thm)],[c_186]) ).
tff(c_250,plain,
p_Empty(t_139),
inference(splitRight,[status(thm)],[c_186]) ).
tff(c_257,plain,
! [X_t_36_153] :
( ~ p_Empty(X_t_36_153)
| ( int_level(X_t_36_153) = n0 ) ),
inference(cnfTransformation,[status(thm)],[f_166]) ).
tff(c_260,plain,
int_level(t_139) = n0,
inference(resolution,[status(thm)],[c_250,c_257]) ).
tff(c_264,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_249,c_260]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.25 % Problem : HWV010-1 : TPTP v8.1.2. Released v2.5.0.
% 0.13/0.26 % 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.14/0.52 % Computer : n019.cluster.edu
% 0.14/0.52 % Model : x86_64 x86_64
% 0.14/0.52 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.52 % Memory : 8042.1875MB
% 0.14/0.52 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.52 % CPULimit : 300
% 0.14/0.52 % WCLimit : 300
% 0.14/0.52 % DateTime : Thu Aug 3 23:59:46 EDT 2023
% 0.14/0.53 % CPUTime :
% 4.21/2.31 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.21/2.31
% 4.21/2.31 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.21/2.34
% 4.21/2.34 Inference rules
% 4.21/2.34 ----------------------
% 4.21/2.34 #Ref : 0
% 4.21/2.34 #Sup : 14
% 4.21/2.34 #Fact : 0
% 4.21/2.34 #Define : 0
% 4.21/2.34 #Split : 1
% 4.21/2.34 #Chain : 0
% 4.21/2.34 #Close : 0
% 4.21/2.34
% 4.21/2.34 Ordering : KBO
% 4.21/2.34
% 4.21/2.34 Simplification rules
% 4.21/2.34 ----------------------
% 4.21/2.34 #Subsume : 1
% 4.21/2.34 #Demod : 4
% 4.21/2.34 #Tautology : 10
% 4.21/2.34 #SimpNegUnit : 2
% 4.21/2.34 #BackRed : 0
% 4.21/2.34
% 4.21/2.34 #Partial instantiations: 0
% 4.21/2.34 #Strategies tried : 1
% 4.21/2.34
% 4.21/2.34 Timing (in seconds)
% 4.21/2.34 ----------------------
% 4.21/2.34 Preprocessing : 0.72
% 4.21/2.34 Parsing : 0.38
% 4.21/2.34 CNF conversion : 0.05
% 4.21/2.34 Main loop : 0.31
% 4.21/2.35 Inferencing : 0.06
% 4.21/2.35 Reduction : 0.10
% 4.21/2.35 Demodulation : 0.07
% 4.21/2.35 BG Simplification : 0.05
% 4.21/2.35 Subsumption : 0.10
% 4.21/2.35 Abstraction : 0.01
% 4.21/2.35 MUC search : 0.00
% 4.21/2.35 Cooper : 0.00
% 4.21/2.35 Total : 1.08
% 4.21/2.35 Index Insertion : 0.00
% 4.21/2.35 Index Deletion : 0.00
% 4.21/2.35 Index Matching : 0.00
% 4.21/2.35 BG Taut test : 0.00
%------------------------------------------------------------------------------