TSTP Solution File: NUM565+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM565+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/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 : 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:52:08 EDT 2023
% Result : Theorem 8.06s 2.93s
% Output : CNFRefutation 8.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 67
% Syntax : Number of formulae : 97 ( 20 unt; 58 typ; 2 def)
% Number of atoms : 79 ( 21 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 66 ( 26 ~; 23 |; 8 &)
% ( 4 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 3 ( 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 : 49 ( 49 usr; 8 con; 0-4 aty)
% Number of variables : 24 (; 24 !; 0 ?; 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 > xc > xT > xS > 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('#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(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(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_211,axiom,
( aSet0(szNzAzT0)
& isCountable0(szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mNATSet) ).
tff(f_667,hypothesis,
( aSubsetOf0(xS,szNzAzT0)
& isCountable0(xS) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3435) ).
tff(f_84,definition,
! [W0] :
( aSet0(W0)
=> ! [W1] :
( aSubsetOf0(W1,W0)
<=> ( aSet0(W1)
& ! [W2] :
( aElementOf0(W2,W1)
=> aElementOf0(W2,W0) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSub) ).
tff(f_702,hypothesis,
xK = sz00,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3462) ).
tff(f_672,hypothesis,
( aFunction0(xc)
& ( szDzozmdt0(xc) = slbdtsldtrb0(xS,xK) )
& aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3453) ).
tff(f_708,negated_conjecture,
~ ! [W0] :
( aElementOf0(W0,slbdtsldtrb0(xS,sz00))
=> ( sdtlpdtrp0(xc,W0) = sdtlpdtrp0(xc,slcrc0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
tff(f_664,hypothesis,
aElementOf0(xK,szNzAzT0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3418) ).
tff(f_487,definition,
! [W0,W1] :
( ( aSet0(W0)
& aElementOf0(W1,szNzAzT0) )
=> ! [W2] :
( ( W2 = slbdtsldtrb0(W0,W1) )
<=> ( aSet0(W2)
& ! [W3] :
( aElementOf0(W3,W2)
<=> ( aSubsetOf0(W3,W0)
& ( sbrdtbr0(W3) = W1 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSel) ).
tff(f_330,axiom,
! [W0] :
( aSet0(W0)
=> ( ( sbrdtbr0(W0) = sz00 )
<=> ( W0 = slcrc0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mCardEmpty) ).
tff(c_108,plain,
aSet0(szNzAzT0),
inference(cnfTransformation,[status(thm)],[f_211]) ).
tff(c_340,plain,
aSubsetOf0(xS,szNzAzT0),
inference(cnfTransformation,[status(thm)],[f_667]) ).
tff(c_536,plain,
! [W1_401,W0_402] :
( aSet0(W1_401)
| ~ aSubsetOf0(W1_401,W0_402)
| ~ aSet0(W0_402) ),
inference(cnfTransformation,[status(thm)],[f_84]) ).
tff(c_545,plain,
( aSet0(xS)
| ~ aSet0(szNzAzT0) ),
inference(resolution,[status(thm)],[c_340,c_536]) ).
tff(c_552,plain,
aSet0(xS),
inference(demodulation,[status(thm),theory(equality)],[c_108,c_545]) ).
tff(c_356,plain,
xK = sz00,
inference(cnfTransformation,[status(thm)],[f_702]) ).
tff(c_344,plain,
slbdtsldtrb0(xS,xK) = szDzozmdt0(xc),
inference(cnfTransformation,[status(thm)],[f_672]) ).
tff(c_367,plain,
slbdtsldtrb0(xS,sz00) = szDzozmdt0(xc),
inference(demodulation,[status(thm),theory(equality)],[c_356,c_344]) ).
tff(c_362,plain,
aElementOf0('#skF_28',slbdtsldtrb0(xS,sz00)),
inference(cnfTransformation,[status(thm)],[f_708]) ).
tff(c_369,plain,
aElementOf0('#skF_28',szDzozmdt0(xc)),
inference(demodulation,[status(thm),theory(equality)],[c_367,c_362]) ).
tff(c_336,plain,
aElementOf0(xK,szNzAzT0),
inference(cnfTransformation,[status(thm)],[f_664]) ).
tff(c_370,plain,
aElementOf0(sz00,szNzAzT0),
inference(demodulation,[status(thm),theory(equality)],[c_356,c_336]) ).
tff(c_2733,plain,
! [W3_557,W0_558,W1_559] :
( aSubsetOf0(W3_557,W0_558)
| ~ aElementOf0(W3_557,slbdtsldtrb0(W0_558,W1_559))
| ~ aElementOf0(W1_559,szNzAzT0)
| ~ aSet0(W0_558) ),
inference(cnfTransformation,[status(thm)],[f_487]) ).
tff(c_2764,plain,
! [W3_557] :
( aSubsetOf0(W3_557,xS)
| ~ aElementOf0(W3_557,szDzozmdt0(xc))
| ~ aElementOf0(sz00,szNzAzT0)
| ~ aSet0(xS) ),
inference(superposition,[status(thm),theory(equality)],[c_367,c_2733]) ).
tff(c_2774,plain,
! [W3_560] :
( aSubsetOf0(W3_560,xS)
| ~ aElementOf0(W3_560,szDzozmdt0(xc)) ),
inference(demodulation,[status(thm),theory(equality)],[c_552,c_370,c_2764]) ).
tff(c_2829,plain,
aSubsetOf0('#skF_28',xS),
inference(resolution,[status(thm)],[c_369,c_2774]) ).
tff(c_26,plain,
! [W1_20,W0_14] :
( aSet0(W1_20)
| ~ aSubsetOf0(W1_20,W0_14)
| ~ aSet0(W0_14) ),
inference(cnfTransformation,[status(thm)],[f_84]) ).
tff(c_2838,plain,
( aSet0('#skF_28')
| ~ aSet0(xS) ),
inference(resolution,[status(thm)],[c_2829,c_26]) ).
tff(c_2847,plain,
aSet0('#skF_28'),
inference(demodulation,[status(thm),theory(equality)],[c_552,c_2838]) ).
tff(c_156,plain,
! [W0_98] :
( ( slcrc0 = W0_98 )
| ( sbrdtbr0(W0_98) != sz00 )
| ~ aSet0(W0_98) ),
inference(cnfTransformation,[status(thm)],[f_330]) ).
tff(c_2851,plain,
( ( slcrc0 = '#skF_28' )
| ( sbrdtbr0('#skF_28') != sz00 ) ),
inference(resolution,[status(thm)],[c_2847,c_156]) ).
tff(c_2936,plain,
sbrdtbr0('#skF_28') != sz00,
inference(splitLeft,[status(thm)],[c_2851]) ).
tff(c_3199,plain,
! [W3_574,W1_575,W0_576] :
( ( sbrdtbr0(W3_574) = W1_575 )
| ~ aElementOf0(W3_574,slbdtsldtrb0(W0_576,W1_575))
| ~ aElementOf0(W1_575,szNzAzT0)
| ~ aSet0(W0_576) ),
inference(cnfTransformation,[status(thm)],[f_487]) ).
tff(c_3230,plain,
! [W3_574] :
( ( sbrdtbr0(W3_574) = sz00 )
| ~ aElementOf0(W3_574,szDzozmdt0(xc))
| ~ aElementOf0(sz00,szNzAzT0)
| ~ aSet0(xS) ),
inference(superposition,[status(thm),theory(equality)],[c_367,c_3199]) ).
tff(c_3240,plain,
! [W3_577] :
( ( sbrdtbr0(W3_577) = sz00 )
| ~ aElementOf0(W3_577,szDzozmdt0(xc)) ),
inference(demodulation,[status(thm),theory(equality)],[c_552,c_370,c_3230]) ).
tff(c_3271,plain,
sbrdtbr0('#skF_28') = sz00,
inference(resolution,[status(thm)],[c_369,c_3240]) ).
tff(c_3298,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_2936,c_3271]) ).
tff(c_3299,plain,
slcrc0 = '#skF_28',
inference(splitRight,[status(thm)],[c_2851]) ).
tff(c_360,plain,
sdtlpdtrp0(xc,slcrc0) != sdtlpdtrp0(xc,'#skF_28'),
inference(cnfTransformation,[status(thm)],[f_708]) ).
tff(c_3368,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_3299,c_360]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM565+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/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 : n002.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 15:02:46 EDT 2023
% 0.14/0.36 % CPUTime :
% 8.06/2.93 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.06/2.94
% 8.06/2.94 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 8.06/2.97
% 8.06/2.97 Inference rules
% 8.06/2.97 ----------------------
% 8.06/2.97 #Ref : 1
% 8.06/2.97 #Sup : 559
% 8.06/2.97 #Fact : 0
% 8.06/2.97 #Define : 0
% 8.06/2.97 #Split : 27
% 8.06/2.97 #Chain : 0
% 8.06/2.97 #Close : 0
% 8.06/2.97
% 8.06/2.97 Ordering : KBO
% 8.06/2.97
% 8.06/2.97 Simplification rules
% 8.06/2.97 ----------------------
% 8.06/2.97 #Subsume : 116
% 8.06/2.97 #Demod : 579
% 8.06/2.97 #Tautology : 168
% 8.06/2.97 #SimpNegUnit : 28
% 8.06/2.97 #BackRed : 90
% 8.06/2.97
% 8.06/2.97 #Partial instantiations: 0
% 8.06/2.97 #Strategies tried : 1
% 8.06/2.97
% 8.06/2.97 Timing (in seconds)
% 8.06/2.97 ----------------------
% 8.06/2.97 Preprocessing : 0.84
% 8.06/2.97 Parsing : 0.40
% 8.06/2.97 CNF conversion : 0.09
% 8.06/2.97 Main loop : 1.06
% 8.06/2.97 Inferencing : 0.34
% 8.06/2.97 Reduction : 0.35
% 8.06/2.97 Demodulation : 0.24
% 8.06/2.97 BG Simplification : 0.08
% 8.06/2.97 Subsumption : 0.23
% 8.06/2.97 Abstraction : 0.04
% 8.06/2.97 MUC search : 0.00
% 8.06/2.97 Cooper : 0.00
% 8.06/2.97 Total : 1.95
% 8.06/2.97 Index Insertion : 0.00
% 8.06/2.97 Index Deletion : 0.00
% 8.06/2.97 Index Matching : 0.00
% 8.06/2.97 BG Taut test : 0.00
%------------------------------------------------------------------------------