TSTP Solution File: KRS013-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KRS013-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:01 EDT 2023
% Result : Unsatisfiable 3.63s 1.91s
% Output : CNFRefutation 3.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 40
% Syntax : Number of formulae : 72 ( 6 unt; 24 typ; 0 def)
% Number of atoms : 117 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 130 ( 61 ~; 69 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 27 ( 23 >; 4 *; 0 +; 0 <<)
% Number of predicates : 13 ( 12 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 1 con; 0-1 aty)
% Number of variables : 56 (; 56 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ t > s > r > equalish > t2least > t1most > s2least > s1most > f > e > d > c > #nlpp > u7r2 > u7r1 > u6r1 > u5r2 > u5r1 > u4r2 > u4r1 > u3r2 > u3r1 > u1r2 > u1r1 > exist
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(s,type,
s: ( $i * $i ) > $o ).
tff(s1most,type,
s1most: $i > $o ).
tff(u5r2,type,
u5r2: $i > $i ).
tff(t2least,type,
t2least: $i > $o ).
tff(d,type,
d: $i > $o ).
tff(u3r1,type,
u3r1: $i > $i ).
tff(u1r1,type,
u1r1: $i > $i ).
tff(u4r1,type,
u4r1: $i > $i ).
tff(u3r2,type,
u3r2: $i > $i ).
tff(t1most,type,
t1most: $i > $o ).
tff(u4r2,type,
u4r2: $i > $i ).
tff(u7r2,type,
u7r2: $i > $i ).
tff(c,type,
c: $i > $o ).
tff(e,type,
e: $i > $o ).
tff(s2least,type,
s2least: $i > $o ).
tff(u7r1,type,
u7r1: $i > $i ).
tff(u6r1,type,
u6r1: $i > $i ).
tff(t,type,
t: ( $i * $i ) > $o ).
tff(exist,type,
exist: $i ).
tff(equalish,type,
equalish: ( $i * $i ) > $o ).
tff(u5r1,type,
u5r1: $i > $i ).
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_221,axiom,
! [X1] :
( s1most(X1)
| s(X1,u7r2(X1)) ),
file(unknown,unknown) ).
tff(f_217,axiom,
! [X1] :
( s1most(X1)
| s(X1,u7r1(X1)) ),
file(unknown,unknown) ).
tff(f_180,axiom,
! [X1,X3,X2] :
( s2least(X1)
| equalish(X3,X2)
| ~ s(X1,X3)
| ~ s(X1,X2) ),
file(unknown,unknown) ).
tff(f_213,axiom,
! [X1] :
( s1most(X1)
| ~ equalish(u7r2(X1),u7r1(X1)) ),
file(unknown,unknown) ).
tff(f_197,axiom,
! [X1] :
( f(X1)
| r(X1,u6r1(X1)) ),
file(unknown,unknown) ).
tff(f_113,axiom,
! [X2,X1] :
( c(X2)
| ~ e(X1)
| ~ r(X1,X2)
| ~ s2least(X2) ),
file(unknown,unknown) ).
tff(f_193,axiom,
! [X1] :
( f(X1)
| ~ s1most(u6r1(X1)) ),
file(unknown,unknown) ).
tff(f_102,axiom,
! [X3,X1] :
( d(X3)
| ~ e(X1)
| ~ r(X1,X3) ),
file(unknown,unknown) ).
tff(f_65,axiom,
! [X1] :
( t1most(X1)
| ~ d(X1) ),
file(unknown,unknown) ).
tff(f_29,axiom,
! [X1] :
( t2least(X1)
| ~ c(X1) ),
file(unknown,unknown) ).
tff(f_50,axiom,
! [X1] :
( t(X1,u1r2(X1))
| ~ t2least(X1) ),
file(unknown,unknown) ).
tff(f_45,axiom,
! [X1] :
( t(X1,u1r1(X1))
| ~ t2least(X1) ),
file(unknown,unknown) ).
tff(f_81,axiom,
! [X3,X2,X1] :
( equalish(X3,X2)
| ~ t1most(X1)
| ~ t(X1,X3)
| ~ t(X1,X2) ),
file(unknown,unknown) ).
tff(f_40,axiom,
! [X1] :
( ~ t2least(X1)
| ~ equalish(u1r2(X1),u1r1(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_66,plain,
! [X1_42] :
( s(X1_42,u7r2(X1_42))
| s1most(X1_42) ),
inference(cnfTransformation,[status(thm)],[f_221]) ).
tff(c_64,plain,
! [X1_41] :
( s(X1_41,u7r1(X1_41))
| s1most(X1_41) ),
inference(cnfTransformation,[status(thm)],[f_217]) ).
tff(c_206,plain,
! [X1_87,X2_88,X3_89] :
( ~ s(X1_87,X2_88)
| ~ s(X1_87,X3_89)
| equalish(X3_89,X2_88)
| s2least(X1_87) ),
inference(cnfTransformation,[status(thm)],[f_180]) ).
tff(c_289,plain,
! [X1_110,X3_111] :
( ~ s(X1_110,X3_111)
| equalish(X3_111,u7r1(X1_110))
| s2least(X1_110)
| s1most(X1_110) ),
inference(resolution,[status(thm)],[c_64,c_206]) ).
tff(c_62,plain,
! [X1_40] :
( ~ equalish(u7r2(X1_40),u7r1(X1_40))
| s1most(X1_40) ),
inference(cnfTransformation,[status(thm)],[f_213]) ).
tff(c_295,plain,
! [X1_112] :
( ~ s(X1_112,u7r2(X1_112))
| s2least(X1_112)
| s1most(X1_112) ),
inference(resolution,[status(thm)],[c_289,c_62]) ).
tff(c_300,plain,
! [X1_113] :
( s2least(X1_113)
| s1most(X1_113) ),
inference(resolution,[status(thm)],[c_66,c_295]) ).
tff(c_58,plain,
! [X1_36] :
( r(X1_36,u6r1(X1_36))
| f(X1_36) ),
inference(cnfTransformation,[status(thm)],[f_197]) ).
tff(c_124,plain,
! [X2_70,X1_71] :
( ~ s2least(X2_70)
| ~ r(X1_71,X2_70)
| ~ e(X1_71)
| c(X2_70) ),
inference(cnfTransformation,[status(thm)],[f_113]) ).
tff(c_136,plain,
! [X1_36] :
( ~ s2least(u6r1(X1_36))
| ~ e(X1_36)
| c(u6r1(X1_36))
| f(X1_36) ),
inference(resolution,[status(thm)],[c_58,c_124]) ).
tff(c_309,plain,
! [X1_114] :
( ~ e(X1_114)
| c(u6r1(X1_114))
| f(X1_114)
| s1most(u6r1(X1_114)) ),
inference(resolution,[status(thm)],[c_300,c_136]) ).
tff(c_56,plain,
! [X1_35] :
( ~ s1most(u6r1(X1_35))
| f(X1_35) ),
inference(cnfTransformation,[status(thm)],[f_193]) ).
tff(c_314,plain,
! [X1_115] :
( ~ e(X1_115)
| c(u6r1(X1_115))
| f(X1_115) ),
inference(resolution,[status(thm)],[c_309,c_56]) ).
tff(c_90,plain,
! [X1_58,X3_59] :
( ~ r(X1_58,X3_59)
| ~ e(X1_58)
| d(X3_59) ),
inference(cnfTransformation,[status(thm)],[f_102]) ).
tff(c_94,plain,
! [X1_36] :
( ~ e(X1_36)
| d(u6r1(X1_36))
| f(X1_36) ),
inference(resolution,[status(thm)],[c_58,c_90]) ).
tff(c_18,plain,
! [X1_9] :
( ~ d(X1_9)
| t1most(X1_9) ),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_6,plain,
! [X1_1] :
( ~ c(X1_1)
| t2least(X1_1) ),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_14,plain,
! [X1_5] :
( ~ t2least(X1_5)
| t(X1_5,u1r2(X1_5)) ),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_12,plain,
! [X1_4] :
( ~ t2least(X1_4)
| t(X1_4,u1r1(X1_4)) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_193,plain,
! [X1_84,X2_85,X3_86] :
( ~ t(X1_84,X2_85)
| ~ t(X1_84,X3_86)
| ~ t1most(X1_84)
| equalish(X3_86,X2_85) ),
inference(cnfTransformation,[status(thm)],[f_81]) ).
tff(c_219,plain,
! [X1_90,X3_91] :
( ~ t(X1_90,X3_91)
| ~ t1most(X1_90)
| equalish(X3_91,u1r1(X1_90))
| ~ t2least(X1_90) ),
inference(resolution,[status(thm)],[c_12,c_193]) ).
tff(c_10,plain,
! [X1_3] :
( ~ equalish(u1r2(X1_3),u1r1(X1_3))
| ~ t2least(X1_3) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_225,plain,
! [X1_92] :
( ~ t(X1_92,u1r2(X1_92))
| ~ t1most(X1_92)
| ~ t2least(X1_92) ),
inference(resolution,[status(thm)],[c_219,c_10]) ).
tff(c_230,plain,
! [X1_93] :
( ~ t1most(X1_93)
| ~ t2least(X1_93) ),
inference(resolution,[status(thm)],[c_14,c_225]) ).
tff(c_235,plain,
! [X1_94] :
( ~ t1most(X1_94)
| ~ c(X1_94) ),
inference(resolution,[status(thm)],[c_6,c_230]) ).
tff(c_240,plain,
! [X1_95] :
( ~ c(X1_95)
| ~ d(X1_95) ),
inference(resolution,[status(thm)],[c_18,c_235]) ).
tff(c_244,plain,
! [X1_36] :
( ~ c(u6r1(X1_36))
| ~ e(X1_36)
| f(X1_36) ),
inference(resolution,[status(thm)],[c_94,c_240]) ).
tff(c_319,plain,
! [X1_116] :
( ~ e(X1_116)
| f(X1_116) ),
inference(resolution,[status(thm)],[c_314,c_244]) ).
tff(c_4,plain,
~ f(exist),
inference(cnfTransformation,[status(thm)],[f_24]) ).
tff(c_322,plain,
~ e(exist),
inference(resolution,[status(thm)],[c_319,c_4]) ).
tff(c_326,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_2,c_322]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : KRS013-1 : TPTP v8.1.2. Released v2.0.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.17/0.35 % Computer : n021.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 300
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Thu Aug 3 20:09:51 EDT 2023
% 0.17/0.35 % CPUTime :
% 3.63/1.91 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.63/1.91
% 3.63/1.91 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.73/1.95
% 3.73/1.95 Inference rules
% 3.73/1.95 ----------------------
% 3.73/1.95 #Ref : 0
% 3.73/1.95 #Sup : 53
% 3.73/1.95 #Fact : 0
% 3.73/1.95 #Define : 0
% 3.73/1.95 #Split : 0
% 3.73/1.95 #Chain : 0
% 3.73/1.95 #Close : 0
% 3.73/1.95
% 3.73/1.95 Ordering : KBO
% 3.73/1.95
% 3.73/1.95 Simplification rules
% 3.73/1.95 ----------------------
% 3.73/1.95 #Subsume : 14
% 3.73/1.95 #Demod : 1
% 3.73/1.95 #Tautology : 22
% 3.73/1.95 #SimpNegUnit : 0
% 3.73/1.95 #BackRed : 0
% 3.73/1.95
% 3.73/1.95 #Partial instantiations: 0
% 3.73/1.95 #Strategies tried : 1
% 3.73/1.95
% 3.73/1.95 Timing (in seconds)
% 3.73/1.95 ----------------------
% 3.73/1.95 Preprocessing : 0.49
% 3.73/1.95 Parsing : 0.27
% 3.73/1.95 CNF conversion : 0.03
% 3.73/1.95 Main loop : 0.38
% 3.73/1.95 Inferencing : 0.18
% 3.73/1.95 Reduction : 0.08
% 3.73/1.95 Demodulation : 0.05
% 3.73/1.95 BG Simplification : 0.03
% 3.73/1.95 Subsumption : 0.07
% 3.73/1.95 Abstraction : 0.01
% 3.73/1.95 MUC search : 0.00
% 3.73/1.95 Cooper : 0.00
% 3.73/1.95 Total : 0.92
% 3.73/1.95 Index Insertion : 0.00
% 3.73/1.95 Index Deletion : 0.00
% 3.73/1.95 Index Matching : 0.00
% 3.73/1.95 BG Taut test : 0.00
%------------------------------------------------------------------------------