TSTP Solution File: KRS125+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KRS125+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 : n014.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.07s 1.75s
% Output : CNFRefutation 3.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 27
% Syntax : Number of formulae : 42 ( 4 unt; 20 typ; 0 def)
% Number of atoms : 41 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 37 ( 18 ~; 12 |; 1 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 21 ( 19 >; 2 *; 0 +; 0 <<)
% Number of predicates : 16 ( 15 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 22 (; 20 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ ra_Px2 > ra_Px1 > xsd_string > xsd_integer > cowlThing > cowlNothing > cf > ce3 > cdxcomp > cd1xcomp > cd1 > cd > cc1 > cc > cUnsatisfiable > #nlpp > i2003_11_14_17_22_17947 > #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(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(cUnsatisfiable,type,
cUnsatisfiable: $i > $o ).
tff(i2003_11_14_17_22_17947,type,
i2003_11_14_17_22_17947: $i ).
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_48,axiom,
! [X] :
( cUnsatisfiable(X)
<=> ( ce3(X)
& cf(X) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
tff(f_94,axiom,
! [X] :
( ce3(X)
=> cc(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_10) ).
tff(f_99,axiom,
! [X] :
( cf(X)
=> cd(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_11) ).
tff(f_53,axiom,
! [X] :
( cc(X)
=> cdxcomp(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
tff(f_76,axiom,
! [X] :
( cdxcomp(X)
<=> ? [Y0] : ra_Px1(X,Y0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
tff(f_70,axiom,
! [X] :
( cd(X)
<=> ~ ? [Y] : ra_Px1(X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
tff(f_101,axiom,
cUnsatisfiable(i2003_11_14_17_22_17947),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_12) ).
tff(c_14,plain,
! [X_3] :
( ce3(X_3)
| ~ cUnsatisfiable(X_3) ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_61,plain,
! [X_35] :
( cc(X_35)
| ~ ce3(X_35) ),
inference(cnfTransformation,[status(thm)],[f_94]) ).
tff(c_65,plain,
! [X_3] :
( cc(X_3)
| ~ cUnsatisfiable(X_3) ),
inference(resolution,[status(thm)],[c_14,c_61]) ).
tff(c_12,plain,
! [X_3] :
( cf(X_3)
| ~ cUnsatisfiable(X_3) ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_53,plain,
! [X_31] :
( cd(X_31)
| ~ cf(X_31) ),
inference(cnfTransformation,[status(thm)],[f_99]) ).
tff(c_57,plain,
! [X_3] :
( cd(X_3)
| ~ cUnsatisfiable(X_3) ),
inference(resolution,[status(thm)],[c_12,c_53]) ).
tff(c_16,plain,
! [X_4] :
( cdxcomp(X_4)
| ~ cc(X_4) ),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_77,plain,
! [X_47] :
( ra_Px1(X_47,'#skF_2'(X_47))
| ~ cdxcomp(X_47) ),
inference(cnfTransformation,[status(thm)],[f_76]) ).
tff(c_22,plain,
! [X_7,Y_10] :
( ~ ra_Px1(X_7,Y_10)
| ~ cd(X_7) ),
inference(cnfTransformation,[status(thm)],[f_70]) ).
tff(c_86,plain,
! [X_48] :
( ~ cd(X_48)
| ~ cdxcomp(X_48) ),
inference(resolution,[status(thm)],[c_77,c_22]) ).
tff(c_91,plain,
! [X_49] :
( ~ cd(X_49)
| ~ cc(X_49) ),
inference(resolution,[status(thm)],[c_16,c_86]) ).
tff(c_96,plain,
! [X_50] :
( ~ cc(X_50)
| ~ cUnsatisfiable(X_50) ),
inference(resolution,[status(thm)],[c_57,c_91]) ).
tff(c_100,plain,
! [X_3] : ~ cUnsatisfiable(X_3),
inference(resolution,[status(thm)],[c_65,c_96]) ).
tff(c_42,plain,
cUnsatisfiable(i2003_11_14_17_22_17947),
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_103,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_100,c_42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : KRS125+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.13/0.36 % Computer : n014.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Thu Aug 3 20:05:33 EDT 2023
% 0.13/0.36 % CPUTime :
% 3.07/1.75 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.07/1.75
% 3.07/1.75 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.16/1.78
% 3.16/1.78 Inference rules
% 3.16/1.78 ----------------------
% 3.16/1.78 #Ref : 0
% 3.16/1.78 #Sup : 9
% 3.16/1.78 #Fact : 0
% 3.16/1.78 #Define : 0
% 3.16/1.78 #Split : 0
% 3.16/1.78 #Chain : 0
% 3.16/1.78 #Close : 0
% 3.16/1.78
% 3.16/1.78 Ordering : KBO
% 3.16/1.78
% 3.16/1.78 Simplification rules
% 3.16/1.78 ----------------------
% 3.16/1.78 #Subsume : 5
% 3.16/1.78 #Demod : 0
% 3.16/1.78 #Tautology : 3
% 3.16/1.78 #SimpNegUnit : 2
% 3.16/1.78 #BackRed : 2
% 3.16/1.78
% 3.16/1.78 #Partial instantiations: 0
% 3.16/1.78 #Strategies tried : 1
% 3.16/1.78
% 3.16/1.78 Timing (in seconds)
% 3.16/1.78 ----------------------
% 3.16/1.78 Preprocessing : 0.46
% 3.16/1.78 Parsing : 0.25
% 3.16/1.78 CNF conversion : 0.03
% 3.16/1.78 Main loop : 0.25
% 3.16/1.78 Inferencing : 0.12
% 3.16/1.78 Reduction : 0.05
% 3.16/1.78 Demodulation : 0.04
% 3.16/1.78 BG Simplification : 0.02
% 3.16/1.78 Subsumption : 0.05
% 3.16/1.78 Abstraction : 0.01
% 3.16/1.78 MUC search : 0.00
% 3.16/1.78 Cooper : 0.00
% 3.16/1.78 Total : 0.76
% 3.16/1.78 Index Insertion : 0.00
% 3.16/1.78 Index Deletion : 0.00
% 3.16/1.78 Index Matching : 0.00
% 3.16/1.78 BG Taut test : 0.00
%------------------------------------------------------------------------------