TSTP Solution File: KRS072+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KRS072+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 : n015.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:06 EDT 2023
% Result : Unsatisfiable 3.56s 1.83s
% Output : CNFRefutation 3.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 21
% Syntax : Number of formulae : 37 ( 4 unt; 17 typ; 0 def)
% Number of atoms : 49 ( 6 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 51 ( 22 ~; 20 |; 5 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 20 ( 16 >; 4 *; 0 +; 0 <<)
% Number of predicates : 14 ( 12 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 25 (; 23 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ rr > rinvR > xsd_string > xsd_integer > cp5 > cp4 > cp3 > cp2 > cp1 > cowlThing > cowlNothing > cUnsatisfiable > #nlpp > i2003_11_14_17_18_50190 > #skF_4 > #skF_3 > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(rinvR,type,
rinvR: ( $i * $i ) > $o ).
tff(cp5,type,
cp5: $i > $o ).
tff(rr,type,
rr: ( $i * $i ) > $o ).
tff('#skF_4',type,
'#skF_4': $i > $i ).
tff(cowlThing,type,
cowlThing: $i > $o ).
tff(i2003_11_14_17_18_50190,type,
i2003_11_14_17_18_50190: $i ).
tff(cp4,type,
cp4: $i > $o ).
tff(cUnsatisfiable,type,
cUnsatisfiable: $i > $o ).
tff(xsd_integer,type,
xsd_integer: $i > $o ).
tff(cp3,type,
cp3: $i > $o ).
tff(xsd_string,type,
xsd_string: $i > $o ).
tff('#skF_3',type,
'#skF_3': $i > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(cp2,type,
cp2: $i > $o ).
tff(cowlNothing,type,
cowlNothing: $i > $o ).
tff(cp1,type,
cp1: $i > $o ).
tff(f_186,axiom,
cUnsatisfiable(i2003_11_14_17_18_50190),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_8) ).
tff(f_143,axiom,
! [X] :
( cUnsatisfiable(X)
<=> ( ? [Y] :
( rinvR(X,Y)
& ! [Z0,Z1] :
( ( rr(Y,Z0)
& rr(Y,Z1) )
=> ( Z0 = Z1 ) )
& ? [Z] :
( rr(Y,Z)
& cp1(Z) ) )
& cp2(X) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
tff(f_184,axiom,
! [X,Y] :
( rinvR(X,Y)
<=> rr(Y,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
tff(f_155,axiom,
! [X] :
( cp1(X)
=> ~ ( cp3(X)
| cp2(X)
| cp4(X)
| cp5(X) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
tff(c_78,plain,
cUnsatisfiable(i2003_11_14_17_18_50190),
inference(cnfTransformation,[status(thm)],[f_186]) ).
tff(c_46,plain,
! [X_35] :
( rinvR(X_35,'#skF_3'(X_35))
| ~ cUnsatisfiable(X_35) ),
inference(cnfTransformation,[status(thm)],[f_143]) ).
tff(c_74,plain,
! [Y_65,X_64] :
( rr(Y_65,X_64)
| ~ rinvR(X_64,Y_65) ),
inference(cnfTransformation,[status(thm)],[f_184]) ).
tff(c_42,plain,
! [X_35] :
( rr('#skF_3'(X_35),'#skF_4'(X_35))
| ~ cUnsatisfiable(X_35) ),
inference(cnfTransformation,[status(thm)],[f_143]) ).
tff(c_122,plain,
! [Z1_91,Z0_92,X_93] :
( ( Z1_91 = Z0_92 )
| ~ rr('#skF_3'(X_93),Z1_91)
| ~ rr('#skF_3'(X_93),Z0_92)
| ~ cUnsatisfiable(X_93) ),
inference(cnfTransformation,[status(thm)],[f_143]) ).
tff(c_137,plain,
! [Z0_97,X_98] :
( ( Z0_97 = '#skF_4'(X_98) )
| ~ rr('#skF_3'(X_98),Z0_97)
| ~ cUnsatisfiable(X_98) ),
inference(resolution,[status(thm)],[c_42,c_122]) ).
tff(c_148,plain,
! [X_99,X_100] :
( ( X_99 = '#skF_4'(X_100) )
| ~ cUnsatisfiable(X_100)
| ~ rinvR(X_99,'#skF_3'(X_100)) ),
inference(resolution,[status(thm)],[c_74,c_137]) ).
tff(c_158,plain,
! [X_101] :
( ( '#skF_4'(X_101) = X_101 )
| ~ cUnsatisfiable(X_101) ),
inference(resolution,[status(thm)],[c_46,c_148]) ).
tff(c_162,plain,
'#skF_4'(i2003_11_14_17_18_50190) = i2003_11_14_17_18_50190,
inference(resolution,[status(thm)],[c_78,c_158]) ).
tff(c_103,plain,
! [X_82] :
( cp1('#skF_4'(X_82))
| ~ cUnsatisfiable(X_82) ),
inference(cnfTransformation,[status(thm)],[f_143]) ).
tff(c_38,plain,
! [X_35] :
( cp2(X_35)
| ~ cUnsatisfiable(X_35) ),
inference(cnfTransformation,[status(thm)],[f_143]) ).
tff(c_92,plain,
! [X_75] :
( ~ cp2(X_75)
| ~ cp1(X_75) ),
inference(cnfTransformation,[status(thm)],[f_155]) ).
tff(c_96,plain,
! [X_35] :
( ~ cp1(X_35)
| ~ cUnsatisfiable(X_35) ),
inference(resolution,[status(thm)],[c_38,c_92]) ).
tff(c_107,plain,
! [X_82] :
( ~ cUnsatisfiable('#skF_4'(X_82))
| ~ cUnsatisfiable(X_82) ),
inference(resolution,[status(thm)],[c_103,c_96]) ).
tff(c_179,plain,
( ~ cUnsatisfiable(i2003_11_14_17_18_50190)
| ~ cUnsatisfiable(i2003_11_14_17_18_50190) ),
inference(superposition,[status(thm),theory(equality)],[c_162,c_107]) ).
tff(c_191,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_78,c_78,c_179]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : KRS072+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/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.14/0.36 % Computer : n015.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 20:28:29 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.56/1.83 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.56/1.84
% 3.56/1.84 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.56/1.87
% 3.56/1.87 Inference rules
% 3.56/1.87 ----------------------
% 3.56/1.87 #Ref : 0
% 3.56/1.87 #Sup : 22
% 3.56/1.87 #Fact : 0
% 3.56/1.87 #Define : 0
% 3.56/1.87 #Split : 0
% 3.56/1.87 #Chain : 0
% 3.56/1.87 #Close : 0
% 3.56/1.87
% 3.56/1.87 Ordering : KBO
% 3.56/1.87
% 3.56/1.87 Simplification rules
% 3.56/1.87 ----------------------
% 3.56/1.87 #Subsume : 0
% 3.56/1.87 #Demod : 4
% 3.56/1.87 #Tautology : 19
% 3.56/1.87 #SimpNegUnit : 0
% 3.56/1.87 #BackRed : 0
% 3.56/1.87
% 3.56/1.87 #Partial instantiations: 0
% 3.56/1.87 #Strategies tried : 1
% 3.56/1.87
% 3.56/1.87 Timing (in seconds)
% 3.56/1.87 ----------------------
% 3.56/1.87 Preprocessing : 0.55
% 3.56/1.87 Parsing : 0.28
% 3.56/1.87 CNF conversion : 0.04
% 3.56/1.87 Main loop : 0.24
% 3.56/1.87 Inferencing : 0.10
% 3.56/1.87 Reduction : 0.06
% 3.56/1.87 Demodulation : 0.04
% 3.56/1.87 BG Simplification : 0.02
% 3.56/1.87 Subsumption : 0.05
% 3.56/1.87 Abstraction : 0.01
% 3.56/1.87 MUC search : 0.00
% 3.56/1.87 Cooper : 0.00
% 3.56/1.87 Total : 0.83
% 3.56/1.87 Index Insertion : 0.00
% 3.56/1.87 Index Deletion : 0.00
% 3.56/1.87 Index Matching : 0.00
% 3.56/1.87 BG Taut test : 0.00
%------------------------------------------------------------------------------