TSTP Solution File: KRS096+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KRS096+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:10 EDT 2023
% Result : Unsatisfiable 3.33s 1.71s
% Output : CNFRefutation 3.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 16
% Syntax : Number of formulae : 31 ( 6 unt; 13 typ; 0 def)
% Number of atoms : 39 ( 5 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 40 ( 19 ~; 13 |; 5 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 12 >; 1 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 18 (; 16 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ rr > xsd_string > xsd_integer > cowlThing > cowlNothing > cd > cc > cUnsatisfiable > #nlpp > i2003_11_14_17_20_18265 > #skF_2 > #skF_4 > #skF_1 > #skF_3
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(rr,type,
rr: ( $i * $i ) > $o ).
tff(i2003_11_14_17_20_18265,type,
i2003_11_14_17_20_18265: $i ).
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff('#skF_4',type,
'#skF_4': $i > $i ).
tff(cc,type,
cc: $i > $o ).
tff(cowlThing,type,
cowlThing: $i > $o ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(cUnsatisfiable,type,
cUnsatisfiable: $i > $o ).
tff(xsd_integer,type,
xsd_integer: $i > $o ).
tff(xsd_string,type,
xsd_string: $i > $o ).
tff('#skF_3',type,
'#skF_3': $i > $i ).
tff(cd,type,
cd: $i > $o ).
tff(cowlNothing,type,
cowlNothing: $i > $o ).
tff(f_123,axiom,
cUnsatisfiable(i2003_11_14_17_20_18265),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
tff(f_115,axiom,
! [X] :
( cUnsatisfiable(X)
<=> ( ? [Y] :
( rr(X,Y)
& cc(Y) )
& ? [Y] :
( rr(X,Y)
& cd(Y) )
& ! [Y0,Y1] :
( ( rr(X,Y0)
& rr(X,Y1) )
=> ( Y0 = Y1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
tff(f_121,axiom,
! [X] :
( cc(X)
=> ~ cd(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
tff(c_46,plain,
cUnsatisfiable(i2003_11_14_17_20_18265),
inference(cnfTransformation,[status(thm)],[f_123]) ).
tff(c_34,plain,
! [X_23] :
( cc('#skF_3'(X_23))
| ~ cUnsatisfiable(X_23) ),
inference(cnfTransformation,[status(thm)],[f_115]) ).
tff(c_36,plain,
! [X_23] :
( rr(X_23,'#skF_3'(X_23))
| ~ cUnsatisfiable(X_23) ),
inference(cnfTransformation,[status(thm)],[f_115]) ).
tff(c_32,plain,
! [X_23] :
( rr(X_23,'#skF_4'(X_23))
| ~ cUnsatisfiable(X_23) ),
inference(cnfTransformation,[status(thm)],[f_115]) ).
tff(c_65,plain,
! [Y1_47,Y0_48,X_49] :
( ( Y1_47 = Y0_48 )
| ~ rr(X_49,Y1_47)
| ~ rr(X_49,Y0_48)
| ~ cUnsatisfiable(X_49) ),
inference(cnfTransformation,[status(thm)],[f_115]) ).
tff(c_72,plain,
! [Y0_50,X_51] :
( ( Y0_50 = '#skF_4'(X_51) )
| ~ rr(X_51,Y0_50)
| ~ cUnsatisfiable(X_51) ),
inference(resolution,[status(thm)],[c_32,c_65]) ).
tff(c_82,plain,
! [X_52] :
( ( '#skF_4'(X_52) = '#skF_3'(X_52) )
| ~ cUnsatisfiable(X_52) ),
inference(resolution,[status(thm)],[c_36,c_72]) ).
tff(c_86,plain,
'#skF_4'(i2003_11_14_17_20_18265) = '#skF_3'(i2003_11_14_17_20_18265),
inference(resolution,[status(thm)],[c_46,c_82]) ).
tff(c_56,plain,
! [X_42] :
( cd('#skF_4'(X_42))
| ~ cUnsatisfiable(X_42) ),
inference(cnfTransformation,[status(thm)],[f_115]) ).
tff(c_44,plain,
! [X_36] :
( ~ cd(X_36)
| ~ cc(X_36) ),
inference(cnfTransformation,[status(thm)],[f_121]) ).
tff(c_60,plain,
! [X_42] :
( ~ cc('#skF_4'(X_42))
| ~ cUnsatisfiable(X_42) ),
inference(resolution,[status(thm)],[c_56,c_44]) ).
tff(c_93,plain,
( ~ cc('#skF_3'(i2003_11_14_17_20_18265))
| ~ cUnsatisfiable(i2003_11_14_17_20_18265) ),
inference(superposition,[status(thm),theory(equality)],[c_86,c_60]) ).
tff(c_102,plain,
~ cc('#skF_3'(i2003_11_14_17_20_18265)),
inference(demodulation,[status(thm),theory(equality)],[c_46,c_93]) ).
tff(c_115,plain,
~ cUnsatisfiable(i2003_11_14_17_20_18265),
inference(resolution,[status(thm)],[c_34,c_102]) ).
tff(c_119,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_46,c_115]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS096+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.14/0.35 % Computer : n029.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 20:25:52 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.33/1.71 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.33/1.71
% 3.33/1.71 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.33/1.74
% 3.33/1.74 Inference rules
% 3.33/1.74 ----------------------
% 3.33/1.74 #Ref : 0
% 3.33/1.74 #Sup : 15
% 3.33/1.74 #Fact : 0
% 3.33/1.74 #Define : 0
% 3.33/1.74 #Split : 0
% 3.33/1.74 #Chain : 0
% 3.33/1.74 #Close : 0
% 3.33/1.74
% 3.33/1.74 Ordering : KBO
% 3.33/1.74
% 3.33/1.74 Simplification rules
% 3.33/1.74 ----------------------
% 3.33/1.74 #Subsume : 0
% 3.33/1.74 #Demod : 4
% 3.33/1.74 #Tautology : 15
% 3.33/1.74 #SimpNegUnit : 0
% 3.33/1.74 #BackRed : 0
% 3.33/1.74
% 3.33/1.74 #Partial instantiations: 0
% 3.33/1.74 #Strategies tried : 1
% 3.33/1.74
% 3.33/1.74 Timing (in seconds)
% 3.33/1.74 ----------------------
% 3.33/1.74 Preprocessing : 0.50
% 3.33/1.74 Parsing : 0.25
% 3.33/1.74 CNF conversion : 0.04
% 3.33/1.74 Main loop : 0.19
% 3.33/1.74 Inferencing : 0.08
% 3.33/1.74 Reduction : 0.04
% 3.33/1.74 Demodulation : 0.03
% 3.33/1.74 BG Simplification : 0.02
% 3.33/1.74 Subsumption : 0.04
% 3.33/1.74 Abstraction : 0.01
% 3.33/1.74 MUC search : 0.00
% 3.33/1.74 Cooper : 0.00
% 3.33/1.74 Total : 0.73
% 3.33/1.74 Index Insertion : 0.00
% 3.33/1.74 Index Deletion : 0.00
% 3.33/1.74 Index Matching : 0.00
% 3.33/1.74 BG Taut test : 0.00
%------------------------------------------------------------------------------