TSTP Solution File: ANA010-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ANA010-2 : TPTP v8.1.2. Released v3.2.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 : n001.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:32:46 EDT 2023
% Result : Unsatisfiable 3.20s 1.89s
% Output : CNFRefutation 3.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 21
% Syntax : Number of formulae : 43 ( 17 unt; 12 typ; 0 def)
% Number of atoms : 52 ( 6 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 49 ( 28 ~; 21 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 14 ( 9 >; 5 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 37 (; 37 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_lessequals > class_Ring__and__Field_Oordered__idom > class_Orderings_Oorder > class_OrderedGroup_Olordered__ab__group__abs > c_times > c_HOL_Oabs > #nlpp > v_x > v_g > v_f > v_c > t_b > c_0
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(v_c,type,
v_c: $i ).
tff(class_OrderedGroup_Olordered__ab__group__abs,type,
class_OrderedGroup_Olordered__ab__group__abs: $i > $o ).
tff(class_Orderings_Oorder,type,
class_Orderings_Oorder: $i > $o ).
tff(c_HOL_Oabs,type,
c_HOL_Oabs: ( $i * $i ) > $i ).
tff(c_0,type,
c_0: $i ).
tff(c_times,type,
c_times: ( $i * $i * $i ) > $i ).
tff(class_Ring__and__Field_Oordered__idom,type,
class_Ring__and__Field_Oordered__idom: $i > $o ).
tff(c_lessequals,type,
c_lessequals: ( $i * $i * $i ) > $o ).
tff(v_g,type,
v_g: $i > $i ).
tff(v_x,type,
v_x: $i > $i ).
tff(v_f,type,
v_f: $i > $i ).
tff(t_b,type,
t_b: $i ).
tff(f_53,axiom,
! [V_U] : c_lessequals(v_f(V_U),c_times(v_c,v_g(V_U),t_b),t_b),
file(unknown,unknown) ).
tff(f_67,axiom,
class_Ring__and__Field_Oordered__idom(t_b),
file(unknown,unknown) ).
tff(f_66,axiom,
! [T] :
( ~ class_Ring__and__Field_Oordered__idom(T)
| class_OrderedGroup_Olordered__ab__group__abs(T) ),
file(unknown,unknown) ).
tff(f_61,axiom,
! [T] :
( ~ class_OrderedGroup_Olordered__ab__group__abs(T)
| class_Orderings_Oorder(T) ),
file(unknown,unknown) ).
tff(f_51,axiom,
! [V_U] : c_lessequals(c_0,v_f(V_U),t_b),
file(unknown,unknown) ).
tff(f_44,axiom,
! [T_a,V_y,V_z,V_x] :
( ~ class_Orderings_Oorder(T_a)
| ~ c_lessequals(V_y,V_z,T_a)
| ~ c_lessequals(V_x,V_y,T_a)
| c_lessequals(V_x,V_z,T_a) ),
file(unknown,unknown) ).
tff(f_33,axiom,
! [T_a,V_y] :
( ~ class_OrderedGroup_Olordered__ab__group__abs(T_a)
| ~ c_lessequals(c_0,V_y,T_a)
| ( c_HOL_Oabs(V_y,T_a) = V_y ) ),
file(unknown,unknown) ).
tff(f_49,axiom,
! [T_a,V_a,V_b] :
( ~ class_Ring__and__Field_Oordered__idom(T_a)
| ( c_HOL_Oabs(c_times(V_a,V_b,T_a),T_a) = c_times(c_HOL_Oabs(V_a,T_a),c_HOL_Oabs(V_b,T_a),T_a) ) ),
file(unknown,unknown) ).
tff(f_56,axiom,
! [V_U] : ~ c_lessequals(v_f(v_x(V_U)),c_times(V_U,c_HOL_Oabs(v_g(v_x(V_U)),t_b),t_b),t_b),
file(unknown,unknown) ).
tff(c_10,plain,
! [V_U_11] : c_lessequals(v_f(V_U_11),c_times(v_c,v_g(V_U_11),t_b),t_b),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_18,plain,
class_Ring__and__Field_Oordered__idom(t_b),
inference(cnfTransformation,[status(thm)],[f_67]) ).
tff(c_19,plain,
! [T_15] :
( class_OrderedGroup_Olordered__ab__group__abs(T_15)
| ~ class_Ring__and__Field_Oordered__idom(T_15) ),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_23,plain,
class_OrderedGroup_Olordered__ab__group__abs(t_b),
inference(resolution,[status(thm)],[c_18,c_19]) ).
tff(c_14,plain,
! [T_13] :
( class_Orderings_Oorder(T_13)
| ~ class_OrderedGroup_Olordered__ab__group__abs(T_13) ),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_8,plain,
! [V_U_10] : c_lessequals(c_0,v_f(V_U_10),t_b),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_44,plain,
! [V_x_23,V_z_24,T_a_25,V_y_26] :
( c_lessequals(V_x_23,V_z_24,T_a_25)
| ~ c_lessequals(V_x_23,V_y_26,T_a_25)
| ~ c_lessequals(V_y_26,V_z_24,T_a_25)
| ~ class_Orderings_Oorder(T_a_25) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_50,plain,
! [V_z_24,V_U_10] :
( c_lessequals(c_0,V_z_24,t_b)
| ~ c_lessequals(v_f(V_U_10),V_z_24,t_b)
| ~ class_Orderings_Oorder(t_b) ),
inference(resolution,[status(thm)],[c_8,c_44]) ).
tff(c_51,plain,
~ class_Orderings_Oorder(t_b),
inference(splitLeft,[status(thm)],[c_50]) ).
tff(c_54,plain,
~ class_OrderedGroup_Olordered__ab__group__abs(t_b),
inference(resolution,[status(thm)],[c_14,c_51]) ).
tff(c_58,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_23,c_54]) ).
tff(c_61,plain,
! [V_z_27,V_U_28] :
( c_lessequals(c_0,V_z_27,t_b)
| ~ c_lessequals(v_f(V_U_28),V_z_27,t_b) ),
inference(splitRight,[status(thm)],[c_50]) ).
tff(c_66,plain,
! [V_U_29] : c_lessequals(c_0,c_times(v_c,v_g(V_U_29),t_b),t_b),
inference(resolution,[status(thm)],[c_10,c_61]) ).
tff(c_2,plain,
! [V_y_2,T_a_1] :
( ( c_HOL_Oabs(V_y_2,T_a_1) = V_y_2 )
| ~ c_lessequals(c_0,V_y_2,T_a_1)
| ~ class_OrderedGroup_Olordered__ab__group__abs(T_a_1) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_71,plain,
! [V_U_29] :
( ( c_HOL_Oabs(c_times(v_c,v_g(V_U_29),t_b),t_b) = c_times(v_c,v_g(V_U_29),t_b) )
| ~ class_OrderedGroup_Olordered__ab__group__abs(t_b) ),
inference(resolution,[status(thm)],[c_66,c_2]) ).
tff(c_77,plain,
! [V_U_29] : ( c_HOL_Oabs(c_times(v_c,v_g(V_U_29),t_b),t_b) = c_times(v_c,v_g(V_U_29),t_b) ),
inference(demodulation,[status(thm),theory(equality)],[c_23,c_71]) ).
tff(c_78,plain,
! [V_a_30,T_a_31,V_b_32] :
( ( c_times(c_HOL_Oabs(V_a_30,T_a_31),c_HOL_Oabs(V_b_32,T_a_31),T_a_31) = c_HOL_Oabs(c_times(V_a_30,V_b_32,T_a_31),T_a_31) )
| ~ class_Ring__and__Field_Oordered__idom(T_a_31) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_12,plain,
! [V_U_12] : ~ c_lessequals(v_f(v_x(V_U_12)),c_times(V_U_12,c_HOL_Oabs(v_g(v_x(V_U_12)),t_b),t_b),t_b),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_85,plain,
! [V_a_30] :
( ~ c_lessequals(v_f(v_x(c_HOL_Oabs(V_a_30,t_b))),c_HOL_Oabs(c_times(V_a_30,v_g(v_x(c_HOL_Oabs(V_a_30,t_b))),t_b),t_b),t_b)
| ~ class_Ring__and__Field_Oordered__idom(t_b) ),
inference(superposition,[status(thm),theory(equality)],[c_78,c_12]) ).
tff(c_187,plain,
! [V_a_45] : ~ c_lessequals(v_f(v_x(c_HOL_Oabs(V_a_45,t_b))),c_HOL_Oabs(c_times(V_a_45,v_g(v_x(c_HOL_Oabs(V_a_45,t_b))),t_b),t_b),t_b),
inference(demodulation,[status(thm),theory(equality)],[c_18,c_85]) ).
tff(c_203,plain,
~ c_lessequals(v_f(v_x(c_HOL_Oabs(v_c,t_b))),c_times(v_c,v_g(v_x(c_HOL_Oabs(v_c,t_b))),t_b),t_b),
inference(superposition,[status(thm),theory(equality)],[c_77,c_187]) ).
tff(c_216,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_10,c_203]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : ANA010-2 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.14 % 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 : n001.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 : Thu Aug 3 15:59:25 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.20/1.89 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.20/1.90
% 3.20/1.90 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.35/1.93
% 3.35/1.93 Inference rules
% 3.35/1.93 ----------------------
% 3.35/1.93 #Ref : 0
% 3.35/1.93 #Sup : 41
% 3.35/1.93 #Fact : 0
% 3.35/1.93 #Define : 0
% 3.35/1.93 #Split : 1
% 3.35/1.93 #Chain : 0
% 3.35/1.93 #Close : 0
% 3.35/1.93
% 3.35/1.93 Ordering : KBO
% 3.35/1.93
% 3.35/1.93 Simplification rules
% 3.35/1.93 ----------------------
% 3.35/1.93 #Subsume : 0
% 3.35/1.93 #Demod : 18
% 3.35/1.93 #Tautology : 13
% 3.35/1.93 #SimpNegUnit : 0
% 3.35/1.93 #BackRed : 0
% 3.35/1.93
% 3.35/1.93 #Partial instantiations: 0
% 3.35/1.93 #Strategies tried : 1
% 3.35/1.93
% 3.35/1.93 Timing (in seconds)
% 3.35/1.93 ----------------------
% 3.35/1.93 Preprocessing : 0.46
% 3.35/1.93 Parsing : 0.25
% 3.35/1.93 CNF conversion : 0.02
% 3.35/1.93 Main loop : 0.30
% 3.35/1.93 Inferencing : 0.14
% 3.35/1.93 Reduction : 0.08
% 3.35/1.93 Demodulation : 0.06
% 3.35/1.93 BG Simplification : 0.01
% 3.35/1.93 Subsumption : 0.05
% 3.35/1.93 Abstraction : 0.02
% 3.35/1.93 MUC search : 0.00
% 3.35/1.93 Cooper : 0.00
% 3.35/1.93 Total : 0.81
% 3.35/1.93 Index Insertion : 0.00
% 3.35/1.93 Index Deletion : 0.00
% 3.35/1.93 Index Matching : 0.00
% 3.35/1.93 BG Taut test : 0.00
%------------------------------------------------------------------------------