TSTP Solution File: NUM592+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM592+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/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 : n012.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:15 EDT 2023
% Result : Theorem 151.00s 122.59s
% Output : CNFRefutation 151.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 90
% Syntax : Number of formulae : 110 ( 7 unt; 87 typ; 0 def)
% Number of atoms : 101 ( 19 equ)
% Maximal formula atoms : 21 ( 4 avg)
% Number of connectives : 123 ( 45 ~; 40 |; 26 &)
% ( 2 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 149 ( 72 >; 77 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 78 ( 78 usr; 15 con; 0-4 aty)
% Number of variables : 32 (; 30 !; 2 ?; 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 > xu > xk > xi > xd > xc > xY > xX > xT > xS > xN > xK > xC > szNzAzT0 > sz00 > slcrc0 > #skF_7 > #skF_11 > #skF_41 > #skF_17 > #skF_31 > #skF_33 > #skF_44 > #skF_6 > #skF_1 > #skF_18 > #skF_48 > #skF_37 > #skF_38 > #skF_4 > #skF_29 > #skF_12 > #skF_30 > #skF_32 > #skF_23 > #skF_35 > #skF_5 > #skF_49 > #skF_19 > #skF_10 > #skF_42 > #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_40 > #skF_27 > #skF_36 > #skF_43 > #skF_46 > #skF_21 > #skF_45 > #skF_9 > #skF_22 > #skF_16 > #skF_47 > #skF_39
%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('#skF_41',type,
'#skF_41': ( $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('#skF_44',type,
'#skF_44': ( $i * $i * $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(xd,type,
xd: $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('#skF_48',type,
'#skF_48': ( $i * $i ) > $i ).
tff(aElement0,type,
aElement0: $i > $o ).
tff(sdtexdt0,type,
sdtexdt0: ( $i * $i ) > $i ).
tff(xX,type,
xX: $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(xu,type,
xu: $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(xY,type,
xY: $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_49',type,
'#skF_49': ( $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_42',type,
'#skF_42': ( $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(xC,type,
xC: $i ).
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('#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('#skF_40',type,
'#skF_40': ( $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('#skF_43',type,
'#skF_43': ( $i * $i ) > $i ).
tff('#skF_46',type,
'#skF_46': $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_45',type,
'#skF_45': $i > $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('#skF_47',type,
'#skF_47': $i > $i ).
tff('#skF_39',type,
'#skF_39': ( $i * $i ) > $i ).
tff(f_1290,hypothesis,
( aElementOf0(xu,xT)
& aSet0(xX)
& ! [W0] :
( aElementOf0(W0,xX)
=> aElementOf0(W0,xY) )
& aSubsetOf0(xX,xY)
& isCountable0(xX)
& ! [W0] :
( ( aSet0(W0)
& ( ( ( ! [W1] :
( aElementOf0(W1,W0)
=> aElementOf0(W1,xX) )
| aSubsetOf0(W0,xX) )
& ( sbrdtbr0(W0) = xk ) )
| aElementOf0(W0,slbdtsldtrb0(xX,xk)) ) )
=> ( sdtlpdtrp0(xd,W0) = xu ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4545) ).
tff(f_1212,hypothesis,
( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ! [W0] :
( aElementOf0(W0,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),W0) )
& aSet0(xY)
& ! [W0] :
( aElementOf0(W0,xY)
<=> ( aElement0(W0)
& aElementOf0(W0,sdtlpdtrp0(xN,xi))
& ( W0 != szmzizndt0(sdtlpdtrp0(xN,xi)) ) ) )
& ( xY = sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))) )
& ( xd = sdtlpdtrp0(xC,xi) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4448_02) ).
tff(f_1340,negated_conjecture,
~ ? [W0] :
( aElementOf0(W0,xT)
& ? [W1] :
( ( ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ! [W2] :
( aElementOf0(W2,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),W2) ) )
=> ( ( aSet0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
& ! [W2] :
( aElementOf0(W2,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
<=> ( aElement0(W2)
& aElementOf0(W2,sdtlpdtrp0(xN,xi))
& ( W2 != szmzizndt0(sdtlpdtrp0(xN,xi)) ) ) ) )
=> ( ( aSet0(W1)
& ! [W2] :
( aElementOf0(W2,W1)
=> aElementOf0(W2,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) ) )
| aSubsetOf0(W1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) ) ) )
& isCountable0(W1)
& ! [W2] :
( ( aSet0(W2)
& ! [W3] :
( aElementOf0(W3,W2)
=> aElementOf0(W3,W1) )
& aSubsetOf0(W2,W1)
& ( sbrdtbr0(W2) = xk )
& aElementOf0(W2,slbdtsldtrb0(W1,xk)) )
=> ( sdtlpdtrp0(sdtlpdtrp0(xC,xi),W2) = W0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
tff(c_9712,plain,
isCountable0(xX),
inference(cnfTransformation,[status(thm)],[f_1290]) ).
tff(c_9714,plain,
aSubsetOf0(xX,xY),
inference(cnfTransformation,[status(thm)],[f_1290]) ).
tff(c_9666,plain,
sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))) = xY,
inference(cnfTransformation,[status(thm)],[f_1212]) ).
tff(c_9830,plain,
! [W1_744,W0_730] :
( ~ aSubsetOf0(W1_744,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| aSet0('#skF_49'(W0_730,W1_744))
| ~ isCountable0(W1_744)
| ~ aElementOf0(W0_730,xT) ),
inference(cnfTransformation,[status(thm)],[f_1340]) ).
tff(c_9891,plain,
! [W1_744,W0_730] :
( ~ aSubsetOf0(W1_744,xY)
| aSet0('#skF_49'(W0_730,W1_744))
| ~ isCountable0(W1_744)
| ~ aElementOf0(W0_730,xT) ),
inference(demodulation,[status(thm),theory(equality)],[c_9666,c_9830]) ).
tff(c_9750,plain,
! [W1_744,W0_730] :
( ~ aSubsetOf0(W1_744,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| aElementOf0('#skF_49'(W0_730,W1_744),slbdtsldtrb0(W1_744,xk))
| ~ isCountable0(W1_744)
| ~ aElementOf0(W0_730,xT) ),
inference(cnfTransformation,[status(thm)],[f_1340]) ).
tff(c_9856,plain,
! [W1_744,W0_730] :
( ~ aSubsetOf0(W1_744,xY)
| aElementOf0('#skF_49'(W0_730,W1_744),slbdtsldtrb0(W1_744,xk))
| ~ isCountable0(W1_744)
| ~ aElementOf0(W0_730,xT) ),
inference(demodulation,[status(thm),theory(equality)],[c_9666,c_9750]) ).
tff(c_172314,plain,
! [W0_3933] :
( ~ aElementOf0(W0_3933,slbdtsldtrb0(xX,xk))
| ( sdtlpdtrp0(xd,W0_3933) = xu )
| ~ aSet0(W0_3933) ),
inference(cnfTransformation,[status(thm)],[f_1290]) ).
tff(c_172338,plain,
! [W0_730] :
( ( sdtlpdtrp0(xd,'#skF_49'(W0_730,xX)) = xu )
| ~ aSet0('#skF_49'(W0_730,xX))
| ~ aSubsetOf0(xX,xY)
| ~ isCountable0(xX)
| ~ aElementOf0(W0_730,xT) ),
inference(resolution,[status(thm)],[c_9856,c_172314]) ).
tff(c_273950,plain,
! [W0_5145] :
( ( sdtlpdtrp0(xd,'#skF_49'(W0_5145,xX)) = xu )
| ~ aSet0('#skF_49'(W0_5145,xX))
| ~ aElementOf0(W0_5145,xT) ),
inference(demodulation,[status(thm),theory(equality)],[c_9712,c_9714,c_172338]) ).
tff(c_273964,plain,
! [W0_730] :
( ( sdtlpdtrp0(xd,'#skF_49'(W0_730,xX)) = xu )
| ~ aSubsetOf0(xX,xY)
| ~ isCountable0(xX)
| ~ aElementOf0(W0_730,xT) ),
inference(resolution,[status(thm)],[c_9891,c_273950]) ).
tff(c_273973,plain,
! [W0_5146] :
( ( sdtlpdtrp0(xd,'#skF_49'(W0_5146,xX)) = xu )
| ~ aElementOf0(W0_5146,xT) ),
inference(demodulation,[status(thm),theory(equality)],[c_9712,c_9714,c_273964]) ).
tff(c_9664,plain,
sdtlpdtrp0(xC,xi) = xd,
inference(cnfTransformation,[status(thm)],[f_1212]) ).
tff(c_9730,plain,
! [W1_744,W0_730] :
( ~ aSubsetOf0(W1_744,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ( sdtlpdtrp0(sdtlpdtrp0(xC,xi),'#skF_49'(W0_730,W1_744)) != W0_730 )
| ~ isCountable0(W1_744)
| ~ aElementOf0(W0_730,xT) ),
inference(cnfTransformation,[status(thm)],[f_1340]) ).
tff(c_9874,plain,
! [W1_744,W0_730] :
( ~ aSubsetOf0(W1_744,xY)
| ( sdtlpdtrp0(sdtlpdtrp0(xC,xi),'#skF_49'(W0_730,W1_744)) != W0_730 )
| ~ isCountable0(W1_744)
| ~ aElementOf0(W0_730,xT) ),
inference(demodulation,[status(thm),theory(equality)],[c_9666,c_9730]) ).
tff(c_9903,plain,
! [W1_744,W0_730] :
( ~ aSubsetOf0(W1_744,xY)
| ( sdtlpdtrp0(xd,'#skF_49'(W0_730,W1_744)) != W0_730 )
| ~ isCountable0(W1_744)
| ~ aElementOf0(W0_730,xT) ),
inference(demodulation,[status(thm),theory(equality)],[c_9664,c_9874]) ).
tff(c_274012,plain,
! [W0_5146] :
( ~ aSubsetOf0(xX,xY)
| ( xu != W0_5146 )
| ~ isCountable0(xX)
| ~ aElementOf0(W0_5146,xT)
| ~ aElementOf0(W0_5146,xT) ),
inference(superposition,[status(thm),theory(equality)],[c_273973,c_9903]) ).
tff(c_274053,plain,
~ aElementOf0(xu,xT),
inference(demodulation,[status(thm),theory(equality)],[c_9712,c_9714,c_274012]) ).
tff(c_9720,plain,
aElementOf0(xu,xT),
inference(cnfTransformation,[status(thm)],[f_1290]) ).
tff(c_274055,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_274053,c_9720]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM592+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/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.15/0.36 % Computer : n012.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 14:29:22 EDT 2023
% 0.15/0.36 % CPUTime :
% 151.00/122.59 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 151.00/122.60
% 151.00/122.60 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 151.08/122.62
% 151.08/122.62 Inference rules
% 151.08/122.62 ----------------------
% 151.08/122.62 #Ref : 14
% 151.08/122.62 #Sup : 47165
% 151.08/122.62 #Fact : 2
% 151.08/122.62 #Define : 0
% 151.08/122.62 #Split : 766
% 151.08/122.62 #Chain : 0
% 151.08/122.62 #Close : 0
% 151.08/122.62
% 151.08/122.62 Ordering : KBO
% 151.08/122.62
% 151.08/122.62 Simplification rules
% 151.08/122.62 ----------------------
% 151.08/122.63 #Subsume : 14441
% 151.08/122.63 #Demod : 49275
% 151.08/122.63 #Tautology : 4846
% 151.08/122.63 #SimpNegUnit : 2661
% 151.08/122.63 #BackRed : 941
% 151.08/122.63
% 151.08/122.63 #Partial instantiations: 0
% 151.08/122.63 #Strategies tried : 1
% 151.08/122.63
% 151.08/122.63 Timing (in seconds)
% 151.08/122.63 ----------------------
% 151.08/122.63 Preprocessing : 2.34
% 151.08/122.63 Parsing : 0.55
% 151.08/122.63 CNF conversion : 0.18
% 151.08/122.63 Main loop : 119.20
% 151.08/122.63 Inferencing : 10.13
% 151.08/122.63 Reduction : 75.24
% 151.08/122.63 Demodulation : 63.31
% 151.08/122.63 BG Simplification : 1.11
% 151.08/122.63 Subsumption : 25.95
% 151.08/122.63 Abstraction : 1.15
% 151.08/122.63 MUC search : 0.00
% 151.08/122.63 Cooper : 0.00
% 151.08/122.63 Total : 121.60
% 151.08/122.63 Index Insertion : 0.00
% 151.08/122.63 Index Deletion : 0.00
% 151.08/122.63 Index Matching : 0.00
% 151.08/122.63 BG Taut test : 0.00
%------------------------------------------------------------------------------