TSTP Solution File: KRS084+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KRS084+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 : n025.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:08 EDT 2023
% Result : Unsatisfiable 4.79s 2.12s
% Output : CNFRefutation 4.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 23
% Syntax : Number of formulae : 48 ( 4 unt; 16 typ; 0 def)
% Number of atoms : 80 ( 5 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 90 ( 42 ~; 34 |; 7 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 20 ( 15 >; 5 *; 0 +; 0 <<)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 53 (; 50 !; 3 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ rr > rinvR > rinvF > rf > xsd_string > xsd_integer > cowlThing > cowlNothing > cd > cc > cUnsatisfiable > #nlpp > i2003_11_14_17_19_35232 > #skF_2 > #skF_4 > #skF_1 > #skF_3
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(rf,type,
rf: ( $i * $i ) > $o ).
tff(rinvR,type,
rinvR: ( $i * $i ) > $o ).
tff(rr,type,
rr: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff('#skF_4',type,
'#skF_4': $i > $i ).
tff(cc,type,
cc: $i > $o ).
tff(cowlThing,type,
cowlThing: $i > $o ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(rinvF,type,
rinvF: ( $i * $i ) > $o ).
tff(i2003_11_14_17_19_35232,type,
i2003_11_14_17_19_35232: $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff(cUnsatisfiable,type,
cUnsatisfiable: $i > $o ).
tff(xsd_integer,type,
xsd_integer: $i > $o ).
tff(xsd_string,type,
xsd_string: $i > $o ).
tff(cd,type,
cd: $i > $o ).
tff(cowlNothing,type,
cowlNothing: $i > $o ).
tff(f_149,axiom,
! [X] :
( cUnsatisfiable(X)
<=> ( ? [Y] :
( rinvF(X,Y)
& cd(Y) )
& ! [Y] :
( rinvR(X,Y)
=> ? [Z] :
( rinvF(Y,Z)
& cd(Z) ) )
& ~ cc(X) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
tff(f_160,axiom,
! [X] :
( cd(X)
<=> ( ? [Y] :
( rf(X,Y)
& ~ cc(Y) )
& cc(X) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
tff(f_172,axiom,
! [X,Y] :
( rinvF(X,Y)
<=> rf(Y,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
tff(f_190,axiom,
! [X,Y] :
( rf(X,Y)
=> rr(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_9) ).
tff(f_177,axiom,
! [X,Y] :
( rinvR(X,Y)
<=> rr(Y,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).
tff(f_167,axiom,
! [X,Y,Z] :
( ( rf(X,Y)
& rf(X,Z) )
=> ( Y = Z ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
tff(f_186,axiom,
cUnsatisfiable(i2003_11_14_17_19_35232),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_8) ).
tff(c_87,plain,
! [X_77] :
( cd('#skF_2'(X_77))
| ~ cUnsatisfiable(X_77) ),
inference(cnfTransformation,[status(thm)],[f_149]) ).
tff(c_56,plain,
! [X_55] :
( cc(X_55)
| ~ cd(X_55) ),
inference(cnfTransformation,[status(thm)],[f_160]) ).
tff(c_91,plain,
! [X_77] :
( cc('#skF_2'(X_77))
| ~ cUnsatisfiable(X_77) ),
inference(resolution,[status(thm)],[c_87,c_56]) ).
tff(c_100,plain,
! [X_83] :
( rinvF(X_83,'#skF_2'(X_83))
| ~ cUnsatisfiable(X_83) ),
inference(cnfTransformation,[status(thm)],[f_149]) ).
tff(c_64,plain,
! [Y_63,X_62] :
( rf(Y_63,X_62)
| ~ rinvF(X_62,Y_63) ),
inference(cnfTransformation,[status(thm)],[f_172]) ).
tff(c_104,plain,
! [X_83] :
( rf('#skF_2'(X_83),X_83)
| ~ cUnsatisfiable(X_83) ),
inference(resolution,[status(thm)],[c_100,c_64]) ).
tff(c_76,plain,
! [X_69,Y_70] :
( rr(X_69,Y_70)
| ~ rf(X_69,Y_70) ),
inference(cnfTransformation,[status(thm)],[f_190]) ).
tff(c_106,plain,
! [X_86,Y_87] :
( rinvR(X_86,Y_87)
| ~ rr(Y_87,X_86) ),
inference(cnfTransformation,[status(thm)],[f_177]) ).
tff(c_110,plain,
! [Y_70,X_69] :
( rinvR(Y_70,X_69)
| ~ rf(X_69,Y_70) ),
inference(resolution,[status(thm)],[c_76,c_106]) ).
tff(c_46,plain,
! [X_41,Y_53] :
( cd('#skF_3'(X_41,Y_53))
| ~ rinvR(X_41,Y_53)
| ~ cUnsatisfiable(X_41) ),
inference(cnfTransformation,[status(thm)],[f_149]) ).
tff(c_192,plain,
! [Y_118,X_119] :
( rinvF(Y_118,'#skF_3'(X_119,Y_118))
| ~ rinvR(X_119,Y_118)
| ~ cUnsatisfiable(X_119) ),
inference(cnfTransformation,[status(thm)],[f_149]) ).
tff(c_309,plain,
! [X_149,Y_150] :
( rf('#skF_3'(X_149,Y_150),Y_150)
| ~ rinvR(X_149,Y_150)
| ~ cUnsatisfiable(X_149) ),
inference(resolution,[status(thm)],[c_192,c_64]) ).
tff(c_60,plain,
! [X_55] :
( rf(X_55,'#skF_4'(X_55))
| ~ cd(X_55) ),
inference(cnfTransformation,[status(thm)],[f_160]) ).
tff(c_123,plain,
! [Z_95,Y_96,X_97] :
( ( Z_95 = Y_96 )
| ~ rf(X_97,Z_95)
| ~ rf(X_97,Y_96) ),
inference(cnfTransformation,[status(thm)],[f_167]) ).
tff(c_126,plain,
! [Y_96,X_55] :
( ( Y_96 = '#skF_4'(X_55) )
| ~ rf(X_55,Y_96)
| ~ cd(X_55) ),
inference(resolution,[status(thm)],[c_60,c_123]) ).
tff(c_768,plain,
! [X_232,Y_233] :
( ( '#skF_4'('#skF_3'(X_232,Y_233)) = Y_233 )
| ~ cd('#skF_3'(X_232,Y_233))
| ~ rinvR(X_232,Y_233)
| ~ cUnsatisfiable(X_232) ),
inference(resolution,[status(thm)],[c_309,c_126]) ).
tff(c_773,plain,
! [X_234,Y_235] :
( ( '#skF_4'('#skF_3'(X_234,Y_235)) = Y_235 )
| ~ rinvR(X_234,Y_235)
| ~ cUnsatisfiable(X_234) ),
inference(resolution,[status(thm)],[c_46,c_768]) ).
tff(c_58,plain,
! [X_55] :
( ~ cc('#skF_4'(X_55))
| ~ cd(X_55) ),
inference(cnfTransformation,[status(thm)],[f_160]) ).
tff(c_835,plain,
! [Y_236,X_237] :
( ~ cc(Y_236)
| ~ cd('#skF_3'(X_237,Y_236))
| ~ rinvR(X_237,Y_236)
| ~ cUnsatisfiable(X_237) ),
inference(superposition,[status(thm),theory(equality)],[c_773,c_58]) ).
tff(c_840,plain,
! [Y_238,X_239] :
( ~ cc(Y_238)
| ~ rinvR(X_239,Y_238)
| ~ cUnsatisfiable(X_239) ),
inference(resolution,[status(thm)],[c_46,c_835]) ).
tff(c_874,plain,
! [X_243,Y_244] :
( ~ cc(X_243)
| ~ cUnsatisfiable(Y_244)
| ~ rf(X_243,Y_244) ),
inference(resolution,[status(thm)],[c_110,c_840]) ).
tff(c_887,plain,
! [X_245] :
( ~ cc('#skF_2'(X_245))
| ~ cUnsatisfiable(X_245) ),
inference(resolution,[status(thm)],[c_104,c_874]) ).
tff(c_891,plain,
! [X_77] : ~ cUnsatisfiable(X_77),
inference(resolution,[status(thm)],[c_91,c_887]) ).
tff(c_74,plain,
cUnsatisfiable(i2003_11_14_17_19_35232),
inference(cnfTransformation,[status(thm)],[f_186]) ).
tff(c_903,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_891,c_74]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : KRS084+1 : TPTP v8.1.2. Released v3.1.0.
% 0.13/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.13/0.35 % Computer : n025.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 20:16:20 EDT 2023
% 0.13/0.35 % CPUTime :
% 4.79/2.12 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.79/2.12
% 4.79/2.12 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.79/2.16
% 4.79/2.16 Inference rules
% 4.79/2.16 ----------------------
% 4.79/2.16 #Ref : 0
% 4.79/2.16 #Sup : 217
% 4.79/2.16 #Fact : 0
% 4.79/2.16 #Define : 0
% 4.79/2.16 #Split : 0
% 4.79/2.16 #Chain : 0
% 4.79/2.16 #Close : 0
% 4.79/2.16
% 4.79/2.16 Ordering : KBO
% 4.79/2.16
% 4.79/2.16 Simplification rules
% 4.79/2.16 ----------------------
% 4.79/2.16 #Subsume : 77
% 4.79/2.16 #Demod : 0
% 4.79/2.16 #Tautology : 32
% 4.79/2.16 #SimpNegUnit : 11
% 4.79/2.16 #BackRed : 6
% 4.79/2.16
% 4.79/2.16 #Partial instantiations: 0
% 4.79/2.16 #Strategies tried : 1
% 4.79/2.16
% 4.79/2.16 Timing (in seconds)
% 4.79/2.16 ----------------------
% 4.79/2.16 Preprocessing : 0.52
% 4.79/2.16 Parsing : 0.28
% 4.79/2.16 CNF conversion : 0.04
% 4.79/2.16 Main loop : 0.53
% 4.79/2.16 Inferencing : 0.21
% 4.79/2.16 Reduction : 0.11
% 4.79/2.16 Demodulation : 0.07
% 4.79/2.16 BG Simplification : 0.03
% 4.79/2.16 Subsumption : 0.15
% 4.79/2.16 Abstraction : 0.02
% 4.79/2.16 MUC search : 0.00
% 4.79/2.16 Cooper : 0.00
% 4.79/2.16 Total : 1.10
% 4.79/2.16 Index Insertion : 0.00
% 4.79/2.16 Index Deletion : 0.00
% 4.79/2.16 Index Matching : 0.00
% 4.79/2.16 BG Taut test : 0.00
%------------------------------------------------------------------------------