TSTP Solution File: NUM624+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM624+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 : 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:22 EDT 2023
% Result : Theorem 10.81s 3.67s
% Output : CNFRefutation 11.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 84
% Syntax : Number of formulae : 114 ( 21 unt; 73 typ; 2 def)
% Number of atoms : 89 ( 21 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 81 ( 33 ~; 29 |; 11 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 106 ( 54 >; 52 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 64 ( 64 usr; 19 con; 0-4 aty)
% Number of variables : 22 (; 22 !; 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 > xx > xp > xn > xm > xk > xe > xd > xc > xT > xS > xQ > xP > xO > xN > xK > xC > szNzAzT0 > sz00 > slcrc0 > #skF_26 > #skF_7 > #skF_11 > #skF_17 > #skF_6 > #skF_27 > #skF_1 > #skF_31 > #skF_18 > #skF_4 > #skF_29 > #skF_12 > #skF_23 > #skF_28 > #skF_5 > #skF_19 > #skF_10 > #skF_8 > #skF_20 > #skF_24 > #skF_15 > #skF_13 > #skF_14 > #skF_25 > #skF_3 > #skF_2 > #skF_21 > #skF_9 > #skF_22 > #skF_30 > #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(xd,type,
xd: $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_31',type,
'#skF_31': $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(xe,type,
xe: $i ).
tff(xP,type,
xP: $i ).
tff('#skF_29',type,
'#skF_29': $i > $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(xx,type,
xx: $i ).
tff('#skF_23',type,
'#skF_23': ( $i * $i * $i ) > $i ).
tff('#skF_28',type,
'#skF_28': $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(xC,type,
xC: $i ).
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(xO,type,
xO: $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(xp,type,
xp: $i ).
tff(iLess0,type,
iLess0: ( $i * $i ) > $o ).
tff(xm,type,
xm: $i ).
tff(szmzizndt0,type,
szmzizndt0: $i > $i ).
tff(xn,type,
xn: $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_30',type,
'#skF_30': $i > $i ).
tff('#skF_16',type,
'#skF_16': ( $i * $i * $i ) > $i ).
tff(f_899,hypothesis,
( aElementOf0(xp,sdtlpdtrp0(xN,xm))
& aElementOf0(xx,xQ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5481) ).
tff(f_908,hypothesis,
( aSubsetOf0(xQ,szNzAzT0)
& aSubsetOf0(sdtlpdtrp0(xN,xm),szNzAzT0)
& ( xQ != slcrc0 )
& ( sdtlpdtrp0(xN,xm) != slcrc0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5518) ).
tff(f_870,hypothesis,
xp = szmzizndt0(xQ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5147) ).
tff(f_388,definition,
! [W0] :
( ( aSubsetOf0(W0,szNzAzT0)
& ( W0 != slcrc0 ) )
=> ! [W1] :
( ( W1 = szmzizndt0(W0) )
<=> ( aElementOf0(W1,W0)
& ! [W2] :
( aElementOf0(W2,W0)
=> sdtlseqdt0(W1,W2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefMin) ).
tff(f_910,negated_conjecture,
xp != xx,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
tff(f_211,axiom,
( aSet0(szNzAzT0)
& isCountable0(szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mNATSet) ).
tff(f_874,hypothesis,
aElementOf0(xp,xQ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5173) ).
tff(f_84,definition,
! [W0] :
( aSet0(W0)
=> ! [W1] :
( aSubsetOf0(W1,W0)
<=> ( aSet0(W1)
& ! [W2] :
( aElementOf0(W2,W1)
=> aElementOf0(W2,W0) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSub) ).
tff(f_889,hypothesis,
( aElementOf0(xx,szNzAzT0)
& aElementOf0(xx,xO) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5365) ).
tff(f_893,hypothesis,
xx = szmzizndt0(sdtlpdtrp0(xN,xm)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5401) ).
tff(f_283,axiom,
! [W0,W1] :
( ( aElementOf0(W0,szNzAzT0)
& aElementOf0(W1,szNzAzT0) )
=> ( ( sdtlseqdt0(W0,W1)
& sdtlseqdt0(W1,W0) )
=> ( W0 = W1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mLessASymm) ).
tff(c_496,plain,
aElementOf0(xx,xQ),
inference(cnfTransformation,[status(thm)],[f_899]) ).
tff(c_502,plain,
xQ != slcrc0,
inference(cnfTransformation,[status(thm)],[f_908]) ).
tff(c_506,plain,
aSubsetOf0(xQ,szNzAzT0),
inference(cnfTransformation,[status(thm)],[f_908]) ).
tff(c_454,plain,
szmzizndt0(xQ) = xp,
inference(cnfTransformation,[status(thm)],[f_870]) ).
tff(c_3693,plain,
! [W0_631,W2_632] :
( sdtlseqdt0(szmzizndt0(W0_631),W2_632)
| ~ aElementOf0(W2_632,W0_631)
| ( slcrc0 = W0_631 )
| ~ aSubsetOf0(W0_631,szNzAzT0) ),
inference(cnfTransformation,[status(thm)],[f_388]) ).
tff(c_3702,plain,
! [W2_632] :
( sdtlseqdt0(xp,W2_632)
| ~ aElementOf0(W2_632,xQ)
| ( xQ = slcrc0 )
| ~ aSubsetOf0(xQ,szNzAzT0) ),
inference(superposition,[status(thm),theory(equality)],[c_454,c_3693]) ).
tff(c_3707,plain,
! [W2_632] :
( sdtlseqdt0(xp,W2_632)
| ~ aElementOf0(W2_632,xQ)
| ( xQ = slcrc0 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_506,c_3702]) ).
tff(c_3708,plain,
! [W2_632] :
( sdtlseqdt0(xp,W2_632)
| ~ aElementOf0(W2_632,xQ) ),
inference(negUnitSimplification,[status(thm)],[c_502,c_3707]) ).
tff(c_508,plain,
xx != xp,
inference(cnfTransformation,[status(thm)],[f_910]) ).
tff(c_108,plain,
aSet0(szNzAzT0),
inference(cnfTransformation,[status(thm)],[f_211]) ).
tff(c_460,plain,
aElementOf0(xp,xQ),
inference(cnfTransformation,[status(thm)],[f_874]) ).
tff(c_3059,plain,
! [W2_604,W0_605,W1_606] :
( aElementOf0(W2_604,W0_605)
| ~ aElementOf0(W2_604,W1_606)
| ~ aSubsetOf0(W1_606,W0_605)
| ~ aSet0(W0_605) ),
inference(cnfTransformation,[status(thm)],[f_84]) ).
tff(c_3303,plain,
! [W0_614] :
( aElementOf0(xp,W0_614)
| ~ aSubsetOf0(xQ,W0_614)
| ~ aSet0(W0_614) ),
inference(resolution,[status(thm)],[c_460,c_3059]) ).
tff(c_3314,plain,
( aElementOf0(xp,szNzAzT0)
| ~ aSet0(szNzAzT0) ),
inference(resolution,[status(thm)],[c_506,c_3303]) ).
tff(c_3326,plain,
aElementOf0(xp,szNzAzT0),
inference(demodulation,[status(thm),theory(equality)],[c_108,c_3314]) ).
tff(c_484,plain,
aElementOf0(xx,szNzAzT0),
inference(cnfTransformation,[status(thm)],[f_889]) ).
tff(c_498,plain,
aElementOf0(xp,sdtlpdtrp0(xN,xm)),
inference(cnfTransformation,[status(thm)],[f_899]) ).
tff(c_500,plain,
sdtlpdtrp0(xN,xm) != slcrc0,
inference(cnfTransformation,[status(thm)],[f_908]) ).
tff(c_504,plain,
aSubsetOf0(sdtlpdtrp0(xN,xm),szNzAzT0),
inference(cnfTransformation,[status(thm)],[f_908]) ).
tff(c_490,plain,
szmzizndt0(sdtlpdtrp0(xN,xm)) = xx,
inference(cnfTransformation,[status(thm)],[f_893]) ).
tff(c_3699,plain,
! [W2_632] :
( sdtlseqdt0(xx,W2_632)
| ~ aElementOf0(W2_632,sdtlpdtrp0(xN,xm))
| ( sdtlpdtrp0(xN,xm) = slcrc0 )
| ~ aSubsetOf0(sdtlpdtrp0(xN,xm),szNzAzT0) ),
inference(superposition,[status(thm),theory(equality)],[c_490,c_3693]) ).
tff(c_3704,plain,
! [W2_632] :
( sdtlseqdt0(xx,W2_632)
| ~ aElementOf0(W2_632,sdtlpdtrp0(xN,xm))
| ( sdtlpdtrp0(xN,xm) = slcrc0 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_504,c_3699]) ).
tff(c_4979,plain,
! [W2_683] :
( sdtlseqdt0(xx,W2_683)
| ~ aElementOf0(W2_683,sdtlpdtrp0(xN,xm)) ),
inference(negUnitSimplification,[status(thm)],[c_500,c_3704]) ).
tff(c_5018,plain,
sdtlseqdt0(xx,xp),
inference(resolution,[status(thm)],[c_498,c_4979]) ).
tff(c_138,plain,
! [W1_87,W0_86] :
( ( W1_87 = W0_86 )
| ~ sdtlseqdt0(W1_87,W0_86)
| ~ sdtlseqdt0(W0_86,W1_87)
| ~ aElementOf0(W1_87,szNzAzT0)
| ~ aElementOf0(W0_86,szNzAzT0) ),
inference(cnfTransformation,[status(thm)],[f_283]) ).
tff(c_5056,plain,
( ( xx = xp )
| ~ sdtlseqdt0(xp,xx)
| ~ aElementOf0(xx,szNzAzT0)
| ~ aElementOf0(xp,szNzAzT0) ),
inference(resolution,[status(thm)],[c_5018,c_138]) ).
tff(c_5059,plain,
( ( xx = xp )
| ~ sdtlseqdt0(xp,xx) ),
inference(demodulation,[status(thm),theory(equality)],[c_3326,c_484,c_5056]) ).
tff(c_5060,plain,
~ sdtlseqdt0(xp,xx),
inference(negUnitSimplification,[status(thm)],[c_508,c_5059]) ).
tff(c_5063,plain,
~ aElementOf0(xx,xQ),
inference(resolution,[status(thm)],[c_3708,c_5060]) ).
tff(c_5067,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_496,c_5063]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM624+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.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:32:53 EDT 2023
% 0.13/0.35 % CPUTime :
% 10.81/3.67 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.81/3.68
% 10.81/3.68 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 11.51/3.71
% 11.51/3.71 Inference rules
% 11.51/3.71 ----------------------
% 11.51/3.71 #Ref : 1
% 11.51/3.71 #Sup : 876
% 11.51/3.71 #Fact : 0
% 11.51/3.71 #Define : 0
% 11.51/3.71 #Split : 51
% 11.51/3.71 #Chain : 0
% 11.51/3.71 #Close : 0
% 11.51/3.71
% 11.51/3.71 Ordering : KBO
% 11.51/3.71
% 11.51/3.71 Simplification rules
% 11.51/3.71 ----------------------
% 11.51/3.71 #Subsume : 140
% 11.51/3.71 #Demod : 848
% 11.51/3.71 #Tautology : 283
% 11.51/3.71 #SimpNegUnit : 63
% 11.51/3.71 #BackRed : 136
% 11.51/3.71
% 11.51/3.71 #Partial instantiations: 0
% 11.51/3.71 #Strategies tried : 1
% 11.51/3.71
% 11.51/3.71 Timing (in seconds)
% 11.51/3.71 ----------------------
% 11.51/3.71 Preprocessing : 0.91
% 11.51/3.71 Parsing : 0.45
% 11.51/3.71 CNF conversion : 0.09
% 11.51/3.71 Main loop : 1.73
% 11.51/3.71 Inferencing : 0.55
% 11.51/3.71 Reduction : 0.62
% 11.51/3.71 Demodulation : 0.42
% 11.51/3.71 BG Simplification : 0.08
% 11.51/3.71 Subsumption : 0.33
% 11.51/3.71 Abstraction : 0.04
% 11.51/3.71 MUC search : 0.00
% 11.51/3.71 Cooper : 0.00
% 11.51/3.71 Total : 2.69
% 11.51/3.71 Index Insertion : 0.00
% 11.51/3.71 Index Deletion : 0.00
% 11.51/3.71 Index Matching : 0.00
% 11.51/3.71 BG Taut test : 0.00
%------------------------------------------------------------------------------