TSTP Solution File: KRS100+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KRS100+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 : n007.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 2.34s 1.67s
% Output : CNFRefutation 2.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 15
% Syntax : Number of formulae : 25 ( 4 unt; 13 typ; 0 def)
% Number of atoms : 30 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 34 ( 16 ~; 12 |; 3 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 14 (; 13 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ rr > xsd_string > xsd_integer > cowlThing > cowlNothing > ce > cd > cc > cUnsatisfiable > #nlpp > i2003_11_14_17_20_32704 > #skF_2 > #skF_1 > #skF_3
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(ce,type,
ce: $i > $o ).
tff(rr,type,
rr: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': $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(i2003_11_14_17_20_32704,type,
i2003_11_14_17_20_32704: $i ).
tff(cd,type,
cd: $i > $o ).
tff(cowlNothing,type,
cowlNothing: $i > $o ).
tff(f_63,axiom,
! [X] :
( cUnsatisfiable(X)
<=> ( ! [Y] :
( rr(X,Y)
=> ( ce(Y)
| ~ cd(Y) ) )
& ! [Y] :
( rr(X,Y)
=> cd(Y) )
& ? [Y] :
( rr(X,Y)
& ~ ce(Y) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
tff(f_71,axiom,
cUnsatisfiable(i2003_11_14_17_20_32704),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
tff(c_12,plain,
! [X_3] :
( rr(X_3,'#skF_3'(X_3))
| ~ cUnsatisfiable(X_3) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_44,plain,
! [Y_21,X_22] :
( cd(Y_21)
| ~ rr(X_22,Y_21)
| ~ cUnsatisfiable(X_22) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_48,plain,
! [X_3] :
( cd('#skF_3'(X_3))
| ~ cUnsatisfiable(X_3) ),
inference(resolution,[status(thm)],[c_12,c_44]) ).
tff(c_49,plain,
! [Y_23,X_24] :
( ~ cd(Y_23)
| ce(Y_23)
| ~ rr(X_24,Y_23)
| ~ cUnsatisfiable(X_24) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_60,plain,
! [X_27] :
( ~ cd('#skF_3'(X_27))
| ce('#skF_3'(X_27))
| ~ cUnsatisfiable(X_27) ),
inference(resolution,[status(thm)],[c_12,c_49]) ).
tff(c_10,plain,
! [X_3] :
( ~ ce('#skF_3'(X_3))
| ~ cUnsatisfiable(X_3) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_65,plain,
! [X_28] :
( ~ cd('#skF_3'(X_28))
| ~ cUnsatisfiable(X_28) ),
inference(resolution,[status(thm)],[c_60,c_10]) ).
tff(c_69,plain,
! [X_3] : ~ cUnsatisfiable(X_3),
inference(resolution,[status(thm)],[c_48,c_65]) ).
tff(c_32,plain,
cUnsatisfiable(i2003_11_14_17_20_32704),
inference(cnfTransformation,[status(thm)],[f_71]) ).
tff(c_71,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_69,c_32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : KRS100+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.19/0.37 % Computer : n007.cluster.edu
% 0.19/0.37 % Model : x86_64 x86_64
% 0.19/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.37 % Memory : 8042.1875MB
% 0.19/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.37 % CPULimit : 300
% 0.19/0.37 % WCLimit : 300
% 0.19/0.37 % DateTime : Thu Aug 3 19:56:23 EDT 2023
% 0.19/0.37 % CPUTime :
% 2.34/1.67 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.34/1.67
% 2.34/1.67 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.34/1.70
% 2.34/1.70 Inference rules
% 2.34/1.70 ----------------------
% 2.34/1.70 #Ref : 0
% 2.34/1.70 #Sup : 6
% 2.34/1.70 #Fact : 0
% 2.34/1.70 #Define : 0
% 2.34/1.70 #Split : 0
% 2.34/1.70 #Chain : 0
% 2.34/1.70 #Close : 0
% 2.34/1.70
% 2.34/1.70 Ordering : KBO
% 2.34/1.70
% 2.34/1.70 Simplification rules
% 2.34/1.70 ----------------------
% 2.34/1.70 #Subsume : 8
% 2.34/1.70 #Demod : 0
% 2.34/1.70 #Tautology : 1
% 2.34/1.70 #SimpNegUnit : 1
% 2.34/1.70 #BackRed : 1
% 2.34/1.70
% 2.34/1.70 #Partial instantiations: 0
% 2.34/1.70 #Strategies tried : 1
% 2.34/1.70
% 2.34/1.70 Timing (in seconds)
% 2.34/1.70 ----------------------
% 2.34/1.70 Preprocessing : 0.42
% 2.34/1.70 Parsing : 0.23
% 2.34/1.70 CNF conversion : 0.03
% 2.34/1.70 Main loop : 0.21
% 2.34/1.70 Inferencing : 0.09
% 2.34/1.70 Reduction : 0.04
% 2.34/1.70 Demodulation : 0.03
% 2.34/1.70 BG Simplification : 0.02
% 2.34/1.70 Subsumption : 0.04
% 2.34/1.70 Abstraction : 0.01
% 2.34/1.70 MUC search : 0.00
% 2.34/1.70 Cooper : 0.00
% 2.34/1.70 Total : 0.68
% 2.34/1.70 Index Insertion : 0.00
% 2.34/1.70 Index Deletion : 0.00
% 2.34/1.70 Index Matching : 0.00
% 2.34/1.70 BG Taut test : 0.00
%------------------------------------------------------------------------------