TSTP Solution File: LCL853-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL853-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/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 : n022.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:10 EDT 2023
% Result : Unsatisfiable 2.96s 1.62s
% Output : CNFRefutation 2.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 16
% Syntax : Number of formulae : 19 ( 5 unt; 14 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 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 17 ( 11 >; 6 *; 0 +; 0 <<)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 0 (; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ c_HOL_Oord__class_Oless > class_Ring__and__Field_Oordered__idom > class_Orderings_Opreorder > class_Orderings_Oorder > class_Orderings_Olinorder > c_InductTermi_OIT > c_Lambda_Osubst > c_Lambda_Olift > c_Lambda_OdB_OApp > #nlpp > c_Lambda_OdB_OVar > c_Lambda_OdB_OAbs > v_ta____ > v_s____ > 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(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(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(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(v_ta____,type,
v_ta____: $i ).
tff(v_s____,type,
v_s____: $i ).
tff(f_254,axiom,
~ c_InductTermi_OIT(v_s____),
file(unknown,unknown) ).
tff(f_239,axiom,
c_InductTermi_OIT(v_s____),
file(unknown,unknown) ).
tff(c_88,plain,
~ c_InductTermi_OIT(v_s____),
inference(cnfTransformation,[status(thm)],[f_254]) ).
tff(c_78,plain,
c_InductTermi_OIT(v_s____),
inference(cnfTransformation,[status(thm)],[f_239]) ).
tff(c_95,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_88,c_78]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL853-1 : TPTP v8.1.2. Released v4.1.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 : n022.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 14:03:03 EDT 2023
% 0.14/0.35 % CPUTime :
% 2.96/1.62 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.96/1.62
% 2.96/1.62 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.96/1.66
% 2.96/1.66 Inference rules
% 2.96/1.66 ----------------------
% 2.96/1.66 #Ref : 0
% 2.96/1.66 #Sup : 0
% 2.96/1.66 #Fact : 0
% 2.96/1.66 #Define : 0
% 2.96/1.66 #Split : 0
% 2.96/1.66 #Chain : 0
% 2.96/1.66 #Close : 0
% 2.96/1.66
% 2.96/1.66 Ordering : KBO
% 2.96/1.66
% 2.96/1.66 Simplification rules
% 2.96/1.66 ----------------------
% 2.96/1.66 #Subsume : 46
% 2.96/1.66 #Demod : 0
% 2.96/1.66 #Tautology : 0
% 2.96/1.66 #SimpNegUnit : 1
% 2.96/1.66 #BackRed : 0
% 2.96/1.66
% 2.96/1.66 #Partial instantiations: 0
% 2.96/1.66 #Strategies tried : 1
% 2.96/1.66
% 2.96/1.66 Timing (in seconds)
% 2.96/1.66 ----------------------
% 2.96/1.66 Preprocessing : 0.54
% 2.96/1.66 Parsing : 0.29
% 2.96/1.66 CNF conversion : 0.04
% 2.96/1.66 Main loop : 0.06
% 2.96/1.66 Inferencing : 0.00
% 2.96/1.66 Reduction : 0.03
% 2.96/1.66 Demodulation : 0.02
% 2.96/1.66 BG Simplification : 0.02
% 2.96/1.66 Subsumption : 0.03
% 2.96/1.66 Abstraction : 0.01
% 2.96/1.66 MUC search : 0.00
% 2.96/1.66 Cooper : 0.00
% 2.96/1.66 Total : 0.65
% 2.96/1.66 Index Insertion : 0.00
% 2.96/1.66 Index Deletion : 0.00
% 2.96/1.66 Index Matching : 0.00
% 2.96/1.66 BG Taut test : 0.00
%------------------------------------------------------------------------------