TSTP Solution File: KRS071+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KRS071+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 : n026.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:06 EDT 2023
% Result : Unsatisfiable 4.38s 2.25s
% Output : CNFRefutation 4.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 23
% Syntax : Number of formulae : 58 ( 14 unt; 19 typ; 0 def)
% Number of atoms : 95 ( 23 equ)
% Maximal formula atoms : 13 ( 2 avg)
% Number of connectives : 95 ( 39 ~; 44 |; 8 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 20 ( 18 >; 2 *; 0 +; 0 <<)
% Number of predicates : 14 ( 12 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-1 aty)
% Number of variables : 32 (; 29 !; 3 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ rr > rinvR > xsd_string > xsd_integer > cp5 > cp4 > cp3 > cp2 > cp1 > cowlThing > cowlNothing > cUnsatisfiable > #nlpp > i2003_11_14_17_18_39380 > #skF_5 > #skF_2 > #skF_4 > #skF_1 > #skF_3 > #skF_6
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_5',type,
'#skF_5': $i > $i ).
tff(rinvR,type,
rinvR: ( $i * $i ) > $o ).
tff(cp5,type,
cp5: $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(cowlThing,type,
cowlThing: $i > $o ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(i2003_11_14_17_18_39380,type,
i2003_11_14_17_18_39380: $i ).
tff(cp4,type,
cp4: $i > $o ).
tff(cUnsatisfiable,type,
cUnsatisfiable: $i > $o ).
tff(xsd_integer,type,
xsd_integer: $i > $o ).
tff(cp3,type,
cp3: $i > $o ).
tff(xsd_string,type,
xsd_string: $i > $o ).
tff('#skF_3',type,
'#skF_3': $i > $i ).
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(f_197,axiom,
cUnsatisfiable(i2003_11_14_17_18_39380),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_8) ).
tff(f_154,axiom,
! [X] :
( cUnsatisfiable(X)
<=> ( ? [Y] :
( rr(X,Y)
& cp1(Y) )
& ? [Y] :
( rr(X,Y)
& cp2(Y) )
& ? [Y] :
( rr(X,Y)
& cp3(Y) )
& ! [Y0,Y1,Y2] :
( ( rr(X,Y0)
& rr(X,Y1)
& rr(X,Y2) )
=> ( ( Y0 = Y1 )
| ( Y0 = Y2 )
| ( Y1 = Y2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
tff(f_166,axiom,
! [X] :
( cp1(X)
=> ~ ( cp4(X)
| cp2(X)
| cp3(X)
| cp5(X) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
tff(f_176,axiom,
! [X] :
( cp2(X)
=> ~ ( cp4(X)
| cp3(X)
| cp5(X) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
tff(c_88,plain,
cUnsatisfiable(i2003_11_14_17_18_39380),
inference(cnfTransformation,[status(thm)],[f_197]) ).
tff(c_48,plain,
! [X_35] :
( cp1('#skF_4'(X_35))
| ~ cUnsatisfiable(X_35) ),
inference(cnfTransformation,[status(thm)],[f_154]) ).
tff(c_42,plain,
! [X_35] :
( rr(X_35,'#skF_6'(X_35))
| ~ cUnsatisfiable(X_35) ),
inference(cnfTransformation,[status(thm)],[f_154]) ).
tff(c_50,plain,
! [X_35] :
( rr(X_35,'#skF_4'(X_35))
| ~ cUnsatisfiable(X_35) ),
inference(cnfTransformation,[status(thm)],[f_154]) ).
tff(c_46,plain,
! [X_35] :
( rr(X_35,'#skF_5'(X_35))
| ~ cUnsatisfiable(X_35) ),
inference(cnfTransformation,[status(thm)],[f_154]) ).
tff(c_149,plain,
! [Y2_90,Y1_91,Y0_92,X_93] :
( ( Y2_90 = Y1_91 )
| ( Y2_90 = Y0_92 )
| ( Y1_91 = Y0_92 )
| ~ rr(X_93,Y2_90)
| ~ rr(X_93,Y1_91)
| ~ rr(X_93,Y0_92)
| ~ cUnsatisfiable(X_93) ),
inference(cnfTransformation,[status(thm)],[f_154]) ).
tff(c_162,plain,
! [Y1_94,X_95,Y0_96] :
( ( Y1_94 = '#skF_5'(X_95) )
| ( Y0_96 = '#skF_5'(X_95) )
| ( Y1_94 = Y0_96 )
| ~ rr(X_95,Y1_94)
| ~ rr(X_95,Y0_96)
| ~ cUnsatisfiable(X_95) ),
inference(resolution,[status(thm)],[c_46,c_149]) ).
tff(c_176,plain,
! [X_97,Y0_98] :
( ( '#skF_5'(X_97) = '#skF_4'(X_97) )
| ( Y0_98 = '#skF_5'(X_97) )
| ( Y0_98 = '#skF_4'(X_97) )
| ~ rr(X_97,Y0_98)
| ~ cUnsatisfiable(X_97) ),
inference(resolution,[status(thm)],[c_50,c_162]) ).
tff(c_195,plain,
! [X_99] :
( ( '#skF_5'(X_99) = '#skF_4'(X_99) )
| ( '#skF_5'(X_99) = '#skF_6'(X_99) )
| ( '#skF_4'(X_99) = '#skF_6'(X_99) )
| ~ cUnsatisfiable(X_99) ),
inference(resolution,[status(thm)],[c_42,c_176]) ).
tff(c_199,plain,
( ( '#skF_5'(i2003_11_14_17_18_39380) = '#skF_4'(i2003_11_14_17_18_39380) )
| ( '#skF_5'(i2003_11_14_17_18_39380) = '#skF_6'(i2003_11_14_17_18_39380) )
| ( '#skF_4'(i2003_11_14_17_18_39380) = '#skF_6'(i2003_11_14_17_18_39380) ) ),
inference(resolution,[status(thm)],[c_88,c_195]) ).
tff(c_200,plain,
'#skF_4'(i2003_11_14_17_18_39380) = '#skF_6'(i2003_11_14_17_18_39380),
inference(splitLeft,[status(thm)],[c_199]) ).
tff(c_210,plain,
( cp1('#skF_6'(i2003_11_14_17_18_39380))
| ~ cUnsatisfiable(i2003_11_14_17_18_39380) ),
inference(superposition,[status(thm),theory(equality)],[c_200,c_48]) ).
tff(c_218,plain,
cp1('#skF_6'(i2003_11_14_17_18_39380)),
inference(demodulation,[status(thm),theory(equality)],[c_88,c_210]) ).
tff(c_108,plain,
! [X_75] :
( cp3('#skF_6'(X_75))
| ~ cUnsatisfiable(X_75) ),
inference(cnfTransformation,[status(thm)],[f_154]) ).
tff(c_66,plain,
! [X_54] :
( ~ cp3(X_54)
| ~ cp1(X_54) ),
inference(cnfTransformation,[status(thm)],[f_166]) ).
tff(c_115,plain,
! [X_75] :
( ~ cp1('#skF_6'(X_75))
| ~ cUnsatisfiable(X_75) ),
inference(resolution,[status(thm)],[c_108,c_66]) ).
tff(c_235,plain,
~ cUnsatisfiable(i2003_11_14_17_18_39380),
inference(resolution,[status(thm)],[c_218,c_115]) ).
tff(c_239,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_88,c_235]) ).
tff(c_240,plain,
( ( '#skF_5'(i2003_11_14_17_18_39380) = '#skF_6'(i2003_11_14_17_18_39380) )
| ( '#skF_5'(i2003_11_14_17_18_39380) = '#skF_4'(i2003_11_14_17_18_39380) ) ),
inference(splitRight,[status(thm)],[c_199]) ).
tff(c_242,plain,
'#skF_5'(i2003_11_14_17_18_39380) = '#skF_4'(i2003_11_14_17_18_39380),
inference(splitLeft,[status(thm)],[c_240]) ).
tff(c_117,plain,
! [X_76] :
( cp2('#skF_5'(X_76))
| ~ cUnsatisfiable(X_76) ),
inference(cnfTransformation,[status(thm)],[f_154]) ).
tff(c_68,plain,
! [X_54] :
( ~ cp2(X_54)
| ~ cp1(X_54) ),
inference(cnfTransformation,[status(thm)],[f_166]) ).
tff(c_121,plain,
! [X_76] :
( ~ cp1('#skF_5'(X_76))
| ~ cUnsatisfiable(X_76) ),
inference(resolution,[status(thm)],[c_117,c_68]) ).
tff(c_265,plain,
( ~ cp1('#skF_4'(i2003_11_14_17_18_39380))
| ~ cUnsatisfiable(i2003_11_14_17_18_39380) ),
inference(superposition,[status(thm),theory(equality)],[c_242,c_121]) ).
tff(c_276,plain,
~ cp1('#skF_4'(i2003_11_14_17_18_39380)),
inference(demodulation,[status(thm),theory(equality)],[c_88,c_265]) ).
tff(c_282,plain,
~ cUnsatisfiable(i2003_11_14_17_18_39380),
inference(resolution,[status(thm)],[c_48,c_276]) ).
tff(c_286,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_88,c_282]) ).
tff(c_287,plain,
'#skF_5'(i2003_11_14_17_18_39380) = '#skF_6'(i2003_11_14_17_18_39380),
inference(splitRight,[status(thm)],[c_240]) ).
tff(c_44,plain,
! [X_35] :
( cp2('#skF_5'(X_35))
| ~ cUnsatisfiable(X_35) ),
inference(cnfTransformation,[status(thm)],[f_154]) ).
tff(c_301,plain,
( cp2('#skF_6'(i2003_11_14_17_18_39380))
| ~ cUnsatisfiable(i2003_11_14_17_18_39380) ),
inference(superposition,[status(thm),theory(equality)],[c_287,c_44]) ).
tff(c_311,plain,
cp2('#skF_6'(i2003_11_14_17_18_39380)),
inference(demodulation,[status(thm),theory(equality)],[c_88,c_301]) ).
tff(c_74,plain,
! [X_55] :
( ~ cp3(X_55)
| ~ cp2(X_55) ),
inference(cnfTransformation,[status(thm)],[f_176]) ).
tff(c_116,plain,
! [X_75] :
( ~ cp2('#skF_6'(X_75))
| ~ cUnsatisfiable(X_75) ),
inference(resolution,[status(thm)],[c_108,c_74]) ).
tff(c_315,plain,
~ cUnsatisfiable(i2003_11_14_17_18_39380),
inference(resolution,[status(thm)],[c_311,c_116]) ).
tff(c_322,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_88,c_315]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.13 % Problem : KRS071+1 : TPTP v8.1.2. Released v3.1.0.
% 0.05/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.10/0.33 % Computer : n026.cluster.edu
% 0.10/0.33 % Model : x86_64 x86_64
% 0.10/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.33 % Memory : 8042.1875MB
% 0.10/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.33 % CPULimit : 300
% 0.10/0.33 % WCLimit : 300
% 0.10/0.33 % DateTime : Thu Aug 3 20:23:47 EDT 2023
% 0.10/0.33 % CPUTime :
% 4.38/2.25 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.38/2.25
% 4.38/2.25 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.38/2.28
% 4.38/2.28 Inference rules
% 4.38/2.28 ----------------------
% 4.38/2.28 #Ref : 0
% 4.38/2.28 #Sup : 50
% 4.38/2.28 #Fact : 0
% 4.38/2.28 #Define : 0
% 4.38/2.28 #Split : 2
% 4.38/2.28 #Chain : 0
% 4.38/2.28 #Close : 0
% 4.38/2.28
% 4.38/2.28 Ordering : KBO
% 4.38/2.28
% 4.38/2.28 Simplification rules
% 4.38/2.28 ----------------------
% 4.38/2.28 #Subsume : 0
% 4.38/2.28 #Demod : 14
% 4.38/2.28 #Tautology : 31
% 4.38/2.29 #SimpNegUnit : 0
% 4.38/2.29 #BackRed : 0
% 4.38/2.29
% 4.38/2.29 #Partial instantiations: 0
% 4.38/2.29 #Strategies tried : 1
% 4.38/2.29
% 4.38/2.29 Timing (in seconds)
% 4.38/2.29 ----------------------
% 4.38/2.29 Preprocessing : 0.73
% 4.38/2.29 Parsing : 0.37
% 4.38/2.29 CNF conversion : 0.05
% 4.38/2.29 Main loop : 0.39
% 4.38/2.29 Inferencing : 0.14
% 4.38/2.29 Reduction : 0.09
% 4.38/2.29 Demodulation : 0.07
% 4.38/2.29 BG Simplification : 0.04
% 4.38/2.29 Subsumption : 0.09
% 4.38/2.29 Abstraction : 0.02
% 4.38/2.29 MUC search : 0.00
% 4.38/2.29 Cooper : 0.00
% 4.38/2.29 Total : 1.19
% 4.38/2.29 Index Insertion : 0.00
% 4.38/2.29 Index Deletion : 0.00
% 4.38/2.29 Index Matching : 0.00
% 4.38/2.29 BG Taut test : 0.00
%------------------------------------------------------------------------------