TSTP Solution File: NUM571+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM571+1 : 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 : n006.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:52:10 EDT 2023
% Result : Theorem 5.43s 2.36s
% Output : CNFRefutation 5.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 65
% Syntax : Number of formulae : 84 ( 15 unt; 61 typ; 0 def)
% Number of atoms : 40 ( 12 equ)
% Maximal formula atoms : 8 ( 1 avg)
% Number of connectives : 27 ( 10 ~; 4 |; 10 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 102 ( 50 >; 52 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 52 ( 52 usr; 11 con; 0-4 aty)
% Number of variables : 2 (; 1 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdtlseqdt0 > iLess0 > aSubsetOf0 > aElementOf0 > isFinite0 > isCountable0 > aSet0 > aFunction0 > aElement0 > slbdtsldtrb0 > sdtpldt0 > sdtmndt0 > sdtlpdtrp0 > sdtlcdtrc0 > sdtlbdtrb0 > sdtexdt0 > #nlpp > szszuzczcdt0 > szmzizndt0 > szmzazxdt0 > szDzozmdt0 > szDzizrdt0 > slbdtrb0 > sbrdtbr0 > xk > xi > xc > xT > xS > xN > xK > szNzAzT0 > sz00 > slcrc0 > #skF_26 > #skF_7 > #skF_11 > #skF_17 > #skF_6 > #skF_27 > #skF_1 > #skF_18 > #skF_4 > #skF_12 > #skF_23 > #skF_5 > #skF_19 > #skF_10 > #skF_8 > #skF_20 > #skF_24 > #skF_15 > #skF_13 > #skF_14 > #skF_25 > #skF_3 > #skF_28 > #skF_2 > #skF_21 > #skF_9 > #skF_22 > #skF_16
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(xk,type,
xk: $i ).
tff('#skF_26',type,
'#skF_26': ( $i * $i * $i ) > $i ).
tff('#skF_7',type,
'#skF_7': $i > $i ).
tff('#skF_11',type,
'#skF_11': ( $i * $i ) > $i ).
tff(sbrdtbr0,type,
sbrdtbr0: $i > $i ).
tff('#skF_17',type,
'#skF_17': ( $i * $i * $i ) > $i ).
tff(aSet0,type,
aSet0: $i > $o ).
tff(szszuzczcdt0,type,
szszuzczcdt0: $i > $i ).
tff(sdtlbdtrb0,type,
sdtlbdtrb0: ( $i * $i ) > $i ).
tff(szDzozmdt0,type,
szDzozmdt0: $i > $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i * $i ) > $i ).
tff('#skF_27',type,
'#skF_27': ( $i * $i * $i ) > $i ).
tff(sdtmndt0,type,
sdtmndt0: ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff('#skF_18',type,
'#skF_18': ( $i * $i * $i ) > $i ).
tff(aElement0,type,
aElement0: $i > $o ).
tff(sdtexdt0,type,
sdtexdt0: ( $i * $i ) > $i ).
tff(xi,type,
xi: $i ).
tff(szNzAzT0,type,
szNzAzT0: $i ).
tff(sdtlseqdt0,type,
sdtlseqdt0: ( $i * $i ) > $o ).
tff(xS,type,
xS: $i ).
tff(sz00,type,
sz00: $i ).
tff(sdtlpdtrp0,type,
sdtlpdtrp0: ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i * $i ) > $i ).
tff(xc,type,
xc: $i ).
tff('#skF_12',type,
'#skF_12': ( $i * $i ) > $i ).
tff(sdtpldt0,type,
sdtpldt0: ( $i * $i ) > $i ).
tff(slbdtsldtrb0,type,
slbdtsldtrb0: ( $i * $i ) > $i ).
tff('#skF_23',type,
'#skF_23': ( $i * $i * $i ) > $i ).
tff(aSubsetOf0,type,
aSubsetOf0: ( $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': ( $i * $i * $i ) > $i ).
tff('#skF_19',type,
'#skF_19': ( $i * $i * $i ) > $i ).
tff(isCountable0,type,
isCountable0: $i > $o ).
tff('#skF_10',type,
'#skF_10': ( $i * $i ) > $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $i ) > $i ).
tff(xT,type,
xT: $i ).
tff(xN,type,
xN: $i ).
tff(aElementOf0,type,
aElementOf0: ( $i * $i ) > $o ).
tff('#skF_20',type,
'#skF_20': ( $i * $i * $i ) > $i ).
tff(szDzizrdt0,type,
szDzizrdt0: $i > $i ).
tff('#skF_24',type,
'#skF_24': ( $i * $i ) > $i ).
tff('#skF_15',type,
'#skF_15': ( $i * $i * $i ) > $i ).
tff('#skF_13',type,
'#skF_13': $i > $i ).
tff('#skF_14',type,
'#skF_14': ( $i * $i * $i ) > $i ).
tff(slcrc0,type,
slcrc0: $i ).
tff(aFunction0,type,
aFunction0: $i > $o ).
tff(isFinite0,type,
isFinite0: $i > $o ).
tff('#skF_25',type,
'#skF_25': ( $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i * $i ) > $i ).
tff(sdtlcdtrc0,type,
sdtlcdtrc0: ( $i * $i ) > $i ).
tff('#skF_28',type,
'#skF_28': $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(iLess0,type,
iLess0: ( $i * $i ) > $o ).
tff(szmzizndt0,type,
szmzizndt0: $i > $i ).
tff(szmzazxdt0,type,
szmzazxdt0: $i > $i ).
tff('#skF_21',type,
'#skF_21': ( $i * $i * $i ) > $i ).
tff(xK,type,
xK: $i ).
tff('#skF_9',type,
'#skF_9': ( $i * $i ) > $i ).
tff(slbdtrb0,type,
slbdtrb0: $i > $i ).
tff('#skF_22',type,
'#skF_22': ( $i * $i * $i * $i ) > $i ).
tff('#skF_16',type,
'#skF_16': ( $i * $i * $i ) > $i ).
tff(f_667,hypothesis,
( aSubsetOf0(xS,szNzAzT0)
& isCountable0(xS) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3435) ).
tff(f_724,hypothesis,
( aFunction0(xN)
& ( szDzozmdt0(xN) = szNzAzT0 )
& ( sdtlpdtrp0(xN,sz00) = xS )
& ! [W0] :
( aElementOf0(W0,szNzAzT0)
=> ( ( aSubsetOf0(sdtlpdtrp0(xN,W0),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,W0)) )
=> ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(W0)),sdtmndt0(sdtlpdtrp0(xN,W0),szmzizndt0(sdtlpdtrp0(xN,W0))))
& isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(W0))) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3623) ).
tff(f_744,hypothesis,
( ( xi != sz00 )
=> ( ? [W0] :
( aElementOf0(W0,szNzAzT0)
& ( szszuzczcdt0(W0) = xi ) )
& aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,xi)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3702_02) ).
tff(f_748,negated_conjecture,
~ ( aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,xi)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
tff(c_338,plain,
isCountable0(xS),
inference(cnfTransformation,[status(thm)],[f_667]) ).
tff(c_364,plain,
sdtlpdtrp0(xN,sz00) = xS,
inference(cnfTransformation,[status(thm)],[f_724]) ).
tff(c_386,plain,
( aElementOf0('#skF_28',szNzAzT0)
| ( xi = sz00 ) ),
inference(cnfTransformation,[status(thm)],[f_744]) ).
tff(c_653,plain,
xi = sz00,
inference(splitLeft,[status(thm)],[c_386]) ).
tff(c_340,plain,
aSubsetOf0(xS,szNzAzT0),
inference(cnfTransformation,[status(thm)],[f_667]) ).
tff(c_415,plain,
xi = sz00,
inference(splitLeft,[status(thm)],[c_386]) ).
tff(c_388,plain,
( ~ isCountable0(sdtlpdtrp0(xN,xi))
| ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
inference(cnfTransformation,[status(thm)],[f_748]) ).
tff(c_393,plain,
~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0),
inference(splitLeft,[status(thm)],[c_388]) ).
tff(c_416,plain,
~ aSubsetOf0(sdtlpdtrp0(xN,sz00),szNzAzT0),
inference(demodulation,[status(thm),theory(equality)],[c_415,c_393]) ).
tff(c_420,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_340,c_364,c_416]) ).
tff(c_422,plain,
xi != sz00,
inference(splitRight,[status(thm)],[c_386]) ).
tff(c_382,plain,
( aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
| ( xi = sz00 ) ),
inference(cnfTransformation,[status(thm)],[f_744]) ).
tff(c_629,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_422,c_393,c_382]) ).
tff(c_630,plain,
~ isCountable0(sdtlpdtrp0(xN,xi)),
inference(splitRight,[status(thm)],[c_388]) ).
tff(c_654,plain,
~ isCountable0(sdtlpdtrp0(xN,sz00)),
inference(demodulation,[status(thm),theory(equality)],[c_653,c_630]) ).
tff(c_658,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_338,c_364,c_654]) ).
tff(c_660,plain,
xi != sz00,
inference(splitRight,[status(thm)],[c_386]) ).
tff(c_380,plain,
( isCountable0(sdtlpdtrp0(xN,xi))
| ( xi = sz00 ) ),
inference(cnfTransformation,[status(thm)],[f_744]) ).
tff(c_730,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_660,c_630,c_380]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM571+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14 % 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.35 % Computer : n006.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 14:50:44 EDT 2023
% 0.14/0.35 % CPUTime :
% 5.43/2.36 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.43/2.37
% 5.43/2.37 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.43/2.39
% 5.43/2.39 Inference rules
% 5.43/2.39 ----------------------
% 5.43/2.39 #Ref : 0
% 5.43/2.39 #Sup : 77
% 5.43/2.39 #Fact : 0
% 5.43/2.39 #Define : 0
% 5.43/2.39 #Split : 4
% 5.43/2.39 #Chain : 0
% 5.43/2.39 #Close : 0
% 5.43/2.39
% 5.43/2.39 Ordering : KBO
% 5.43/2.39
% 5.43/2.39 Simplification rules
% 5.43/2.39 ----------------------
% 5.43/2.39 #Subsume : 8
% 5.43/2.40 #Demod : 45
% 5.43/2.40 #Tautology : 44
% 5.43/2.40 #SimpNegUnit : 5
% 5.43/2.40 #BackRed : 4
% 5.43/2.40
% 5.43/2.40 #Partial instantiations: 0
% 5.43/2.40 #Strategies tried : 1
% 5.43/2.40
% 5.43/2.40 Timing (in seconds)
% 5.43/2.40 ----------------------
% 6.27/2.40 Preprocessing : 0.84
% 6.27/2.40 Parsing : 0.41
% 6.27/2.40 CNF conversion : 0.08
% 6.27/2.40 Main loop : 0.49
% 6.27/2.40 Inferencing : 0.10
% 6.27/2.40 Reduction : 0.18
% 6.27/2.40 Demodulation : 0.12
% 6.27/2.40 BG Simplification : 0.07
% 6.27/2.40 Subsumption : 0.13
% 6.27/2.40 Abstraction : 0.02
% 6.27/2.40 MUC search : 0.00
% 6.27/2.40 Cooper : 0.00
% 6.27/2.40 Total : 1.38
% 6.27/2.40 Index Insertion : 0.00
% 6.27/2.40 Index Deletion : 0.00
% 6.27/2.40 Index Matching : 0.00
% 6.27/2.40 BG Taut test : 0.00
%------------------------------------------------------------------------------