TSTP Solution File: KRS085+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KRS085+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 : n031.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:08 EDT 2023
% Result : Unsatisfiable 3.54s 1.84s
% Output : CNFRefutation 3.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 18
% Syntax : Number of formulae : 34 ( 4 unt; 14 typ; 0 def)
% Number of atoms : 46 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 47 ( 21 ~; 17 |; 5 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 19 ( 13 >; 6 *; 0 +; 0 <<)
% Number of predicates : 11 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-3 aty)
% Number of variables : 31 (; 29 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ rr > rinvR > rinvF > rf > xsd_string > xsd_integer > cp1 > cowlThing > cowlNothing > cUnsatisfiable > #nlpp > i2003_11_14_17_19_39537 > #skF_1 > #skF_2 > #skF_3
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(rf,type,
rf: ( $i * $i ) > $o ).
tff(rinvR,type,
rinvR: ( $i * $i ) > $o ).
tff(rr,type,
rr: ( $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': ( $i * $i * $i ) > $i ).
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff(cowlThing,type,
cowlThing: $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_19_39537,type,
i2003_11_14_17_19_39537: $i ).
tff(xsd_string,type,
xsd_string: $i > $o ).
tff('#skF_3',type,
'#skF_3': $i > $i ).
tff(cowlNothing,type,
cowlNothing: $i > $o ).
tff(cp1,type,
cp1: $i > $o ).
tff(f_142,axiom,
! [X] :
( cUnsatisfiable(X)
<=> ( ? [Y] :
( rr(X,Y)
& ? [Z] :
( rr(Y,Z)
& cp1(Z)
& ! [W] :
( rinvR(Z,W)
=> ~ cp1(W) ) ) )
& cp1(X) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
tff(f_162,axiom,
! [X,Y] :
( rinvR(X,Y)
<=> rr(Y,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
tff(f_169,axiom,
! [X,Y,Z] :
( ( rr(X,Y)
& rr(Y,Z) )
=> rr(X,Z) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
tff(f_171,axiom,
cUnsatisfiable(i2003_11_14_17_19_39537),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
tff(c_38,plain,
! [X_39] :
( cp1(X_39)
| ~ cUnsatisfiable(X_39) ),
inference(cnfTransformation,[status(thm)],[f_142]) ).
tff(c_95,plain,
! [X_93] :
( rr('#skF_2'(X_93),'#skF_3'(X_93))
| ~ cUnsatisfiable(X_93) ),
inference(cnfTransformation,[status(thm)],[f_142]) ).
tff(c_60,plain,
! [X_72,Y_73] :
( rinvR(X_72,Y_73)
| ~ rr(Y_73,X_72) ),
inference(cnfTransformation,[status(thm)],[f_162]) ).
tff(c_99,plain,
! [X_93] :
( rinvR('#skF_3'(X_93),'#skF_2'(X_93))
| ~ cUnsatisfiable(X_93) ),
inference(resolution,[status(thm)],[c_95,c_60]) ).
tff(c_46,plain,
! [X_39] :
( rr(X_39,'#skF_2'(X_39))
| ~ cUnsatisfiable(X_39) ),
inference(cnfTransformation,[status(thm)],[f_142]) ).
tff(c_58,plain,
! [Y_73,X_72] :
( rr(Y_73,X_72)
| ~ rinvR(X_72,Y_73) ),
inference(cnfTransformation,[status(thm)],[f_162]) ).
tff(c_113,plain,
! [X_102,Z_103,Y_104] :
( rr(X_102,Z_103)
| ~ rr(Y_104,Z_103)
| ~ rr(X_102,Y_104) ),
inference(cnfTransformation,[status(thm)],[f_169]) ).
tff(c_131,plain,
! [X_107,X_108,Y_109] :
( rr(X_107,X_108)
| ~ rr(X_107,Y_109)
| ~ rinvR(X_108,Y_109) ),
inference(resolution,[status(thm)],[c_58,c_113]) ).
tff(c_145,plain,
! [X_112,X_113] :
( rr(X_112,X_113)
| ~ rinvR(X_113,'#skF_2'(X_112))
| ~ cUnsatisfiable(X_112) ),
inference(resolution,[status(thm)],[c_46,c_131]) ).
tff(c_160,plain,
! [X_114] :
( rr(X_114,'#skF_3'(X_114))
| ~ cUnsatisfiable(X_114) ),
inference(resolution,[status(thm)],[c_99,c_145]) ).
tff(c_172,plain,
! [X_118] :
( rinvR('#skF_3'(X_118),X_118)
| ~ cUnsatisfiable(X_118) ),
inference(resolution,[status(thm)],[c_160,c_60]) ).
tff(c_40,plain,
! [W_64,X_39] :
( ~ cp1(W_64)
| ~ rinvR('#skF_3'(X_39),W_64)
| ~ cUnsatisfiable(X_39) ),
inference(cnfTransformation,[status(thm)],[f_142]) ).
tff(c_182,plain,
! [X_119] :
( ~ cp1(X_119)
| ~ cUnsatisfiable(X_119) ),
inference(resolution,[status(thm)],[c_172,c_40]) ).
tff(c_194,plain,
! [X_39] : ~ cUnsatisfiable(X_39),
inference(resolution,[status(thm)],[c_38,c_182]) ).
tff(c_64,plain,
cUnsatisfiable(i2003_11_14_17_19_39537),
inference(cnfTransformation,[status(thm)],[f_171]) ).
tff(c_197,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_194,c_64]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : KRS085+1 : TPTP v8.1.2. Released v3.1.0.
% 0.13/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 : n031.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:28:44 EDT 2023
% 0.21/0.36 % CPUTime :
% 3.54/1.84 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.54/1.85
% 3.54/1.85 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.80/1.88
% 3.80/1.88 Inference rules
% 3.80/1.88 ----------------------
% 3.80/1.88 #Ref : 0
% 3.80/1.88 #Sup : 27
% 3.80/1.88 #Fact : 0
% 3.80/1.88 #Define : 0
% 3.80/1.88 #Split : 0
% 3.80/1.88 #Chain : 0
% 3.80/1.88 #Close : 0
% 3.80/1.88
% 3.80/1.88 Ordering : KBO
% 3.80/1.88
% 3.80/1.88 Simplification rules
% 3.80/1.88 ----------------------
% 3.80/1.88 #Subsume : 17
% 3.80/1.88 #Demod : 1
% 3.80/1.88 #Tautology : 17
% 3.80/1.88 #SimpNegUnit : 2
% 3.80/1.88 #BackRed : 2
% 3.80/1.88
% 3.80/1.88 #Partial instantiations: 0
% 3.80/1.88 #Strategies tried : 1
% 3.80/1.88
% 3.80/1.88 Timing (in seconds)
% 3.80/1.88 ----------------------
% 3.80/1.88 Preprocessing : 0.52
% 3.80/1.88 Parsing : 0.28
% 3.80/1.88 CNF conversion : 0.04
% 3.80/1.88 Main loop : 0.28
% 3.80/1.88 Inferencing : 0.12
% 3.80/1.88 Reduction : 0.06
% 3.80/1.88 Demodulation : 0.04
% 3.80/1.88 BG Simplification : 0.02
% 3.80/1.88 Subsumption : 0.07
% 3.80/1.88 Abstraction : 0.01
% 3.80/1.88 MUC search : 0.00
% 3.80/1.88 Cooper : 0.00
% 3.80/1.88 Total : 0.85
% 3.80/1.88 Index Insertion : 0.00
% 3.80/1.88 Index Deletion : 0.00
% 3.80/1.88 Index Matching : 0.00
% 3.80/1.88 BG Taut test : 0.00
%------------------------------------------------------------------------------