TSTP Solution File: ANA007-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ANA007-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 : n010.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 2.39s 1.57s
% Output : CNFRefutation 2.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 14
% Syntax : Number of formulae : 24 ( 9 unt; 9 typ; 0 def)
% Number of atoms : 21 ( 3 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 16 ( 10 ~; 6 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 12 ( 7 >; 5 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 13 (; 13 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_lessequals > class_Ring__and__Field_Oordered__idom > class_Orderings_Oorder > c_times > c_HOL_Oabs > #nlpp > v_x > v_f > t_b > c_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(class_Orderings_Oorder,type,
class_Orderings_Oorder: $i > $o ).
tff(c_HOL_Oabs,type,
c_HOL_Oabs: ( $i * $i ) > $i ).
tff(c_1,type,
c_1: $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_x,type,
v_x: $i > $i ).
tff(v_f,type,
v_f: $i > $i ).
tff(t_b,type,
t_b: $i ).
tff(f_29,axiom,
class_Ring__and__Field_Oordered__idom(t_b),
file(unknown,unknown) ).
tff(f_44,axiom,
! [T] :
( ~ class_Ring__and__Field_Oordered__idom(T)
| class_Orderings_Oorder(T) ),
file(unknown,unknown) ).
tff(f_34,axiom,
! [T_a,V_x] :
( ~ class_Orderings_Oorder(T_a)
| c_lessequals(V_x,V_x,T_a) ),
file(unknown,unknown) ).
tff(f_39,axiom,
! [T_a,V_c] :
( ~ class_Ring__and__Field_Oordered__idom(T_a)
| ( V_c = c_times(c_1,V_c,T_a) ) ),
file(unknown,unknown) ).
tff(f_28,axiom,
! [V_U] : ~ c_lessequals(c_HOL_Oabs(v_f(v_x(V_U)),t_b),c_times(V_U,c_HOL_Oabs(v_f(v_x(V_U)),t_b),t_b),t_b),
file(unknown,unknown) ).
tff(c_4,plain,
class_Ring__and__Field_Oordered__idom(t_b),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_11,plain,
! [T_7] :
( class_Orderings_Oorder(T_7)
| ~ class_Ring__and__Field_Oordered__idom(T_7) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_15,plain,
class_Orderings_Oorder(t_b),
inference(resolution,[status(thm)],[c_4,c_11]) ).
tff(c_6,plain,
! [V_x_3,T_a_2] :
( c_lessequals(V_x_3,V_x_3,T_a_2)
| ~ class_Orderings_Oorder(T_a_2) ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_17,plain,
! [V_c_10,T_a_11] :
( ( c_times(c_1,V_c_10,T_a_11) = V_c_10 )
| ~ class_Ring__and__Field_Oordered__idom(T_a_11) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_22,plain,
! [V_c_13] : ( c_times(c_1,V_c_13,t_b) = V_c_13 ),
inference(resolution,[status(thm)],[c_4,c_17]) ).
tff(c_2,plain,
! [V_U_1] : ~ c_lessequals(c_HOL_Oabs(v_f(v_x(V_U_1)),t_b),c_times(V_U_1,c_HOL_Oabs(v_f(v_x(V_U_1)),t_b),t_b),t_b),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_29,plain,
~ c_lessequals(c_HOL_Oabs(v_f(v_x(c_1)),t_b),c_HOL_Oabs(v_f(v_x(c_1)),t_b),t_b),
inference(superposition,[status(thm),theory(equality)],[c_22,c_2]) ).
tff(c_37,plain,
~ class_Orderings_Oorder(t_b),
inference(resolution,[status(thm)],[c_6,c_29]) ).
tff(c_41,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_15,c_37]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : ANA007-2 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13 % 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.35 % Computer : n010.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 15:19:44 EDT 2023
% 0.14/0.35 % CPUTime :
% 2.39/1.57 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.39/1.57
% 2.39/1.57 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.39/1.59
% 2.39/1.59 Inference rules
% 2.39/1.59 ----------------------
% 2.39/1.59 #Ref : 0
% 2.39/1.59 #Sup : 6
% 2.39/1.59 #Fact : 0
% 2.39/1.60 #Define : 0
% 2.39/1.60 #Split : 0
% 2.39/1.60 #Chain : 0
% 2.39/1.60 #Close : 0
% 2.39/1.60
% 2.39/1.60 Ordering : KBO
% 2.39/1.60
% 2.39/1.60 Simplification rules
% 2.39/1.60 ----------------------
% 2.39/1.60 #Subsume : 0
% 2.39/1.60 #Demod : 1
% 2.39/1.60 #Tautology : 2
% 2.39/1.60 #SimpNegUnit : 0
% 2.39/1.60 #BackRed : 0
% 2.39/1.60
% 2.39/1.60 #Partial instantiations: 0
% 2.39/1.60 #Strategies tried : 1
% 2.39/1.60
% 2.39/1.60 Timing (in seconds)
% 2.39/1.60 ----------------------
% 2.58/1.60 Preprocessing : 0.38
% 2.58/1.60 Parsing : 0.21
% 2.58/1.60 CNF conversion : 0.02
% 2.58/1.60 Main loop : 0.14
% 2.58/1.60 Inferencing : 0.07
% 2.58/1.60 Reduction : 0.03
% 2.58/1.60 Demodulation : 0.02
% 2.58/1.60 BG Simplification : 0.01
% 2.58/1.60 Subsumption : 0.02
% 2.58/1.60 Abstraction : 0.00
% 2.58/1.60 MUC search : 0.00
% 2.58/1.60 Cooper : 0.00
% 2.58/1.60 Total : 0.57
% 2.58/1.60 Index Insertion : 0.00
% 2.58/1.60 Index Deletion : 0.00
% 2.58/1.60 Index Matching : 0.00
% 2.58/1.60 BG Taut test : 0.00
%------------------------------------------------------------------------------