TSTP Solution File: KRS089+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KRS089+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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/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:09 EDT 2023
% Result : Unsatisfiable 5.64s 2.48s
% Output : CNFRefutation 5.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 20
% Syntax : Number of formulae : 41 ( 12 unt; 14 typ; 0 def)
% Number of atoms : 58 ( 27 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 51 ( 20 ~; 18 |; 9 &)
% ( 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 : 15 ( 12 >; 3 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-1 aty)
% Number of variables : 33 (; 29 !; 4 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ rr > rp > rinvP > xsd_string > xsd_integer > cowlThing > cowlNothing > cUnsatisfiable > #nlpp > ispy > i2003_11_14_17_19_53168 > #skF_2 > #skF_4 > #skF_1 > #skF_3
%Foreground sorts:
%Background operators:
%Foreground operators:
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(ispy,type,
ispy: $i ).
tff(rinvP,type,
rinvP: ( $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': $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('#skF_3',type,
'#skF_3': $i > $i ).
tff(i2003_11_14_17_19_53168,type,
i2003_11_14_17_19_53168: $i ).
tff(rp,type,
rp: ( $i * $i ) > $o ).
tff(cowlNothing,type,
cowlNothing: $i > $o ).
tff(f_102,axiom,
! [X] :
( cowlThing(X)
& ~ cowlNothing(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_0) ).
tff(f_135,axiom,
! [X] :
( cowlThing(X)
=> ? [Y] :
( rp(X,Y)
& ( Y = ispy ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
tff(f_140,axiom,
! [X,Y] :
( rp(X,Y)
<=> rinvP(Y,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
tff(f_153,axiom,
! [X0,X1,X2] :
( ( rinvP(ispy,X0)
& rinvP(ispy,X1)
& rinvP(ispy,X2) )
=> ( ( X0 = X1 )
| ( X0 = X2 )
| ( X1 = X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
tff(f_157,axiom,
cUnsatisfiable(i2003_11_14_17_19_53168),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
tff(f_127,axiom,
! [X] :
( cUnsatisfiable(X)
=> ? [Y0,Y1,Y2] :
( rr(X,Y0)
& rr(X,Y1)
& rr(X,Y2)
& ( Y0 != Y1 )
& ( Y0 != Y2 )
& ( Y1 != Y2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
tff(c_24,plain,
! [X_29] : cowlThing(X_29),
inference(cnfTransformation,[status(thm)],[f_102]) ).
tff(c_44,plain,
! [X_35] :
( ( '#skF_4'(X_35) = ispy )
| ~ cowlThing(X_35) ),
inference(cnfTransformation,[status(thm)],[f_135]) ).
tff(c_61,plain,
! [X_35] : ( '#skF_4'(X_35) = ispy ),
inference(demodulation,[status(thm),theory(equality)],[c_24,c_44]) ).
tff(c_46,plain,
! [X_35] :
( rp(X_35,'#skF_4'(X_35))
| ~ cowlThing(X_35) ),
inference(cnfTransformation,[status(thm)],[f_135]) ).
tff(c_59,plain,
! [X_35] : rp(X_35,'#skF_4'(X_35)),
inference(demodulation,[status(thm),theory(equality)],[c_24,c_46]) ).
tff(c_62,plain,
! [X_35] : rp(X_35,ispy),
inference(demodulation,[status(thm),theory(equality)],[c_61,c_59]) ).
tff(c_97,plain,
! [Y_55,X_56] :
( rinvP(Y_55,X_56)
| ~ rp(X_56,Y_55) ),
inference(cnfTransformation,[status(thm)],[f_140]) ).
tff(c_105,plain,
! [X_35] : rinvP(ispy,X_35),
inference(resolution,[status(thm)],[c_62,c_97]) ).
tff(c_52,plain,
! [X2_41,X1_40,X0_39] :
( ( X2_41 = X1_40 )
| ( X2_41 = X0_39 )
| ( X1_40 = X0_39 )
| ~ rinvP(ispy,X2_41)
| ~ rinvP(ispy,X1_40)
| ~ rinvP(ispy,X0_39) ),
inference(cnfTransformation,[status(thm)],[f_153]) ).
tff(c_290,plain,
! [X2_59,X1_60,X0_61] :
( ( X2_59 = X1_60 )
| ( X2_59 = X0_61 )
| ( X1_60 = X0_61 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_105,c_105,c_105,c_52]) ).
tff(c_56,plain,
cUnsatisfiable(i2003_11_14_17_19_53168),
inference(cnfTransformation,[status(thm)],[f_157]) ).
tff(c_86,plain,
! [X_52] :
( ( '#skF_2'(X_52) != '#skF_1'(X_52) )
| ~ cUnsatisfiable(X_52) ),
inference(cnfTransformation,[status(thm)],[f_127]) ).
tff(c_90,plain,
'#skF_2'(i2003_11_14_17_19_53168) != '#skF_1'(i2003_11_14_17_19_53168),
inference(resolution,[status(thm)],[c_56,c_86]) ).
tff(c_448,plain,
! [X2_59,X0_61] :
( ( X2_59 != '#skF_1'(i2003_11_14_17_19_53168) )
| ( X2_59 = X0_61 )
| ( X0_61 = '#skF_2'(i2003_11_14_17_19_53168) ) ),
inference(superposition,[status(thm),theory(equality)],[c_290,c_90]) ).
tff(c_4857,plain,
! [X0_1754] :
( ( X0_1754 = '#skF_1'(i2003_11_14_17_19_53168) )
| ( X0_1754 = '#skF_2'(i2003_11_14_17_19_53168) ) ),
inference(reflexivity,[status(thm),theory(equality)],[c_448]) ).
tff(c_79,plain,
! [X_48] :
( ( '#skF_2'(X_48) != '#skF_3'(X_48) )
| ~ cUnsatisfiable(X_48) ),
inference(cnfTransformation,[status(thm)],[f_127]) ).
tff(c_83,plain,
'#skF_2'(i2003_11_14_17_19_53168) != '#skF_3'(i2003_11_14_17_19_53168),
inference(resolution,[status(thm)],[c_56,c_79]) ).
tff(c_8306,plain,
'#skF_1'(i2003_11_14_17_19_53168) = '#skF_3'(i2003_11_14_17_19_53168),
inference(superposition,[status(thm),theory(equality)],[c_4857,c_83]) ).
tff(c_91,plain,
! [X_53] :
( ( '#skF_1'(X_53) != '#skF_3'(X_53) )
| ~ cUnsatisfiable(X_53) ),
inference(cnfTransformation,[status(thm)],[f_127]) ).
tff(c_95,plain,
'#skF_1'(i2003_11_14_17_19_53168) != '#skF_3'(i2003_11_14_17_19_53168),
inference(resolution,[status(thm)],[c_56,c_91]) ).
tff(c_8313,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_8306,c_95]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : KRS089+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/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:24:19 EDT 2023
% 0.13/0.36 % CPUTime :
% 5.64/2.48 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.64/2.48
% 5.64/2.48 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.64/2.51
% 5.64/2.51 Inference rules
% 5.64/2.51 ----------------------
% 5.64/2.51 #Ref : 1
% 5.64/2.51 #Sup : 1126
% 5.64/2.51 #Fact : 31
% 5.64/2.51 #Define : 0
% 5.64/2.51 #Split : 8
% 5.64/2.51 #Chain : 0
% 5.64/2.51 #Close : 0
% 5.64/2.51
% 5.64/2.51 Ordering : KBO
% 5.64/2.51
% 5.64/2.51 Simplification rules
% 5.64/2.51 ----------------------
% 5.64/2.51 #Subsume : 373
% 5.64/2.51 #Demod : 560
% 5.64/2.51 #Tautology : 129
% 5.64/2.51 #SimpNegUnit : 56
% 5.64/2.51 #BackRed : 34
% 5.64/2.51
% 5.64/2.51 #Partial instantiations: 3785
% 5.64/2.51 #Strategies tried : 1
% 5.64/2.51
% 5.64/2.51 Timing (in seconds)
% 5.64/2.51 ----------------------
% 5.64/2.51 Preprocessing : 0.54
% 5.64/2.51 Parsing : 0.28
% 5.64/2.51 CNF conversion : 0.04
% 5.64/2.51 Main loop : 0.86
% 5.64/2.51 Inferencing : 0.36
% 5.64/2.51 Reduction : 0.22
% 5.64/2.51 Demodulation : 0.15
% 5.64/2.51 BG Simplification : 0.04
% 5.64/2.51 Subsumption : 0.19
% 5.64/2.51 Abstraction : 0.05
% 5.64/2.51 MUC search : 0.00
% 5.64/2.51 Cooper : 0.00
% 5.64/2.51 Total : 1.45
% 5.64/2.51 Index Insertion : 0.00
% 5.64/2.51 Index Deletion : 0.00
% 5.64/2.51 Index Matching : 0.00
% 5.64/2.51 BG Taut test : 0.00
%------------------------------------------------------------------------------