TSTP Solution File: KRS070+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KRS070+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 : n017.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.19s 1.93s
% Output : CNFRefutation 4.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 26
% Syntax : Number of formulae : 48 ( 7 unt; 21 typ; 0 def)
% Number of atoms : 59 ( 5 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 59 ( 27 ~; 21 |; 7 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 30 ( 20 >; 10 *; 0 +; 0 <<)
% Number of predicates : 19 ( 17 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 31 (; 28 !; 3 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ rrxa > rrx4a > rrx4 > rrx3a > rrx3 > rrx2a > rrx2 > rrx1a > rrx1 > rrx > xsd_string > xsd_integer > cowlThing > cowlNothing > cc2 > cc1 > cUnsatisfiable > #nlpp > i2003_11_14_17_18_32242 > #skF_2 > #skF_1 > #skF_3
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff(i2003_11_14_17_18_32242,type,
i2003_11_14_17_18_32242: $i ).
tff(rrxa,type,
rrxa: ( $i * $i ) > $o ).
tff(cowlThing,type,
cowlThing: $i > $o ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(rrx2,type,
rrx2: ( $i * $i ) > $o ).
tff(rrx1a,type,
rrx1a: ( $i * $i ) > $o ).
tff(rrx,type,
rrx: ( $i * $i ) > $o ).
tff(cc1,type,
cc1: $i > $o ).
tff(rrx2a,type,
rrx2a: ( $i * $i ) > $o ).
tff(cUnsatisfiable,type,
cUnsatisfiable: $i > $o ).
tff(xsd_integer,type,
xsd_integer: $i > $o ).
tff(rrx4,type,
rrx4: ( $i * $i ) > $o ).
tff(rrx3a,type,
rrx3a: ( $i * $i ) > $o ).
tff(rrx4a,type,
rrx4a: ( $i * $i ) > $o ).
tff(rrx1,type,
rrx1: ( $i * $i ) > $o ).
tff(rrx3,type,
rrx3: ( $i * $i ) > $o ).
tff(xsd_string,type,
xsd_string: $i > $o ).
tff('#skF_3',type,
'#skF_3': $i > $i ).
tff(cc2,type,
cc2: $i > $o ).
tff(cowlNothing,type,
cowlNothing: $i > $o ).
tff(f_259,axiom,
cUnsatisfiable(i2003_11_14_17_18_32242),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_8) ).
tff(f_222,axiom,
! [X] :
( cUnsatisfiable(X)
<=> ( ? [Y] :
( rrx4(X,Y)
& cc2(Y) )
& ~ ? [Y] :
( rrx3(X,Y)
& cc2(Y)
& cc1(Y) )
& ? [Y] :
( rrx3(X,Y)
& cc1(Y) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
tff(f_263,axiom,
! [X,Y] :
( rrx3(X,Y)
=> rrx(X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_9) ).
tff(f_291,axiom,
! [X,Y] :
( rrx4(X,Y)
=> rrx(X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_16) ).
tff(f_229,axiom,
! [X,Y,Z] :
( ( rrx(X,Y)
& rrx(X,Z) )
=> ( Y = Z ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
tff(c_90,plain,
cUnsatisfiable(i2003_11_14_17_18_32242),
inference(cnfTransformation,[status(thm)],[f_259]) ).
tff(c_64,plain,
! [X_77] :
( cc1('#skF_3'(X_77))
| ~ cUnsatisfiable(X_77) ),
inference(cnfTransformation,[status(thm)],[f_222]) ).
tff(c_121,plain,
! [X_132] :
( rrx3(X_132,'#skF_3'(X_132))
| ~ cUnsatisfiable(X_132) ),
inference(cnfTransformation,[status(thm)],[f_222]) ).
tff(c_92,plain,
! [X_102,Y_103] :
( rrx(X_102,Y_103)
| ~ rrx3(X_102,Y_103) ),
inference(cnfTransformation,[status(thm)],[f_263]) ).
tff(c_128,plain,
! [X_132] :
( rrx(X_132,'#skF_3'(X_132))
| ~ cUnsatisfiable(X_132) ),
inference(resolution,[status(thm)],[c_121,c_92]) ).
tff(c_134,plain,
! [X_141] :
( rrx4(X_141,'#skF_2'(X_141))
| ~ cUnsatisfiable(X_141) ),
inference(cnfTransformation,[status(thm)],[f_222]) ).
tff(c_106,plain,
! [X_116,Y_117] :
( rrx(X_116,Y_117)
| ~ rrx4(X_116,Y_117) ),
inference(cnfTransformation,[status(thm)],[f_291]) ).
tff(c_150,plain,
! [X_148] :
( rrx(X_148,'#skF_2'(X_148))
| ~ cUnsatisfiable(X_148) ),
inference(resolution,[status(thm)],[c_134,c_106]) ).
tff(c_80,plain,
! [Z_89,Y_88,X_87] :
( ( Z_89 = Y_88 )
| ~ rrx(X_87,Z_89)
| ~ rrx(X_87,Y_88) ),
inference(cnfTransformation,[status(thm)],[f_229]) ).
tff(c_176,plain,
! [Y_165,X_166] :
( ( Y_165 = '#skF_2'(X_166) )
| ~ rrx(X_166,Y_165)
| ~ cUnsatisfiable(X_166) ),
inference(resolution,[status(thm)],[c_150,c_80]) ).
tff(c_191,plain,
! [X_169] :
( ( '#skF_2'(X_169) = '#skF_3'(X_169) )
| ~ cUnsatisfiable(X_169) ),
inference(resolution,[status(thm)],[c_128,c_176]) ).
tff(c_195,plain,
'#skF_2'(i2003_11_14_17_18_32242) = '#skF_3'(i2003_11_14_17_18_32242),
inference(resolution,[status(thm)],[c_90,c_191]) ).
tff(c_70,plain,
! [X_77] :
( cc2('#skF_2'(X_77))
| ~ cUnsatisfiable(X_77) ),
inference(cnfTransformation,[status(thm)],[f_222]) ).
tff(c_208,plain,
( cc2('#skF_3'(i2003_11_14_17_18_32242))
| ~ cUnsatisfiable(i2003_11_14_17_18_32242) ),
inference(superposition,[status(thm),theory(equality)],[c_195,c_70]) ).
tff(c_218,plain,
cc2('#skF_3'(i2003_11_14_17_18_32242)),
inference(demodulation,[status(thm),theory(equality)],[c_90,c_208]) ).
tff(c_66,plain,
! [X_77] :
( rrx3(X_77,'#skF_3'(X_77))
| ~ cUnsatisfiable(X_77) ),
inference(cnfTransformation,[status(thm)],[f_222]) ).
tff(c_186,plain,
! [Y_167,X_168] :
( ~ cc1(Y_167)
| ~ cc2(Y_167)
| ~ rrx3(X_168,Y_167)
| ~ cUnsatisfiable(X_168) ),
inference(cnfTransformation,[status(thm)],[f_222]) ).
tff(c_290,plain,
! [X_178] :
( ~ cc1('#skF_3'(X_178))
| ~ cc2('#skF_3'(X_178))
| ~ cUnsatisfiable(X_178) ),
inference(resolution,[status(thm)],[c_66,c_186]) ).
tff(c_293,plain,
( ~ cc1('#skF_3'(i2003_11_14_17_18_32242))
| ~ cUnsatisfiable(i2003_11_14_17_18_32242) ),
inference(resolution,[status(thm)],[c_218,c_290]) ).
tff(c_296,plain,
~ cc1('#skF_3'(i2003_11_14_17_18_32242)),
inference(demodulation,[status(thm),theory(equality)],[c_90,c_293]) ).
tff(c_299,plain,
~ cUnsatisfiable(i2003_11_14_17_18_32242),
inference(resolution,[status(thm)],[c_64,c_296]) ).
tff(c_303,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_90,c_299]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : KRS070+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.14/0.36 % Computer : n017.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 19:33:06 EDT 2023
% 0.14/0.36 % CPUTime :
% 4.19/1.93 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.19/1.93
% 4.19/1.93 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.19/1.96
% 4.19/1.96 Inference rules
% 4.19/1.96 ----------------------
% 4.19/1.96 #Ref : 0
% 4.19/1.96 #Sup : 36
% 4.19/1.96 #Fact : 0
% 4.19/1.96 #Define : 0
% 4.19/1.96 #Split : 0
% 4.19/1.96 #Chain : 0
% 4.19/1.96 #Close : 0
% 4.19/1.96
% 4.19/1.96 Ordering : KBO
% 4.19/1.96
% 4.19/1.96 Simplification rules
% 4.19/1.96 ----------------------
% 4.19/1.96 #Subsume : 0
% 4.19/1.96 #Demod : 17
% 4.19/1.96 #Tautology : 44
% 4.19/1.96 #SimpNegUnit : 0
% 4.19/1.96 #BackRed : 0
% 4.19/1.96
% 4.19/1.96 #Partial instantiations: 0
% 4.19/1.96 #Strategies tried : 1
% 4.19/1.96
% 4.19/1.96 Timing (in seconds)
% 4.19/1.96 ----------------------
% 4.19/1.97 Preprocessing : 0.58
% 4.19/1.97 Parsing : 0.31
% 4.19/1.97 CNF conversion : 0.05
% 4.19/1.97 Main loop : 0.30
% 4.19/1.97 Inferencing : 0.13
% 4.19/1.97 Reduction : 0.07
% 4.19/1.97 Demodulation : 0.05
% 4.19/1.97 BG Simplification : 0.03
% 4.19/1.97 Subsumption : 0.06
% 4.19/1.97 Abstraction : 0.01
% 4.19/1.97 MUC search : 0.00
% 4.19/1.97 Cooper : 0.00
% 4.19/1.97 Total : 0.93
% 4.19/1.97 Index Insertion : 0.00
% 4.19/1.97 Index Deletion : 0.00
% 4.19/1.97 Index Matching : 0.00
% 4.19/1.97 BG Taut test : 0.00
%------------------------------------------------------------------------------