TSTP Solution File: KRS119+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KRS119+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 : n029.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 3.90s 1.75s
% Output : CNFRefutation 3.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 28
% Syntax : Number of formulae : 53 ( 4 unt; 20 typ; 0 def)
% Number of atoms : 77 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 81 ( 37 ~; 31 |; 5 &)
% ( 6 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 24 ( 19 >; 5 *; 0 +; 0 <<)
% Number of predicates : 15 ( 14 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 47 (; 43 !; 4 ?; 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_44786 > #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(i2003_11_14_17_21_44786,type,
i2003_11_14_17_21_44786: $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(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_163,axiom,
! [X] :
( cUnsatisfiable(X)
<=> ( ? [Y] :
( rr(X,Y)
& ca_Vx3(Y) )
& cp1(X) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
tff(f_194,axiom,
! [X] :
( ca_Vx3(X)
<=> ? [Y] :
( rr(X,Y)
& ca_Ax2(Y) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).
tff(f_221,axiom,
! [X,Y,Z] :
( ( rr(X,Y)
& rr(Y,Z) )
=> rr(X,Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_10) ).
tff(f_214,axiom,
! [X,Y] :
( rinvR(X,Y)
<=> rr(Y,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_9) ).
tff(f_186,axiom,
! [X] :
( ca_Ax2(X)
<=> ( cp1(X)
& ! [Y] :
( rinvR(X,Y)
=> cp1xcomp(Y) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
tff(f_176,axiom,
! [X] :
( cp1xcomp(X)
<=> ? [Y0] : ra_Px1(X,Y0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
tff(f_170,axiom,
! [X] :
( cp1(X)
<=> ~ ? [Y] : ra_Px1(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
tff(f_223,axiom,
cUnsatisfiable(i2003_11_14_17_21_44786),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_11) ).
tff(c_52,plain,
! [X_51] :
( ca_Vx3('#skF_1'(X_51))
| ~ cUnsatisfiable(X_51) ),
inference(cnfTransformation,[status(thm)],[f_163]) ).
tff(c_54,plain,
! [X_51] :
( rr(X_51,'#skF_1'(X_51))
| ~ cUnsatisfiable(X_51) ),
inference(cnfTransformation,[status(thm)],[f_163]) ).
tff(c_74,plain,
! [X_67] :
( ca_Ax2('#skF_5'(X_67))
| ~ ca_Vx3(X_67) ),
inference(cnfTransformation,[status(thm)],[f_194]) ).
tff(c_76,plain,
! [X_67] :
( rr(X_67,'#skF_5'(X_67))
| ~ ca_Vx3(X_67) ),
inference(cnfTransformation,[status(thm)],[f_194]) ).
tff(c_256,plain,
! [X_134,Z_135,Y_136] :
( rr(X_134,Z_135)
| ~ rr(Y_136,Z_135)
| ~ rr(X_134,Y_136) ),
inference(cnfTransformation,[status(thm)],[f_221]) ).
tff(c_308,plain,
! [X_144,X_145] :
( rr(X_144,'#skF_5'(X_145))
| ~ rr(X_144,X_145)
| ~ ca_Vx3(X_145) ),
inference(resolution,[status(thm)],[c_76,c_256]) ).
tff(c_72,plain,
! [X_67,Y_70] :
( ca_Vx3(X_67)
| ~ ca_Ax2(Y_70)
| ~ rr(X_67,Y_70) ),
inference(cnfTransformation,[status(thm)],[f_194]) ).
tff(c_449,plain,
! [X_161,X_162] :
( ca_Vx3(X_161)
| ~ ca_Ax2('#skF_5'(X_162))
| ~ rr(X_161,X_162)
| ~ ca_Vx3(X_162) ),
inference(resolution,[status(thm)],[c_308,c_72]) ).
tff(c_453,plain,
! [X_163,X_164] :
( ca_Vx3(X_163)
| ~ rr(X_163,X_164)
| ~ ca_Vx3(X_164) ),
inference(resolution,[status(thm)],[c_74,c_449]) ).
tff(c_503,plain,
! [X_167] :
( ca_Vx3(X_167)
| ~ ca_Vx3('#skF_1'(X_167))
| ~ cUnsatisfiable(X_167) ),
inference(resolution,[status(thm)],[c_54,c_453]) ).
tff(c_508,plain,
! [X_168] :
( ca_Vx3(X_168)
| ~ cUnsatisfiable(X_168) ),
inference(resolution,[status(thm)],[c_52,c_503]) ).
tff(c_50,plain,
! [X_51] :
( cp1(X_51)
| ~ cUnsatisfiable(X_51) ),
inference(cnfTransformation,[status(thm)],[f_163]) ).
tff(c_135,plain,
! [X_105,Y_106] :
( rinvR(X_105,Y_106)
| ~ rr(Y_106,X_105) ),
inference(cnfTransformation,[status(thm)],[f_214]) ).
tff(c_146,plain,
! [X_67] :
( rinvR('#skF_5'(X_67),X_67)
| ~ ca_Vx3(X_67) ),
inference(resolution,[status(thm)],[c_76,c_135]) ).
tff(c_173,plain,
! [Y_114,X_115] :
( cp1xcomp(Y_114)
| ~ rinvR(X_115,Y_114)
| ~ ca_Ax2(X_115) ),
inference(cnfTransformation,[status(thm)],[f_186]) ).
tff(c_201,plain,
! [X_120] :
( cp1xcomp(X_120)
| ~ ca_Ax2('#skF_5'(X_120))
| ~ ca_Vx3(X_120) ),
inference(resolution,[status(thm)],[c_146,c_173]) ).
tff(c_206,plain,
! [X_121] :
( cp1xcomp(X_121)
| ~ ca_Vx3(X_121) ),
inference(resolution,[status(thm)],[c_74,c_201]) ).
tff(c_107,plain,
! [X_95] :
( ra_Px1(X_95,'#skF_3'(X_95))
| ~ cp1xcomp(X_95) ),
inference(cnfTransformation,[status(thm)],[f_176]) ).
tff(c_56,plain,
! [X_55,Y_58] :
( ~ ra_Px1(X_55,Y_58)
| ~ cp1(X_55) ),
inference(cnfTransformation,[status(thm)],[f_170]) ).
tff(c_114,plain,
! [X_95] :
( ~ cp1(X_95)
| ~ cp1xcomp(X_95) ),
inference(resolution,[status(thm)],[c_107,c_56]) ).
tff(c_215,plain,
! [X_122] :
( ~ cp1(X_122)
| ~ ca_Vx3(X_122) ),
inference(resolution,[status(thm)],[c_206,c_114]) ).
tff(c_223,plain,
! [X_51] :
( ~ ca_Vx3(X_51)
| ~ cUnsatisfiable(X_51) ),
inference(resolution,[status(thm)],[c_50,c_215]) ).
tff(c_519,plain,
! [X_168] : ~ cUnsatisfiable(X_168),
inference(resolution,[status(thm)],[c_508,c_223]) ).
tff(c_90,plain,
cUnsatisfiable(i2003_11_14_17_21_44786),
inference(cnfTransformation,[status(thm)],[f_223]) ).
tff(c_524,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_519,c_90]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : KRS119+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.11 % 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.10/0.31 % Computer : n029.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Thu Aug 3 20:21:07 EDT 2023
% 0.10/0.31 % CPUTime :
% 3.90/1.75 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.90/1.76
% 3.90/1.76 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.90/1.79
% 3.90/1.79 Inference rules
% 3.90/1.79 ----------------------
% 3.90/1.79 #Ref : 0
% 3.90/1.79 #Sup : 96
% 3.90/1.79 #Fact : 0
% 3.90/1.79 #Define : 0
% 3.90/1.79 #Split : 0
% 3.90/1.79 #Chain : 0
% 3.90/1.79 #Close : 0
% 3.90/1.79
% 3.90/1.79 Ordering : KBO
% 3.90/1.79
% 3.90/1.79 Simplification rules
% 3.90/1.79 ----------------------
% 3.90/1.79 #Subsume : 33
% 3.90/1.79 #Demod : 1
% 3.90/1.79 #Tautology : 33
% 3.90/1.79 #SimpNegUnit : 3
% 3.90/1.79 #BackRed : 3
% 3.90/1.79
% 3.90/1.79 #Partial instantiations: 0
% 3.90/1.79 #Strategies tried : 1
% 3.90/1.79
% 3.90/1.79 Timing (in seconds)
% 3.90/1.79 ----------------------
% 3.90/1.79 Preprocessing : 0.53
% 3.90/1.79 Parsing : 0.28
% 3.90/1.79 CNF conversion : 0.04
% 3.90/1.79 Main loop : 0.38
% 3.90/1.79 Inferencing : 0.16
% 3.90/1.79 Reduction : 0.08
% 3.90/1.79 Demodulation : 0.05
% 3.90/1.79 BG Simplification : 0.03
% 3.90/1.79 Subsumption : 0.09
% 3.90/1.79 Abstraction : 0.02
% 3.90/1.79 MUC search : 0.00
% 3.90/1.79 Cooper : 0.00
% 3.90/1.79 Total : 0.97
% 3.90/1.79 Index Insertion : 0.00
% 3.90/1.79 Index Deletion : 0.00
% 3.90/1.79 Index Matching : 0.00
% 3.90/1.79 BG Taut test : 0.00
%------------------------------------------------------------------------------