TSTP Solution File: KRS115+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KRS115+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 : n009.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.48s 1.70s
% Output : CNFRefutation 3.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 28
% Syntax : Number of formulae : 60 ( 7 unt; 18 typ; 0 def)
% Number of atoms : 94 ( 12 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 93 ( 41 ~; 34 |; 8 &)
% ( 3 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 58 (; 53 !; 5 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ rr > rf2 > rf1 > ra_Px1 > xsd_string > xsd_integer > cp2xcomp > cp2 > cp1 > cowlThing > cowlNothing > cUnsatisfiable > #nlpp > i2003_11_14_17_21_30578 > #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(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('#skF_1',type,
'#skF_1': $i > $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(i2003_11_14_17_21_30578,type,
i2003_11_14_17_21_30578: $i ).
tff(rf1,type,
rf1: ( $i * $i ) > $o ).
tff(xsd_string,type,
xsd_string: $i > $o ).
tff('#skF_3',type,
'#skF_3': $i > $i ).
tff(cp2xcomp,type,
cp2xcomp: $i > $o ).
tff(rf2,type,
rf2: ( $i * $i ) > $o ).
tff(cp2,type,
cp2: $i > $o ).
tff(cowlNothing,type,
cowlNothing: $i > $o ).
tff(cp1,type,
cp1: $i > $o ).
tff(f_193,axiom,
cUnsatisfiable(i2003_11_14_17_21_30578),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_8) ).
tff(f_153,axiom,
! [X] :
( cUnsatisfiable(X)
<=> ( ? [Y] :
( rf2(X,Y)
& cp2(Y) )
& ? [Y] :
( rf1(X,Y)
& cp1(Y) )
& ? [Y] :
( rr(X,Y)
& cowlThing(Y) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
tff(f_201,axiom,
! [X,Y] :
( rr(X,Y)
=> rf1(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_10) ).
tff(f_129,axiom,
! [X] :
( cowlThing(X)
& ~ cowlNothing(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_0) ).
tff(f_181,axiom,
! [X] :
( cowlThing(X)
=> ! [Y0,Y1] :
( ( rf1(X,Y0)
& rf1(X,Y1) )
=> ( Y0 = Y1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).
tff(f_197,axiom,
! [X,Y] :
( rr(X,Y)
=> rf2(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_9) ).
tff(f_191,axiom,
! [X] :
( cowlThing(X)
=> ! [Y0,Y1] :
( ( rf2(X,Y0)
& rf2(X,Y1) )
=> ( Y0 = Y1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7) ).
tff(f_158,axiom,
! [X] :
( cp1(X)
=> cp2xcomp(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
tff(f_171,axiom,
! [X] :
( cp2xcomp(X)
<=> ? [Y0] : ra_Px1(X,Y0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
tff(f_165,axiom,
! [X] :
( cp2(X)
<=> ~ ? [Y] : ra_Px1(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
tff(c_70,plain,
cUnsatisfiable(i2003_11_14_17_21_30578),
inference(cnfTransformation,[status(thm)],[f_193]) ).
tff(c_46,plain,
! [X_43] :
( rr(X_43,'#skF_3'(X_43))
| ~ cUnsatisfiable(X_43) ),
inference(cnfTransformation,[status(thm)],[f_153]) ).
tff(c_122,plain,
! [X_95,Y_96] :
( rf1(X_95,Y_96)
| ~ rr(X_95,Y_96) ),
inference(cnfTransformation,[status(thm)],[f_201]) ).
tff(c_126,plain,
! [X_43] :
( rf1(X_43,'#skF_3'(X_43))
| ~ cUnsatisfiable(X_43) ),
inference(resolution,[status(thm)],[c_46,c_122]) ).
tff(c_50,plain,
! [X_43] :
( rf1(X_43,'#skF_2'(X_43))
| ~ cUnsatisfiable(X_43) ),
inference(cnfTransformation,[status(thm)],[f_153]) ).
tff(c_34,plain,
! [X_41] : cowlThing(X_41),
inference(cnfTransformation,[status(thm)],[f_129]) ).
tff(c_66,plain,
! [Y1_66,Y0_65,X_62] :
( ( Y1_66 = Y0_65 )
| ~ rf1(X_62,Y1_66)
| ~ rf1(X_62,Y0_65)
| ~ cowlThing(X_62) ),
inference(cnfTransformation,[status(thm)],[f_181]) ).
tff(c_144,plain,
! [Y1_102,Y0_103,X_104] :
( ( Y1_102 = Y0_103 )
| ~ rf1(X_104,Y1_102)
| ~ rf1(X_104,Y0_103) ),
inference(demodulation,[status(thm),theory(equality)],[c_34,c_66]) ).
tff(c_162,plain,
! [Y0_112,X_113] :
( ( Y0_112 = '#skF_2'(X_113) )
| ~ rf1(X_113,Y0_112)
| ~ cUnsatisfiable(X_113) ),
inference(resolution,[status(thm)],[c_50,c_144]) ).
tff(c_172,plain,
! [X_114] :
( ( '#skF_2'(X_114) = '#skF_3'(X_114) )
| ~ cUnsatisfiable(X_114) ),
inference(resolution,[status(thm)],[c_126,c_162]) ).
tff(c_176,plain,
'#skF_2'(i2003_11_14_17_21_30578) = '#skF_3'(i2003_11_14_17_21_30578),
inference(resolution,[status(thm)],[c_70,c_172]) ).
tff(c_48,plain,
! [X_43] :
( cp1('#skF_2'(X_43))
| ~ cUnsatisfiable(X_43) ),
inference(cnfTransformation,[status(thm)],[f_153]) ).
tff(c_183,plain,
( cp1('#skF_3'(i2003_11_14_17_21_30578))
| ~ cUnsatisfiable(i2003_11_14_17_21_30578) ),
inference(superposition,[status(thm),theory(equality)],[c_176,c_48]) ).
tff(c_189,plain,
cp1('#skF_3'(i2003_11_14_17_21_30578)),
inference(demodulation,[status(thm),theory(equality)],[c_70,c_183]) ).
tff(c_117,plain,
! [X_94] :
( rr(X_94,'#skF_3'(X_94))
| ~ cUnsatisfiable(X_94) ),
inference(cnfTransformation,[status(thm)],[f_153]) ).
tff(c_72,plain,
! [X_72,Y_73] :
( rf2(X_72,Y_73)
| ~ rr(X_72,Y_73) ),
inference(cnfTransformation,[status(thm)],[f_197]) ).
tff(c_121,plain,
! [X_94] :
( rf2(X_94,'#skF_3'(X_94))
| ~ cUnsatisfiable(X_94) ),
inference(resolution,[status(thm)],[c_117,c_72]) ).
tff(c_54,plain,
! [X_43] :
( rf2(X_43,'#skF_1'(X_43))
| ~ cUnsatisfiable(X_43) ),
inference(cnfTransformation,[status(thm)],[f_153]) ).
tff(c_68,plain,
! [Y1_71,Y0_70,X_67] :
( ( Y1_71 = Y0_70 )
| ~ rf2(X_67,Y1_71)
| ~ rf2(X_67,Y0_70)
| ~ cowlThing(X_67) ),
inference(cnfTransformation,[status(thm)],[f_191]) ).
tff(c_151,plain,
! [Y1_105,Y0_106,X_107] :
( ( Y1_105 = Y0_106 )
| ~ rf2(X_107,Y1_105)
| ~ rf2(X_107,Y0_106) ),
inference(demodulation,[status(thm),theory(equality)],[c_34,c_68]) ).
tff(c_191,plain,
! [Y0_115,X_116] :
( ( Y0_115 = '#skF_1'(X_116) )
| ~ rf2(X_116,Y0_115)
| ~ cUnsatisfiable(X_116) ),
inference(resolution,[status(thm)],[c_54,c_151]) ).
tff(c_210,plain,
! [X_117] :
( ( '#skF_1'(X_117) = '#skF_3'(X_117) )
| ~ cUnsatisfiable(X_117) ),
inference(resolution,[status(thm)],[c_121,c_191]) ).
tff(c_214,plain,
'#skF_1'(i2003_11_14_17_21_30578) = '#skF_3'(i2003_11_14_17_21_30578),
inference(resolution,[status(thm)],[c_70,c_210]) ).
tff(c_52,plain,
! [X_43] :
( cp2('#skF_1'(X_43))
| ~ cUnsatisfiable(X_43) ),
inference(cnfTransformation,[status(thm)],[f_153]) ).
tff(c_56,plain,
! [X_53] :
( cp2xcomp(X_53)
| ~ cp1(X_53) ),
inference(cnfTransformation,[status(thm)],[f_158]) ).
tff(c_96,plain,
! [X_88] :
( ra_Px1(X_88,'#skF_5'(X_88))
| ~ cp2xcomp(X_88) ),
inference(cnfTransformation,[status(thm)],[f_171]) ).
tff(c_58,plain,
! [X_54,Y_57] :
( ~ ra_Px1(X_54,Y_57)
| ~ cp2(X_54) ),
inference(cnfTransformation,[status(thm)],[f_165]) ).
tff(c_105,plain,
! [X_89] :
( ~ cp2(X_89)
| ~ cp2xcomp(X_89) ),
inference(resolution,[status(thm)],[c_96,c_58]) ).
tff(c_110,plain,
! [X_90] :
( ~ cp2(X_90)
| ~ cp1(X_90) ),
inference(resolution,[status(thm)],[c_56,c_105]) ).
tff(c_114,plain,
! [X_43] :
( ~ cp1('#skF_1'(X_43))
| ~ cUnsatisfiable(X_43) ),
inference(resolution,[status(thm)],[c_52,c_110]) ).
tff(c_221,plain,
( ~ cp1('#skF_3'(i2003_11_14_17_21_30578))
| ~ cUnsatisfiable(i2003_11_14_17_21_30578) ),
inference(superposition,[status(thm),theory(equality)],[c_214,c_114]) ).
tff(c_231,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_70,c_189,c_221]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS115+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.13 % 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.12/0.33 % Computer : n009.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu Aug 3 20:04:38 EDT 2023
% 0.12/0.33 % CPUTime :
% 3.48/1.70 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.48/1.71
% 3.48/1.71 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.51/1.74
% 3.51/1.74 Inference rules
% 3.51/1.74 ----------------------
% 3.51/1.74 #Ref : 0
% 3.51/1.74 #Sup : 32
% 3.51/1.74 #Fact : 0
% 3.51/1.74 #Define : 0
% 3.51/1.74 #Split : 0
% 3.51/1.74 #Chain : 0
% 3.51/1.74 #Close : 0
% 3.51/1.74
% 3.51/1.74 Ordering : KBO
% 3.51/1.74
% 3.51/1.74 Simplification rules
% 3.51/1.74 ----------------------
% 3.51/1.74 #Subsume : 0
% 3.51/1.74 #Demod : 11
% 3.51/1.74 #Tautology : 28
% 3.51/1.74 #SimpNegUnit : 0
% 3.51/1.74 #BackRed : 0
% 3.51/1.74
% 3.51/1.74 #Partial instantiations: 0
% 3.51/1.74 #Strategies tried : 1
% 3.51/1.74
% 3.51/1.74 Timing (in seconds)
% 3.51/1.74 ----------------------
% 3.51/1.75 Preprocessing : 0.52
% 3.51/1.75 Parsing : 0.28
% 3.51/1.75 CNF conversion : 0.04
% 3.51/1.75 Main loop : 0.27
% 3.51/1.75 Inferencing : 0.12
% 3.51/1.75 Reduction : 0.06
% 3.51/1.75 Demodulation : 0.04
% 3.51/1.75 BG Simplification : 0.02
% 3.51/1.75 Subsumption : 0.05
% 3.51/1.75 Abstraction : 0.01
% 3.51/1.75 MUC search : 0.00
% 3.51/1.75 Cooper : 0.00
% 3.51/1.75 Total : 0.85
% 3.51/1.75 Index Insertion : 0.00
% 3.51/1.75 Index Deletion : 0.00
% 3.51/1.75 Index Matching : 0.00
% 3.51/1.75 BG Taut test : 0.00
%------------------------------------------------------------------------------