TSTP Solution File: NUM607+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM607+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 : n014.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:18 EDT 2023
% Result : Theorem 15.54s 5.10s
% Output : CNFRefutation 15.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 81
% Syntax : Number of formulae : 110 ( 20 unt; 68 typ; 2 def)
% Number of atoms : 95 ( 8 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 90 ( 37 ~; 32 |; 13 &)
% ( 3 <=>; 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 : 106 ( 54 >; 52 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 59 ( 59 usr; 14 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 > xk > xe > xd > xc > xT > xS > xQ > 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('#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('#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(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_30',type,
'#skF_30': $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_868,hypothesis,
aSubsetOf0(xQ,szNzAzT0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5106) ).
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_867,hypothesis,
( aSubsetOf0(xQ,xO)
& ( xQ != slcrc0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5093) ).
tff(f_852,hypothesis,
( aSet0(xO)
& isCountable0(xO) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4908) ).
tff(f_667,hypothesis,
( aSubsetOf0(xS,szNzAzT0)
& isCountable0(xS) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3435) ).
tff(f_862,hypothesis,
aSubsetOf0(xO,xS),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4998) ).
tff(f_119,axiom,
! [W0,W1,W2] :
( ( aSet0(W0)
& aSet0(W1)
& aSet0(W2) )
=> ( ( aSubsetOf0(W0,W1)
& aSubsetOf0(W1,W2) )
=> aSubsetOf0(W0,W2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSubTrans) ).
tff(f_870,negated_conjecture,
~ aElementOf0(xQ,szDzozmdt0(xc)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
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_664,hypothesis,
aElementOf0(xK,szNzAzT0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3418) ).
tff(f_863,hypothesis,
aElementOf0(xQ,slbdtsldtrb0(xO,xK)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5078) ).
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(c_108,plain,
aSet0(szNzAzT0),
inference(cnfTransformation,[status(thm)],[f_211]) ).
tff(c_450,plain,
aSubsetOf0(xQ,szNzAzT0),
inference(cnfTransformation,[status(thm)],[f_868]) ).
tff(c_1049,plain,
! [W1_483,W0_484] :
( aSet0(W1_483)
| ~ aSubsetOf0(W1_483,W0_484)
| ~ aSet0(W0_484) ),
inference(cnfTransformation,[status(thm)],[f_84]) ).
tff(c_1064,plain,
( aSet0(xQ)
| ~ aSet0(szNzAzT0) ),
inference(resolution,[status(thm)],[c_450,c_1049]) ).
tff(c_1082,plain,
aSet0(xQ),
inference(demodulation,[status(thm),theory(equality)],[c_108,c_1064]) ).
tff(c_448,plain,
aSubsetOf0(xQ,xO),
inference(cnfTransformation,[status(thm)],[f_867]) ).
tff(c_434,plain,
aSet0(xO),
inference(cnfTransformation,[status(thm)],[f_852]) ).
tff(c_340,plain,
aSubsetOf0(xS,szNzAzT0),
inference(cnfTransformation,[status(thm)],[f_667]) ).
tff(c_1070,plain,
( aSet0(xS)
| ~ aSet0(szNzAzT0) ),
inference(resolution,[status(thm)],[c_340,c_1049]) ).
tff(c_1088,plain,
aSet0(xS),
inference(demodulation,[status(thm),theory(equality)],[c_108,c_1070]) ).
tff(c_442,plain,
aSubsetOf0(xO,xS),
inference(cnfTransformation,[status(thm)],[f_862]) ).
tff(c_9373,plain,
! [W0_872,W2_873,W1_874] :
( aSubsetOf0(W0_872,W2_873)
| ~ aSubsetOf0(W1_874,W2_873)
| ~ aSubsetOf0(W0_872,W1_874)
| ~ aSet0(W2_873)
| ~ aSet0(W1_874)
| ~ aSet0(W0_872) ),
inference(cnfTransformation,[status(thm)],[f_119]) ).
tff(c_9419,plain,
! [W0_872] :
( aSubsetOf0(W0_872,xS)
| ~ aSubsetOf0(W0_872,xO)
| ~ aSet0(xS)
| ~ aSet0(xO)
| ~ aSet0(W0_872) ),
inference(resolution,[status(thm)],[c_442,c_9373]) ).
tff(c_9482,plain,
! [W0_872] :
( aSubsetOf0(W0_872,xS)
| ~ aSubsetOf0(W0_872,xO)
| ~ aSet0(W0_872) ),
inference(demodulation,[status(thm),theory(equality)],[c_434,c_1088,c_9419]) ).
tff(c_452,plain,
~ aElementOf0(xQ,szDzozmdt0(xc)),
inference(cnfTransformation,[status(thm)],[f_870]) ).
tff(c_344,plain,
slbdtsldtrb0(xS,xK) = szDzozmdt0(xc),
inference(cnfTransformation,[status(thm)],[f_672]) ).
tff(c_336,plain,
aElementOf0(xK,szNzAzT0),
inference(cnfTransformation,[status(thm)],[f_664]) ).
tff(c_444,plain,
aElementOf0(xQ,slbdtsldtrb0(xO,xK)),
inference(cnfTransformation,[status(thm)],[f_863]) ).
tff(c_7062,plain,
! [W3_788,W1_789,W0_790] :
( ( sbrdtbr0(W3_788) = W1_789 )
| ~ aElementOf0(W3_788,slbdtsldtrb0(W0_790,W1_789))
| ~ aElementOf0(W1_789,szNzAzT0)
| ~ aSet0(W0_790) ),
inference(cnfTransformation,[status(thm)],[f_487]) ).
tff(c_7085,plain,
( ( sbrdtbr0(xQ) = xK )
| ~ aElementOf0(xK,szNzAzT0)
| ~ aSet0(xO) ),
inference(resolution,[status(thm)],[c_444,c_7062]) ).
tff(c_7096,plain,
sbrdtbr0(xQ) = xK,
inference(demodulation,[status(thm),theory(equality)],[c_434,c_336,c_7085]) ).
tff(c_9720,plain,
! [W3_875,W0_876] :
( aElementOf0(W3_875,slbdtsldtrb0(W0_876,sbrdtbr0(W3_875)))
| ~ aSubsetOf0(W3_875,W0_876)
| ~ aElementOf0(sbrdtbr0(W3_875),szNzAzT0)
| ~ aSet0(W0_876) ),
inference(cnfTransformation,[status(thm)],[f_487]) ).
tff(c_9737,plain,
! [W0_876] :
( aElementOf0(xQ,slbdtsldtrb0(W0_876,xK))
| ~ aSubsetOf0(xQ,W0_876)
| ~ aElementOf0(sbrdtbr0(xQ),szNzAzT0)
| ~ aSet0(W0_876) ),
inference(superposition,[status(thm),theory(equality)],[c_7096,c_9720]) ).
tff(c_12726,plain,
! [W0_976] :
( aElementOf0(xQ,slbdtsldtrb0(W0_976,xK))
| ~ aSubsetOf0(xQ,W0_976)
| ~ aSet0(W0_976) ),
inference(demodulation,[status(thm),theory(equality)],[c_336,c_7096,c_9737]) ).
tff(c_12740,plain,
( aElementOf0(xQ,szDzozmdt0(xc))
| ~ aSubsetOf0(xQ,xS)
| ~ aSet0(xS) ),
inference(superposition,[status(thm),theory(equality)],[c_344,c_12726]) ).
tff(c_12751,plain,
( aElementOf0(xQ,szDzozmdt0(xc))
| ~ aSubsetOf0(xQ,xS) ),
inference(demodulation,[status(thm),theory(equality)],[c_1088,c_12740]) ).
tff(c_12752,plain,
~ aSubsetOf0(xQ,xS),
inference(negUnitSimplification,[status(thm)],[c_452,c_12751]) ).
tff(c_12755,plain,
( ~ aSubsetOf0(xQ,xO)
| ~ aSet0(xQ) ),
inference(resolution,[status(thm)],[c_9482,c_12752]) ).
tff(c_12759,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_1082,c_448,c_12755]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM607+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.13/0.35 % Computer : n014.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 14:51:33 EDT 2023
% 0.13/0.35 % CPUTime :
% 15.54/5.10 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 15.64/5.11
% 15.64/5.11 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 15.64/5.14
% 15.64/5.14 Inference rules
% 15.64/5.14 ----------------------
% 15.64/5.14 #Ref : 3
% 15.64/5.14 #Sup : 2485
% 15.64/5.14 #Fact : 0
% 15.64/5.14 #Define : 0
% 15.64/5.14 #Split : 79
% 15.64/5.14 #Chain : 0
% 15.64/5.14 #Close : 0
% 15.64/5.14
% 15.64/5.14 Ordering : KBO
% 15.64/5.14
% 15.64/5.14 Simplification rules
% 15.64/5.14 ----------------------
% 15.64/5.14 #Subsume : 415
% 15.64/5.14 #Demod : 2143
% 15.64/5.14 #Tautology : 540
% 15.64/5.14 #SimpNegUnit : 163
% 15.64/5.14 #BackRed : 101
% 15.64/5.14
% 15.64/5.14 #Partial instantiations: 0
% 15.64/5.14 #Strategies tried : 1
% 15.64/5.14
% 15.64/5.14 Timing (in seconds)
% 15.64/5.14 ----------------------
% 15.64/5.14 Preprocessing : 0.90
% 15.64/5.15 Parsing : 0.43
% 15.64/5.15 CNF conversion : 0.09
% 15.64/5.15 Main loop : 3.12
% 15.64/5.15 Inferencing : 1.05
% 15.64/5.15 Reduction : 1.16
% 15.64/5.15 Demodulation : 0.83
% 15.64/5.15 BG Simplification : 0.10
% 15.64/5.15 Subsumption : 0.62
% 15.64/5.15 Abstraction : 0.06
% 15.64/5.15 MUC search : 0.00
% 15.64/5.15 Cooper : 0.00
% 15.64/5.15 Total : 4.07
% 15.64/5.15 Index Insertion : 0.00
% 15.64/5.15 Index Deletion : 0.00
% 15.64/5.15 Index Matching : 0.00
% 15.64/5.15 BG Taut test : 0.00
%------------------------------------------------------------------------------