TSTP Solution File: ALG069-10 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ALG069-10 : TPTP v8.1.2. Released v7.3.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 : n028.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:31:04 EDT 2023
% Result : Unsatisfiable 4.71s 2.31s
% Output : CNFRefutation 5.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 22
% Syntax : Number of formulae : 46 ( 34 unt; 12 typ; 0 def)
% Number of atoms : 34 ( 33 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 19 ( 10 >; 9 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 2 con; 0-4 aty)
% Number of variables : 28 (; 28 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ ifeq2 > ifeq > tuple > op2 > op1 > #nlpp > sorti2 > sorti1 > sK2_ax3_V > j > h > true > sK1_ax4_U
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(sK2_ax3_V,type,
sK2_ax3_V: $i > $i ).
tff(sorti1,type,
sorti1: $i > $i ).
tff(tuple,type,
tuple: ( $i * $i ) > $i ).
tff(ifeq2,type,
ifeq2: ( $i * $i * $i * $i ) > $i ).
tff(op2,type,
op2: ( $i * $i ) > $i ).
tff(sorti2,type,
sorti2: $i > $i ).
tff(op1,type,
op1: ( $i * $i ) > $i ).
tff(h,type,
h: $i > $i ).
tff(sK1_ax4_U,type,
sK1_ax4_U: $i ).
tff(true,type,
true: $i ).
tff(j,type,
j: $i > $i ).
tff(ifeq,type,
ifeq: ( $i * $i * $i * $i ) > $i ).
tff(f_38,axiom,
sorti2(sK1_ax4_U) = true,
file(unknown,unknown) ).
tff(f_46,axiom,
! [V] : ( ifeq(sorti2(V),true,sorti1(j(V)),true) = true ),
file(unknown,unknown) ).
tff(f_26,axiom,
! [A,B,C] : ( ifeq(A,A,B,C) = B ),
file(unknown,unknown) ).
tff(f_32,axiom,
! [U] : ( ifeq(sorti1(U),true,sorti1(sK2_ax3_V(U)),true) = true ),
file(unknown,unknown) ).
tff(f_40,axiom,
! [U] : ( ifeq(sorti1(U),true,sorti2(h(U)),true) = true ),
file(unknown,unknown) ).
tff(f_50,axiom,
! [X1] : ( ifeq2(sorti2(X1),true,h(j(X1)),X1) = X1 ),
file(unknown,unknown) ).
tff(f_24,axiom,
! [A,B,C] : ( ifeq2(A,A,B,C) = B ),
file(unknown,unknown) ).
tff(f_34,axiom,
! [U] : ( ifeq2(sorti1(U),true,op1(sK2_ax3_V(U),sK2_ax3_V(U)),U) = U ),
file(unknown,unknown) ).
tff(f_42,axiom,
! [X,W] : ( ifeq2(sorti1(X),true,ifeq2(sorti1(W),true,op2(h(W),h(X)),h(op1(W,X))),h(op1(W,X))) = h(op1(W,X)) ),
file(unknown,unknown) ).
tff(f_37,axiom,
! [V] : ( tuple(op2(V,V),sorti2(V)) != tuple(sK1_ax4_U,true) ),
file(unknown,unknown) ).
tff(c_16,plain,
sorti2(sK1_ax4_U) = true,
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_78,plain,
! [V_32] : ( ifeq(sorti2(V_32),true,sorti1(j(V_32)),true) = true ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_85,plain,
ifeq(true,true,sorti1(j(sK1_ax4_U)),true) = true,
inference(superposition,[status(thm),theory(equality)],[c_16,c_78]) ).
tff(c_4,plain,
! [A_4,B_5,C_6] : ( ifeq(A_4,A_4,B_5,C_6) = B_5 ),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_103,plain,
sorti1(j(sK1_ax4_U)) = true,
inference(superposition,[status(thm),theory(equality)],[c_85,c_4]) ).
tff(c_10,plain,
! [U_11] : ( ifeq(sorti1(U_11),true,sorti1(sK2_ax3_V(U_11)),true) = true ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_121,plain,
ifeq(true,true,sorti1(sK2_ax3_V(j(sK1_ax4_U))),true) = true,
inference(superposition,[status(thm),theory(equality)],[c_103,c_10]) ).
tff(c_174,plain,
sorti1(sK2_ax3_V(j(sK1_ax4_U))) = true,
inference(superposition,[status(thm),theory(equality)],[c_121,c_4]) ).
tff(c_18,plain,
! [U_14] : ( ifeq(sorti1(U_14),true,sorti2(h(U_14)),true) = true ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_189,plain,
ifeq(true,true,sorti2(h(sK2_ax3_V(j(sK1_ax4_U)))),true) = true,
inference(superposition,[status(thm),theory(equality)],[c_174,c_18]) ).
tff(c_428,plain,
sorti2(h(sK2_ax3_V(j(sK1_ax4_U)))) = true,
inference(superposition,[status(thm),theory(equality)],[c_189,c_4]) ).
tff(c_88,plain,
! [X1_33] : ( ifeq2(sorti2(X1_33),true,h(j(X1_33)),X1_33) = X1_33 ),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_97,plain,
ifeq2(true,true,h(j(sK1_ax4_U)),sK1_ax4_U) = sK1_ax4_U,
inference(superposition,[status(thm),theory(equality)],[c_16,c_88]) ).
tff(c_2,plain,
! [A_1,B_2,C_3] : ( ifeq2(A_1,A_1,B_2,C_3) = B_2 ),
inference(cnfTransformation,[status(thm)],[f_24]) ).
tff(c_133,plain,
h(j(sK1_ax4_U)) = sK1_ax4_U,
inference(superposition,[status(thm),theory(equality)],[c_97,c_2]) ).
tff(c_158,plain,
! [U_34] : ( ifeq2(sorti1(U_34),true,op1(sK2_ax3_V(U_34),sK2_ax3_V(U_34)),U_34) = U_34 ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_167,plain,
ifeq2(true,true,op1(sK2_ax3_V(j(sK1_ax4_U)),sK2_ax3_V(j(sK1_ax4_U))),j(sK1_ax4_U)) = j(sK1_ax4_U),
inference(superposition,[status(thm),theory(equality)],[c_103,c_158]) ).
tff(c_1899,plain,
op1(sK2_ax3_V(j(sK1_ax4_U)),sK2_ax3_V(j(sK1_ax4_U))) = j(sK1_ax4_U),
inference(superposition,[status(thm),theory(equality)],[c_167,c_2]) ).
tff(c_20,plain,
! [X_15,W_16] : ( ifeq2(sorti1(X_15),true,ifeq2(sorti1(W_16),true,op2(h(W_16),h(X_15)),h(op1(W_16,X_15))),h(op1(W_16,X_15))) = h(op1(W_16,X_15)) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_1960,plain,
ifeq2(sorti1(sK2_ax3_V(j(sK1_ax4_U))),true,ifeq2(sorti1(sK2_ax3_V(j(sK1_ax4_U))),true,op2(h(sK2_ax3_V(j(sK1_ax4_U))),h(sK2_ax3_V(j(sK1_ax4_U)))),h(op1(sK2_ax3_V(j(sK1_ax4_U)),sK2_ax3_V(j(sK1_ax4_U))))),h(j(sK1_ax4_U))) = h(op1(sK2_ax3_V(j(sK1_ax4_U)),sK2_ax3_V(j(sK1_ax4_U)))),
inference(superposition,[status(thm),theory(equality)],[c_1899,c_20]) ).
tff(c_1971,plain,
op2(h(sK2_ax3_V(j(sK1_ax4_U))),h(sK2_ax3_V(j(sK1_ax4_U)))) = sK1_ax4_U,
inference(demodulation,[status(thm),theory(equality)],[c_133,c_1899,c_2,c_174,c_2,c_174,c_133,c_1960]) ).
tff(c_14,plain,
! [V_13] : ( tuple(op2(V_13,V_13),sorti2(V_13)) != tuple(sK1_ax4_U,true) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_1991,plain,
tuple(sK1_ax4_U,sorti2(h(sK2_ax3_V(j(sK1_ax4_U))))) != tuple(sK1_ax4_U,true),
inference(superposition,[status(thm),theory(equality)],[c_1971,c_14]) ).
tff(c_2000,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_428,c_1991]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : ALG069-10 : TPTP v8.1.2. Released v7.3.0.
% 0.00/0.14 % 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.35 % Computer : n028.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 20:31:54 EDT 2023
% 0.14/0.35 % CPUTime :
% 4.71/2.31 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.71/2.31
% 4.71/2.31 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.00/2.35
% 5.00/2.35 Inference rules
% 5.00/2.35 ----------------------
% 5.00/2.35 #Ref : 0
% 5.00/2.35 #Sup : 595
% 5.00/2.35 #Fact : 0
% 5.00/2.35 #Define : 0
% 5.00/2.35 #Split : 0
% 5.00/2.35 #Chain : 0
% 5.00/2.35 #Close : 0
% 5.00/2.35
% 5.00/2.35 Ordering : KBO
% 5.00/2.35
% 5.00/2.35 Simplification rules
% 5.00/2.35 ----------------------
% 5.00/2.35 #Subsume : 0
% 5.00/2.35 #Demod : 425
% 5.00/2.35 #Tautology : 288
% 5.00/2.35 #SimpNegUnit : 0
% 5.00/2.35 #BackRed : 27
% 5.00/2.35
% 5.00/2.35 #Partial instantiations: 0
% 5.00/2.35 #Strategies tried : 1
% 5.00/2.35
% 5.00/2.35 Timing (in seconds)
% 5.00/2.35 ----------------------
% 5.00/2.35 Preprocessing : 0.46
% 5.00/2.35 Parsing : 0.26
% 5.00/2.35 CNF conversion : 0.02
% 5.00/2.35 Main loop : 0.71
% 5.00/2.35 Inferencing : 0.24
% 5.00/2.35 Reduction : 0.27
% 5.00/2.36 Demodulation : 0.20
% 5.00/2.36 BG Simplification : 0.03
% 5.00/2.36 Subsumption : 0.12
% 5.00/2.36 Abstraction : 0.03
% 5.00/2.36 MUC search : 0.00
% 5.00/2.36 Cooper : 0.00
% 5.00/2.36 Total : 1.23
% 5.00/2.36 Index Insertion : 0.00
% 5.00/2.36 Index Deletion : 0.00
% 5.00/2.36 Index Matching : 0.00
% 5.00/2.36 BG Taut test : 0.00
%------------------------------------------------------------------------------