TSTP Solution File: KRS108+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KRS108+1 : TPTP v8.1.2. Released v3.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 : n023.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:11 EDT 2023
% Result : Unsatisfiable 4.81s 2.04s
% Output : CNFRefutation 4.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 57
% Syntax : Number of formulae : 81 ( 4 unt; 49 typ; 0 def)
% Number of atoms : 75 ( 6 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 78 ( 35 ~; 27 |; 8 &)
% ( 6 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 57 ( 48 >; 9 *; 0 +; 0 <<)
% Number of predicates : 32 ( 30 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 1 con; 0-1 aty)
% Number of variables : 42 (; 38 !; 4 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ rr > rinvR > ra_Px7 > ra_Px6 > ra_Px5 > ra_Px4 > ra_Px3 > ra_Px2 > ra_Px1 > xsd_string > xsd_integer > cp5xcomp > cp5 > cp4xcomp > cp4 > cp3xcomp > cp3 > cp2xcomp > cp2 > cp1 > cowlThing > cowlNothing > ca_Cx3xcomp > ca_Cx3 > ca_Cx2xcomp > ca_Cx2 > ca_Cx1xcomp > ca_Cx1 > ca_Ax14 > cUnsatisfiable > #nlpp > i2003_11_14_17_21_04740 > #skF_9 > #skF_7 > #skF_5 > #skF_16 > #skF_2 > #skF_4 > #skF_18 > #skF_1 > #skF_8 > #skF_15 > #skF_10 > #skF_13 > #skF_17 > #skF_3 > #skF_11 > #skF_14 > #skF_12 > #skF_6
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(cp4xcomp,type,
cp4xcomp: $i > $o ).
tff('#skF_9',type,
'#skF_9': $i > $i ).
tff('#skF_7',type,
'#skF_7': $i > $i ).
tff('#skF_5',type,
'#skF_5': $i > $i ).
tff(ca_Cx2xcomp,type,
ca_Cx2xcomp: $i > $o ).
tff(ra_Px5,type,
ra_Px5: ( $i * $i ) > $o ).
tff(rinvR,type,
rinvR: ( $i * $i ) > $o ).
tff(cp5,type,
cp5: $i > $o ).
tff(rr,type,
rr: ( $i * $i ) > $o ).
tff('#skF_16',type,
'#skF_16': $i > $i ).
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff('#skF_4',type,
'#skF_4': $i > $i ).
tff('#skF_18',type,
'#skF_18': $i > $i ).
tff(ra_Px2,type,
ra_Px2: ( $i * $i ) > $o ).
tff(cowlThing,type,
cowlThing: $i > $o ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(ca_Cx3,type,
ca_Cx3: $i > $o ).
tff(ra_Px6,type,
ra_Px6: ( $i * $i ) > $o ).
tff('#skF_8',type,
'#skF_8': $i > $i ).
tff(cp4,type,
cp4: $i > $o ).
tff(ca_Cx1xcomp,type,
ca_Cx1xcomp: $i > $o ).
tff(cp3xcomp,type,
cp3xcomp: $i > $o ).
tff(i2003_11_14_17_21_04740,type,
i2003_11_14_17_21_04740: $i ).
tff(cUnsatisfiable,type,
cUnsatisfiable: $i > $o ).
tff('#skF_15',type,
'#skF_15': $i > $i ).
tff(xsd_integer,type,
xsd_integer: $i > $o ).
tff(ca_Cx3xcomp,type,
ca_Cx3xcomp: $i > $o ).
tff(cp5xcomp,type,
cp5xcomp: $i > $o ).
tff('#skF_10',type,
'#skF_10': $i > $i ).
tff(ra_Px7,type,
ra_Px7: ( $i * $i ) > $o ).
tff(ca_Cx2,type,
ca_Cx2: $i > $o ).
tff(ra_Px1,type,
ra_Px1: ( $i * $i ) > $o ).
tff(ca_Ax14,type,
ca_Ax14: $i > $o ).
tff(cp3,type,
cp3: $i > $o ).
tff('#skF_13',type,
'#skF_13': $i > $i ).
tff(ca_Cx1,type,
ca_Cx1: $i > $o ).
tff(xsd_string,type,
xsd_string: $i > $o ).
tff('#skF_17',type,
'#skF_17': $i > $i ).
tff('#skF_3',type,
'#skF_3': $i > $i ).
tff('#skF_11',type,
'#skF_11': $i > $i ).
tff('#skF_14',type,
'#skF_14': $i > $i ).
tff(cp2xcomp,type,
cp2xcomp: $i > $o ).
tff('#skF_12',type,
'#skF_12': $i > $i ).
tff(ra_Px3,type,
ra_Px3: ( $i * $i ) > $o ).
tff(cp2,type,
cp2: $i > $o ).
tff('#skF_6',type,
'#skF_6': $i > $i ).
tff(cowlNothing,type,
cowlNothing: $i > $o ).
tff(cp1,type,
cp1: $i > $o ).
tff(ra_Px4,type,
ra_Px4: ( $i * $i ) > $o ).
tff(f_283,axiom,
! [X] :
( cUnsatisfiable(X)
<=> ( ? [Y] :
( rinvR(X,Y)
& ca_Ax14(Y) )
& cp2(X) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
tff(f_441,axiom,
! [X,Y] :
( rinvR(X,Y)
<=> rr(Y,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_25) ).
tff(f_370,axiom,
! [X] :
( ca_Ax14(X)
<=> ( ? [Y] :
( rr(X,Y)
& cp1(Y) )
& ! [Y0,Y1] :
( ( rr(X,Y0)
& rr(X,Y1) )
=> ( Y0 = Y1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_15) ).
tff(f_288,axiom,
! [X] :
( cp1(X)
=> ca_Cx1(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
tff(f_381,axiom,
! [X] :
( ca_Cx1(X)
<=> ( cp2xcomp(X)
& cp5xcomp(X)
& cp3xcomp(X)
& cp4xcomp(X) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_16) ).
tff(f_294,axiom,
! [X] :
( cp2(X)
<=> ? [Y0] : ra_Px5(X,Y0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
tff(f_306,axiom,
! [X] :
( cp2xcomp(X)
<=> ~ ? [Y] : ra_Px5(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).
tff(f_443,axiom,
cUnsatisfiable(i2003_11_14_17_21_04740),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_26) ).
tff(c_92,plain,
! [X_99] :
( ca_Ax14('#skF_1'(X_99))
| ~ cUnsatisfiable(X_99) ),
inference(cnfTransformation,[status(thm)],[f_283]) ).
tff(c_94,plain,
! [X_99] :
( rinvR(X_99,'#skF_1'(X_99))
| ~ cUnsatisfiable(X_99) ),
inference(cnfTransformation,[status(thm)],[f_283]) ).
tff(c_196,plain,
! [Y_177,X_176] :
( rr(Y_177,X_176)
| ~ rinvR(X_176,Y_177) ),
inference(cnfTransformation,[status(thm)],[f_441]) ).
tff(c_140,plain,
! [X_139] :
( rr(X_139,'#skF_12'(X_139))
| ~ ca_Ax14(X_139) ),
inference(cnfTransformation,[status(thm)],[f_370]) ).
tff(c_646,plain,
! [Y1_288,Y0_289,X_290] :
( ( Y1_288 = Y0_289 )
| ~ rr(X_290,Y1_288)
| ~ rr(X_290,Y0_289)
| ~ ca_Ax14(X_290) ),
inference(cnfTransformation,[status(thm)],[f_370]) ).
tff(c_696,plain,
! [Y0_294,X_295] :
( ( Y0_294 = '#skF_12'(X_295) )
| ~ rr(X_295,Y0_294)
| ~ ca_Ax14(X_295) ),
inference(resolution,[status(thm)],[c_140,c_646]) ).
tff(c_720,plain,
! [X_299,Y_300] :
( ( X_299 = '#skF_12'(Y_300) )
| ~ ca_Ax14(Y_300)
| ~ rinvR(X_299,Y_300) ),
inference(resolution,[status(thm)],[c_196,c_696]) ).
tff(c_754,plain,
! [X_304] :
( ( '#skF_12'('#skF_1'(X_304)) = X_304 )
| ~ ca_Ax14('#skF_1'(X_304))
| ~ cUnsatisfiable(X_304) ),
inference(resolution,[status(thm)],[c_94,c_720]) ).
tff(c_759,plain,
! [X_305] :
( ( '#skF_12'('#skF_1'(X_305)) = X_305 )
| ~ cUnsatisfiable(X_305) ),
inference(resolution,[status(thm)],[c_92,c_754]) ).
tff(c_231,plain,
! [X_203] :
( cp1('#skF_12'(X_203))
| ~ ca_Ax14(X_203) ),
inference(cnfTransformation,[status(thm)],[f_370]) ).
tff(c_96,plain,
! [X_103] :
( ca_Cx1(X_103)
| ~ cp1(X_103) ),
inference(cnfTransformation,[status(thm)],[f_288]) ).
tff(c_235,plain,
! [X_203] :
( ca_Cx1('#skF_12'(X_203))
| ~ ca_Ax14(X_203) ),
inference(resolution,[status(thm)],[c_231,c_96]) ).
tff(c_90,plain,
! [X_99] :
( cp2(X_99)
| ~ cUnsatisfiable(X_99) ),
inference(cnfTransformation,[status(thm)],[f_283]) ).
tff(c_156,plain,
! [X_149] :
( cp2xcomp(X_149)
| ~ ca_Cx1(X_149) ),
inference(cnfTransformation,[status(thm)],[f_381]) ).
tff(c_433,plain,
! [X_262] :
( ra_Px5(X_262,'#skF_2'(X_262))
| ~ cp2(X_262) ),
inference(cnfTransformation,[status(thm)],[f_294]) ).
tff(c_104,plain,
! [X_109,Y_112] :
( ~ ra_Px5(X_109,Y_112)
| ~ cp2xcomp(X_109) ),
inference(cnfTransformation,[status(thm)],[f_306]) ).
tff(c_447,plain,
! [X_264] :
( ~ cp2xcomp(X_264)
| ~ cp2(X_264) ),
inference(resolution,[status(thm)],[c_433,c_104]) ).
tff(c_456,plain,
! [X_265] :
( ~ cp2(X_265)
| ~ ca_Cx1(X_265) ),
inference(resolution,[status(thm)],[c_156,c_447]) ).
tff(c_461,plain,
! [X_266] :
( ~ ca_Cx1(X_266)
| ~ cUnsatisfiable(X_266) ),
inference(resolution,[status(thm)],[c_90,c_456]) ).
tff(c_465,plain,
! [X_203] :
( ~ cUnsatisfiable('#skF_12'(X_203))
| ~ ca_Ax14(X_203) ),
inference(resolution,[status(thm)],[c_235,c_461]) ).
tff(c_786,plain,
! [X_306] :
( ~ cUnsatisfiable(X_306)
| ~ ca_Ax14('#skF_1'(X_306))
| ~ cUnsatisfiable(X_306) ),
inference(superposition,[status(thm),theory(equality)],[c_759,c_465]) ).
tff(c_790,plain,
! [X_99] : ~ cUnsatisfiable(X_99),
inference(resolution,[status(thm)],[c_92,c_786]) ).
tff(c_200,plain,
cUnsatisfiable(i2003_11_14_17_21_04740),
inference(cnfTransformation,[status(thm)],[f_443]) ).
tff(c_801,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_790,c_200]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : KRS108+1 : TPTP v8.1.2. Released v3.1.0.
% 0.07/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.14/0.35 % Computer : n023.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 20:23:52 EDT 2023
% 0.14/0.35 % CPUTime :
% 4.81/2.04 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.81/2.05
% 4.81/2.05 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.81/2.08
% 4.81/2.08 Inference rules
% 4.81/2.08 ----------------------
% 4.81/2.08 #Ref : 0
% 4.81/2.08 #Sup : 125
% 4.81/2.08 #Fact : 0
% 4.81/2.08 #Define : 0
% 4.81/2.08 #Split : 0
% 4.81/2.08 #Chain : 0
% 4.81/2.08 #Close : 0
% 4.81/2.08
% 4.81/2.08 Ordering : KBO
% 4.81/2.08
% 4.81/2.08 Simplification rules
% 4.81/2.08 ----------------------
% 4.81/2.08 #Subsume : 36
% 4.81/2.08 #Demod : 0
% 4.81/2.08 #Tautology : 83
% 4.81/2.08 #SimpNegUnit : 3
% 4.81/2.08 #BackRed : 3
% 4.81/2.08
% 4.81/2.08 #Partial instantiations: 0
% 4.81/2.08 #Strategies tried : 1
% 4.81/2.08
% 4.81/2.08 Timing (in seconds)
% 4.81/2.08 ----------------------
% 4.81/2.08 Preprocessing : 0.65
% 4.81/2.08 Parsing : 0.33
% 4.81/2.08 CNF conversion : 0.06
% 4.81/2.08 Main loop : 0.43
% 4.81/2.08 Inferencing : 0.18
% 4.81/2.08 Reduction : 0.10
% 4.81/2.08 Demodulation : 0.07
% 4.81/2.08 BG Simplification : 0.04
% 4.81/2.08 Subsumption : 0.09
% 4.81/2.08 Abstraction : 0.02
% 4.81/2.08 MUC search : 0.00
% 4.81/2.08 Cooper : 0.00
% 4.81/2.08 Total : 1.13
% 4.81/2.08 Index Insertion : 0.00
% 4.81/2.08 Index Deletion : 0.00
% 4.81/2.08 Index Matching : 0.00
% 4.81/2.08 BG Taut test : 0.00
%------------------------------------------------------------------------------