TSTP Solution File: KRS111+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KRS111+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 : n005.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:12 EDT 2023
% Result : Unsatisfiable 3.97s 1.98s
% Output : CNFRefutation 3.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 28
% Syntax : Number of formulae : 56 ( 8 unt; 20 typ; 0 def)
% Number of atoms : 75 ( 10 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 71 ( 32 ~; 25 |; 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 : 26 ( 19 >; 7 *; 0 +; 0 <<)
% Number of predicates : 16 ( 14 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 45 (; 40 !; 5 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ rs > rinvS > rinvF1 > rinvF > rf1 > rf > ra_Px1 > xsd_string > xsd_integer > cpxcomp > cp > cowlThing > cowlNothing > cUnsatisfiable > #nlpp > i2003_11_14_17_21_15425 > #skF_5 > #skF_2 > #skF_4 > #skF_1 > #skF_3
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(rf,type,
rf: ( $i * $i ) > $o ).
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(rinvS,type,
rinvS: ( $i * $i ) > $o ).
tff(rs,type,
rs: ( $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(i2003_11_14_17_21_15425,type,
i2003_11_14_17_21_15425: $i ).
tff(rinvF,type,
rinvF: ( $i * $i ) > $o ).
tff(cUnsatisfiable,type,
cUnsatisfiable: $i > $o ).
tff(xsd_integer,type,
xsd_integer: $i > $o ).
tff(cpxcomp,type,
cpxcomp: $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(cp,type,
cp: $i > $o ).
tff(rinvF1,type,
rinvF1: ( $i * $i ) > $o ).
tff(cowlNothing,type,
cowlNothing: $i > $o ).
tff(f_234,axiom,
cUnsatisfiable(i2003_11_14_17_21_15425),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_11) ).
tff(f_183,axiom,
! [X] :
( cUnsatisfiable(X)
<=> ( ? [Y] :
( rf1(X,Y)
& cpxcomp(Y) )
& ? [Y] :
( rs(X,Y)
& cowlThing(Y) )
& ? [Y] :
( rf(X,Y)
& cp(Y) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
tff(f_242,axiom,
! [X,Y] :
( rs(X,Y)
=> rf1(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_13) ).
tff(f_210,axiom,
! [X,Y,Z] :
( ( rf1(X,Y)
& rf1(X,Z) )
=> ( Y = Z ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).
tff(f_238,axiom,
! [X,Y] :
( rs(X,Y)
=> rf(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_12) ).
tff(f_203,axiom,
! [X,Y,Z] :
( ( rf(X,Y)
& rf(X,Z) )
=> ( Y = Z ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
tff(f_196,axiom,
! [X] :
( cpxcomp(X)
<=> ? [Y0] : ra_Px1(X,Y0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
tff(f_190,axiom,
! [X] :
( cp(X)
<=> ~ ? [Y] : ra_Px1(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
tff(c_92,plain,
cUnsatisfiable(i2003_11_14_17_21_15425),
inference(cnfTransformation,[status(thm)],[f_234]) ).
tff(c_54,plain,
! [X_59] :
( cp('#skF_3'(X_59))
| ~ cUnsatisfiable(X_59) ),
inference(cnfTransformation,[status(thm)],[f_183]) ).
tff(c_60,plain,
! [X_59] :
( rs(X_59,'#skF_2'(X_59))
| ~ cUnsatisfiable(X_59) ),
inference(cnfTransformation,[status(thm)],[f_183]) ).
tff(c_127,plain,
! [X_117,Y_118] :
( rf1(X_117,Y_118)
| ~ rs(X_117,Y_118) ),
inference(cnfTransformation,[status(thm)],[f_242]) ).
tff(c_131,plain,
! [X_59] :
( rf1(X_59,'#skF_2'(X_59))
| ~ cUnsatisfiable(X_59) ),
inference(resolution,[status(thm)],[c_60,c_127]) ).
tff(c_64,plain,
! [X_59] :
( rf1(X_59,'#skF_1'(X_59))
| ~ cUnsatisfiable(X_59) ),
inference(cnfTransformation,[status(thm)],[f_183]) ).
tff(c_211,plain,
! [Z_143,Y_144,X_145] :
( ( Z_143 = Y_144 )
| ~ rf1(X_145,Z_143)
| ~ rf1(X_145,Y_144) ),
inference(cnfTransformation,[status(thm)],[f_210]) ).
tff(c_225,plain,
! [Y_149,X_150] :
( ( Y_149 = '#skF_1'(X_150) )
| ~ rf1(X_150,Y_149)
| ~ cUnsatisfiable(X_150) ),
inference(resolution,[status(thm)],[c_64,c_211]) ).
tff(c_242,plain,
! [X_155] :
( ( '#skF_2'(X_155) = '#skF_1'(X_155) )
| ~ cUnsatisfiable(X_155) ),
inference(resolution,[status(thm)],[c_131,c_225]) ).
tff(c_246,plain,
'#skF_2'(i2003_11_14_17_21_15425) = '#skF_1'(i2003_11_14_17_21_15425),
inference(resolution,[status(thm)],[c_92,c_242]) ).
tff(c_121,plain,
! [X_114,Y_115] :
( rf(X_114,Y_115)
| ~ rs(X_114,Y_115) ),
inference(cnfTransformation,[status(thm)],[f_238]) ).
tff(c_125,plain,
! [X_59] :
( rf(X_59,'#skF_2'(X_59))
| ~ cUnsatisfiable(X_59) ),
inference(resolution,[status(thm)],[c_60,c_121]) ).
tff(c_253,plain,
( rf(i2003_11_14_17_21_15425,'#skF_1'(i2003_11_14_17_21_15425))
| ~ cUnsatisfiable(i2003_11_14_17_21_15425) ),
inference(superposition,[status(thm),theory(equality)],[c_246,c_125]) ).
tff(c_265,plain,
rf(i2003_11_14_17_21_15425,'#skF_1'(i2003_11_14_17_21_15425)),
inference(demodulation,[status(thm),theory(equality)],[c_92,c_253]) ).
tff(c_56,plain,
! [X_59] :
( rf(X_59,'#skF_3'(X_59))
| ~ cUnsatisfiable(X_59) ),
inference(cnfTransformation,[status(thm)],[f_183]) ).
tff(c_184,plain,
! [Z_130,Y_131,X_132] :
( ( Z_130 = Y_131 )
| ~ rf(X_132,Z_130)
| ~ rf(X_132,Y_131) ),
inference(cnfTransformation,[status(thm)],[f_203]) ).
tff(c_335,plain,
! [Y_158,X_159] :
( ( Y_158 = '#skF_3'(X_159) )
| ~ rf(X_159,Y_158)
| ~ cUnsatisfiable(X_159) ),
inference(resolution,[status(thm)],[c_56,c_184]) ).
tff(c_338,plain,
( ( '#skF_1'(i2003_11_14_17_21_15425) = '#skF_3'(i2003_11_14_17_21_15425) )
| ~ cUnsatisfiable(i2003_11_14_17_21_15425) ),
inference(resolution,[status(thm)],[c_265,c_335]) ).
tff(c_347,plain,
'#skF_1'(i2003_11_14_17_21_15425) = '#skF_3'(i2003_11_14_17_21_15425),
inference(demodulation,[status(thm),theory(equality)],[c_92,c_338]) ).
tff(c_62,plain,
! [X_59] :
( cpxcomp('#skF_1'(X_59))
| ~ cUnsatisfiable(X_59) ),
inference(cnfTransformation,[status(thm)],[f_183]) ).
tff(c_132,plain,
! [X_119] :
( ra_Px1(X_119,'#skF_5'(X_119))
| ~ cpxcomp(X_119) ),
inference(cnfTransformation,[status(thm)],[f_196]) ).
tff(c_66,plain,
! [X_69,Y_72] :
( ~ ra_Px1(X_69,Y_72)
| ~ cp(X_69) ),
inference(cnfTransformation,[status(thm)],[f_190]) ).
tff(c_141,plain,
! [X_120] :
( ~ cp(X_120)
| ~ cpxcomp(X_120) ),
inference(resolution,[status(thm)],[c_132,c_66]) ).
tff(c_145,plain,
! [X_59] :
( ~ cp('#skF_1'(X_59))
| ~ cUnsatisfiable(X_59) ),
inference(resolution,[status(thm)],[c_62,c_141]) ).
tff(c_359,plain,
( ~ cp('#skF_3'(i2003_11_14_17_21_15425))
| ~ cUnsatisfiable(i2003_11_14_17_21_15425) ),
inference(superposition,[status(thm),theory(equality)],[c_347,c_145]) ).
tff(c_369,plain,
~ cp('#skF_3'(i2003_11_14_17_21_15425)),
inference(demodulation,[status(thm),theory(equality)],[c_92,c_359]) ).
tff(c_377,plain,
~ cUnsatisfiable(i2003_11_14_17_21_15425),
inference(resolution,[status(thm)],[c_54,c_369]) ).
tff(c_381,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_92,c_377]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : KRS111+1 : TPTP v8.1.2. Released v3.1.0.
% 0.08/0.15 % 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.16/0.36 % Computer : n005.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Thu Aug 3 20:05:27 EDT 2023
% 0.16/0.36 % CPUTime :
% 3.97/1.98 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.97/1.98
% 3.97/1.98 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.97/2.01
% 3.97/2.01 Inference rules
% 3.97/2.01 ----------------------
% 3.97/2.01 #Ref : 0
% 3.97/2.01 #Sup : 59
% 3.97/2.01 #Fact : 0
% 3.97/2.01 #Define : 0
% 3.97/2.01 #Split : 0
% 3.97/2.01 #Chain : 0
% 3.97/2.01 #Close : 0
% 3.97/2.01
% 3.97/2.01 Ordering : KBO
% 3.97/2.01
% 3.97/2.01 Simplification rules
% 3.97/2.01 ----------------------
% 3.97/2.01 #Subsume : 2
% 3.97/2.01 #Demod : 25
% 3.97/2.01 #Tautology : 46
% 3.97/2.01 #SimpNegUnit : 0
% 3.97/2.01 #BackRed : 5
% 3.97/2.01
% 3.97/2.01 #Partial instantiations: 0
% 3.97/2.01 #Strategies tried : 1
% 3.97/2.01
% 3.97/2.01 Timing (in seconds)
% 3.97/2.01 ----------------------
% 3.97/2.02 Preprocessing : 0.54
% 3.97/2.02 Parsing : 0.29
% 3.97/2.02 CNF conversion : 0.04
% 3.97/2.02 Main loop : 0.31
% 3.97/2.02 Inferencing : 0.13
% 3.97/2.02 Reduction : 0.07
% 3.97/2.02 Demodulation : 0.05
% 3.97/2.02 BG Simplification : 0.03
% 3.97/2.02 Subsumption : 0.06
% 3.97/2.02 Abstraction : 0.01
% 3.97/2.02 MUC search : 0.00
% 3.97/2.02 Cooper : 0.00
% 3.97/2.02 Total : 0.90
% 3.97/2.02 Index Insertion : 0.00
% 3.97/2.02 Index Deletion : 0.00
% 3.97/2.02 Index Matching : 0.00
% 3.97/2.02 BG Taut test : 0.00
%------------------------------------------------------------------------------