TSTP Solution File: ANA042-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ANA042-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 : n016.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:52 EDT 2023
% Result : Unsatisfiable 2.46s 1.60s
% Output : CNFRefutation 2.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 11
% Syntax : Number of formulae : 14 ( 5 unt; 9 typ; 0 def)
% Number of atoms : 5 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 14 ( 7 >; 7 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-3 aty)
% Number of variables : 6 (; 6 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_lessequals > c_times > v_h > v_f > c_HOL_Oabs > #nlpp > v_xb > v_xa > v_x > t_c
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(v_x,type,
v_x: $i ).
tff(v_h,type,
v_h: ( $i * $i ) > $i ).
tff(v_xa,type,
v_xa: $i > $i ).
tff(v_xb,type,
v_xb: $i > $i ).
tff(t_c,type,
t_c: $i ).
tff(c_HOL_Oabs,type,
c_HOL_Oabs: ( $i * $i ) > $i ).
tff(v_f,type,
v_f: ( $i * $i ) > $i ).
tff(c_times,type,
c_times: ( $i * $i * $i ) > $i ).
tff(c_lessequals,type,
c_lessequals: ( $i * $i * $i ) > $o ).
tff(f_27,axiom,
! [V_U,V_V] : c_lessequals(c_HOL_Oabs(v_f(V_U,V_V),t_c),c_times(v_x,v_h(V_U,V_V),t_c),t_c),
file(unknown,unknown) ).
tff(f_30,axiom,
! [V_U] : ~ c_lessequals(c_HOL_Oabs(v_f(v_xa(V_U),v_xb(V_U)),t_c),c_times(V_U,v_h(v_xa(V_U),v_xb(V_U)),t_c),t_c),
file(unknown,unknown) ).
tff(c_2,plain,
! [V_U_1,V_V_2] : c_lessequals(c_HOL_Oabs(v_f(V_U_1,V_V_2),t_c),c_times(v_x,v_h(V_U_1,V_V_2),t_c),t_c),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_6,plain,
! [V_U_6] : ~ c_lessequals(c_HOL_Oabs(v_f(v_xa(V_U_6),v_xb(V_U_6)),t_c),c_times(V_U_6,v_h(v_xa(V_U_6),v_xb(V_U_6)),t_c),t_c),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_11,plain,
$false,
inference(resolution,[status(thm)],[c_2,c_6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : ANA042-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.13/0.35 % Computer : n016.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 15:58:08 EDT 2023
% 0.13/0.36 % CPUTime :
% 2.46/1.60 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.50/1.60
% 2.50/1.60 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.53/1.64
% 2.53/1.64 Inference rules
% 2.53/1.64 ----------------------
% 2.53/1.64 #Ref : 0
% 2.53/1.64 #Sup : 1
% 2.53/1.64 #Fact : 0
% 2.53/1.64 #Define : 0
% 2.53/1.64 #Split : 0
% 2.53/1.64 #Chain : 0
% 2.53/1.64 #Close : 0
% 2.53/1.64
% 2.53/1.64 Ordering : KBO
% 2.53/1.64
% 2.53/1.64 Simplification rules
% 2.53/1.64 ----------------------
% 2.53/1.64 #Subsume : 0
% 2.53/1.64 #Demod : 0
% 2.53/1.64 #Tautology : 0
% 2.53/1.64 #SimpNegUnit : 0
% 2.53/1.64 #BackRed : 0
% 2.53/1.64
% 2.53/1.64 #Partial instantiations: 0
% 2.53/1.64 #Strategies tried : 1
% 2.53/1.64
% 2.53/1.64 Timing (in seconds)
% 2.53/1.64 ----------------------
% 2.53/1.64 Preprocessing : 0.38
% 2.53/1.64 Parsing : 0.21
% 2.53/1.64 CNF conversion : 0.02
% 2.53/1.64 Main loop : 0.11
% 2.53/1.64 Inferencing : 0.05
% 2.53/1.64 Reduction : 0.02
% 2.53/1.64 Demodulation : 0.02
% 2.53/1.64 BG Simplification : 0.01
% 2.53/1.64 Subsumption : 0.02
% 2.53/1.64 Abstraction : 0.00
% 2.53/1.64 MUC search : 0.00
% 2.53/1.64 Cooper : 0.00
% 2.53/1.64 Total : 0.54
% 2.53/1.64 Index Insertion : 0.00
% 2.53/1.64 Index Deletion : 0.00
% 2.53/1.64 Index Matching : 0.00
% 2.53/1.64 BG Taut test : 0.00
%------------------------------------------------------------------------------