TSTP Solution File: NUM612+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM612+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 : 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:20 EDT 2023
% Result : Theorem 85.81s 66.62s
% Output : CNFRefutation 85.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 104
% Syntax : Number of formulae : 134 ( 20 unt; 94 typ; 0 def)
% Number of atoms : 90 ( 16 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 82 ( 32 ~; 24 |; 15 &)
% ( 2 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 154 ( 76 >; 78 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 85 ( 85 usr; 18 con; 0-4 aty)
% Number of variables : 17 (; 17 !; 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 > xp > xk > xe > xd > xc > xT > xS > xQ > xP > xO > xN > xK > xC > szNzAzT0 > sz00 > slcrc0 > #skF_53 > #skF_47 > #skF_7 > #skF_11 > #skF_41 > #skF_17 > #skF_31 > #skF_33 > #skF_44 > #skF_6 > #skF_1 > #skF_18 > #skF_55 > #skF_37 > #skF_54 > #skF_38 > #skF_4 > #skF_29 > #skF_52 > #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_50 > #skF_25 > #skF_3 > #skF_2 > #skF_48 > #skF_40 > #skF_27 > #skF_36 > #skF_43 > #skF_46 > #skF_21 > #skF_45 > #skF_9 > #skF_22 > #skF_16 > #skF_51 > #skF_39
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_53',type,
'#skF_53': $i > $i ).
tff(xk,type,
xk: $i ).
tff('#skF_47',type,
'#skF_47': ( $i * $i ) > $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_55',type,
'#skF_55': $i ).
tff(aElement0,type,
aElement0: $i > $o ).
tff(sdtexdt0,type,
sdtexdt0: ( $i * $i ) > $i ).
tff('#skF_37',type,
'#skF_37': $i > $i ).
tff(szNzAzT0,type,
szNzAzT0: $i ).
tff(sdtlseqdt0,type,
sdtlseqdt0: ( $i * $i ) > $o ).
tff('#skF_54',type,
'#skF_54': $i ).
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(xe,type,
xe: $i ).
tff('#skF_29',type,
'#skF_29': ( $i * $i * $i ) > $i ).
tff('#skF_52',type,
'#skF_52': $i > $i ).
tff(xP,type,
xP: $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_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(xO,type,
xO: $i ).
tff('#skF_14',type,
'#skF_14': ( $i * $i * $i ) > $i ).
tff(slcrc0,type,
slcrc0: $i ).
tff('#skF_50',type,
'#skF_50': ( $i * $i ) > $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(xp,type,
xp: $i ).
tff('#skF_48',type,
'#skF_48': $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_51',type,
'#skF_51': $i > $i ).
tff('#skF_39',type,
'#skF_39': ( $i * $i ) > $i ).
tff(f_1439,hypothesis,
( aSet0(xP)
& ! [W0] :
( aElementOf0(W0,xQ)
=> sdtlseqdt0(szmzizndt0(xQ),W0) )
& ! [W0] :
( aElementOf0(W0,xP)
<=> ( aElement0(W0)
& aElementOf0(W0,xQ)
& ( W0 != szmzizndt0(xQ) ) ) )
& ( xP = sdtmndt0(xQ,szmzizndt0(xQ)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5164) ).
tff(f_324,axiom,
! [W0] :
( aSet0(W0)
=> ( aElementOf0(sbrdtbr0(W0),szNzAzT0)
<=> isFinite0(W0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mCardNum) ).
tff(f_1381,hypothesis,
( aSet0(xQ)
& ! [W0] :
( aElementOf0(W0,xQ)
=> aElementOf0(W0,xO) )
& aSubsetOf0(xQ,xO)
& ( sbrdtbr0(xQ) = xK )
& aElementOf0(xQ,slbdtsldtrb0(xO,xK)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5078) ).
tff(f_1460,negated_conjecture,
~ ( ( szszuzczcdt0(sbrdtbr0(xP)) = sbrdtbr0(xQ) )
& aElementOf0(sbrdtbr0(xP),szNzAzT0) ),
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_1440,hypothesis,
aElementOf0(xp,xQ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5173) ).
tff(f_1421,hypothesis,
( aElementOf0(xp,xQ)
& ! [W0] :
( aElementOf0(W0,xQ)
=> sdtlseqdt0(xp,W0) )
& ( xp = szmzizndt0(xQ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5147) ).
tff(f_351,axiom,
! [W0] :
( aSet0(W0)
=> ! [W1] :
( ( isFinite0(W0)
& aElementOf0(W1,W0) )
=> ( szszuzczcdt0(sbrdtbr0(sdtmndt0(W0,W1))) = sbrdtbr0(W0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mCardDiff) ).
tff(f_1450,hypothesis,
( ! [W0] :
( aElementOf0(W0,xP)
=> aElementOf0(W0,xQ) )
& aSubsetOf0(xP,xQ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5195) ).
tff(f_93,axiom,
! [W0] :
( ( aSet0(W0)
& isFinite0(W0) )
=> ! [W1] :
( aSubsetOf0(W1,W0)
=> isFinite0(W1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSubFSet) ).
tff(c_9830,plain,
aSet0(xP),
inference(cnfTransformation,[status(thm)],[f_1439]) ).
tff(c_22347,plain,
! [W0_1307] :
( aElementOf0(sbrdtbr0(W0_1307),szNzAzT0)
| ~ isFinite0(W0_1307)
| ~ aSet0(W0_1307) ),
inference(cnfTransformation,[status(thm)],[f_324]) ).
tff(c_9790,plain,
sbrdtbr0(xQ) = xK,
inference(cnfTransformation,[status(thm)],[f_1381]) ).
tff(c_9852,plain,
( ~ aElementOf0(sbrdtbr0(xP),szNzAzT0)
| ( szszuzczcdt0(sbrdtbr0(xP)) != sbrdtbr0(xQ) ) ),
inference(cnfTransformation,[status(thm)],[f_1460]) ).
tff(c_9859,plain,
( ~ aElementOf0(sbrdtbr0(xP),szNzAzT0)
| ( szszuzczcdt0(sbrdtbr0(xP)) != xK ) ),
inference(demodulation,[status(thm),theory(equality)],[c_9790,c_9852]) ).
tff(c_9878,plain,
szszuzczcdt0(sbrdtbr0(xP)) != xK,
inference(splitLeft,[status(thm)],[c_9859]) ).
tff(c_9796,plain,
aSet0(xQ),
inference(cnfTransformation,[status(thm)],[f_1381]) ).
tff(c_336,plain,
aElementOf0(xK,szNzAzT0),
inference(cnfTransformation,[status(thm)],[f_664]) ).
tff(c_10673,plain,
! [W0_867] :
( isFinite0(W0_867)
| ~ aElementOf0(sbrdtbr0(W0_867),szNzAzT0)
| ~ aSet0(W0_867) ),
inference(cnfTransformation,[status(thm)],[f_324]) ).
tff(c_10679,plain,
( isFinite0(xQ)
| ~ aElementOf0(xK,szNzAzT0)
| ~ aSet0(xQ) ),
inference(superposition,[status(thm),theory(equality)],[c_9790,c_10673]) ).
tff(c_10684,plain,
isFinite0(xQ),
inference(demodulation,[status(thm),theory(equality)],[c_9796,c_336,c_10679]) ).
tff(c_9838,plain,
aElementOf0(xp,xQ),
inference(cnfTransformation,[status(thm)],[f_1440]) ).
tff(c_9818,plain,
szmzizndt0(xQ) = xp,
inference(cnfTransformation,[status(thm)],[f_1421]) ).
tff(c_9824,plain,
sdtmndt0(xQ,szmzizndt0(xQ)) = xP,
inference(cnfTransformation,[status(thm)],[f_1439]) ).
tff(c_9854,plain,
sdtmndt0(xQ,xp) = xP,
inference(demodulation,[status(thm),theory(equality)],[c_9818,c_9824]) ).
tff(c_21314,plain,
! [W0_1240,W1_1241] :
( ( szszuzczcdt0(sbrdtbr0(sdtmndt0(W0_1240,W1_1241))) = sbrdtbr0(W0_1240) )
| ~ aElementOf0(W1_1241,W0_1240)
| ~ isFinite0(W0_1240)
| ~ aSet0(W0_1240) ),
inference(cnfTransformation,[status(thm)],[f_351]) ).
tff(c_21381,plain,
( ( szszuzczcdt0(sbrdtbr0(xP)) = sbrdtbr0(xQ) )
| ~ aElementOf0(xp,xQ)
| ~ isFinite0(xQ)
| ~ aSet0(xQ) ),
inference(superposition,[status(thm),theory(equality)],[c_9854,c_21314]) ).
tff(c_21385,plain,
szszuzczcdt0(sbrdtbr0(xP)) = xK,
inference(demodulation,[status(thm),theory(equality)],[c_9796,c_10684,c_9838,c_9790,c_21381]) ).
tff(c_21387,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_9878,c_21385]) ).
tff(c_21388,plain,
~ aElementOf0(sbrdtbr0(xP),szNzAzT0),
inference(splitRight,[status(thm)],[c_9859]) ).
tff(c_22359,plain,
( ~ isFinite0(xP)
| ~ aSet0(xP) ),
inference(resolution,[status(thm)],[c_22347,c_21388]) ).
tff(c_22376,plain,
~ isFinite0(xP),
inference(demodulation,[status(thm),theory(equality)],[c_9830,c_22359]) ).
tff(c_22439,plain,
! [W0_1311] :
( isFinite0(W0_1311)
| ~ aElementOf0(sbrdtbr0(W0_1311),szNzAzT0)
| ~ aSet0(W0_1311) ),
inference(cnfTransformation,[status(thm)],[f_324]) ).
tff(c_22448,plain,
( isFinite0(xQ)
| ~ aElementOf0(xK,szNzAzT0)
| ~ aSet0(xQ) ),
inference(superposition,[status(thm),theory(equality)],[c_9790,c_22439]) ).
tff(c_22454,plain,
isFinite0(xQ),
inference(demodulation,[status(thm),theory(equality)],[c_9796,c_336,c_22448]) ).
tff(c_9844,plain,
aSubsetOf0(xP,xQ),
inference(cnfTransformation,[status(thm)],[f_1450]) ).
tff(c_22770,plain,
! [W1_1326,W0_1327] :
( isFinite0(W1_1326)
| ~ aSubsetOf0(W1_1326,W0_1327)
| ~ isFinite0(W0_1327)
| ~ aSet0(W0_1327) ),
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_22800,plain,
( isFinite0(xP)
| ~ isFinite0(xQ)
| ~ aSet0(xQ) ),
inference(resolution,[status(thm)],[c_9844,c_22770]) ).
tff(c_22834,plain,
isFinite0(xP),
inference(demodulation,[status(thm),theory(equality)],[c_9796,c_22454,c_22800]) ).
tff(c_22836,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_22376,c_22834]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM612+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.14/0.36 % Computer : n016.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:10:22 EDT 2023
% 0.14/0.36 % CPUTime :
% 85.81/66.62 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 85.81/66.63
% 85.81/66.63 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 85.81/66.66
% 85.81/66.66 Inference rules
% 85.81/66.66 ----------------------
% 85.81/66.66 #Ref : 2
% 85.81/66.66 #Sup : 2495
% 85.81/66.66 #Fact : 0
% 85.81/66.66 #Define : 0
% 85.81/66.66 #Split : 131
% 85.81/66.66 #Chain : 0
% 85.81/66.66 #Close : 0
% 85.81/66.66
% 85.81/66.66 Ordering : KBO
% 85.81/66.66
% 85.81/66.66 Simplification rules
% 85.81/66.66 ----------------------
% 85.81/66.66 #Subsume : 1520
% 85.81/66.66 #Demod : 2158
% 85.81/66.66 #Tautology : 712
% 85.81/66.66 #SimpNegUnit : 156
% 85.81/66.66 #BackRed : 245
% 85.81/66.66
% 85.81/66.66 #Partial instantiations: 0
% 85.81/66.66 #Strategies tried : 1
% 85.81/66.66
% 85.81/66.66 Timing (in seconds)
% 85.81/66.66 ----------------------
% 85.81/66.67 Preprocessing : 2.26
% 85.81/66.67 Parsing : 0.55
% 85.81/66.67 CNF conversion : 0.17
% 85.81/66.67 Main loop : 63.33
% 85.81/66.67 Inferencing : 0.98
% 85.81/66.67 Reduction : 47.36
% 85.81/66.67 Demodulation : 40.68
% 85.81/66.67 BG Simplification : 0.75
% 85.81/66.67 Subsumption : 11.99
% 85.81/66.67 Abstraction : 0.47
% 85.81/66.67 MUC search : 0.00
% 85.81/66.67 Cooper : 0.00
% 85.81/66.67 Total : 65.66
% 85.81/66.67 Index Insertion : 0.00
% 85.81/66.67 Index Deletion : 0.00
% 85.81/66.67 Index Matching : 0.00
% 85.81/66.67 BG Taut test : 0.00
%------------------------------------------------------------------------------