TSTP Solution File: NUM609+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM609+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 : n023.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:19 EDT 2023
% Result : Theorem 16.70s 6.33s
% Output : CNFRefutation 16.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 79
% Syntax : Number of formulae : 103 ( 15 unt; 70 typ; 2 def)
% Number of atoms : 75 ( 8 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 71 ( 29 ~; 26 |; 8 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 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 : 61 ( 61 usr; 16 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 > xp > 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('#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(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_877,negated_conjecture,
~ aSubsetOf0(xP,xQ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
tff(f_852,hypothesis,
( aSet0(xO)
& isCountable0(xO) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4908) ).
tff(f_867,hypothesis,
( aSubsetOf0(xQ,xO)
& ( xQ != slcrc0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5093) ).
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_873,hypothesis,
( aSet0(xP)
& ( xP = sdtmndt0(xQ,szmzizndt0(xQ)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5164) ).
tff(f_875,hypothesis,
aElementOf0(xp,xO),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5182) ).
tff(f_39,axiom,
! [W0] :
( aSet0(W0)
=> ! [W1] :
( aElementOf0(W1,W0)
=> aElement0(W1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEOfElem) ).
tff(f_870,hypothesis,
xp = szmzizndt0(xQ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5147) ).
tff(f_156,definition,
! [W0,W1] :
( ( aSet0(W0)
& aElement0(W1) )
=> ! [W2] :
( ( W2 = sdtmndt0(W0,W1) )
<=> ( aSet0(W2)
& ! [W3] :
( aElementOf0(W3,W2)
<=> ( aElement0(W3)
& aElementOf0(W3,W0)
& ( W3 != W1 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefDiff) ).
tff(c_464,plain,
~ aSubsetOf0(xP,xQ),
inference(cnfTransformation,[status(thm)],[f_877]) ).
tff(c_434,plain,
aSet0(xO),
inference(cnfTransformation,[status(thm)],[f_852]) ).
tff(c_448,plain,
aSubsetOf0(xQ,xO),
inference(cnfTransformation,[status(thm)],[f_867]) ).
tff(c_680,plain,
! [W1_445,W0_446] :
( aSet0(W1_445)
| ~ aSubsetOf0(W1_445,W0_446)
| ~ aSet0(W0_446) ),
inference(cnfTransformation,[status(thm)],[f_84]) ).
tff(c_695,plain,
( aSet0(xQ)
| ~ aSet0(xO) ),
inference(resolution,[status(thm)],[c_448,c_680]) ).
tff(c_713,plain,
aSet0(xQ),
inference(demodulation,[status(thm),theory(equality)],[c_434,c_695]) ).
tff(c_458,plain,
aSet0(xP),
inference(cnfTransformation,[status(thm)],[f_873]) ).
tff(c_30,plain,
! [W0_14,W1_20] :
( aElementOf0('#skF_2'(W0_14,W1_20),W1_20)
| aSubsetOf0(W1_20,W0_14)
| ~ aSet0(W1_20)
| ~ aSet0(W0_14) ),
inference(cnfTransformation,[status(thm)],[f_84]) ).
tff(c_462,plain,
aElementOf0(xp,xO),
inference(cnfTransformation,[status(thm)],[f_875]) ).
tff(c_767,plain,
! [W1_450,W0_451] :
( aElement0(W1_450)
| ~ aElementOf0(W1_450,W0_451)
| ~ aSet0(W0_451) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_803,plain,
( aElement0(xp)
| ~ aSet0(xO) ),
inference(resolution,[status(thm)],[c_462,c_767]) ).
tff(c_835,plain,
aElement0(xp),
inference(demodulation,[status(thm),theory(equality)],[c_434,c_803]) ).
tff(c_454,plain,
szmzizndt0(xQ) = xp,
inference(cnfTransformation,[status(thm)],[f_870]) ).
tff(c_456,plain,
sdtmndt0(xQ,szmzizndt0(xQ)) = xP,
inference(cnfTransformation,[status(thm)],[f_873]) ).
tff(c_465,plain,
sdtmndt0(xQ,xp) = xP,
inference(demodulation,[status(thm),theory(equality)],[c_454,c_456]) ).
tff(c_9398,plain,
! [W3_928,W0_929,W1_930] :
( aElementOf0(W3_928,W0_929)
| ~ aElementOf0(W3_928,sdtmndt0(W0_929,W1_930))
| ~ aElement0(W1_930)
| ~ aSet0(W0_929) ),
inference(cnfTransformation,[status(thm)],[f_156]) ).
tff(c_9417,plain,
! [W3_928] :
( aElementOf0(W3_928,xQ)
| ~ aElementOf0(W3_928,xP)
| ~ aElement0(xp)
| ~ aSet0(xQ) ),
inference(superposition,[status(thm),theory(equality)],[c_465,c_9398]) ).
tff(c_9423,plain,
! [W3_928] :
( aElementOf0(W3_928,xQ)
| ~ aElementOf0(W3_928,xP) ),
inference(demodulation,[status(thm),theory(equality)],[c_713,c_835,c_9417]) ).
tff(c_9620,plain,
! [W0_941,W1_942] :
( ~ aElementOf0('#skF_2'(W0_941,W1_942),W0_941)
| aSubsetOf0(W1_942,W0_941)
| ~ aSet0(W1_942)
| ~ aSet0(W0_941) ),
inference(cnfTransformation,[status(thm)],[f_84]) ).
tff(c_9624,plain,
! [W1_942] :
( aSubsetOf0(W1_942,xQ)
| ~ aSet0(W1_942)
| ~ aSet0(xQ)
| ~ aElementOf0('#skF_2'(xQ,W1_942),xP) ),
inference(resolution,[status(thm)],[c_9423,c_9620]) ).
tff(c_20150,plain,
! [W1_1210] :
( aSubsetOf0(W1_1210,xQ)
| ~ aSet0(W1_1210)
| ~ aElementOf0('#skF_2'(xQ,W1_1210),xP) ),
inference(demodulation,[status(thm),theory(equality)],[c_713,c_9624]) ).
tff(c_20154,plain,
( aSubsetOf0(xP,xQ)
| ~ aSet0(xP)
| ~ aSet0(xQ) ),
inference(resolution,[status(thm)],[c_30,c_20150]) ).
tff(c_20157,plain,
aSubsetOf0(xP,xQ),
inference(demodulation,[status(thm),theory(equality)],[c_713,c_458,c_20154]) ).
tff(c_20159,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_464,c_20157]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : NUM609+1 : TPTP v8.1.2. Released v4.0.0.
% 0.08/0.15 % 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.14/0.36 % Computer : n023.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:41:37 EDT 2023
% 0.14/0.37 % CPUTime :
% 16.70/6.33 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 16.70/6.34
% 16.70/6.34 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 16.90/6.37
% 16.90/6.37 Inference rules
% 16.90/6.37 ----------------------
% 16.90/6.37 #Ref : 6
% 16.90/6.37 #Sup : 3822
% 16.90/6.37 #Fact : 2
% 16.90/6.37 #Define : 0
% 16.90/6.37 #Split : 138
% 16.90/6.37 #Chain : 0
% 16.90/6.37 #Close : 0
% 16.90/6.37
% 16.90/6.37 Ordering : KBO
% 16.90/6.37
% 16.90/6.37 Simplification rules
% 16.90/6.37 ----------------------
% 16.90/6.37 #Subsume : 544
% 16.90/6.37 #Demod : 3232
% 16.90/6.37 #Tautology : 740
% 16.90/6.37 #SimpNegUnit : 270
% 16.90/6.37 #BackRed : 148
% 16.90/6.37
% 16.90/6.37 #Partial instantiations: 0
% 16.90/6.37 #Strategies tried : 1
% 16.90/6.37
% 16.90/6.37 Timing (in seconds)
% 16.90/6.37 ----------------------
% 16.90/6.38 Preprocessing : 0.88
% 16.90/6.38 Parsing : 0.43
% 16.90/6.38 CNF conversion : 0.09
% 16.90/6.38 Main loop : 4.40
% 16.90/6.38 Inferencing : 1.30
% 16.90/6.38 Reduction : 1.72
% 16.90/6.38 Demodulation : 1.25
% 16.90/6.38 BG Simplification : 0.11
% 16.90/6.38 Subsumption : 0.99
% 16.90/6.38 Abstraction : 0.08
% 16.90/6.38 MUC search : 0.00
% 16.90/6.38 Cooper : 0.00
% 16.90/6.38 Total : 5.34
% 16.90/6.38 Index Insertion : 0.00
% 16.90/6.38 Index Deletion : 0.00
% 16.90/6.38 Index Matching : 0.00
% 16.90/6.38 BG Taut test : 0.00
%------------------------------------------------------------------------------