TSTP Solution File: NUM456+6 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM456+6 : TPTP v8.1.2. Released v4.0.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 : n018.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:51:44 EDT 2023
% Result : Theorem 7.08s 2.63s
% Output : CNFRefutation 7.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 63
% Syntax : Number of formulae : 74 ( 6 unt; 60 typ; 0 def)
% Number of atoms : 66 ( 18 equ)
% Maximal formula atoms : 26 ( 4 avg)
% Number of connectives : 62 ( 10 ~; 12 |; 32 &)
% ( 5 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 87 ( 50 >; 37 *; 0 +; 0 <<)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 50 ( 50 usr; 10 con; 0-3 aty)
% Number of variables : 17 (; 11 !; 6 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdteqdtlpzmzozddtrp0 > aSubsetOf0 > aElementOf0 > aDivisorOf0 > isPrime0 > isOpen0 > isFinite0 > isClosed0 > aSet0 > aInteger0 > szAzrzSzezqlpdtcmdtrp0 > sdtslmnbsdt0 > sdtpldt0 > sdtbsmnsldt0 > sdtasdt0 > #nlpp > stldt0 > smndt0 > sbsmnsldt0 > xp > xS > sz10 > sz00 > cS2200 > cS2076 > cS2043 > cS1395 > #skF_25 > #skF_33 > #skF_11 > #skF_2 > #skF_18 > #skF_24 > #skF_26 > #skF_6 > #skF_19 > #skF_17 > #skF_31 > #skF_22 > #skF_12 > #skF_8 > #skF_4 > #skF_3 > #skF_13 > #skF_14 > #skF_32 > #skF_28 > #skF_5 > #skF_10 > #skF_7 > #skF_15 > #skF_23 > #skF_27 > #skF_29 > #skF_21 > #skF_1 > #skF_9 > #skF_30 > #skF_20 > #skF_16 > #skF_34
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(aInteger0,type,
aInteger0: $i > $o ).
tff(sbsmnsldt0,type,
sbsmnsldt0: $i > $i ).
tff('#skF_25',type,
'#skF_25': $i > $i ).
tff('#skF_33',type,
'#skF_33': $i ).
tff('#skF_11',type,
'#skF_11': ( $i * $i ) > $i ).
tff(cS2043,type,
cS2043: $i ).
tff(stldt0,type,
stldt0: $i > $i ).
tff(sdtasdt0,type,
sdtasdt0: ( $i * $i ) > $i ).
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff(aSet0,type,
aSet0: $i > $o ).
tff('#skF_18',type,
'#skF_18': $i > $i ).
tff(isClosed0,type,
isClosed0: $i > $o ).
tff('#skF_24',type,
'#skF_24': $i > $i ).
tff('#skF_26',type,
'#skF_26': ( $i * $i ) > $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i * $i ) > $i ).
tff(szAzrzSzezqlpdtcmdtrp0,type,
szAzrzSzezqlpdtcmdtrp0: ( $i * $i ) > $i ).
tff(sz10,type,
sz10: $i ).
tff(cS1395,type,
cS1395: $i ).
tff('#skF_19',type,
'#skF_19': $i > $i ).
tff('#skF_17',type,
'#skF_17': ( $i * $i ) > $i ).
tff('#skF_31',type,
'#skF_31': $i > $i ).
tff('#skF_22',type,
'#skF_22': $i > $i ).
tff(cS2076,type,
cS2076: $i ).
tff(xS,type,
xS: $i ).
tff('#skF_12',type,
'#skF_12': ( $i * $i * $i ) > $i ).
tff(sz00,type,
sz00: $i ).
tff('#skF_8',type,
'#skF_8': $i > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff('#skF_13',type,
'#skF_13': ( $i * $i ) > $i ).
tff(cS2200,type,
cS2200: $i ).
tff('#skF_14',type,
'#skF_14': ( $i * $i ) > $i ).
tff('#skF_32',type,
'#skF_32': $i > $i ).
tff(sdtpldt0,type,
sdtpldt0: ( $i * $i ) > $i ).
tff(sdtslmnbsdt0,type,
sdtslmnbsdt0: ( $i * $i ) > $i ).
tff(isPrime0,type,
isPrime0: $i > $o ).
tff('#skF_28',type,
'#skF_28': $i > $i ).
tff(smndt0,type,
smndt0: $i > $i ).
tff(aSubsetOf0,type,
aSubsetOf0: ( $i * $i ) > $o ).
tff(isOpen0,type,
isOpen0: $i > $o ).
tff('#skF_5',type,
'#skF_5': ( $i * $i * $i ) > $i ).
tff('#skF_10',type,
'#skF_10': ( $i * $i ) > $i ).
tff('#skF_7',type,
'#skF_7': ( $i * $i * $i ) > $i ).
tff(aElementOf0,type,
aElementOf0: ( $i * $i ) > $o ).
tff(sdtbsmnsldt0,type,
sdtbsmnsldt0: ( $i * $i ) > $i ).
tff('#skF_15',type,
'#skF_15': ( $i * $i * $i ) > $i ).
tff('#skF_23',type,
'#skF_23': ( $i * $i ) > $i ).
tff(isFinite0,type,
isFinite0: $i > $o ).
tff(aDivisorOf0,type,
aDivisorOf0: ( $i * $i ) > $o ).
tff(xp,type,
xp: $i ).
tff('#skF_27',type,
'#skF_27': $i > $i ).
tff('#skF_29',type,
'#skF_29': ( $i * $i ) > $i ).
tff(sdteqdtlpzmzozddtrp0,type,
sdteqdtlpzmzozddtrp0: ( $i * $i * $i ) > $o ).
tff('#skF_21',type,
'#skF_21': ( $i * $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff('#skF_9',type,
'#skF_9': ( $i * $i ) > $i ).
tff('#skF_30',type,
'#skF_30': $i > $i ).
tff('#skF_20',type,
'#skF_20': $i > $i ).
tff('#skF_16',type,
'#skF_16': ( $i * $i * $i ) > $i ).
tff('#skF_34',type,
'#skF_34': $i ).
tff(f_757,hypothesis,
? [W0] :
( aInteger0(W0)
& ? [W1] :
( aInteger0(W1)
& ( sdtasdt0(xp,W1) = sdtpldt0(W0,smndt0(sz10)) ) )
& aDivisorOf0(xp,sdtpldt0(W0,smndt0(sz10)))
& sdteqdtlpzmzozddtrp0(W0,sz10,xp)
& aElementOf0(W0,szAzrzSzezqlpdtcmdtrp0(sz10,xp))
& ~ ( ( W0 = sz10 )
| ( W0 = smndt0(sz10) )
| aElementOf0(W0,cS2200) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2203) ).
tff(f_543,hypothesis,
( aSet0(sbsmnsldt0(xS))
& ! [W0] :
( aElementOf0(W0,sbsmnsldt0(xS))
<=> ( aInteger0(W0)
& ? [W1] :
( aElementOf0(W1,xS)
& aElementOf0(W0,W1) ) ) )
& aSet0(stldt0(sbsmnsldt0(xS)))
& ! [W0] :
( aElementOf0(W0,stldt0(sbsmnsldt0(xS)))
<=> ( aInteger0(W0)
& ~ aElementOf0(W0,sbsmnsldt0(xS)) ) )
& ! [W0] :
( aElementOf0(W0,stldt0(sbsmnsldt0(xS)))
<=> ( ( W0 = sz10 )
| ( W0 = smndt0(sz10) ) ) )
& ( stldt0(sbsmnsldt0(xS)) = cS2076 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2079) ).
tff(f_737,hypothesis,
( aInteger0(xp)
& ( xp != sz00 )
& aSet0(szAzrzSzezqlpdtcmdtrp0(sz10,xp))
& ! [W0] :
( ( aElementOf0(W0,szAzrzSzezqlpdtcmdtrp0(sz10,xp))
=> ( aInteger0(W0)
& ? [W1] :
( aInteger0(W1)
& ( sdtasdt0(xp,W1) = sdtpldt0(W0,smndt0(sz10)) ) )
& aDivisorOf0(xp,sdtpldt0(W0,smndt0(sz10)))
& sdteqdtlpzmzozddtrp0(W0,sz10,xp) ) )
& ( ( aInteger0(W0)
& ( ? [W1] :
( aInteger0(W1)
& ( sdtasdt0(xp,W1) = sdtpldt0(W0,smndt0(sz10)) ) )
| aDivisorOf0(xp,sdtpldt0(W0,smndt0(sz10)))
| sdteqdtlpzmzozddtrp0(W0,sz10,xp) ) )
=> aElementOf0(W0,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) ) )
& aSet0(sbsmnsldt0(xS))
& ! [W0] :
( aElementOf0(W0,sbsmnsldt0(xS))
<=> ( aInteger0(W0)
& ? [W1] :
( aElementOf0(W1,xS)
& aElementOf0(W0,W1) ) ) )
& ! [W0] :
( aElementOf0(W0,stldt0(sbsmnsldt0(xS)))
<=> ( aInteger0(W0)
& ~ aElementOf0(W0,sbsmnsldt0(xS)) ) )
& ! [W0] :
( aElementOf0(W0,szAzrzSzezqlpdtcmdtrp0(sz10,xp))
=> aElementOf0(W0,stldt0(sbsmnsldt0(xS))) )
& aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(sz10,xp),stldt0(sbsmnsldt0(xS))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2171) ).
tff(c_484,plain,
sz10 != '#skF_33',
inference(cnfTransformation,[status(thm)],[f_757]) ).
tff(c_482,plain,
smndt0(sz10) != '#skF_33',
inference(cnfTransformation,[status(thm)],[f_757]) ).
tff(c_486,plain,
aElementOf0('#skF_33',szAzrzSzezqlpdtcmdtrp0(sz10,xp)),
inference(cnfTransformation,[status(thm)],[f_757]) ).
tff(c_322,plain,
stldt0(sbsmnsldt0(xS)) = cS2076,
inference(cnfTransformation,[status(thm)],[f_543]) ).
tff(c_440,plain,
! [W0_287] :
( aElementOf0(W0_287,stldt0(sbsmnsldt0(xS)))
| ~ aElementOf0(W0_287,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) ),
inference(cnfTransformation,[status(thm)],[f_737]) ).
tff(c_1654,plain,
! [W0_350] :
( aElementOf0(W0_350,cS2076)
| ~ aElementOf0(W0_350,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) ),
inference(demodulation,[status(thm),theory(equality)],[c_322,c_440]) ).
tff(c_1658,plain,
aElementOf0('#skF_33',cS2076),
inference(resolution,[status(thm)],[c_486,c_1654]) ).
tff(c_324,plain,
! [W0_221] :
( ( smndt0(sz10) = W0_221 )
| ( sz10 = W0_221 )
| ~ aElementOf0(W0_221,stldt0(sbsmnsldt0(xS))) ),
inference(cnfTransformation,[status(thm)],[f_543]) ).
tff(c_538,plain,
! [W0_221] :
( ( smndt0(sz10) = W0_221 )
| ( sz10 = W0_221 )
| ~ aElementOf0(W0_221,cS2076) ),
inference(demodulation,[status(thm),theory(equality)],[c_322,c_324]) ).
tff(c_1661,plain,
( ( smndt0(sz10) = '#skF_33' )
| ( sz10 = '#skF_33' ) ),
inference(resolution,[status(thm)],[c_1658,c_538]) ).
tff(c_1674,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_484,c_482,c_1661]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : NUM456+6 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.15 % 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.14/0.37 % Computer : n018.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Thu Aug 3 15:23:20 EDT 2023
% 0.14/0.37 % CPUTime :
% 7.08/2.63 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.08/2.64
% 7.08/2.64 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.38/2.66
% 7.38/2.66 Inference rules
% 7.38/2.66 ----------------------
% 7.38/2.66 #Ref : 0
% 7.38/2.66 #Sup : 280
% 7.38/2.66 #Fact : 0
% 7.38/2.66 #Define : 0
% 7.38/2.66 #Split : 0
% 7.38/2.66 #Chain : 0
% 7.38/2.66 #Close : 0
% 7.38/2.66
% 7.38/2.66 Ordering : KBO
% 7.38/2.66
% 7.38/2.66 Simplification rules
% 7.38/2.66 ----------------------
% 7.38/2.66 #Subsume : 18
% 7.38/2.66 #Demod : 273
% 7.38/2.66 #Tautology : 189
% 7.38/2.66 #SimpNegUnit : 1
% 7.38/2.66 #BackRed : 0
% 7.38/2.66
% 7.38/2.66 #Partial instantiations: 0
% 7.38/2.66 #Strategies tried : 1
% 7.38/2.66
% 7.38/2.67 Timing (in seconds)
% 7.38/2.67 ----------------------
% 7.38/2.67 Preprocessing : 0.87
% 7.38/2.67 Parsing : 0.41
% 7.38/2.67 CNF conversion : 0.09
% 7.38/2.67 Main loop : 0.71
% 7.38/2.67 Inferencing : 0.17
% 7.38/2.67 Reduction : 0.26
% 7.38/2.67 Demodulation : 0.17
% 7.38/2.67 BG Simplification : 0.08
% 7.38/2.67 Subsumption : 0.16
% 7.38/2.67 Abstraction : 0.03
% 7.38/2.67 MUC search : 0.00
% 7.38/2.67 Cooper : 0.00
% 7.38/2.67 Total : 1.62
% 7.38/2.67 Index Insertion : 0.00
% 7.38/2.67 Index Deletion : 0.00
% 7.38/2.67 Index Matching : 0.00
% 7.38/2.67 BG Taut test : 0.00
%------------------------------------------------------------------------------