TSTP Solution File: KRS129+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KRS129+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 : n016.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:14 EDT 2023
% Result : Theorem 3.70s 1.96s
% Output : CNFRefutation 3.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 28
% Syntax : Number of formulae : 74 ( 25 unt; 22 typ; 0 def)
% Number of atoms : 108 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 112 ( 56 ~; 47 |; 5 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 11 >; 2 *; 0 +; 0 <<)
% Number of predicates : 11 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 11 con; 0-1 aty)
% Number of variables : 21 (; 20 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ risEuroMPFrom > rhasEuroMP > xsd_string > xsd_integer > cowlThing > cowlNothing > cPerson > cEuropeanCountry > cEuroMP > cEUCountry > #nlpp > iUK > iPT > iNL > iKinnock > iFR > iES > iBE > #skF_1 > #skF_5 > #skF_2 > #skF_3 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(iPT,type,
iPT: $i ).
tff(cPerson,type,
cPerson: $i > $o ).
tff(cEUCountry,type,
cEUCountry: $i > $o ).
tff(cowlThing,type,
cowlThing: $i > $o ).
tff(iES,type,
iES: $i ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(iBE,type,
iBE: $i ).
tff(xsd_integer,type,
xsd_integer: $i > $o ).
tff(iUK,type,
iUK: $i ).
tff('#skF_5',type,
'#skF_5': $i ).
tff(rhasEuroMP,type,
rhasEuroMP: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff(risEuroMPFrom,type,
risEuroMPFrom: ( $i * $i ) > $o ).
tff(iKinnock,type,
iKinnock: $i ).
tff(iNL,type,
iNL: $i ).
tff(cEuropeanCountry,type,
cEuropeanCountry: $i > $o ).
tff(xsd_string,type,
xsd_string: $i > $o ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(iFR,type,
iFR: $i ).
tff(cEuroMP,type,
cEuroMP: $i > $o ).
tff(cowlNothing,type,
cowlNothing: $i > $o ).
tff(f_105,axiom,
! [X] :
( cowlThing(X)
& ~ cowlNothing(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_0) ).
tff(f_176,negated_conjecture,
~ ( ! [X] :
( cowlThing(X)
& ~ cowlNothing(X) )
& ! [X] :
( xsd_string(X)
<=> ~ xsd_integer(X) )
& cEuroMP(iKinnock) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',the_axiom) ).
tff(f_159,axiom,
rhasEuroMP(iUK,iKinnock),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_13) ).
tff(f_144,axiom,
! [X,Y] :
( risEuroMPFrom(X,Y)
<=> rhasEuroMP(Y,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
tff(f_134,axiom,
! [X] :
( cEuroMP(X)
<=> ? [Y] :
( risEuroMPFrom(X,Y)
& cowlThing(Y) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
tff(f_111,axiom,
! [X] :
( xsd_string(X)
<=> ~ xsd_integer(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1) ).
tff(c_26,plain,
! [X_29] : cowlThing(X_29),
inference(cnfTransformation,[status(thm)],[f_105]) ).
tff(c_28,plain,
! [X_29] : ~ cowlNothing(X_29),
inference(cnfTransformation,[status(thm)],[f_105]) ).
tff(c_76,plain,
( ~ xsd_string('#skF_4')
| xsd_integer('#skF_5')
| ~ cEuroMP(iKinnock)
| ~ cowlThing('#skF_3')
| cowlNothing('#skF_2') ),
inference(cnfTransformation,[status(thm)],[f_176]) ).
tff(c_83,plain,
( ~ xsd_string('#skF_4')
| xsd_integer('#skF_5')
| ~ cEuroMP(iKinnock)
| ~ cowlThing('#skF_3') ),
inference(negUnitSimplification,[status(thm)],[c_28,c_76]) ).
tff(c_91,plain,
( ~ xsd_string('#skF_4')
| xsd_integer('#skF_5')
| ~ cEuroMP(iKinnock) ),
inference(demodulation,[status(thm),theory(equality)],[c_26,c_83]) ).
tff(c_98,plain,
~ cEuroMP(iKinnock),
inference(splitLeft,[status(thm)],[c_91]) ).
tff(c_74,plain,
rhasEuroMP(iUK,iKinnock),
inference(cnfTransformation,[status(thm)],[f_159]) ).
tff(c_124,plain,
! [X_51,Y_52] :
( risEuroMPFrom(X_51,Y_52)
| ~ rhasEuroMP(Y_52,X_51) ),
inference(cnfTransformation,[status(thm)],[f_144]) ).
tff(c_48,plain,
! [X_32,Y_35] :
( cEuroMP(X_32)
| ~ cowlThing(Y_35)
| ~ risEuroMPFrom(X_32,Y_35) ),
inference(cnfTransformation,[status(thm)],[f_134]) ).
tff(c_89,plain,
! [X_32,Y_35] :
( cEuroMP(X_32)
| ~ risEuroMPFrom(X_32,Y_35) ),
inference(demodulation,[status(thm),theory(equality)],[c_26,c_48]) ).
tff(c_133,plain,
! [X_53,Y_54] :
( cEuroMP(X_53)
| ~ rhasEuroMP(Y_54,X_53) ),
inference(resolution,[status(thm)],[c_124,c_89]) ).
tff(c_136,plain,
cEuroMP(iKinnock),
inference(resolution,[status(thm)],[c_74,c_133]) ).
tff(c_140,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_98,c_136]) ).
tff(c_142,plain,
cEuroMP(iKinnock),
inference(splitRight,[status(thm)],[c_91]) ).
tff(c_82,plain,
( ~ xsd_integer('#skF_4')
| xsd_string('#skF_5')
| ~ cEuroMP(iKinnock)
| ~ cowlThing('#skF_3')
| cowlNothing('#skF_2') ),
inference(cnfTransformation,[status(thm)],[f_176]) ).
tff(c_84,plain,
( ~ xsd_integer('#skF_4')
| xsd_string('#skF_5')
| ~ cEuroMP(iKinnock)
| ~ cowlThing('#skF_3') ),
inference(negUnitSimplification,[status(thm)],[c_28,c_82]) ).
tff(c_93,plain,
( ~ xsd_integer('#skF_4')
| xsd_string('#skF_5')
| ~ cEuroMP(iKinnock) ),
inference(demodulation,[status(thm),theory(equality)],[c_26,c_84]) ).
tff(c_144,plain,
~ cEuroMP(iKinnock),
inference(splitLeft,[status(thm)],[c_93]) ).
tff(c_147,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_142,c_144]) ).
tff(c_149,plain,
cEuroMP(iKinnock),
inference(splitRight,[status(thm)],[c_93]) ).
tff(c_78,plain,
( ~ xsd_integer('#skF_4')
| xsd_integer('#skF_5')
| ~ cEuroMP(iKinnock)
| ~ cowlThing('#skF_3')
| cowlNothing('#skF_2') ),
inference(cnfTransformation,[status(thm)],[f_176]) ).
tff(c_86,plain,
( ~ xsd_integer('#skF_4')
| xsd_integer('#skF_5')
| ~ cEuroMP(iKinnock)
| ~ cowlThing('#skF_3') ),
inference(negUnitSimplification,[status(thm)],[c_28,c_78]) ).
tff(c_97,plain,
( ~ xsd_integer('#skF_4')
| xsd_integer('#skF_5')
| ~ cEuroMP(iKinnock) ),
inference(demodulation,[status(thm),theory(equality)],[c_26,c_86]) ).
tff(c_152,plain,
( ~ xsd_integer('#skF_4')
| xsd_integer('#skF_5') ),
inference(demodulation,[status(thm),theory(equality)],[c_149,c_97]) ).
tff(c_153,plain,
~ xsd_integer('#skF_4'),
inference(splitLeft,[status(thm)],[c_152]) ).
tff(c_159,plain,
! [X_59] :
( xsd_string(X_59)
| xsd_integer(X_59) ),
inference(cnfTransformation,[status(thm)],[f_111]) ).
tff(c_141,plain,
( ~ xsd_string('#skF_4')
| xsd_integer('#skF_5') ),
inference(splitRight,[status(thm)],[c_91]) ).
tff(c_155,plain,
~ xsd_string('#skF_4'),
inference(splitLeft,[status(thm)],[c_141]) ).
tff(c_165,plain,
xsd_integer('#skF_4'),
inference(resolution,[status(thm)],[c_159,c_155]) ).
tff(c_170,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_153,c_165]) ).
tff(c_171,plain,
xsd_integer('#skF_5'),
inference(splitRight,[status(thm)],[c_141]) ).
tff(c_172,plain,
xsd_string('#skF_4'),
inference(splitRight,[status(thm)],[c_141]) ).
tff(c_80,plain,
( ~ xsd_string('#skF_4')
| xsd_string('#skF_5')
| ~ cEuroMP(iKinnock)
| ~ cowlThing('#skF_3')
| cowlNothing('#skF_2') ),
inference(cnfTransformation,[status(thm)],[f_176]) ).
tff(c_85,plain,
( ~ xsd_string('#skF_4')
| xsd_string('#skF_5')
| ~ cEuroMP(iKinnock)
| ~ cowlThing('#skF_3') ),
inference(negUnitSimplification,[status(thm)],[c_28,c_80]) ).
tff(c_95,plain,
( ~ xsd_string('#skF_4')
| xsd_string('#skF_5')
| ~ cEuroMP(iKinnock) ),
inference(demodulation,[status(thm),theory(equality)],[c_26,c_85]) ).
tff(c_191,plain,
xsd_string('#skF_5'),
inference(demodulation,[status(thm),theory(equality)],[c_149,c_172,c_95]) ).
tff(c_30,plain,
! [X_30] :
( ~ xsd_integer(X_30)
| ~ xsd_string(X_30) ),
inference(cnfTransformation,[status(thm)],[f_111]) ).
tff(c_194,plain,
~ xsd_integer('#skF_5'),
inference(resolution,[status(thm)],[c_191,c_30]) ).
tff(c_198,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_171,c_194]) ).
tff(c_199,plain,
xsd_integer('#skF_5'),
inference(splitRight,[status(thm)],[c_152]) ).
tff(c_200,plain,
xsd_integer('#skF_4'),
inference(splitRight,[status(thm)],[c_152]) ).
tff(c_148,plain,
( ~ xsd_integer('#skF_4')
| xsd_string('#skF_5') ),
inference(splitRight,[status(thm)],[c_93]) ).
tff(c_212,plain,
xsd_string('#skF_5'),
inference(demodulation,[status(thm),theory(equality)],[c_200,c_148]) ).
tff(c_214,plain,
! [X_67] :
( ~ xsd_integer(X_67)
| ~ xsd_string(X_67) ),
inference(cnfTransformation,[status(thm)],[f_111]) ).
tff(c_217,plain,
~ xsd_integer('#skF_5'),
inference(resolution,[status(thm)],[c_212,c_214]) ).
tff(c_224,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_199,c_217]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : KRS129+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 : n016.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:38:53 EDT 2023
% 0.20/0.35 % CPUTime :
% 3.70/1.96 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.70/1.97
% 3.70/1.97 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.70/2.00
% 3.70/2.00 Inference rules
% 3.70/2.00 ----------------------
% 3.70/2.00 #Ref : 0
% 3.70/2.00 #Sup : 16
% 3.70/2.00 #Fact : 0
% 3.70/2.00 #Define : 0
% 3.70/2.00 #Split : 5
% 3.70/2.00 #Chain : 0
% 3.70/2.00 #Close : 0
% 3.70/2.00
% 3.70/2.00 Ordering : KBO
% 3.70/2.00
% 3.70/2.00 Simplification rules
% 3.70/2.00 ----------------------
% 3.70/2.00 #Subsume : 6
% 3.70/2.00 #Demod : 21
% 3.70/2.00 #Tautology : 23
% 3.70/2.00 #SimpNegUnit : 6
% 3.70/2.00 #BackRed : 0
% 3.70/2.00
% 3.70/2.00 #Partial instantiations: 0
% 3.70/2.00 #Strategies tried : 1
% 3.70/2.00
% 3.70/2.00 Timing (in seconds)
% 3.70/2.00 ----------------------
% 3.70/2.01 Preprocessing : 0.54
% 3.70/2.01 Parsing : 0.30
% 3.70/2.01 CNF conversion : 0.04
% 3.70/2.01 Main loop : 0.30
% 3.70/2.01 Inferencing : 0.10
% 3.70/2.01 Reduction : 0.08
% 3.70/2.01 Demodulation : 0.06
% 3.70/2.01 BG Simplification : 0.02
% 3.70/2.01 Subsumption : 0.06
% 3.70/2.01 Abstraction : 0.01
% 3.70/2.01 MUC search : 0.00
% 3.70/2.01 Cooper : 0.00
% 3.70/2.01 Total : 0.89
% 3.70/2.01 Index Insertion : 0.00
% 3.70/2.01 Index Deletion : 0.00
% 3.70/2.01 Index Matching : 0.00
% 3.70/2.01 BG Taut test : 0.00
%------------------------------------------------------------------------------