TSTP Solution File: HWV011-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : HWV011-3 : 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 : n011.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:25 EDT 2023
% Result : Unsatisfiable 4.85s 2.28s
% Output : CNFRefutation 4.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 53
% Syntax : Number of formulae : 60 ( 9 unt; 49 typ; 0 def)
% Number of atoms : 13 ( 8 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 5 ~; 2 |; 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 : 63 ( 41 >; 22 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 46 ( 46 usr; 8 con; 0-3 aty)
% Number of variables : 4 (; 4 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ p_LES_EQU_ > def_89 > p__pred_ > f__slice_ > fstd_DOTstandard_DOTmod_ > f__xor_ > f__xnor_ > f__or_ > f__nor_ > f__nand_ > f__lt_ > f__leq_ > f__index_ > f__gt_ > f__geq_ > f__equiv_ > f__equal_ > f__cons_ > f__concat_ > f__and_ > f_SUB_ > f_ADD_ > #nlpp > y_105 > length > fwork_DOTfifo_DOTrtl_DOTwr__level_ > fwork_DOTfifo_DOTrtl_DOTwr__error_ > fwork_DOTfifo_DOTrtl_DOTwr_ > fwork_DOTfifo_DOTrtl_DOTreset_ > fwork_DOTfifo_DOTrtl_DOTrd__level_ > fwork_DOTfifo_DOTrtl_DOTrd__error_ > fwork_DOTfifo_DOTrtl_DOTrd_ > fwork_DOTfifo_DOTrtl_DOTmem_ > fwork_DOTfifo_DOTrtl_DOTlevel_ > fwork_DOTfifo_DOTrtl_DOTint__level_ > fwork_DOTfifo_DOTrtl_DOTfull_ > fwork_DOTfifo_DOTrtl_DOTempty_ > fwork_DOTfifo_DOTrtl_DOTdata__out_ > fwork_DOTfifo_DOTrtl_DOTdata__in_ > f__others_ > f__not_ > f__length_ > t_206 > n1 > n0 > fwork_DOTfifo_DOTrtl_DOTfifo__width_ > fwork_DOTfifo_DOTrtl_DOTfifo__length_ > f__true_ > f__false_ > f__empty_
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(fstd_DOTstandard_DOTmod_,type,
fstd_DOTstandard_DOTmod_: ( $i * $i ) > $i ).
tff(p_LES_EQU_,type,
p_LES_EQU_: ( $i * $i ) > $o ).
tff(f__nor_,type,
f__nor_: ( $i * $i ) > $i ).
tff(f__others_,type,
f__others_: $i > $i ).
tff(fwork_DOTfifo_DOTrtl_DOTlevel_,type,
fwork_DOTfifo_DOTrtl_DOTlevel_: $i > $i ).
tff(f__not_,type,
f__not_: $i > $i ).
tff(f__empty_,type,
f__empty_: $i ).
tff(f__index_,type,
f__index_: ( $i * $i ) > $i ).
tff(f__leq_,type,
f__leq_: ( $i * $i ) > $i ).
tff(fwork_DOTfifo_DOTrtl_DOTdata__in_,type,
fwork_DOTfifo_DOTrtl_DOTdata__in_: $i > $i ).
tff(f__equal_,type,
f__equal_: ( $i * $i ) > $i ).
tff(f__or_,type,
f__or_: ( $i * $i ) > $i ).
tff(fwork_DOTfifo_DOTrtl_DOTwr__level_,type,
fwork_DOTfifo_DOTrtl_DOTwr__level_: $i > $i ).
tff(fwork_DOTfifo_DOTrtl_DOTrd__level_,type,
fwork_DOTfifo_DOTrtl_DOTrd__level_: $i > $i ).
tff(fwork_DOTfifo_DOTrtl_DOTwr__error_,type,
fwork_DOTfifo_DOTrtl_DOTwr__error_: $i > $i ).
tff(f__and_,type,
f__and_: ( $i * $i ) > $i ).
tff(fwork_DOTfifo_DOTrtl_DOTrd__error_,type,
fwork_DOTfifo_DOTrtl_DOTrd__error_: $i > $i ).
tff(fwork_DOTfifo_DOTrtl_DOTdata__out_,type,
fwork_DOTfifo_DOTrtl_DOTdata__out_: $i > $i ).
tff(fwork_DOTfifo_DOTrtl_DOTint__level_,type,
fwork_DOTfifo_DOTrtl_DOTint__level_: $i > $i ).
tff(fwork_DOTfifo_DOTrtl_DOTfifo__width_,type,
fwork_DOTfifo_DOTrtl_DOTfifo__width_: $i ).
tff(fwork_DOTfifo_DOTrtl_DOTwr_,type,
fwork_DOTfifo_DOTrtl_DOTwr_: $i > $i ).
tff(y_105,type,
y_105: $i > $i ).
tff(f_ADD_,type,
f_ADD_: ( $i * $i ) > $i ).
tff(n1,type,
n1: $i ).
tff(f_SUB_,type,
f_SUB_: ( $i * $i ) > $i ).
tff(f__geq_,type,
f__geq_: ( $i * $i ) > $i ).
tff(fwork_DOTfifo_DOTrtl_DOTfifo__length_,type,
fwork_DOTfifo_DOTrtl_DOTfifo__length_: $i ).
tff(f__false_,type,
f__false_: $i ).
tff(f__concat_,type,
f__concat_: ( $i * $i ) > $i ).
tff(f__length_,type,
f__length_: $i > $i ).
tff(f__slice_,type,
f__slice_: ( $i * $i * $i ) > $i ).
tff(f__xor_,type,
f__xor_: ( $i * $i ) > $i ).
tff(n0,type,
n0: $i ).
tff(fwork_DOTfifo_DOTrtl_DOTreset_,type,
fwork_DOTfifo_DOTrtl_DOTreset_: $i > $i ).
tff(f__equiv_,type,
f__equiv_: ( $i * $i ) > $i ).
tff(f__lt_,type,
f__lt_: ( $i * $i ) > $i ).
tff(f__gt_,type,
f__gt_: ( $i * $i ) > $i ).
tff(p__pred_,type,
p__pred_: $i > $o ).
tff(f__true_,type,
f__true_: $i ).
tff(f__xnor_,type,
f__xnor_: ( $i * $i ) > $i ).
tff(fwork_DOTfifo_DOTrtl_DOTempty_,type,
fwork_DOTfifo_DOTrtl_DOTempty_: $i > $i ).
tff(fwork_DOTfifo_DOTrtl_DOTrd_,type,
fwork_DOTfifo_DOTrtl_DOTrd_: $i > $i ).
tff(t_206,type,
t_206: $i ).
tff(f__cons_,type,
f__cons_: ( $i * $i ) > $i ).
tff(f__nand_,type,
f__nand_: ( $i * $i ) > $i ).
tff(def_89,type,
def_89: ( $i * $i ) > $o ).
tff(fwork_DOTfifo_DOTrtl_DOTmem_,type,
fwork_DOTfifo_DOTrtl_DOTmem_: $i > $i ).
tff(fwork_DOTfifo_DOTrtl_DOTfull_,type,
fwork_DOTfifo_DOTrtl_DOTfull_: $i > $i ).
tff(length,type,
length: $i > $i ).
tff(f_53,axiom,
! [T_0] : ( fwork_DOTfifo_DOTrtl_DOTlevel_(T_0) = fwork_DOTfifo_DOTrtl_DOTint__level_(T_0) ),
file(unknown,unknown) ).
tff(f_1059,axiom,
fwork_DOTfifo_DOTrtl_DOTlevel_(t_206) = fwork_DOTfifo_DOTrtl_DOTfifo__length_,
file(unknown,unknown) ).
tff(f_58,axiom,
! [T_1] :
( p__pred_(fwork_DOTfifo_DOTrtl_DOTfull_(T_1))
| ( fwork_DOTfifo_DOTrtl_DOTint__level_(T_1) != fwork_DOTfifo_DOTrtl_DOTfifo__length_ ) ),
file(unknown,unknown) ).
tff(f_1061,axiom,
~ p__pred_(fwork_DOTfifo_DOTrtl_DOTfull_(t_206)),
file(unknown,unknown) ).
tff(c_296,plain,
! [T_0_230] : ( fwork_DOTfifo_DOTrtl_DOTlevel_(T_0_230) = fwork_DOTfifo_DOTrtl_DOTint__level_(T_0_230) ),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_268,plain,
fwork_DOTfifo_DOTrtl_DOTlevel_(t_206) = fwork_DOTfifo_DOTrtl_DOTfifo__length_,
inference(cnfTransformation,[status(thm)],[f_1059]) ).
tff(c_302,plain,
fwork_DOTfifo_DOTrtl_DOTint__level_(t_206) = fwork_DOTfifo_DOTrtl_DOTfifo__length_,
inference(superposition,[status(thm),theory(equality)],[c_296,c_268]) ).
tff(c_394,plain,
! [T_1_265] :
( ( fwork_DOTfifo_DOTrtl_DOTint__level_(T_1_265) != fwork_DOTfifo_DOTrtl_DOTfifo__length_ )
| p__pred_(fwork_DOTfifo_DOTrtl_DOTfull_(T_1_265)) ),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_270,plain,
~ p__pred_(fwork_DOTfifo_DOTrtl_DOTfull_(t_206)),
inference(cnfTransformation,[status(thm)],[f_1061]) ).
tff(c_400,plain,
fwork_DOTfifo_DOTrtl_DOTint__level_(t_206) != fwork_DOTfifo_DOTrtl_DOTfifo__length_,
inference(resolution,[status(thm)],[c_394,c_270]) ).
tff(c_405,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_302,c_400]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.14/0.15 % Problem : HWV011-3 : TPTP v8.1.2. Released v2.5.0.
% 0.14/0.16 % 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.15/0.37 % Computer : n011.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu Aug 3 23:44:21 EDT 2023
% 0.15/0.37 % CPUTime :
% 4.85/2.28 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.85/2.28
% 4.85/2.28 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.85/2.31
% 4.85/2.31 Inference rules
% 4.85/2.31 ----------------------
% 4.85/2.31 #Ref : 0
% 4.85/2.31 #Sup : 28
% 4.85/2.31 #Fact : 0
% 4.85/2.31 #Define : 0
% 4.85/2.31 #Split : 0
% 4.85/2.31 #Chain : 0
% 4.85/2.31 #Close : 0
% 4.85/2.31
% 4.85/2.31 Ordering : KBO
% 4.85/2.31
% 4.85/2.31 Simplification rules
% 4.85/2.31 ----------------------
% 4.85/2.31 #Subsume : 2
% 4.85/2.31 #Demod : 3
% 4.85/2.31 #Tautology : 21
% 4.85/2.31 #SimpNegUnit : 0
% 4.85/2.31 #BackRed : 0
% 4.85/2.31
% 4.85/2.31 #Partial instantiations: 0
% 4.85/2.31 #Strategies tried : 1
% 4.85/2.31
% 4.85/2.31 Timing (in seconds)
% 4.85/2.31 ----------------------
% 4.85/2.31 Preprocessing : 0.83
% 4.85/2.31 Parsing : 0.43
% 4.85/2.31 CNF conversion : 0.06
% 4.85/2.31 Main loop : 0.38
% 4.85/2.31 Inferencing : 0.08
% 4.85/2.31 Reduction : 0.15
% 4.85/2.31 Demodulation : 0.11
% 4.85/2.31 BG Simplification : 0.06
% 4.85/2.31 Subsumption : 0.10
% 4.85/2.31 Abstraction : 0.02
% 4.85/2.31 MUC search : 0.00
% 4.85/2.31 Cooper : 0.00
% 4.85/2.31 Total : 1.26
% 4.85/2.31 Index Insertion : 0.00
% 4.85/2.31 Index Deletion : 0.00
% 4.85/2.31 Index Matching : 0.00
% 4.85/2.31 BG Taut test : 0.00
%------------------------------------------------------------------------------