TSTP Solution File: KRS113+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KRS113+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 : n008.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.88s 1.89s
% Output : CNFRefutation 3.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 27
% Syntax : Number of formulae : 54 ( 9 unt; 20 typ; 0 def)
% Number of atoms : 73 ( 5 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 71 ( 32 ~; 25 |; 6 &)
% ( 5 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 23 ( 19 >; 4 *; 0 +; 0 <<)
% Number of predicates : 14 ( 12 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 1 con; 0-1 aty)
% Number of variables : 39 (; 35 !; 4 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ rs > rr > rinvS > ra_Px1 > xsd_string > xsd_integer > cpxcomp > cp > cowlThing > cowlNothing > ca_Vx2 > cUnsatisfiable > #nlpp > i2003_11_14_17_21_22376 > #skF_7 > #skF_5 > #skF_2 > #skF_4 > #skF_1 > #skF_3 > #skF_6
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_7',type,
'#skF_7': $i > $i ).
tff('#skF_5',type,
'#skF_5': $i > $i ).
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(rinvS,type,
rinvS: ( $i * $i ) > $o ).
tff(rs,type,
rs: ( $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(cUnsatisfiable,type,
cUnsatisfiable: $i > $o ).
tff(ca_Vx2,type,
ca_Vx2: $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(xsd_string,type,
xsd_string: $i > $o ).
tff('#skF_3',type,
'#skF_3': $i > $i ).
tff(cp,type,
cp: $i > $o ).
tff('#skF_6',type,
'#skF_6': $i > $i ).
tff(cowlNothing,type,
cowlNothing: $i > $o ).
tff(i2003_11_14_17_21_22376,type,
i2003_11_14_17_21_22376: $i ).
tff(f_185,axiom,
cUnsatisfiable(i2003_11_14_17_21_22376),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
tff(f_157,axiom,
! [X] :
( cUnsatisfiable(X)
<=> ( ! [Y0,Y1] :
( ( rr(X,Y0)
& rr(X,Y1) )
=> ( Y0 = Y1 ) )
& ? [Y] :
( rr(X,Y)
& ca_Vx2(Y) )
& ? [Y] :
( rs(X,Y)
& cp(Y) )
& cpxcomp(X) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
tff(f_189,axiom,
! [X,Y] :
( rs(X,Y)
=> rr(X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_8) ).
tff(f_183,axiom,
! [X,Y] :
( rinvS(X,Y)
<=> rs(Y,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
tff(f_178,axiom,
! [X] :
( ca_Vx2(X)
<=> ! [Y] :
( rinvS(X,Y)
=> cp(Y) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
tff(f_170,axiom,
! [X] :
( cpxcomp(X)
<=> ? [Y0] : ra_Px1(X,Y0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
tff(f_164,axiom,
! [X] :
( cp(X)
<=> ~ ? [Y] : ra_Px1(X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
tff(c_78,plain,
cUnsatisfiable(i2003_11_14_17_21_22376),
inference(cnfTransformation,[status(thm)],[f_185]) ).
tff(c_48,plain,
! [X_43] :
( ca_Vx2('#skF_3'(X_43))
| ~ cUnsatisfiable(X_43) ),
inference(cnfTransformation,[status(thm)],[f_157]) ).
tff(c_109,plain,
! [X_92] :
( rs(X_92,'#skF_4'(X_92))
| ~ cUnsatisfiable(X_92) ),
inference(cnfTransformation,[status(thm)],[f_157]) ).
tff(c_80,plain,
! [X_70,Y_71] :
( rr(X_70,Y_71)
| ~ rs(X_70,Y_71) ),
inference(cnfTransformation,[status(thm)],[f_189]) ).
tff(c_116,plain,
! [X_92] :
( rr(X_92,'#skF_4'(X_92))
| ~ cUnsatisfiable(X_92) ),
inference(resolution,[status(thm)],[c_109,c_80]) ).
tff(c_50,plain,
! [X_43] :
( rr(X_43,'#skF_3'(X_43))
| ~ cUnsatisfiable(X_43) ),
inference(cnfTransformation,[status(thm)],[f_157]) ).
tff(c_164,plain,
! [Y1_106,Y0_107,X_108] :
( ( Y1_106 = Y0_107 )
| ~ rr(X_108,Y1_106)
| ~ rr(X_108,Y0_107)
| ~ cUnsatisfiable(X_108) ),
inference(cnfTransformation,[status(thm)],[f_157]) ).
tff(c_181,plain,
! [Y0_112,X_113] :
( ( Y0_112 = '#skF_3'(X_113) )
| ~ rr(X_113,Y0_112)
| ~ cUnsatisfiable(X_113) ),
inference(resolution,[status(thm)],[c_50,c_164]) ).
tff(c_195,plain,
! [X_114] :
( ( '#skF_4'(X_114) = '#skF_3'(X_114) )
| ~ cUnsatisfiable(X_114) ),
inference(resolution,[status(thm)],[c_116,c_181]) ).
tff(c_199,plain,
'#skF_4'(i2003_11_14_17_21_22376) = '#skF_3'(i2003_11_14_17_21_22376),
inference(resolution,[status(thm)],[c_78,c_195]) ).
tff(c_76,plain,
! [X_68,Y_69] :
( rinvS(X_68,Y_69)
| ~ rs(Y_69,X_68) ),
inference(cnfTransformation,[status(thm)],[f_183]) ).
tff(c_158,plain,
! [X_104] :
( rinvS('#skF_4'(X_104),X_104)
| ~ cUnsatisfiable(X_104) ),
inference(resolution,[status(thm)],[c_109,c_76]) ).
tff(c_68,plain,
! [Y_67,X_64] :
( cp(Y_67)
| ~ rinvS(X_64,Y_67)
| ~ ca_Vx2(X_64) ),
inference(cnfTransformation,[status(thm)],[f_178]) ).
tff(c_162,plain,
! [X_104] :
( cp(X_104)
| ~ ca_Vx2('#skF_4'(X_104))
| ~ cUnsatisfiable(X_104) ),
inference(resolution,[status(thm)],[c_158,c_68]) ).
tff(c_203,plain,
( cp(i2003_11_14_17_21_22376)
| ~ ca_Vx2('#skF_3'(i2003_11_14_17_21_22376))
| ~ cUnsatisfiable(i2003_11_14_17_21_22376) ),
inference(superposition,[status(thm),theory(equality)],[c_199,c_162]) ).
tff(c_222,plain,
( cp(i2003_11_14_17_21_22376)
| ~ ca_Vx2('#skF_3'(i2003_11_14_17_21_22376)) ),
inference(demodulation,[status(thm),theory(equality)],[c_78,c_203]) ).
tff(c_293,plain,
~ ca_Vx2('#skF_3'(i2003_11_14_17_21_22376)),
inference(splitLeft,[status(thm)],[c_222]) ).
tff(c_296,plain,
~ cUnsatisfiable(i2003_11_14_17_21_22376),
inference(resolution,[status(thm)],[c_48,c_293]) ).
tff(c_300,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_78,c_296]) ).
tff(c_301,plain,
cp(i2003_11_14_17_21_22376),
inference(splitRight,[status(thm)],[c_222]) ).
tff(c_42,plain,
! [X_43] :
( cpxcomp(X_43)
| ~ cUnsatisfiable(X_43) ),
inference(cnfTransformation,[status(thm)],[f_157]) ).
tff(c_118,plain,
! [X_93] :
( ra_Px1(X_93,'#skF_6'(X_93))
| ~ cpxcomp(X_93) ),
inference(cnfTransformation,[status(thm)],[f_170]) ).
tff(c_60,plain,
! [X_56,Y_59] :
( ~ ra_Px1(X_56,Y_59)
| ~ cp(X_56) ),
inference(cnfTransformation,[status(thm)],[f_164]) ).
tff(c_136,plain,
! [X_96] :
( ~ cp(X_96)
| ~ cpxcomp(X_96) ),
inference(resolution,[status(thm)],[c_118,c_60]) ).
tff(c_144,plain,
! [X_43] :
( ~ cp(X_43)
| ~ cUnsatisfiable(X_43) ),
inference(resolution,[status(thm)],[c_42,c_136]) ).
tff(c_305,plain,
~ cUnsatisfiable(i2003_11_14_17_21_22376),
inference(resolution,[status(thm)],[c_301,c_144]) ).
tff(c_309,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_78,c_305]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : KRS113+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.36 % Computer : n008.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Thu Aug 3 20:08:33 EDT 2023
% 0.13/0.36 % CPUTime :
% 3.88/1.89 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.88/1.90
% 3.88/1.90 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.88/1.93
% 3.88/1.93 Inference rules
% 3.88/1.93 ----------------------
% 3.88/1.93 #Ref : 0
% 3.88/1.93 #Sup : 46
% 3.88/1.93 #Fact : 0
% 3.88/1.93 #Define : 0
% 3.88/1.93 #Split : 1
% 3.88/1.93 #Chain : 0
% 3.88/1.93 #Close : 0
% 3.88/1.93
% 3.88/1.93 Ordering : KBO
% 3.88/1.93
% 3.88/1.93 Simplification rules
% 3.88/1.93 ----------------------
% 3.88/1.93 #Subsume : 1
% 3.88/1.93 #Demod : 18
% 3.88/1.93 #Tautology : 34
% 3.88/1.93 #SimpNegUnit : 0
% 3.88/1.93 #BackRed : 0
% 3.88/1.93
% 3.88/1.93 #Partial instantiations: 0
% 3.88/1.93 #Strategies tried : 1
% 3.88/1.93
% 3.88/1.93 Timing (in seconds)
% 3.88/1.93 ----------------------
% 3.88/1.93 Preprocessing : 0.55
% 3.88/1.93 Parsing : 0.28
% 3.88/1.93 CNF conversion : 0.04
% 3.88/1.93 Main loop : 0.30
% 3.88/1.93 Inferencing : 0.12
% 3.88/1.93 Reduction : 0.07
% 3.88/1.93 Demodulation : 0.05
% 3.88/1.93 BG Simplification : 0.03
% 3.88/1.93 Subsumption : 0.07
% 3.88/1.93 Abstraction : 0.02
% 3.88/1.93 MUC search : 0.00
% 3.88/1.93 Cooper : 0.00
% 3.88/1.93 Total : 0.90
% 3.88/1.93 Index Insertion : 0.00
% 3.88/1.93 Index Deletion : 0.00
% 3.88/1.93 Index Matching : 0.00
% 3.88/1.93 BG Taut test : 0.00
%------------------------------------------------------------------------------