TSTP Solution File: KRS079+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KRS079+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:07 EDT 2023
% Result : Unsatisfiable 3.50s 1.86s
% Output : CNFRefutation 3.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 22
% Syntax : Number of formulae : 50 ( 8 unt; 14 typ; 0 def)
% Number of atoms : 81 ( 12 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 80 ( 35 ~; 29 |; 8 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 16 ( 13 >; 3 *; 0 +; 0 <<)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 48 (; 45 !; 3 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ rr > rf2 > rf1 > xsd_string > xsd_integer > cp2 > cp1 > cowlThing > cowlNothing > cUnsatisfiable > #nlpp > i2003_11_14_17_19_17492 > #skF_2 > #skF_1 > #skF_3
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(rr,type,
rr: ( $i * $i ) > $o ).
tff(i2003_11_14_17_19_17492,type,
i2003_11_14_17_19_17492: $i ).
tff('#skF_2',type,
'#skF_2': $i > $i ).
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(rf1,type,
rf1: ( $i * $i ) > $o ).
tff(xsd_string,type,
xsd_string: $i > $o ).
tff('#skF_3',type,
'#skF_3': $i > $i ).
tff(rf2,type,
rf2: ( $i * $i ) > $o ).
tff(cp2,type,
cp2: $i > $o ).
tff(cowlNothing,type,
cowlNothing: $i > $o ).
tff(cp1,type,
cp1: $i > $o ).
tff(f_163,axiom,
cUnsatisfiable(i2003_11_14_17_19_17492),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
tff(f_135,axiom,
! [X] :
( cUnsatisfiable(X)
<=> ( ? [Y] :
( rf2(X,Y)
& cp2(Y) )
& ? [Y] :
( rf1(X,Y)
& cp1(Y) )
& ? [Y] :
( rr(X,Y)
& cowlThing(Y) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
tff(f_171,axiom,
! [X,Y] :
( rr(X,Y)
=> rf2(X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_8) ).
tff(f_111,axiom,
! [X] :
( cowlThing(X)
& ~ cowlNothing(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_0) ).
tff(f_161,axiom,
! [X] :
( cowlThing(X)
=> ! [Y0,Y1] :
( ( rf2(X,Y0)
& rf2(X,Y1) )
=> ( Y0 = Y1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
tff(f_141,axiom,
! [X] :
( cp1(X)
=> ~ cp2(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
tff(f_167,axiom,
! [X,Y] :
( rr(X,Y)
=> rf1(X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
tff(f_151,axiom,
! [X] :
( cowlThing(X)
=> ! [Y0,Y1] :
( ( rf1(X,Y0)
& rf1(X,Y1) )
=> ( Y0 = Y1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
tff(c_56,plain,
cUnsatisfiable(i2003_11_14_17_19_17492),
inference(cnfTransformation,[status(thm)],[f_163]) ).
tff(c_40,plain,
! [X_35] :
( rr(X_35,'#skF_3'(X_35))
| ~ cUnsatisfiable(X_35) ),
inference(cnfTransformation,[status(thm)],[f_135]) ).
tff(c_92,plain,
! [X_73,Y_74] :
( rf2(X_73,Y_74)
| ~ rr(X_73,Y_74) ),
inference(cnfTransformation,[status(thm)],[f_171]) ).
tff(c_96,plain,
! [X_35] :
( rf2(X_35,'#skF_3'(X_35))
| ~ cUnsatisfiable(X_35) ),
inference(resolution,[status(thm)],[c_40,c_92]) ).
tff(c_48,plain,
! [X_35] :
( rf2(X_35,'#skF_1'(X_35))
| ~ cUnsatisfiable(X_35) ),
inference(cnfTransformation,[status(thm)],[f_135]) ).
tff(c_28,plain,
! [X_33] : cowlThing(X_33),
inference(cnfTransformation,[status(thm)],[f_111]) ).
tff(c_54,plain,
! [Y1_55,Y0_54,X_51] :
( ( Y1_55 = Y0_54 )
| ~ rf2(X_51,Y1_55)
| ~ rf2(X_51,Y0_54)
| ~ cowlThing(X_51) ),
inference(cnfTransformation,[status(thm)],[f_161]) ).
tff(c_98,plain,
! [Y1_76,Y0_77,X_78] :
( ( Y1_76 = Y0_77 )
| ~ rf2(X_78,Y1_76)
| ~ rf2(X_78,Y0_77) ),
inference(demodulation,[status(thm),theory(equality)],[c_28,c_54]) ).
tff(c_113,plain,
! [Y0_83,X_84] :
( ( Y0_83 = '#skF_1'(X_84) )
| ~ rf2(X_84,Y0_83)
| ~ cUnsatisfiable(X_84) ),
inference(resolution,[status(thm)],[c_48,c_98]) ).
tff(c_133,plain,
! [X_87] :
( ( '#skF_1'(X_87) = '#skF_3'(X_87) )
| ~ cUnsatisfiable(X_87) ),
inference(resolution,[status(thm)],[c_96,c_113]) ).
tff(c_137,plain,
'#skF_1'(i2003_11_14_17_19_17492) = '#skF_3'(i2003_11_14_17_19_17492),
inference(resolution,[status(thm)],[c_56,c_133]) ).
tff(c_78,plain,
! [X_66] :
( cp2('#skF_1'(X_66))
| ~ cUnsatisfiable(X_66) ),
inference(cnfTransformation,[status(thm)],[f_135]) ).
tff(c_50,plain,
! [X_45] :
( ~ cp2(X_45)
| ~ cp1(X_45) ),
inference(cnfTransformation,[status(thm)],[f_141]) ).
tff(c_82,plain,
! [X_66] :
( ~ cp1('#skF_1'(X_66))
| ~ cUnsatisfiable(X_66) ),
inference(resolution,[status(thm)],[c_78,c_50]) ).
tff(c_144,plain,
( ~ cp1('#skF_3'(i2003_11_14_17_19_17492))
| ~ cUnsatisfiable(i2003_11_14_17_19_17492) ),
inference(superposition,[status(thm),theory(equality)],[c_137,c_82]) ).
tff(c_153,plain,
~ cp1('#skF_3'(i2003_11_14_17_19_17492)),
inference(demodulation,[status(thm),theory(equality)],[c_56,c_144]) ).
tff(c_86,plain,
! [X_70,Y_71] :
( rf1(X_70,Y_71)
| ~ rr(X_70,Y_71) ),
inference(cnfTransformation,[status(thm)],[f_167]) ).
tff(c_90,plain,
! [X_35] :
( rf1(X_35,'#skF_3'(X_35))
| ~ cUnsatisfiable(X_35) ),
inference(resolution,[status(thm)],[c_40,c_86]) ).
tff(c_44,plain,
! [X_35] :
( rf1(X_35,'#skF_2'(X_35))
| ~ cUnsatisfiable(X_35) ),
inference(cnfTransformation,[status(thm)],[f_135]) ).
tff(c_52,plain,
! [Y1_50,Y0_49,X_46] :
( ( Y1_50 = Y0_49 )
| ~ rf1(X_46,Y1_50)
| ~ rf1(X_46,Y0_49)
| ~ cowlThing(X_46) ),
inference(cnfTransformation,[status(thm)],[f_151]) ).
tff(c_106,plain,
! [Y1_80,Y0_81,X_82] :
( ( Y1_80 = Y0_81 )
| ~ rf1(X_82,Y1_80)
| ~ rf1(X_82,Y0_81) ),
inference(demodulation,[status(thm),theory(equality)],[c_28,c_52]) ).
tff(c_123,plain,
! [Y0_85,X_86] :
( ( Y0_85 = '#skF_2'(X_86) )
| ~ rf1(X_86,Y0_85)
| ~ cUnsatisfiable(X_86) ),
inference(resolution,[status(thm)],[c_44,c_106]) ).
tff(c_174,plain,
! [X_92] :
( ( '#skF_2'(X_92) = '#skF_3'(X_92) )
| ~ cUnsatisfiable(X_92) ),
inference(resolution,[status(thm)],[c_90,c_123]) ).
tff(c_178,plain,
'#skF_2'(i2003_11_14_17_19_17492) = '#skF_3'(i2003_11_14_17_19_17492),
inference(resolution,[status(thm)],[c_56,c_174]) ).
tff(c_42,plain,
! [X_35] :
( cp1('#skF_2'(X_35))
| ~ cUnsatisfiable(X_35) ),
inference(cnfTransformation,[status(thm)],[f_135]) ).
tff(c_185,plain,
( cp1('#skF_3'(i2003_11_14_17_19_17492))
| ~ cUnsatisfiable(i2003_11_14_17_19_17492) ),
inference(superposition,[status(thm),theory(equality)],[c_178,c_42]) ).
tff(c_191,plain,
cp1('#skF_3'(i2003_11_14_17_19_17492)),
inference(demodulation,[status(thm),theory(equality)],[c_56,c_185]) ).
tff(c_193,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_153,c_191]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : KRS079+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 : n017.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 19:38:51 EDT 2023
% 0.13/0.36 % CPUTime :
% 3.50/1.86 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.50/1.87
% 3.50/1.87 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.62/1.90
% 3.62/1.90 Inference rules
% 3.62/1.90 ----------------------
% 3.62/1.90 #Ref : 0
% 3.62/1.90 #Sup : 27
% 3.62/1.90 #Fact : 0
% 3.62/1.90 #Define : 0
% 3.62/1.90 #Split : 0
% 3.62/1.90 #Chain : 0
% 3.62/1.90 #Close : 0
% 3.62/1.90
% 3.62/1.90 Ordering : KBO
% 3.62/1.90
% 3.62/1.90 Simplification rules
% 3.62/1.90 ----------------------
% 3.62/1.90 #Subsume : 1
% 3.62/1.90 #Demod : 11
% 3.62/1.90 #Tautology : 22
% 3.62/1.90 #SimpNegUnit : 1
% 3.62/1.90 #BackRed : 0
% 3.62/1.90
% 3.62/1.90 #Partial instantiations: 0
% 3.62/1.90 #Strategies tried : 1
% 3.62/1.90
% 3.62/1.90 Timing (in seconds)
% 3.62/1.90 ----------------------
% 3.62/1.90 Preprocessing : 0.51
% 3.62/1.90 Parsing : 0.28
% 3.62/1.90 CNF conversion : 0.04
% 3.62/1.90 Main loop : 0.24
% 3.62/1.90 Inferencing : 0.10
% 3.62/1.90 Reduction : 0.06
% 3.62/1.90 Demodulation : 0.04
% 3.62/1.90 BG Simplification : 0.02
% 3.62/1.90 Subsumption : 0.05
% 3.62/1.90 Abstraction : 0.01
% 3.62/1.90 MUC search : 0.00
% 3.62/1.90 Cooper : 0.00
% 3.62/1.90 Total : 0.81
% 3.62/1.90 Index Insertion : 0.00
% 3.62/1.90 Index Deletion : 0.00
% 3.62/1.90 Index Matching : 0.00
% 3.62/1.90 BG Taut test : 0.00
%------------------------------------------------------------------------------