TSTP Solution File: KRS010-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KRS010-1 : TPTP v8.1.2. Released v2.0.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 : n021.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:45:00 EDT 2023
% Result : Unsatisfiable 4.47s 2.02s
% Output : CNFRefutation 4.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 30
% Syntax : Number of formulae : 79 ( 6 unt; 17 typ; 0 def)
% Number of atoms : 237 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 347 ( 172 ~; 175 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 18 ( 16 >; 2 *; 0 +; 0 <<)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 1 con; 0-1 aty)
% Number of variables : 70 (; 70 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ r > equalish > r3least > f > e > d > c > a > #nlpp > u3r2 > u3r1 > u2r3 > u2r2 > u2r1 > u1r3 > u1r2 > u1r1 > exist
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(d,type,
d: $i > $o ).
tff(u3r1,type,
u3r1: $i > $i ).
tff(u1r1,type,
u1r1: $i > $i ).
tff(u1r3,type,
u1r3: $i > $i ).
tff(u2r3,type,
u2r3: $i > $i ).
tff(r3least,type,
r3least: $i > $o ).
tff(u3r2,type,
u3r2: $i > $i ).
tff(u2r2,type,
u2r2: $i > $i ).
tff(c,type,
c: $i > $o ).
tff(e,type,
e: $i > $o ).
tff(u2r1,type,
u2r1: $i > $i ).
tff(a,type,
a: $i > $o ).
tff(exist,type,
exist: $i ).
tff(equalish,type,
equalish: ( $i * $i ) > $o ).
tff(u1r2,type,
u1r2: $i > $i ).
tff(r,type,
r: ( $i * $i ) > $o ).
tff(f,type,
f: $i > $o ).
tff(f_22,axiom,
e(exist),
file(unknown,unknown) ).
tff(f_63,axiom,
! [X1] :
( r3least(X1)
| ~ e(X1) ),
file(unknown,unknown) ).
tff(f_191,axiom,
! [X1] :
( r(X1,u2r1(X1))
| ~ r3least(X1) ),
file(unknown,unknown) ).
tff(f_71,axiom,
! [X2,X1] :
( a(X2)
| ~ e(X1)
| ~ r(X1,X2) ),
file(unknown,unknown) ).
tff(f_196,axiom,
! [X1] :
( r(X1,u2r2(X1))
| ~ r3least(X1) ),
file(unknown,unknown) ).
tff(f_201,axiom,
! [X1] :
( r(X1,u2r3(X1))
| ~ r3least(X1) ),
file(unknown,unknown) ).
tff(f_31,axiom,
! [X1] :
( c(X1)
| d(X1)
| ~ a(X1) ),
file(unknown,unknown) ).
tff(f_260,axiom,
! [X1,X3,X2] :
( f(X1)
| equalish(X3,X2)
| ~ r(X1,X3)
| ~ r(X1,X2)
| ~ d(X3)
| ~ d(X2) ),
file(unknown,unknown) ).
tff(f_174,axiom,
! [X1] :
( ~ r3least(X1)
| ~ equalish(u2r2(X1),u2r1(X1)) ),
file(unknown,unknown) ).
tff(f_180,axiom,
! [X1] :
( ~ r3least(X1)
| ~ equalish(u2r3(X1),u2r1(X1)) ),
file(unknown,unknown) ).
tff(f_58,axiom,
! [X4,X3,X1] :
( equalish(X4,X3)
| ~ e(X1)
| ~ r(X1,X4)
| ~ r(X1,X3)
| ~ c(X4)
| ~ c(X3) ),
file(unknown,unknown) ).
tff(f_186,axiom,
! [X1] :
( ~ r3least(X1)
| ~ equalish(u2r3(X1),u2r2(X1)) ),
file(unknown,unknown) ).
tff(f_24,axiom,
~ f(exist),
file(unknown,unknown) ).
tff(c_2,plain,
e(exist),
inference(cnfTransformation,[status(thm)],[f_22]) ).
tff(c_14,plain,
! [X1_7] :
( ~ e(X1_7)
| r3least(X1_7) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_44,plain,
! [X1_23] :
( ~ r3least(X1_23)
| r(X1_23,u2r1(X1_23)) ),
inference(cnfTransformation,[status(thm)],[f_191]) ).
tff(c_89,plain,
! [X1_52,X2_53] :
( ~ r(X1_52,X2_53)
| ~ e(X1_52)
| a(X2_53) ),
inference(cnfTransformation,[status(thm)],[f_71]) ).
tff(c_105,plain,
! [X1_23] :
( ~ e(X1_23)
| a(u2r1(X1_23))
| ~ r3least(X1_23) ),
inference(resolution,[status(thm)],[c_44,c_89]) ).
tff(c_46,plain,
! [X1_24] :
( ~ r3least(X1_24)
| r(X1_24,u2r2(X1_24)) ),
inference(cnfTransformation,[status(thm)],[f_196]) ).
tff(c_106,plain,
! [X1_24] :
( ~ e(X1_24)
| a(u2r2(X1_24))
| ~ r3least(X1_24) ),
inference(resolution,[status(thm)],[c_46,c_89]) ).
tff(c_48,plain,
! [X1_25] :
( ~ r3least(X1_25)
| r(X1_25,u2r3(X1_25)) ),
inference(cnfTransformation,[status(thm)],[f_201]) ).
tff(c_107,plain,
! [X1_25] :
( ~ e(X1_25)
| a(u2r3(X1_25))
| ~ r3least(X1_25) ),
inference(resolution,[status(thm)],[c_48,c_89]) ).
tff(c_6,plain,
! [X1_1] :
( ~ a(X1_1)
| d(X1_1)
| c(X1_1) ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_194,plain,
! [X2_75,X3_76,X1_77] :
( ~ d(X2_75)
| ~ d(X3_76)
| ~ r(X1_77,X2_75)
| ~ r(X1_77,X3_76)
| equalish(X3_76,X2_75)
| f(X1_77) ),
inference(cnfTransformation,[status(thm)],[f_260]) ).
tff(c_310,plain,
! [X1_101,X3_102] :
( ~ d(u2r1(X1_101))
| ~ d(X3_102)
| ~ r(X1_101,X3_102)
| equalish(X3_102,u2r1(X1_101))
| f(X1_101)
| ~ r3least(X1_101) ),
inference(resolution,[status(thm)],[c_44,c_194]) ).
tff(c_38,plain,
! [X1_20] :
( ~ equalish(u2r2(X1_20),u2r1(X1_20))
| ~ r3least(X1_20) ),
inference(cnfTransformation,[status(thm)],[f_174]) ).
tff(c_347,plain,
! [X1_108] :
( ~ d(u2r1(X1_108))
| ~ d(u2r2(X1_108))
| ~ r(X1_108,u2r2(X1_108))
| f(X1_108)
| ~ r3least(X1_108) ),
inference(resolution,[status(thm)],[c_310,c_38]) ).
tff(c_352,plain,
! [X1_109] :
( ~ d(u2r1(X1_109))
| ~ d(u2r2(X1_109))
| f(X1_109)
| ~ r3least(X1_109) ),
inference(resolution,[status(thm)],[c_46,c_347]) ).
tff(c_357,plain,
! [X1_110] :
( ~ d(u2r1(X1_110))
| f(X1_110)
| ~ r3least(X1_110)
| ~ a(u2r2(X1_110))
| c(u2r2(X1_110)) ),
inference(resolution,[status(thm)],[c_6,c_352]) ).
tff(c_361,plain,
! [X1_110] :
( f(X1_110)
| ~ r3least(X1_110)
| ~ a(u2r2(X1_110))
| c(u2r2(X1_110))
| ~ a(u2r1(X1_110))
| c(u2r1(X1_110)) ),
inference(resolution,[status(thm)],[c_6,c_357]) ).
tff(c_40,plain,
! [X1_21] :
( ~ equalish(u2r3(X1_21),u2r1(X1_21))
| ~ r3least(X1_21) ),
inference(cnfTransformation,[status(thm)],[f_180]) ).
tff(c_321,plain,
! [X1_103] :
( ~ d(u2r1(X1_103))
| ~ d(u2r3(X1_103))
| ~ r(X1_103,u2r3(X1_103))
| f(X1_103)
| ~ r3least(X1_103) ),
inference(resolution,[status(thm)],[c_310,c_40]) ).
tff(c_326,plain,
! [X1_104] :
( ~ d(u2r1(X1_104))
| ~ d(u2r3(X1_104))
| f(X1_104)
| ~ r3least(X1_104) ),
inference(resolution,[status(thm)],[c_48,c_321]) ).
tff(c_331,plain,
! [X1_105] :
( ~ d(u2r1(X1_105))
| f(X1_105)
| ~ r3least(X1_105)
| ~ a(u2r3(X1_105))
| c(u2r3(X1_105)) ),
inference(resolution,[status(thm)],[c_6,c_326]) ).
tff(c_387,plain,
! [X1_116] :
( f(X1_116)
| ~ r3least(X1_116)
| ~ a(u2r3(X1_116))
| c(u2r3(X1_116))
| ~ a(u2r1(X1_116))
| c(u2r1(X1_116)) ),
inference(resolution,[status(thm)],[c_6,c_331]) ).
tff(c_160,plain,
! [X3_72,X4_73,X1_74] :
( ~ c(X3_72)
| ~ c(X4_73)
| ~ r(X1_74,X3_72)
| ~ r(X1_74,X4_73)
| ~ e(X1_74)
| equalish(X4_73,X3_72) ),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_291,plain,
! [X1_93,X4_94] :
( ~ c(u2r2(X1_93))
| ~ c(X4_94)
| ~ r(X1_93,X4_94)
| ~ e(X1_93)
| equalish(X4_94,u2r2(X1_93))
| ~ r3least(X1_93) ),
inference(resolution,[status(thm)],[c_46,c_160]) ).
tff(c_42,plain,
! [X1_22] :
( ~ equalish(u2r3(X1_22),u2r2(X1_22))
| ~ r3least(X1_22) ),
inference(cnfTransformation,[status(thm)],[f_186]) ).
tff(c_303,plain,
! [X1_97] :
( ~ c(u2r2(X1_97))
| ~ c(u2r3(X1_97))
| ~ r(X1_97,u2r3(X1_97))
| ~ e(X1_97)
| ~ r3least(X1_97) ),
inference(resolution,[status(thm)],[c_291,c_42]) ).
tff(c_307,plain,
! [X1_25] :
( ~ c(u2r2(X1_25))
| ~ c(u2r3(X1_25))
| ~ e(X1_25)
| ~ r3least(X1_25) ),
inference(resolution,[status(thm)],[c_48,c_303]) ).
tff(c_410,plain,
! [X1_120] :
( ~ c(u2r2(X1_120))
| ~ e(X1_120)
| f(X1_120)
| ~ r3least(X1_120)
| ~ a(u2r3(X1_120))
| ~ a(u2r1(X1_120))
| c(u2r1(X1_120)) ),
inference(resolution,[status(thm)],[c_387,c_307]) ).
tff(c_513,plain,
! [X1_131] :
( ~ e(X1_131)
| ~ a(u2r3(X1_131))
| f(X1_131)
| ~ r3least(X1_131)
| ~ a(u2r2(X1_131))
| ~ a(u2r1(X1_131))
| c(u2r1(X1_131)) ),
inference(resolution,[status(thm)],[c_361,c_410]) ).
tff(c_264,plain,
! [X1_86,X3_87] :
( ~ d(u2r2(X1_86))
| ~ d(X3_87)
| ~ r(X1_86,X3_87)
| equalish(X3_87,u2r2(X1_86))
| f(X1_86)
| ~ r3least(X1_86) ),
inference(resolution,[status(thm)],[c_46,c_194]) ).
tff(c_270,plain,
! [X1_88] :
( ~ d(u2r2(X1_88))
| ~ d(u2r3(X1_88))
| ~ r(X1_88,u2r3(X1_88))
| f(X1_88)
| ~ r3least(X1_88) ),
inference(resolution,[status(thm)],[c_264,c_42]) ).
tff(c_275,plain,
! [X1_89] :
( ~ d(u2r2(X1_89))
| ~ d(u2r3(X1_89))
| f(X1_89)
| ~ r3least(X1_89) ),
inference(resolution,[status(thm)],[c_48,c_270]) ).
tff(c_280,plain,
! [X1_90] :
( ~ d(u2r2(X1_90))
| f(X1_90)
| ~ r3least(X1_90)
| ~ a(u2r3(X1_90))
| c(u2r3(X1_90)) ),
inference(resolution,[status(thm)],[c_6,c_275]) ).
tff(c_374,plain,
! [X1_115] :
( f(X1_115)
| ~ r3least(X1_115)
| ~ a(u2r3(X1_115))
| c(u2r3(X1_115))
| ~ a(u2r2(X1_115))
| c(u2r2(X1_115)) ),
inference(resolution,[status(thm)],[c_6,c_280]) ).
tff(c_336,plain,
! [X1_106,X4_107] :
( ~ c(u2r1(X1_106))
| ~ c(X4_107)
| ~ r(X1_106,X4_107)
| ~ e(X1_106)
| equalish(X4_107,u2r1(X1_106))
| ~ r3least(X1_106) ),
inference(resolution,[status(thm)],[c_44,c_160]) ).
tff(c_362,plain,
! [X1_111] :
( ~ c(u2r1(X1_111))
| ~ c(u2r3(X1_111))
| ~ r(X1_111,u2r3(X1_111))
| ~ e(X1_111)
| ~ r3least(X1_111) ),
inference(resolution,[status(thm)],[c_336,c_40]) ).
tff(c_366,plain,
! [X1_25] :
( ~ c(u2r1(X1_25))
| ~ c(u2r3(X1_25))
| ~ e(X1_25)
| ~ r3least(X1_25) ),
inference(resolution,[status(thm)],[c_48,c_362]) ).
tff(c_415,plain,
! [X1_121] :
( ~ c(u2r1(X1_121))
| ~ e(X1_121)
| f(X1_121)
| ~ r3least(X1_121)
| ~ a(u2r3(X1_121))
| ~ a(u2r2(X1_121))
| c(u2r2(X1_121)) ),
inference(resolution,[status(thm)],[c_374,c_366]) ).
tff(c_368,plain,
! [X1_113] :
( ~ c(u2r1(X1_113))
| ~ c(u2r2(X1_113))
| ~ r(X1_113,u2r2(X1_113))
| ~ e(X1_113)
| ~ r3least(X1_113) ),
inference(resolution,[status(thm)],[c_336,c_38]) ).
tff(c_372,plain,
! [X1_24] :
( ~ c(u2r1(X1_24))
| ~ c(u2r2(X1_24))
| ~ e(X1_24)
| ~ r3least(X1_24) ),
inference(resolution,[status(thm)],[c_46,c_368]) ).
tff(c_426,plain,
! [X1_121] :
( ~ c(u2r1(X1_121))
| ~ e(X1_121)
| f(X1_121)
| ~ r3least(X1_121)
| ~ a(u2r3(X1_121))
| ~ a(u2r2(X1_121)) ),
inference(resolution,[status(thm)],[c_415,c_372]) ).
tff(c_522,plain,
! [X1_132] :
( ~ e(X1_132)
| ~ a(u2r3(X1_132))
| f(X1_132)
| ~ r3least(X1_132)
| ~ a(u2r2(X1_132))
| ~ a(u2r1(X1_132)) ),
inference(resolution,[status(thm)],[c_513,c_426]) ).
tff(c_527,plain,
! [X1_133] :
( f(X1_133)
| ~ a(u2r2(X1_133))
| ~ a(u2r1(X1_133))
| ~ e(X1_133)
| ~ r3least(X1_133) ),
inference(resolution,[status(thm)],[c_107,c_522]) ).
tff(c_533,plain,
! [X1_136] :
( f(X1_136)
| ~ a(u2r1(X1_136))
| ~ e(X1_136)
| ~ r3least(X1_136) ),
inference(resolution,[status(thm)],[c_106,c_527]) ).
tff(c_538,plain,
! [X1_137] :
( f(X1_137)
| ~ e(X1_137)
| ~ r3least(X1_137) ),
inference(resolution,[status(thm)],[c_105,c_533]) ).
tff(c_543,plain,
! [X1_138] :
( f(X1_138)
| ~ e(X1_138) ),
inference(resolution,[status(thm)],[c_14,c_538]) ).
tff(c_4,plain,
~ f(exist),
inference(cnfTransformation,[status(thm)],[f_24]) ).
tff(c_546,plain,
~ e(exist),
inference(resolution,[status(thm)],[c_543,c_4]) ).
tff(c_550,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_2,c_546]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS010-1 : TPTP v8.1.2. Released v2.0.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.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 20:04:06 EDT 2023
% 0.13/0.34 % CPUTime :
% 4.47/2.02 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.47/2.02
% 4.47/2.02 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.66/2.06
% 4.66/2.06 Inference rules
% 4.66/2.06 ----------------------
% 4.66/2.06 #Ref : 0
% 4.66/2.06 #Sup : 94
% 4.66/2.06 #Fact : 8
% 4.66/2.06 #Define : 0
% 4.66/2.06 #Split : 0
% 4.66/2.06 #Chain : 0
% 4.66/2.06 #Close : 0
% 4.66/2.06
% 4.66/2.06 Ordering : KBO
% 4.66/2.06
% 4.66/2.06 Simplification rules
% 4.66/2.06 ----------------------
% 4.66/2.06 #Subsume : 25
% 4.66/2.06 #Demod : 1
% 4.66/2.06 #Tautology : 29
% 4.66/2.06 #SimpNegUnit : 0
% 4.66/2.06 #BackRed : 0
% 4.66/2.06
% 4.66/2.06 #Partial instantiations: 0
% 4.66/2.06 #Strategies tried : 1
% 4.66/2.06
% 4.66/2.06 Timing (in seconds)
% 4.66/2.06 ----------------------
% 4.66/2.07 Preprocessing : 0.48
% 4.66/2.07 Parsing : 0.26
% 4.66/2.07 CNF conversion : 0.03
% 4.66/2.07 Main loop : 0.50
% 4.66/2.07 Inferencing : 0.23
% 4.66/2.07 Reduction : 0.10
% 4.66/2.07 Demodulation : 0.06
% 4.66/2.07 BG Simplification : 0.03
% 4.66/2.07 Subsumption : 0.12
% 4.66/2.07 Abstraction : 0.02
% 4.66/2.07 MUC search : 0.00
% 4.66/2.07 Cooper : 0.00
% 4.66/2.07 Total : 1.04
% 4.66/2.07 Index Insertion : 0.00
% 4.66/2.07 Index Deletion : 0.00
% 4.66/2.07 Index Matching : 0.00
% 4.66/2.07 BG Taut test : 0.00
%------------------------------------------------------------------------------