TSTP Solution File: KRS087+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KRS087+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 : n018.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.64s 1.90s
% Output : CNFRefutation 3.64s
% 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_46763 > #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_46763,type,
i2003_11_14_17_19_46763: $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)
<=> ( cp1(X)
& ? [Y] :
( rr(X,Y)
& ? [Z] :
( rr(Y,Z)
& ! [W] :
( rinvR(Z,W)
=> ~ cp1(W) )
& cp1(Z) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
tff(f_159,axiom,
! [X,Y] :
( rinvR(X,Y)
<=> rr(Y,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
tff(f_166,axiom,
! [X,Y,Z] :
( ( rr(X,Y)
& rr(Y,Z) )
=> rr(X,Z) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
tff(f_168,axiom,
cUnsatisfiable(i2003_11_14_17_19_46763),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
tff(c_46,plain,
! [X_39] :
( cp1(X_39)
| ~ cUnsatisfiable(X_39) ),
inference(cnfTransformation,[status(thm)],[f_142]) ).
tff(c_93,plain,
! [X_91] :
( rr('#skF_2'(X_91),'#skF_3'(X_91))
| ~ cUnsatisfiable(X_91) ),
inference(cnfTransformation,[status(thm)],[f_142]) ).
tff(c_60,plain,
! [X_70,Y_71] :
( rinvR(X_70,Y_71)
| ~ rr(Y_71,X_70) ),
inference(cnfTransformation,[status(thm)],[f_159]) ).
tff(c_97,plain,
! [X_91] :
( rinvR('#skF_3'(X_91),'#skF_2'(X_91))
| ~ cUnsatisfiable(X_91) ),
inference(resolution,[status(thm)],[c_93,c_60]) ).
tff(c_44,plain,
! [X_39] :
( rr(X_39,'#skF_2'(X_39))
| ~ cUnsatisfiable(X_39) ),
inference(cnfTransformation,[status(thm)],[f_142]) ).
tff(c_58,plain,
! [Y_71,X_70] :
( rr(Y_71,X_70)
| ~ rinvR(X_70,Y_71) ),
inference(cnfTransformation,[status(thm)],[f_159]) ).
tff(c_111,plain,
! [X_100,Z_101,Y_102] :
( rr(X_100,Z_101)
| ~ rr(Y_102,Z_101)
| ~ rr(X_100,Y_102) ),
inference(cnfTransformation,[status(thm)],[f_166]) ).
tff(c_129,plain,
! [X_105,X_106,Y_107] :
( rr(X_105,X_106)
| ~ rr(X_105,Y_107)
| ~ rinvR(X_106,Y_107) ),
inference(resolution,[status(thm)],[c_58,c_111]) ).
tff(c_143,plain,
! [X_110,X_111] :
( rr(X_110,X_111)
| ~ rinvR(X_111,'#skF_2'(X_110))
| ~ cUnsatisfiable(X_110) ),
inference(resolution,[status(thm)],[c_44,c_129]) ).
tff(c_158,plain,
! [X_112] :
( rr(X_112,'#skF_3'(X_112))
| ~ cUnsatisfiable(X_112) ),
inference(resolution,[status(thm)],[c_97,c_143]) ).
tff(c_170,plain,
! [X_116] :
( rinvR('#skF_3'(X_116),X_116)
| ~ cUnsatisfiable(X_116) ),
inference(resolution,[status(thm)],[c_158,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_180,plain,
! [X_117] :
( ~ cp1(X_117)
| ~ cUnsatisfiable(X_117) ),
inference(resolution,[status(thm)],[c_170,c_40]) ).
tff(c_192,plain,
! [X_39] : ~ cUnsatisfiable(X_39),
inference(resolution,[status(thm)],[c_46,c_180]) ).
tff(c_64,plain,
cUnsatisfiable(i2003_11_14_17_19_46763),
inference(cnfTransformation,[status(thm)],[f_168]) ).
tff(c_195,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_192,c_64]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : KRS087+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.15 % 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.15/0.37 % Computer : n018.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu Aug 3 20:11:35 EDT 2023
% 0.15/0.37 % CPUTime :
% 3.64/1.90 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.64/1.91
% 3.64/1.91 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.64/1.93
% 3.64/1.93 Inference rules
% 3.64/1.93 ----------------------
% 3.64/1.93 #Ref : 0
% 3.64/1.93 #Sup : 27
% 3.64/1.93 #Fact : 0
% 3.64/1.93 #Define : 0
% 3.64/1.93 #Split : 0
% 3.64/1.93 #Chain : 0
% 3.64/1.93 #Close : 0
% 3.64/1.93
% 3.64/1.93 Ordering : KBO
% 3.64/1.93
% 3.64/1.93 Simplification rules
% 3.64/1.93 ----------------------
% 3.64/1.94 #Subsume : 17
% 3.64/1.94 #Demod : 0
% 3.64/1.94 #Tautology : 17
% 3.64/1.94 #SimpNegUnit : 2
% 3.64/1.94 #BackRed : 2
% 3.64/1.94
% 3.64/1.94 #Partial instantiations: 0
% 3.64/1.94 #Strategies tried : 1
% 3.64/1.94
% 3.64/1.94 Timing (in seconds)
% 3.64/1.94 ----------------------
% 3.88/1.94 Preprocessing : 0.52
% 3.88/1.94 Parsing : 0.27
% 3.88/1.94 CNF conversion : 0.04
% 3.88/1.94 Main loop : 0.27
% 3.88/1.94 Inferencing : 0.12
% 3.88/1.94 Reduction : 0.05
% 3.88/1.94 Demodulation : 0.04
% 3.88/1.94 BG Simplification : 0.02
% 3.88/1.94 Subsumption : 0.07
% 3.88/1.94 Abstraction : 0.01
% 3.88/1.94 MUC search : 0.00
% 3.88/1.94 Cooper : 0.00
% 3.88/1.94 Total : 0.83
% 3.88/1.94 Index Insertion : 0.00
% 3.88/1.94 Index Deletion : 0.00
% 3.88/1.94 Index Matching : 0.00
% 3.88/1.94 BG Taut test : 0.00
%------------------------------------------------------------------------------