TSTP Solution File: LCL843-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL843-1 : TPTP v8.1.2. Released v4.1.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 : 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:49:09 EDT 2023
% Result : Unsatisfiable 3.29s 1.67s
% Output : CNFRefutation 3.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 24
% Syntax : Number of formulae : 27 ( 5 unt; 22 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 : 2 ( 2 avg)
% Maximal term depth : 2 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 28 ( 19 >; 9 *; 0 +; 0 <<)
% Number of predicates : 11 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 3 con; 0-3 aty)
% Number of variables : 2 (; 2 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_HOL_Oord__class_Oless > c_Lambda_Obeta > class_Ring__and__Field_Osemiring__1 > class_Ring__and__Field_Oordered__semidom > class_Ring__and__Field_Oordered__idom > class_Orderings_Opreorder > class_Orderings_Oorder > class_Orderings_Olinorder > class_Nat_Osemiring__char__0 > c_InductTermi_OIT > c_Lambda_Osubst > c_Nat_Osemiring__1__class_Oof__nat > c_Lambda_Osko__Lambda__Xbeta__cases__2__1 > c_Lambda_Olift > c_Lambda_OdB_OApp > #nlpp > v_env______ > c_Lambda_OdB_OVar > c_Lambda_OdB_OAbs > c_HOL_Ozero__class_Ozero > v_x______ > v_Ta______ > tc_nat
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(c_Lambda_Olift,type,
c_Lambda_Olift: ( $i * $i ) > $i ).
tff(class_Orderings_Olinorder,type,
class_Orderings_Olinorder: $i > $o ).
tff(c_HOL_Oord__class_Oless,type,
c_HOL_Oord__class_Oless: ( $i * $i * $i ) > $o ).
tff(c_InductTermi_OIT,type,
c_InductTermi_OIT: $i > $o ).
tff(c_Nat_Osemiring__1__class_Oof__nat,type,
c_Nat_Osemiring__1__class_Oof__nat: ( $i * $i ) > $i ).
tff(c_Lambda_Obeta,type,
c_Lambda_Obeta: ( $i * $i ) > $o ).
tff(class_Orderings_Oorder,type,
class_Orderings_Oorder: $i > $o ).
tff(class_Orderings_Opreorder,type,
class_Orderings_Opreorder: $i > $o ).
tff(c_Lambda_Osubst,type,
c_Lambda_Osubst: ( $i * $i * $i ) > $i ).
tff(v_x______,type,
v_x______: $i ).
tff(c_Lambda_OdB_OApp,type,
c_Lambda_OdB_OApp: ( $i * $i ) > $i ).
tff(c_Lambda_OdB_OVar,type,
c_Lambda_OdB_OVar: $i > $i ).
tff(v_Ta______,type,
v_Ta______: $i ).
tff(class_Ring__and__Field_Oordered__idom,type,
class_Ring__and__Field_Oordered__idom: $i > $o ).
tff(c_Lambda_OdB_OAbs,type,
c_Lambda_OdB_OAbs: $i > $i ).
tff(tc_nat,type,
tc_nat: $i ).
tff(class_Nat_Osemiring__char__0,type,
class_Nat_Osemiring__char__0: $i > $o ).
tff(c_HOL_Ozero__class_Ozero,type,
c_HOL_Ozero__class_Ozero: $i > $i ).
tff(c_Lambda_Osko__Lambda__Xbeta__cases__2__1,type,
c_Lambda_Osko__Lambda__Xbeta__cases__2__1: ( $i * $i ) > $i ).
tff(class_Ring__and__Field_Osemiring__1,type,
class_Ring__and__Field_Osemiring__1: $i > $o ).
tff(class_Ring__and__Field_Oordered__semidom,type,
class_Ring__and__Field_Oordered__semidom: $i > $o ).
tff(v_env______,type,
v_env______: $i > $i ).
tff(f_341,axiom,
! [V_n] : c_InductTermi_OIT(c_Lambda_OdB_OVar(V_n)),
file(unknown,unknown) ).
tff(f_356,axiom,
~ c_InductTermi_OIT(c_Lambda_OdB_OVar(v_x______)),
file(unknown,unknown) ).
tff(c_118,plain,
! [V_n_142] : c_InductTermi_OIT(c_Lambda_OdB_OVar(V_n_142)),
inference(cnfTransformation,[status(thm)],[f_341]) ).
tff(c_126,plain,
~ c_InductTermi_OIT(c_Lambda_OdB_OVar(v_x______)),
inference(cnfTransformation,[status(thm)],[f_356]) ).
tff(c_140,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_118,c_126]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.15 % Problem : LCL843-1 : TPTP v8.1.2. Released v4.1.0.
% 0.00/0.15 % 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.16/0.37 % Computer : n011.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Thu Aug 3 14:08:36 EDT 2023
% 0.16/0.37 % CPUTime :
% 3.29/1.67 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.29/1.67
% 3.29/1.67 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.29/1.70
% 3.29/1.70 Inference rules
% 3.29/1.70 ----------------------
% 3.29/1.70 #Ref : 0
% 3.29/1.70 #Sup : 0
% 3.29/1.70 #Fact : 0
% 3.29/1.70 #Define : 0
% 3.29/1.70 #Split : 0
% 3.29/1.70 #Chain : 0
% 3.29/1.70 #Close : 0
% 3.29/1.70
% 3.29/1.70 Ordering : KBO
% 3.29/1.70
% 3.29/1.70 Simplification rules
% 3.29/1.70 ----------------------
% 3.29/1.70 #Subsume : 68
% 3.29/1.70 #Demod : 1
% 3.29/1.70 #Tautology : 0
% 3.29/1.70 #SimpNegUnit : 0
% 3.29/1.70 #BackRed : 0
% 3.29/1.70
% 3.29/1.70 #Partial instantiations: 0
% 3.29/1.70 #Strategies tried : 1
% 3.29/1.70
% 3.29/1.70 Timing (in seconds)
% 3.29/1.70 ----------------------
% 3.29/1.70 Preprocessing : 0.57
% 3.29/1.70 Parsing : 0.31
% 3.29/1.70 CNF conversion : 0.04
% 3.29/1.70 Main loop : 0.07
% 3.29/1.70 Inferencing : 0.00
% 3.29/1.70 Reduction : 0.03
% 3.29/1.70 Demodulation : 0.02
% 3.29/1.70 BG Simplification : 0.03
% 3.29/1.70 Subsumption : 0.03
% 3.29/1.70 Abstraction : 0.01
% 3.29/1.70 MUC search : 0.00
% 3.29/1.70 Cooper : 0.00
% 3.29/1.70 Total : 0.68
% 3.29/1.70 Index Insertion : 0.00
% 3.29/1.70 Index Deletion : 0.00
% 3.29/1.70 Index Matching : 0.00
% 3.29/1.70 BG Taut test : 0.00
%------------------------------------------------------------------------------