TSTP Solution File: KRS099+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KRS099+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:10 EDT 2023
% Result : Unsatisfiable 3.37s 1.83s
% Output : CNFRefutation 3.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 20
% Syntax : Number of formulae : 30 ( 5 unt; 18 typ; 0 def)
% Number of atoms : 35 ( 11 equ)
% Maximal formula atoms : 15 ( 2 avg)
% Number of connectives : 37 ( 14 ~; 9 |; 10 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 18 ( 17 >; 1 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 1 con; 0-1 aty)
% Number of variables : 18 (; 15 !; 3 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ rtt > xsd_string > xsd_integer > cowlThing > cowlNothing > cd > cc > ca > cUnsatisfiable > #nlpp > i2003_11_14_17_20_29215 > #skF_7 > #skF_5 > #skF_2 > #skF_4 > #skF_1 > #skF_8 > #skF_3 > #skF_6
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_7',type,
'#skF_7': $i > $i ).
tff(i2003_11_14_17_20_29215,type,
i2003_11_14_17_20_29215: $i ).
tff('#skF_5',type,
'#skF_5': $i > $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('#skF_1',type,
'#skF_1': $i > $i ).
tff('#skF_8',type,
'#skF_8': $i > $i ).
tff(cUnsatisfiable,type,
cUnsatisfiable: $i > $o ).
tff(xsd_integer,type,
xsd_integer: $i > $o ).
tff(ca,type,
ca: $i > $o ).
tff(xsd_string,type,
xsd_string: $i > $o ).
tff('#skF_3',type,
'#skF_3': $i > $i ).
tff(rtt,type,
rtt: ( $i * $i ) > $o ).
tff(cd,type,
cd: $i > $o ).
tff('#skF_6',type,
'#skF_6': $i > $i ).
tff(cowlNothing,type,
cowlNothing: $i > $o ).
tff(f_154,axiom,
cUnsatisfiable(i2003_11_14_17_20_29215),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
tff(f_139,axiom,
! [X] :
( cUnsatisfiable(X)
<=> ( ? [Y0,Y1,Y2] :
( rtt(X,Y0)
& rtt(X,Y1)
& rtt(X,Y2)
& ( Y0 != Y1 )
& ( Y0 != Y2 )
& ( Y1 != Y2 ) )
& ! [Y] :
( rtt(X,Y)
=> ca(Y) )
& ! [Y0,Y1] :
( ( rtt(X,Y0)
& rtt(X,Y1) )
=> ( Y0 = Y1 ) )
& ! [Y0,Y1] :
( ( rtt(X,Y0)
& rtt(X,Y1) )
=> ( Y0 = Y1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
tff(c_88,plain,
cUnsatisfiable(i2003_11_14_17_20_29215),
inference(cnfTransformation,[status(thm)],[f_154]) ).
tff(c_114,plain,
! [X_61] :
( ( '#skF_7'(X_61) != '#skF_8'(X_61) )
| ~ cUnsatisfiable(X_61) ),
inference(cnfTransformation,[status(thm)],[f_139]) ).
tff(c_118,plain,
'#skF_7'(i2003_11_14_17_20_29215) != '#skF_8'(i2003_11_14_17_20_29215),
inference(resolution,[status(thm)],[c_88,c_114]) ).
tff(c_44,plain,
! [X_25] :
( rtt(X_25,'#skF_7'(X_25))
| ~ cUnsatisfiable(X_25) ),
inference(cnfTransformation,[status(thm)],[f_139]) ).
tff(c_42,plain,
! [X_25] :
( rtt(X_25,'#skF_8'(X_25))
| ~ cUnsatisfiable(X_25) ),
inference(cnfTransformation,[status(thm)],[f_139]) ).
tff(c_136,plain,
! [Y1_68,Y0_69,X_70] :
( ( Y1_68 = Y0_69 )
| ~ rtt(X_70,Y1_68)
| ~ rtt(X_70,Y0_69)
| ~ cUnsatisfiable(X_70) ),
inference(cnfTransformation,[status(thm)],[f_139]) ).
tff(c_147,plain,
! [Y0_72,X_73] :
( ( Y0_72 = '#skF_8'(X_73) )
| ~ rtt(X_73,Y0_72)
| ~ cUnsatisfiable(X_73) ),
inference(resolution,[status(thm)],[c_42,c_136]) ).
tff(c_161,plain,
! [X_74] :
( ( '#skF_7'(X_74) = '#skF_8'(X_74) )
| ~ cUnsatisfiable(X_74) ),
inference(resolution,[status(thm)],[c_44,c_147]) ).
tff(c_164,plain,
'#skF_7'(i2003_11_14_17_20_29215) = '#skF_8'(i2003_11_14_17_20_29215),
inference(resolution,[status(thm)],[c_88,c_161]) ).
tff(c_168,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_118,c_164]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : KRS099+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.14/0.36 % Computer : n017.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 19:32:36 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.37/1.83 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.37/1.83
% 3.37/1.83 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.69/1.86
% 3.69/1.86 Inference rules
% 3.69/1.86 ----------------------
% 3.69/1.86 #Ref : 0
% 3.69/1.86 #Sup : 15
% 3.69/1.86 #Fact : 0
% 3.69/1.86 #Define : 0
% 3.69/1.86 #Split : 0
% 3.69/1.86 #Chain : 0
% 3.69/1.86 #Close : 0
% 3.69/1.86
% 3.69/1.86 Ordering : KBO
% 3.69/1.86
% 3.69/1.86 Simplification rules
% 3.69/1.86 ----------------------
% 3.69/1.86 #Subsume : 1
% 3.69/1.86 #Demod : 0
% 3.69/1.86 #Tautology : 13
% 3.69/1.86 #SimpNegUnit : 1
% 3.69/1.86 #BackRed : 0
% 3.69/1.86
% 3.69/1.86 #Partial instantiations: 0
% 3.69/1.86 #Strategies tried : 1
% 3.69/1.86
% 3.69/1.86 Timing (in seconds)
% 3.69/1.86 ----------------------
% 3.69/1.86 Preprocessing : 0.54
% 3.69/1.86 Parsing : 0.26
% 3.69/1.86 CNF conversion : 0.04
% 3.69/1.86 Main loop : 0.24
% 3.69/1.86 Inferencing : 0.08
% 3.69/1.86 Reduction : 0.06
% 3.69/1.86 Demodulation : 0.04
% 3.69/1.86 BG Simplification : 0.03
% 3.69/1.86 Subsumption : 0.07
% 3.69/1.86 Abstraction : 0.01
% 3.69/1.86 MUC search : 0.00
% 3.69/1.86 Cooper : 0.00
% 3.69/1.86 Total : 0.83
% 3.69/1.86 Index Insertion : 0.00
% 3.69/1.86 Index Deletion : 0.00
% 3.69/1.86 Index Matching : 0.00
% 3.69/1.86 BG Taut test : 0.00
%------------------------------------------------------------------------------