TSTP Solution File: KRS126+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KRS126+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 : n010.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.26s 1.80s
% Output : CNFRefutation 3.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 24
% Syntax : Number of formulae : 33 ( 4 unt; 19 typ; 0 def)
% Number of atoms : 24 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 21 ( 11 ~; 6 |; 0 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 20 ( 18 >; 2 *; 0 +; 0 <<)
% Number of predicates : 15 ( 14 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 14 (; 12 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ ra_Px2 > ra_Px1 > xsd_string > xsd_integer > cowlThing > cowlNothing > cf > ce3 > cdxcomp > cd1xcomp > cd1 > cd > cc > cUnsatisfiable > #nlpp > i2003_11_14_17_22_23554 > #skF_2 > #skF_4 > #skF_1 > #skF_3
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff('#skF_4',type,
'#skF_4': $i > $i ).
tff(i2003_11_14_17_22_23554,type,
i2003_11_14_17_22_23554: $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(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(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(cowlNothing,type,
cowlNothing: $i > $o ).
tff(cd1xcomp,type,
cd1xcomp: $i > $o ).
tff(f_51,axiom,
! [X] :
( cUnsatisfiable(X)
=> cd1(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
tff(f_46,axiom,
! [X] :
( cUnsatisfiable(X)
=> cd1xcomp(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
tff(f_75,axiom,
! [X] :
( cd1(X)
<=> ? [Y0] : ra_Px2(X,Y0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
tff(f_82,axiom,
! [X] :
( cd1xcomp(X)
<=> ~ ? [Y] : ra_Px2(X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_8) ).
tff(f_94,axiom,
cUnsatisfiable(i2003_11_14_17_22_23554),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_11) ).
tff(c_12,plain,
! [X_4] :
( cd1(X_4)
| ~ cUnsatisfiable(X_4) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_10,plain,
! [X_3] :
( cd1xcomp(X_3)
| ~ cUnsatisfiable(X_3) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_83,plain,
! [X_46] :
( ra_Px2(X_46,'#skF_3'(X_46))
| ~ cd1(X_46) ),
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_28,plain,
! [X_18,Y_21] :
( ~ ra_Px2(X_18,Y_21)
| ~ cd1xcomp(X_18) ),
inference(cnfTransformation,[status(thm)],[f_82]) ).
tff(c_92,plain,
! [X_47] :
( ~ cd1xcomp(X_47)
| ~ cd1(X_47) ),
inference(resolution,[status(thm)],[c_83,c_28]) ).
tff(c_97,plain,
! [X_48] :
( ~ cd1(X_48)
| ~ cUnsatisfiable(X_48) ),
inference(resolution,[status(thm)],[c_10,c_92]) ).
tff(c_101,plain,
! [X_4] : ~ cUnsatisfiable(X_4),
inference(resolution,[status(thm)],[c_12,c_97]) ).
tff(c_36,plain,
cUnsatisfiable(i2003_11_14_17_22_23554),
inference(cnfTransformation,[status(thm)],[f_94]) ).
tff(c_103,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_101,c_36]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : KRS126+1 : TPTP v8.1.2. Released v3.1.0.
% 0.13/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.13/0.35 % Computer : n010.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 20:00:13 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.26/1.80 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.26/1.80
% 3.26/1.80 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.36/1.82
% 3.36/1.82 Inference rules
% 3.36/1.82 ----------------------
% 3.36/1.82 #Ref : 0
% 3.36/1.82 #Sup : 11
% 3.36/1.82 #Fact : 0
% 3.36/1.82 #Define : 0
% 3.36/1.82 #Split : 0
% 3.36/1.82 #Chain : 0
% 3.36/1.82 #Close : 0
% 3.36/1.82
% 3.36/1.82 Ordering : KBO
% 3.36/1.82
% 3.36/1.82 Simplification rules
% 3.36/1.82 ----------------------
% 3.36/1.82 #Subsume : 3
% 3.36/1.82 #Demod : 0
% 3.36/1.82 #Tautology : 5
% 3.36/1.82 #SimpNegUnit : 1
% 3.36/1.82 #BackRed : 1
% 3.36/1.82
% 3.36/1.82 #Partial instantiations: 0
% 3.36/1.82 #Strategies tried : 1
% 3.36/1.82
% 3.36/1.82 Timing (in seconds)
% 3.36/1.82 ----------------------
% 3.36/1.83 Preprocessing : 0.47
% 3.36/1.83 Parsing : 0.26
% 3.36/1.83 CNF conversion : 0.03
% 3.36/1.83 Main loop : 0.23
% 3.36/1.83 Inferencing : 0.11
% 3.36/1.83 Reduction : 0.05
% 3.36/1.83 Demodulation : 0.03
% 3.36/1.83 BG Simplification : 0.02
% 3.36/1.83 Subsumption : 0.04
% 3.36/1.83 Abstraction : 0.01
% 3.36/1.83 MUC search : 0.00
% 3.36/1.83 Cooper : 0.00
% 3.36/1.83 Total : 0.75
% 3.36/1.83 Index Insertion : 0.00
% 3.36/1.83 Index Deletion : 0.00
% 3.36/1.83 Index Matching : 0.00
% 3.36/1.83 BG Taut test : 0.00
%------------------------------------------------------------------------------