TSTP Solution File: KRS127+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KRS127+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 : n002.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.23s 1.69s
% Output : CNFRefutation 3.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 22
% Syntax : Number of formulae : 41 ( 6 unt; 17 typ; 0 def)
% Number of atoms : 51 ( 5 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 52 ( 25 ~; 17 |; 5 &)
% ( 3 <=>; 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 : 18 ( 16 >; 2 *; 0 +; 0 <<)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-1 aty)
% Number of variables : 27 (; 23 !; 4 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ rr > ra_Px1 > xsd_string > xsd_integer > cowlThing > cowlNothing > cdxcomp > cd > cc > cUnsatisfiable > #nlpp > i2003_11_14_17_22_27794 > #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(i2003_11_14_17_22_27794,type,
i2003_11_14_17_22_27794: $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(cdxcomp,type,
cdxcomp: $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(ra_Px1,type,
ra_Px1: ( $i * $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('#skF_6',type,
'#skF_6': $i > $i ).
tff(cowlNothing,type,
cowlNothing: $i > $o ).
tff(f_153,axiom,
cUnsatisfiable(i2003_11_14_17_22_27794),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).
tff(f_133,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_138,axiom,
! [X] :
( cc(X)
=> cdxcomp(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
tff(f_151,axiom,
! [X] :
( cdxcomp(X)
<=> ? [Y0] : ra_Px1(X,Y0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
tff(f_145,axiom,
! [X] :
( cd(X)
<=> ~ ? [Y] : ra_Px1(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
tff(c_60,plain,
cUnsatisfiable(i2003_11_14_17_22_27794),
inference(cnfTransformation,[status(thm)],[f_153]) ).
tff(c_40,plain,
! [X_31] :
( cc('#skF_3'(X_31))
| ~ cUnsatisfiable(X_31) ),
inference(cnfTransformation,[status(thm)],[f_133]) ).
tff(c_38,plain,
! [X_31] :
( rr(X_31,'#skF_4'(X_31))
| ~ cUnsatisfiable(X_31) ),
inference(cnfTransformation,[status(thm)],[f_133]) ).
tff(c_42,plain,
! [X_31] :
( rr(X_31,'#skF_3'(X_31))
| ~ cUnsatisfiable(X_31) ),
inference(cnfTransformation,[status(thm)],[f_133]) ).
tff(c_110,plain,
! [Y1_72,Y0_73,X_74] :
( ( Y1_72 = Y0_73 )
| ~ rr(X_74,Y1_72)
| ~ rr(X_74,Y0_73)
| ~ cUnsatisfiable(X_74) ),
inference(cnfTransformation,[status(thm)],[f_133]) ).
tff(c_124,plain,
! [Y0_78,X_79] :
( ( Y0_78 = '#skF_3'(X_79) )
| ~ rr(X_79,Y0_78)
| ~ cUnsatisfiable(X_79) ),
inference(resolution,[status(thm)],[c_42,c_110]) ).
tff(c_134,plain,
! [X_80] :
( ( '#skF_4'(X_80) = '#skF_3'(X_80) )
| ~ cUnsatisfiable(X_80) ),
inference(resolution,[status(thm)],[c_38,c_124]) ).
tff(c_138,plain,
'#skF_4'(i2003_11_14_17_22_27794) = '#skF_3'(i2003_11_14_17_22_27794),
inference(resolution,[status(thm)],[c_60,c_134]) ).
tff(c_36,plain,
! [X_31] :
( cd('#skF_4'(X_31))
| ~ cUnsatisfiable(X_31) ),
inference(cnfTransformation,[status(thm)],[f_133]) ).
tff(c_50,plain,
! [X_44] :
( cdxcomp(X_44)
| ~ cc(X_44) ),
inference(cnfTransformation,[status(thm)],[f_138]) ).
tff(c_74,plain,
! [X_64] :
( ra_Px1(X_64,'#skF_6'(X_64))
| ~ cdxcomp(X_64) ),
inference(cnfTransformation,[status(thm)],[f_151]) ).
tff(c_52,plain,
! [X_45,Y_48] :
( ~ ra_Px1(X_45,Y_48)
| ~ cd(X_45) ),
inference(cnfTransformation,[status(thm)],[f_145]) ).
tff(c_83,plain,
! [X_65] :
( ~ cd(X_65)
| ~ cdxcomp(X_65) ),
inference(resolution,[status(thm)],[c_74,c_52]) ).
tff(c_88,plain,
! [X_66] :
( ~ cd(X_66)
| ~ cc(X_66) ),
inference(resolution,[status(thm)],[c_50,c_83]) ).
tff(c_92,plain,
! [X_31] :
( ~ cc('#skF_4'(X_31))
| ~ cUnsatisfiable(X_31) ),
inference(resolution,[status(thm)],[c_36,c_88]) ).
tff(c_145,plain,
( ~ cc('#skF_3'(i2003_11_14_17_22_27794))
| ~ cUnsatisfiable(i2003_11_14_17_22_27794) ),
inference(superposition,[status(thm),theory(equality)],[c_138,c_92]) ).
tff(c_154,plain,
~ cc('#skF_3'(i2003_11_14_17_22_27794)),
inference(demodulation,[status(thm),theory(equality)],[c_60,c_145]) ).
tff(c_160,plain,
~ cUnsatisfiable(i2003_11_14_17_22_27794),
inference(resolution,[status(thm)],[c_40,c_154]) ).
tff(c_164,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_60,c_160]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS127+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.12/0.34 % Computer : n002.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Thu Aug 3 20:20:01 EDT 2023
% 0.12/0.34 % CPUTime :
% 3.23/1.69 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.23/1.69
% 3.23/1.69 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.23/1.72
% 3.23/1.72 Inference rules
% 3.23/1.72 ----------------------
% 3.23/1.72 #Ref : 0
% 3.23/1.72 #Sup : 21
% 3.23/1.72 #Fact : 0
% 3.23/1.72 #Define : 0
% 3.23/1.72 #Split : 0
% 3.23/1.72 #Chain : 0
% 3.23/1.72 #Close : 0
% 3.23/1.72
% 3.23/1.72 Ordering : KBO
% 3.23/1.72
% 3.23/1.72 Simplification rules
% 3.23/1.72 ----------------------
% 3.23/1.72 #Subsume : 0
% 3.23/1.72 #Demod : 4
% 3.23/1.72 #Tautology : 21
% 3.23/1.72 #SimpNegUnit : 0
% 3.23/1.72 #BackRed : 0
% 3.23/1.72
% 3.23/1.72 #Partial instantiations: 0
% 3.23/1.72 #Strategies tried : 1
% 3.23/1.72
% 3.23/1.72 Timing (in seconds)
% 3.23/1.72 ----------------------
% 3.23/1.72 Preprocessing : 0.52
% 3.23/1.72 Parsing : 0.26
% 3.23/1.72 CNF conversion : 0.04
% 3.23/1.72 Main loop : 0.21
% 3.23/1.72 Inferencing : 0.09
% 3.23/1.72 Reduction : 0.05
% 3.23/1.72 Demodulation : 0.04
% 3.23/1.72 BG Simplification : 0.02
% 3.23/1.72 Subsumption : 0.04
% 3.23/1.72 Abstraction : 0.01
% 3.23/1.72 MUC search : 0.00
% 3.23/1.72 Cooper : 0.00
% 3.23/1.72 Total : 0.78
% 3.23/1.72 Index Insertion : 0.00
% 3.23/1.72 Index Deletion : 0.00
% 3.23/1.72 Index Matching : 0.00
% 3.23/1.72 BG Taut test : 0.00
%------------------------------------------------------------------------------