TSTP Solution File: NUM580+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM580+3 : 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 : n016.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:12 EDT 2023
% Result : Theorem 78.55s 59.35s
% Output : CNFRefutation 78.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 80
% Syntax : Number of formulae : 106 ( 18 unt; 72 typ; 0 def)
% Number of atoms : 87 ( 11 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 79 ( 26 ~; 19 |; 18 &)
% ( 3 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 129 ( 61 >; 68 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 63 ( 63 usr; 11 con; 0-4 aty)
% Number of variables : 19 (; 19 !; 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 > xk > xi > xc > xT > xS > xQ > xN > xK > szNzAzT0 > sz00 > slcrc0 > #skF_7 > #skF_11 > #skF_17 > #skF_31 > #skF_33 > #skF_6 > #skF_1 > #skF_18 > #skF_37 > #skF_38 > #skF_4 > #skF_29 > #skF_12 > #skF_30 > #skF_32 > #skF_23 > #skF_35 > #skF_5 > #skF_19 > #skF_10 > #skF_8 > #skF_20 > #skF_28 > #skF_26 > #skF_24 > #skF_34 > #skF_15 > #skF_13 > #skF_14 > #skF_25 > #skF_3 > #skF_2 > #skF_27 > #skF_36 > #skF_21 > #skF_9 > #skF_22 > #skF_16
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(xk,type,
xk: $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('#skF_31',type,
'#skF_31': ( $i * $i * $i ) > $i ).
tff('#skF_33',type,
'#skF_33': ( $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(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('#skF_37',type,
'#skF_37': $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_38',type,
'#skF_38': ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i * $i ) > $i ).
tff(xc,type,
xc: $i ).
tff('#skF_29',type,
'#skF_29': ( $i * $i * $i ) > $i ).
tff('#skF_12',type,
'#skF_12': ( $i * $i ) > $i ).
tff(sdtpldt0,type,
sdtpldt0: ( $i * $i ) > $i ).
tff('#skF_30',type,
'#skF_30': ( $i * $i * $i ) > $i ).
tff(slbdtsldtrb0,type,
slbdtsldtrb0: ( $i * $i ) > $i ).
tff('#skF_32',type,
'#skF_32': ( $i * $i * $i * $i ) > $i ).
tff('#skF_23',type,
'#skF_23': ( $i * $i * $i ) > $i ).
tff('#skF_35',type,
'#skF_35': ( $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_28',type,
'#skF_28': ( $i * $i ) > $i ).
tff('#skF_26',type,
'#skF_26': $i > $i ).
tff('#skF_24',type,
'#skF_24': ( $i * $i ) > $i ).
tff('#skF_34',type,
'#skF_34': ( $i * $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(xQ,type,
xQ: $i ).
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_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(iLess0,type,
iLess0: ( $i * $i ) > $o ).
tff('#skF_27',type,
'#skF_27': $i > $i ).
tff(szmzizndt0,type,
szmzizndt0: $i > $i ).
tff('#skF_36',type,
'#skF_36': ( $i * $i * $i * $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_955,hypothesis,
( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ! [W0] :
( aElementOf0(W0,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),W0) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
& ! [W0] :
( aElementOf0(W0,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
<=> ( aElement0(W0)
& aElementOf0(W0,sdtlpdtrp0(xN,xi))
& ( W0 != szmzizndt0(sdtlpdtrp0(xN,xi)) ) ) )
& aSet0(xQ)
& ! [W0] :
( aElementOf0(W0,xQ)
=> aElementOf0(W0,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& aSubsetOf0(xQ,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
& ( sbrdtbr0(xQ) = xk )
& aElementOf0(xQ,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))),xk)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3989_02) ).
tff(f_824,hypothesis,
( aElementOf0(xk,szNzAzT0)
& ( szszuzczcdt0(xk) = xK ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3533) ).
tff(f_324,axiom,
! [W0] :
( aSet0(W0)
=> ( aElementOf0(sbrdtbr0(W0),szNzAzT0)
<=> isFinite0(W0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mCardNum) ).
tff(f_924,hypothesis,
aElementOf0(xi,szNzAzT0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3989) ).
tff(f_886,hypothesis,
! [W0] :
( aElementOf0(W0,szNzAzT0)
=> ( aSet0(sdtlpdtrp0(xN,W0))
& ! [W1] :
( aElementOf0(W1,sdtlpdtrp0(xN,W0))
=> aElementOf0(W1,szNzAzT0) )
& aSubsetOf0(sdtlpdtrp0(xN,W0),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,W0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3671) ).
tff(f_975,negated_conjecture,
~ ( ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ! [W0] :
( aElementOf0(W0,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),W0) ) )
=> ( ( aSet0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
& ! [W0] :
( aElementOf0(W0,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
<=> ( aElement0(W0)
& ( aElementOf0(W0,xQ)
| ( W0 = szmzizndt0(sdtlpdtrp0(xN,xi)) ) ) ) ) )
=> ( sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) = xK ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
tff(f_39,axiom,
! [W0] :
( aSet0(W0)
=> ! [W1] :
( aElementOf0(W1,W0)
=> aElement0(W1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEOfElem) ).
tff(f_342,axiom,
! [W0] :
( ( aSet0(W0)
& isFinite0(W0) )
=> ! [W1] :
( aElement0(W1)
=> ( ~ aElementOf0(W1,W0)
=> ( sbrdtbr0(sdtpldt0(W0,W1)) = szszuzczcdt0(sbrdtbr0(W0)) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mCardCons) ).
tff(c_26371,plain,
! [W0_1235] :
( aElementOf0(W0_1235,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ aElementOf0(W0_1235,xQ) ),
inference(cnfTransformation,[status(thm)],[f_955]) ).
tff(c_8436,plain,
~ aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))),
inference(cnfTransformation,[status(thm)],[f_955]) ).
tff(c_26399,plain,
~ aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),xQ),
inference(resolution,[status(thm)],[c_26371,c_8436]) ).
tff(c_8426,plain,
aSet0(xQ),
inference(cnfTransformation,[status(thm)],[f_955]) ).
tff(c_8320,plain,
aElementOf0(xk,szNzAzT0),
inference(cnfTransformation,[status(thm)],[f_824]) ).
tff(c_8420,plain,
sbrdtbr0(xQ) = xk,
inference(cnfTransformation,[status(thm)],[f_955]) ).
tff(c_8949,plain,
! [W0_640] :
( isFinite0(W0_640)
| ~ aElementOf0(sbrdtbr0(W0_640),szNzAzT0)
| ~ aSet0(W0_640) ),
inference(cnfTransformation,[status(thm)],[f_324]) ).
tff(c_8958,plain,
( isFinite0(xQ)
| ~ aElementOf0(xk,szNzAzT0)
| ~ aSet0(xQ) ),
inference(superposition,[status(thm),theory(equality)],[c_8420,c_8949]) ).
tff(c_8962,plain,
isFinite0(xQ),
inference(demodulation,[status(thm),theory(equality)],[c_8426,c_8320,c_8958]) ).
tff(c_8416,plain,
aElementOf0(xi,szNzAzT0),
inference(cnfTransformation,[status(thm)],[f_924]) ).
tff(c_8400,plain,
! [W0_581] :
( aSet0(sdtlpdtrp0(xN,W0_581))
| ~ aElementOf0(W0_581,szNzAzT0) ),
inference(cnfTransformation,[status(thm)],[f_886]) ).
tff(c_8454,plain,
( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ aElement0(szmzizndt0(sdtlpdtrp0(xN,xi))) ),
inference(cnfTransformation,[status(thm)],[f_975]) ).
tff(c_8688,plain,
~ aElement0(szmzizndt0(sdtlpdtrp0(xN,xi))),
inference(splitLeft,[status(thm)],[c_8454]) ).
tff(c_8448,plain,
aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi)),
inference(cnfTransformation,[status(thm)],[f_975]) ).
tff(c_8635,plain,
! [W1_621,W0_622] :
( aElement0(W1_621)
| ~ aElementOf0(W1_621,W0_622)
| ~ aSet0(W0_622) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_8675,plain,
( aElement0(szmzizndt0(sdtlpdtrp0(xN,xi)))
| ~ aSet0(sdtlpdtrp0(xN,xi)) ),
inference(resolution,[status(thm)],[c_8448,c_8635]) ).
tff(c_8850,plain,
~ aSet0(sdtlpdtrp0(xN,xi)),
inference(negUnitSimplification,[status(thm)],[c_8688,c_8675]) ).
tff(c_8853,plain,
~ aElementOf0(xi,szNzAzT0),
inference(resolution,[status(thm)],[c_8400,c_8850]) ).
tff(c_8857,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_8416,c_8853]) ).
tff(c_8859,plain,
aElement0(szmzizndt0(sdtlpdtrp0(xN,xi))),
inference(splitRight,[status(thm)],[c_8454]) ).
tff(c_8318,plain,
szszuzczcdt0(xk) = xK,
inference(cnfTransformation,[status(thm)],[f_824]) ).
tff(c_38934,plain,
! [W0_1602,W1_1603] :
( ( szszuzczcdt0(sbrdtbr0(W0_1602)) = sbrdtbr0(sdtpldt0(W0_1602,W1_1603)) )
| aElementOf0(W1_1603,W0_1602)
| ~ aElement0(W1_1603)
| ~ isFinite0(W0_1602)
| ~ aSet0(W0_1602) ),
inference(cnfTransformation,[status(thm)],[f_342]) ).
tff(c_8442,plain,
sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) != xK,
inference(cnfTransformation,[status(thm)],[f_975]) ).
tff(c_39075,plain,
( ( szszuzczcdt0(sbrdtbr0(xQ)) != xK )
| aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),xQ)
| ~ aElement0(szmzizndt0(sdtlpdtrp0(xN,xi)))
| ~ isFinite0(xQ)
| ~ aSet0(xQ) ),
inference(superposition,[status(thm),theory(equality)],[c_38934,c_8442]) ).
tff(c_39117,plain,
aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),xQ),
inference(demodulation,[status(thm),theory(equality)],[c_8426,c_8962,c_8859,c_8318,c_8420,c_39075]) ).
tff(c_39119,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_26399,c_39117]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM580+3 : 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.13/0.35 % Computer : n016.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 15:25:52 EDT 2023
% 0.13/0.36 % CPUTime :
% 78.55/59.35 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 78.55/59.35
% 78.55/59.35 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 78.74/59.38
% 78.74/59.38 Inference rules
% 78.74/59.38 ----------------------
% 78.74/59.38 #Ref : 3
% 78.74/59.38 #Sup : 5594
% 78.74/59.38 #Fact : 0
% 78.74/59.38 #Define : 0
% 78.74/59.38 #Split : 231
% 78.74/59.38 #Chain : 0
% 78.74/59.38 #Close : 0
% 78.74/59.38
% 78.74/59.38 Ordering : KBO
% 78.74/59.38
% 78.74/59.38 Simplification rules
% 78.74/59.38 ----------------------
% 78.74/59.38 #Subsume : 2383
% 78.74/59.38 #Demod : 5318
% 78.74/59.38 #Tautology : 1089
% 78.74/59.38 #SimpNegUnit : 318
% 78.74/59.38 #BackRed : 217
% 78.74/59.38
% 78.74/59.38 #Partial instantiations: 0
% 78.74/59.38 #Strategies tried : 1
% 78.74/59.38
% 78.74/59.38 Timing (in seconds)
% 78.74/59.38 ----------------------
% 78.82/59.38 Preprocessing : 2.02
% 78.82/59.38 Parsing : 0.41
% 78.82/59.38 CNF conversion : 0.16
% 78.82/59.38 Main loop : 56.30
% 78.82/59.38 Inferencing : 1.46
% 78.82/59.38 Reduction : 40.69
% 78.82/59.38 Demodulation : 34.75
% 78.82/59.38 BG Simplification : 0.71
% 78.82/59.38 Subsumption : 11.19
% 78.82/59.38 Abstraction : 0.48
% 78.82/59.38 MUC search : 0.00
% 78.82/59.38 Cooper : 0.00
% 78.82/59.38 Total : 58.38
% 78.82/59.38 Index Insertion : 0.00
% 78.82/59.38 Index Deletion : 0.00
% 78.82/59.38 Index Matching : 0.00
% 78.82/59.38 BG Taut test : 0.00
%------------------------------------------------------------------------------