TSTP Solution File: KRS124+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KRS124+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 : n017.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:14 EDT 2023
% Result : Unsatisfiable 3.51s 1.78s
% Output : CNFRefutation 3.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 30
% Syntax : Number of formulae : 45 ( 5 unt; 24 typ; 0 def)
% Number of atoms : 42 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 41 ( 20 ~; 12 |; 3 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 26 ( 23 >; 3 *; 0 +; 0 <<)
% Number of predicates : 18 ( 17 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-1 aty)
% Number of variables : 25 (; 22 !; 3 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ rr > ra_Px2 > ra_Px1 > xsd_string > xsd_integer > cowlThing > cowlNothing > cf > ce3 > cdxcomp > cd1xcomp > cd1 > cd > cc1 > cc > ca_Ax3 > cUnsatisfiable > #nlpp > i2003_11_14_17_22_10903 > #skF_5 > #skF_2 > #skF_4 > #skF_1 > #skF_3 > #skF_6
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_5',type,
'#skF_5': $i > $i ).
tff(rr,type,
rr: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff('#skF_4',type,
'#skF_4': $i > $i ).
tff(ra_Px2,type,
ra_Px2: ( $i * $i ) > $o ).
tff(cc,type,
cc: $i > $o ).
tff(cowlThing,type,
cowlThing: $i > $o ).
tff(cd1,type,
cd1: $i > $o ).
tff(cdxcomp,type,
cdxcomp: $i > $o ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(cc1,type,
cc1: $i > $o ).
tff(i2003_11_14_17_22_10903,type,
i2003_11_14_17_22_10903: $i ).
tff(cUnsatisfiable,type,
cUnsatisfiable: $i > $o ).
tff(ce3,type,
ce3: $i > $o ).
tff(xsd_integer,type,
xsd_integer: $i > $o ).
tff(ra_Px1,type,
ra_Px1: ( $i * $i ) > $o ).
tff(ca_Ax3,type,
ca_Ax3: $i > $o ).
tff(xsd_string,type,
xsd_string: $i > $o ).
tff(cf,type,
cf: $i > $o ).
tff('#skF_3',type,
'#skF_3': $i > $i ).
tff(cd,type,
cd: $i > $o ).
tff('#skF_6',type,
'#skF_6': $i > $i ).
tff(cowlNothing,type,
cowlNothing: $i > $o ).
tff(cd1xcomp,type,
cd1xcomp: $i > $o ).
tff(f_54,axiom,
! [X] :
( cUnsatisfiable(X)
<=> ( ? [Y] :
( rr(X,Y)
& cowlThing(Y) )
& ! [Y] :
( rr(X,Y)
=> ca_Ax3(Y) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
tff(f_112,axiom,
! [X] :
( ca_Ax3(X)
<=> ( cd(X)
& cc(X) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_12) ).
tff(f_59,axiom,
! [X] :
( cc(X)
=> cdxcomp(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
tff(f_82,axiom,
! [X] :
( cdxcomp(X)
<=> ? [Y0] : ra_Px1(X,Y0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
tff(f_76,axiom,
! [X] :
( cd(X)
<=> ~ ? [Y] : ra_Px1(X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
tff(f_114,axiom,
cUnsatisfiable(i2003_11_14_17_22_10903),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_13) ).
tff(c_14,plain,
! [X_3] :
( rr(X_3,'#skF_2'(X_3))
| ~ cUnsatisfiable(X_3) ),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_48,plain,
! [X_31] :
( cc(X_31)
| ~ ca_Ax3(X_31) ),
inference(cnfTransformation,[status(thm)],[f_112]) ).
tff(c_50,plain,
! [X_31] :
( cd(X_31)
| ~ ca_Ax3(X_31) ),
inference(cnfTransformation,[status(thm)],[f_112]) ).
tff(c_20,plain,
! [X_10] :
( cdxcomp(X_10)
| ~ cc(X_10) ),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_113,plain,
! [X_59] :
( ra_Px1(X_59,'#skF_4'(X_59))
| ~ cdxcomp(X_59) ),
inference(cnfTransformation,[status(thm)],[f_82]) ).
tff(c_26,plain,
! [X_13,Y_16] :
( ~ ra_Px1(X_13,Y_16)
| ~ cd(X_13) ),
inference(cnfTransformation,[status(thm)],[f_76]) ).
tff(c_131,plain,
! [X_61] :
( ~ cd(X_61)
| ~ cdxcomp(X_61) ),
inference(resolution,[status(thm)],[c_113,c_26]) ).
tff(c_145,plain,
! [X_63] :
( ~ cd(X_63)
| ~ cc(X_63) ),
inference(resolution,[status(thm)],[c_20,c_131]) ).
tff(c_155,plain,
! [X_66] :
( ~ cc(X_66)
| ~ ca_Ax3(X_66) ),
inference(resolution,[status(thm)],[c_50,c_145]) ).
tff(c_159,plain,
! [X_31] : ~ ca_Ax3(X_31),
inference(resolution,[status(thm)],[c_48,c_155]) ).
tff(c_10,plain,
! [Y_9,X_3] :
( ca_Ax3(Y_9)
| ~ rr(X_3,Y_9)
| ~ cUnsatisfiable(X_3) ),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_162,plain,
! [X_68,Y_69] :
( ~ rr(X_68,Y_69)
| ~ cUnsatisfiable(X_68) ),
inference(negUnitSimplification,[status(thm)],[c_159,c_10]) ).
tff(c_166,plain,
! [X_3] : ~ cUnsatisfiable(X_3),
inference(resolution,[status(thm)],[c_14,c_162]) ).
tff(c_52,plain,
cUnsatisfiable(i2003_11_14_17_22_10903),
inference(cnfTransformation,[status(thm)],[f_114]) ).
tff(c_168,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_166,c_52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : KRS124+1 : TPTP v8.1.2. Released v3.1.0.
% 0.12/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.36 % Computer : n017.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 19:32:21 EDT 2023
% 0.15/0.36 % CPUTime :
% 3.51/1.78 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.59/1.79
% 3.59/1.79 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.59/1.81
% 3.59/1.81 Inference rules
% 3.59/1.81 ----------------------
% 3.59/1.81 #Ref : 0
% 3.59/1.81 #Sup : 19
% 3.59/1.81 #Fact : 0
% 3.59/1.81 #Define : 0
% 3.59/1.81 #Split : 0
% 3.59/1.81 #Chain : 0
% 3.59/1.81 #Close : 0
% 3.59/1.81
% 3.59/1.81 Ordering : KBO
% 3.59/1.81
% 3.59/1.81 Simplification rules
% 3.59/1.81 ----------------------
% 3.59/1.81 #Subsume : 9
% 3.59/1.81 #Demod : 3
% 3.59/1.81 #Tautology : 9
% 3.59/1.81 #SimpNegUnit : 2
% 3.59/1.81 #BackRed : 2
% 3.59/1.81
% 3.59/1.81 #Partial instantiations: 0
% 3.59/1.81 #Strategies tried : 1
% 3.59/1.81
% 3.59/1.81 Timing (in seconds)
% 3.59/1.81 ----------------------
% 3.59/1.82 Preprocessing : 0.47
% 3.59/1.82 Parsing : 0.25
% 3.59/1.82 CNF conversion : 0.04
% 3.59/1.82 Main loop : 0.28
% 3.59/1.82 Inferencing : 0.13
% 3.59/1.82 Reduction : 0.06
% 3.59/1.82 Demodulation : 0.04
% 3.59/1.82 BG Simplification : 0.02
% 3.59/1.82 Subsumption : 0.05
% 3.59/1.82 Abstraction : 0.01
% 3.59/1.82 MUC search : 0.00
% 3.59/1.82 Cooper : 0.00
% 3.59/1.82 Total : 0.80
% 3.59/1.82 Index Insertion : 0.00
% 3.59/1.82 Index Deletion : 0.00
% 3.59/1.82 Index Matching : 0.00
% 3.59/1.82 BG Taut test : 0.00
%------------------------------------------------------------------------------