TSTP Solution File: KRS120+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KRS120+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 : 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:13 EDT 2023
% Result : Unsatisfiable 4.02s 2.00s
% Output : CNFRefutation 4.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 29
% Syntax : Number of formulae : 53 ( 6 unt; 20 typ; 0 def)
% Number of atoms : 72 ( 6 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 71 ( 32 ~; 25 |; 6 &)
% ( 6 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 24 ( 19 >; 5 *; 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 :
%------------------------------------------------------------------------------
%$ rr > rinvR > rinvF > rf > ra_Px1 > xsd_string > xsd_integer > cp1xcomp > cp1 > cowlThing > cowlNothing > ca_Vx3 > ca_Ax2 > cUnsatisfiable > #nlpp > i2003_11_14_17_21_48796 > #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(rinvR,type,
rinvR: ( $i * $i ) > $o ).
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(ca_Ax2,type,
ca_Ax2: $i > $o ).
tff(rinvF,type,
rinvF: ( $i * $i ) > $o ).
tff(cUnsatisfiable,type,
cUnsatisfiable: $i > $o ).
tff(xsd_integer,type,
xsd_integer: $i > $o ).
tff(i2003_11_14_17_21_48796,type,
i2003_11_14_17_21_48796: $i ).
tff(ra_Px1,type,
ra_Px1: ( $i * $i ) > $o ).
tff(ca_Vx3,type,
ca_Vx3: $i > $o ).
tff(xsd_string,type,
xsd_string: $i > $o ).
tff('#skF_3',type,
'#skF_3': $i > $i ).
tff(cp1xcomp,type,
cp1xcomp: $i > $o ).
tff(cowlNothing,type,
cowlNothing: $i > $o ).
tff(cp1,type,
cp1: $i > $o ).
tff(f_184,axiom,
! [X] :
( ca_Ax2(X)
<=> ( ? [Y] :
( rinvF(X,Y)
& ca_Vx3(Y) )
& cp1(X) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
tff(f_207,axiom,
! [X,Y] :
( rinvF(X,Y)
<=> rf(Y,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_8) ).
tff(f_192,axiom,
! [X] :
( ca_Vx3(X)
<=> ? [Y] :
( rf(X,Y)
& cp1xcomp(Y) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).
tff(f_147,axiom,
! [X] :
( cowlThing(X)
& ~ cowlNothing(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_0) ).
tff(f_202,axiom,
! [X] :
( cowlThing(X)
=> ! [Y0,Y1] :
( ( rf(X,Y0)
& rf(X,Y1) )
=> ( Y0 = Y1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7) ).
tff(f_174,axiom,
! [X] :
( cp1xcomp(X)
<=> ? [Y0] : ra_Px1(X,Y0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
tff(f_168,axiom,
! [X] :
( cp1(X)
<=> ~ ? [Y] : ra_Px1(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
tff(f_161,axiom,
! [X] :
( cUnsatisfiable(X)
<=> ? [Y] :
( rf(X,Y)
& ca_Ax2(Y) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
tff(f_221,axiom,
cUnsatisfiable(i2003_11_14_17_21_48796),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_11) ).
tff(c_64,plain,
! [X_63] :
( cp1(X_63)
| ~ ca_Ax2(X_63) ),
inference(cnfTransformation,[status(thm)],[f_184]) ).
tff(c_66,plain,
! [X_63] :
( ca_Vx3('#skF_4'(X_63))
| ~ ca_Ax2(X_63) ),
inference(cnfTransformation,[status(thm)],[f_184]) ).
tff(c_153,plain,
! [X_111] :
( rinvF(X_111,'#skF_4'(X_111))
| ~ ca_Ax2(X_111) ),
inference(cnfTransformation,[status(thm)],[f_184]) ).
tff(c_78,plain,
! [Y_77,X_76] :
( rf(Y_77,X_76)
| ~ rinvF(X_76,Y_77) ),
inference(cnfTransformation,[status(thm)],[f_207]) ).
tff(c_157,plain,
! [X_111] :
( rf('#skF_4'(X_111),X_111)
| ~ ca_Ax2(X_111) ),
inference(resolution,[status(thm)],[c_153,c_78]) ).
tff(c_74,plain,
! [X_67] :
( rf(X_67,'#skF_5'(X_67))
| ~ ca_Vx3(X_67) ),
inference(cnfTransformation,[status(thm)],[f_192]) ).
tff(c_40,plain,
! [X_49] : cowlThing(X_49),
inference(cnfTransformation,[status(thm)],[f_147]) ).
tff(c_76,plain,
! [Y1_75,Y0_74,X_71] :
( ( Y1_75 = Y0_74 )
| ~ rf(X_71,Y1_75)
| ~ rf(X_71,Y0_74)
| ~ cowlThing(X_71) ),
inference(cnfTransformation,[status(thm)],[f_202]) ).
tff(c_201,plain,
! [Y1_122,Y0_123,X_124] :
( ( Y1_122 = Y0_123 )
| ~ rf(X_124,Y1_122)
| ~ rf(X_124,Y0_123) ),
inference(demodulation,[status(thm),theory(equality)],[c_40,c_76]) ).
tff(c_225,plain,
! [Y0_127,X_128] :
( ( Y0_127 = '#skF_5'(X_128) )
| ~ rf(X_128,Y0_127)
| ~ ca_Vx3(X_128) ),
inference(resolution,[status(thm)],[c_74,c_201]) ).
tff(c_308,plain,
! [X_145] :
( ( '#skF_5'('#skF_4'(X_145)) = X_145 )
| ~ ca_Vx3('#skF_4'(X_145))
| ~ ca_Ax2(X_145) ),
inference(resolution,[status(thm)],[c_157,c_225]) ).
tff(c_313,plain,
! [X_146] :
( ( '#skF_5'('#skF_4'(X_146)) = X_146 )
| ~ ca_Ax2(X_146) ),
inference(resolution,[status(thm)],[c_66,c_308]) ).
tff(c_72,plain,
! [X_67] :
( cp1xcomp('#skF_5'(X_67))
| ~ ca_Vx3(X_67) ),
inference(cnfTransformation,[status(thm)],[f_192]) ).
tff(c_334,plain,
! [X_147] :
( cp1xcomp(X_147)
| ~ ca_Vx3('#skF_4'(X_147))
| ~ ca_Ax2(X_147) ),
inference(superposition,[status(thm),theory(equality)],[c_313,c_72]) ).
tff(c_339,plain,
! [X_148] :
( cp1xcomp(X_148)
| ~ ca_Ax2(X_148) ),
inference(resolution,[status(thm)],[c_66,c_334]) ).
tff(c_118,plain,
! [X_102] :
( ra_Px1(X_102,'#skF_3'(X_102))
| ~ cp1xcomp(X_102) ),
inference(cnfTransformation,[status(thm)],[f_174]) ).
tff(c_54,plain,
! [X_55,Y_58] :
( ~ ra_Px1(X_55,Y_58)
| ~ cp1(X_55) ),
inference(cnfTransformation,[status(thm)],[f_168]) ).
tff(c_126,plain,
! [X_102] :
( ~ cp1(X_102)
| ~ cp1xcomp(X_102) ),
inference(resolution,[status(thm)],[c_118,c_54]) ).
tff(c_348,plain,
! [X_149] :
( ~ cp1(X_149)
| ~ ca_Ax2(X_149) ),
inference(resolution,[status(thm)],[c_339,c_126]) ).
tff(c_356,plain,
! [X_63] : ~ ca_Ax2(X_63),
inference(resolution,[status(thm)],[c_64,c_348]) ).
tff(c_50,plain,
! [X_51] :
( ca_Ax2('#skF_1'(X_51))
| ~ cUnsatisfiable(X_51) ),
inference(cnfTransformation,[status(thm)],[f_161]) ).
tff(c_359,plain,
! [X_51] : ~ cUnsatisfiable(X_51),
inference(negUnitSimplification,[status(thm)],[c_356,c_50]) ).
tff(c_88,plain,
cUnsatisfiable(i2003_11_14_17_21_48796),
inference(cnfTransformation,[status(thm)],[f_221]) ).
tff(c_362,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_359,c_88]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS120+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.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 20:11:49 EDT 2023
% 0.13/0.34 % CPUTime :
% 4.02/2.00 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.29/2.00
% 4.29/2.00 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.29/2.03
% 4.29/2.03 Inference rules
% 4.29/2.03 ----------------------
% 4.29/2.03 #Ref : 0
% 4.29/2.03 #Sup : 57
% 4.29/2.03 #Fact : 0
% 4.29/2.03 #Define : 0
% 4.29/2.03 #Split : 0
% 4.29/2.03 #Chain : 0
% 4.29/2.03 #Close : 0
% 4.29/2.03
% 4.29/2.03 Ordering : KBO
% 4.29/2.03
% 4.29/2.03 Simplification rules
% 4.29/2.03 ----------------------
% 4.29/2.03 #Subsume : 30
% 4.29/2.03 #Demod : 1
% 4.29/2.03 #Tautology : 37
% 4.29/2.03 #SimpNegUnit : 4
% 4.29/2.03 #BackRed : 4
% 4.29/2.03
% 4.29/2.03 #Partial instantiations: 0
% 4.29/2.03 #Strategies tried : 1
% 4.29/2.03
% 4.29/2.03 Timing (in seconds)
% 4.29/2.03 ----------------------
% 4.29/2.04 Preprocessing : 0.59
% 4.29/2.04 Parsing : 0.30
% 4.29/2.04 CNF conversion : 0.06
% 4.29/2.04 Main loop : 0.37
% 4.29/2.04 Inferencing : 0.16
% 4.29/2.04 Reduction : 0.08
% 4.29/2.04 Demodulation : 0.05
% 4.29/2.04 BG Simplification : 0.03
% 4.29/2.04 Subsumption : 0.08
% 4.29/2.04 Abstraction : 0.02
% 4.29/2.04 MUC search : 0.00
% 4.29/2.04 Cooper : 0.00
% 4.29/2.04 Total : 1.00
% 4.29/2.04 Index Insertion : 0.00
% 4.29/2.04 Index Deletion : 0.00
% 4.29/2.04 Index Matching : 0.00
% 4.29/2.04 BG Taut test : 0.00
%------------------------------------------------------------------------------