TSTP Solution File: KRS106+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KRS106+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 : n012.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:11 EDT 2023
% Result : Unsatisfiable 3.78s 1.84s
% Output : CNFRefutation 3.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 26
% Syntax : Number of formulae : 53 ( 8 unt; 18 typ; 0 def)
% Number of atoms : 73 ( 10 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 67 ( 29 ~; 24 |; 7 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 21 ( 17 >; 4 *; 0 +; 0 <<)
% Number of predicates : 14 ( 12 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 46 (; 41 !; 5 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ rf3 > rf2 > rf1 > ra_Px1 > xsd_string > xsd_integer > cp2 > cp1xcomp > cp1 > cowlThing > cowlNothing > cUnsatisfiable > #nlpp > i2003_11_14_17_20_57644 > #skF_5 > #skF_2 > #skF_4 > #skF_1 > #skF_3
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_5',type,
'#skF_5': $i > $i ).
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_20_57644,type,
i2003_11_14_17_20_57644: $i ).
tff(cUnsatisfiable,type,
cUnsatisfiable: $i > $o ).
tff(xsd_integer,type,
xsd_integer: $i > $o ).
tff(ra_Px1,type,
ra_Px1: ( $i * $i ) > $o ).
tff(rf1,type,
rf1: ( $i * $i ) > $o ).
tff(xsd_string,type,
xsd_string: $i > $o ).
tff('#skF_3',type,
'#skF_3': $i > $i ).
tff(rf2,type,
rf2: ( $i * $i ) > $o ).
tff(rf3,type,
rf3: ( $i * $i ) > $o ).
tff(cp1xcomp,type,
cp1xcomp: $i > $o ).
tff(cp2,type,
cp2: $i > $o ).
tff(cowlNothing,type,
cowlNothing: $i > $o ).
tff(cp1,type,
cp1: $i > $o ).
tff(f_189,axiom,
cUnsatisfiable(i2003_11_14_17_20_57644),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_8) ).
tff(f_153,axiom,
! [X] :
( cUnsatisfiable(X)
<=> ( ? [Y] :
( rf3(X,Y)
& cp2(Y) )
& ? [Y] :
( rf1(X,Y)
& cp1(Y) )
& ? [Y] :
( rf2(X,Y)
& cp1xcomp(Y) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
tff(f_197,axiom,
! [X,Y] :
( rf3(X,Y)
=> rf2(X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_10) ).
tff(f_180,axiom,
! [X,Y,Z] :
( ( rf2(X,Y)
& rf2(X,Z) )
=> ( Y = Z ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
tff(f_193,axiom,
! [X,Y] :
( rf3(X,Y)
=> rf1(X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_9) ).
tff(f_173,axiom,
! [X,Y,Z] :
( ( rf1(X,Y)
& rf1(X,Z) )
=> ( Y = Z ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
tff(f_166,axiom,
! [X] :
( cp1xcomp(X)
<=> ? [Y0] : ra_Px1(X,Y0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
tff(f_160,axiom,
! [X] :
( cp1(X)
<=> ~ ? [Y] : ra_Px1(X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
tff(c_70,plain,
cUnsatisfiable(i2003_11_14_17_20_57644),
inference(cnfTransformation,[status(thm)],[f_189]) ).
tff(c_120,plain,
! [X_95] :
( rf3(X_95,'#skF_1'(X_95))
| ~ cUnsatisfiable(X_95) ),
inference(cnfTransformation,[status(thm)],[f_153]) ).
tff(c_74,plain,
! [X_72,Y_73] :
( rf2(X_72,Y_73)
| ~ rf3(X_72,Y_73) ),
inference(cnfTransformation,[status(thm)],[f_197]) ).
tff(c_128,plain,
! [X_95] :
( rf2(X_95,'#skF_1'(X_95))
| ~ cUnsatisfiable(X_95) ),
inference(resolution,[status(thm)],[c_120,c_74]) ).
tff(c_46,plain,
! [X_43] :
( rf2(X_43,'#skF_3'(X_43))
| ~ cUnsatisfiable(X_43) ),
inference(cnfTransformation,[status(thm)],[f_153]) ).
tff(c_143,plain,
! [Z_105,Y_106,X_107] :
( ( Z_105 = Y_106 )
| ~ rf2(X_107,Z_105)
| ~ rf2(X_107,Y_106) ),
inference(cnfTransformation,[status(thm)],[f_180]) ).
tff(c_222,plain,
! [Y_118,X_119] :
( ( Y_118 = '#skF_3'(X_119) )
| ~ rf2(X_119,Y_118)
| ~ cUnsatisfiable(X_119) ),
inference(resolution,[status(thm)],[c_46,c_143]) ).
tff(c_232,plain,
! [X_120] :
( ( '#skF_1'(X_120) = '#skF_3'(X_120) )
| ~ cUnsatisfiable(X_120) ),
inference(resolution,[status(thm)],[c_128,c_222]) ).
tff(c_236,plain,
'#skF_1'(i2003_11_14_17_20_57644) = '#skF_3'(i2003_11_14_17_20_57644),
inference(resolution,[status(thm)],[c_70,c_232]) ).
tff(c_72,plain,
! [X_70,Y_71] :
( rf1(X_70,Y_71)
| ~ rf3(X_70,Y_71) ),
inference(cnfTransformation,[status(thm)],[f_193]) ).
tff(c_127,plain,
! [X_95] :
( rf1(X_95,'#skF_1'(X_95))
| ~ cUnsatisfiable(X_95) ),
inference(resolution,[status(thm)],[c_120,c_72]) ).
tff(c_50,plain,
! [X_43] :
( rf1(X_43,'#skF_2'(X_43))
| ~ cUnsatisfiable(X_43) ),
inference(cnfTransformation,[status(thm)],[f_153]) ).
tff(c_132,plain,
! [Z_99,Y_100,X_101] :
( ( Z_99 = Y_100 )
| ~ rf1(X_101,Z_99)
| ~ rf1(X_101,Y_100) ),
inference(cnfTransformation,[status(thm)],[f_173]) ).
tff(c_163,plain,
! [Y_114,X_115] :
( ( Y_114 = '#skF_2'(X_115) )
| ~ rf1(X_115,Y_114)
| ~ cUnsatisfiable(X_115) ),
inference(resolution,[status(thm)],[c_50,c_132]) ).
tff(c_173,plain,
! [X_116] :
( ( '#skF_2'(X_116) = '#skF_1'(X_116) )
| ~ cUnsatisfiable(X_116) ),
inference(resolution,[status(thm)],[c_127,c_163]) ).
tff(c_177,plain,
'#skF_2'(i2003_11_14_17_20_57644) = '#skF_1'(i2003_11_14_17_20_57644),
inference(resolution,[status(thm)],[c_70,c_173]) ).
tff(c_48,plain,
! [X_43] :
( cp1('#skF_2'(X_43))
| ~ cUnsatisfiable(X_43) ),
inference(cnfTransformation,[status(thm)],[f_153]) ).
tff(c_184,plain,
( cp1('#skF_1'(i2003_11_14_17_20_57644))
| ~ cUnsatisfiable(i2003_11_14_17_20_57644) ),
inference(superposition,[status(thm),theory(equality)],[c_177,c_48]) ).
tff(c_190,plain,
cp1('#skF_1'(i2003_11_14_17_20_57644)),
inference(demodulation,[status(thm),theory(equality)],[c_70,c_184]) ).
tff(c_249,plain,
cp1('#skF_3'(i2003_11_14_17_20_57644)),
inference(demodulation,[status(thm),theory(equality)],[c_236,c_190]) ).
tff(c_44,plain,
! [X_43] :
( cp1xcomp('#skF_3'(X_43))
| ~ cUnsatisfiable(X_43) ),
inference(cnfTransformation,[status(thm)],[f_153]) ).
tff(c_99,plain,
! [X_89] :
( ra_Px1(X_89,'#skF_5'(X_89))
| ~ cp1xcomp(X_89) ),
inference(cnfTransformation,[status(thm)],[f_166]) ).
tff(c_56,plain,
! [X_53,Y_56] :
( ~ ra_Px1(X_53,Y_56)
| ~ cp1(X_53) ),
inference(cnfTransformation,[status(thm)],[f_160]) ).
tff(c_108,plain,
! [X_90] :
( ~ cp1(X_90)
| ~ cp1xcomp(X_90) ),
inference(resolution,[status(thm)],[c_99,c_56]) ).
tff(c_116,plain,
! [X_43] :
( ~ cp1('#skF_3'(X_43))
| ~ cUnsatisfiable(X_43) ),
inference(resolution,[status(thm)],[c_44,c_108]) ).
tff(c_277,plain,
~ cUnsatisfiable(i2003_11_14_17_20_57644),
inference(resolution,[status(thm)],[c_249,c_116]) ).
tff(c_281,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_70,c_277]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : KRS106+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.12 % 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.11/0.33 % Computer : n012.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Thu Aug 3 20:03:07 EDT 2023
% 0.11/0.34 % CPUTime :
% 3.78/1.84 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.78/1.85
% 3.78/1.85 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.78/1.88
% 3.78/1.88 Inference rules
% 3.78/1.88 ----------------------
% 3.78/1.88 #Ref : 0
% 3.78/1.88 #Sup : 41
% 3.78/1.88 #Fact : 0
% 3.78/1.88 #Define : 0
% 3.78/1.88 #Split : 0
% 3.78/1.88 #Chain : 0
% 3.78/1.88 #Close : 0
% 3.78/1.88
% 3.78/1.88 Ordering : KBO
% 3.78/1.88
% 3.78/1.88 Simplification rules
% 3.78/1.88 ----------------------
% 3.78/1.88 #Subsume : 1
% 3.78/1.88 #Demod : 16
% 3.78/1.88 #Tautology : 34
% 3.78/1.88 #SimpNegUnit : 0
% 3.78/1.88 #BackRed : 4
% 3.78/1.88
% 3.78/1.88 #Partial instantiations: 0
% 3.78/1.88 #Strategies tried : 1
% 3.78/1.88
% 3.78/1.88 Timing (in seconds)
% 3.78/1.88 ----------------------
% 3.78/1.88 Preprocessing : 0.53
% 3.78/1.88 Parsing : 0.28
% 3.78/1.88 CNF conversion : 0.04
% 3.78/1.88 Main loop : 0.30
% 3.78/1.88 Inferencing : 0.13
% 3.78/1.88 Reduction : 0.07
% 3.78/1.88 Demodulation : 0.05
% 3.78/1.88 BG Simplification : 0.02
% 3.78/1.88 Subsumption : 0.06
% 3.78/1.88 Abstraction : 0.01
% 3.78/1.88 MUC search : 0.00
% 3.78/1.88 Cooper : 0.00
% 3.78/1.88 Total : 0.89
% 3.78/1.88 Index Insertion : 0.00
% 3.78/1.88 Index Deletion : 0.00
% 3.78/1.88 Index Matching : 0.00
% 3.78/1.88 BG Taut test : 0.00
%------------------------------------------------------------------------------