TSTP Solution File: NUM587+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM587+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 : 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:13 EDT 2023
% Result : Theorem 7.33s 2.74s
% Output : CNFRefutation 7.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 68
% Syntax : Number of formulae : 79 ( 9 unt; 63 typ; 1 def)
% Number of atoms : 30 ( 3 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 22 ( 8 ~; 6 |; 5 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 102 ( 50 >; 52 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 54 ( 54 usr; 13 con; 0-4 aty)
% Number of variables : 7 (; 7 !; 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 > xk > xi > xc > xT > xS > xQ > xN > xK > xC > szNzAzT0 > sz00 > slcrc0 > #skF_26 > #skF_7 > #skF_11 > #skF_17 > #skF_6 > #skF_27 > #skF_1 > #skF_18 > #skF_4 > #skF_12 > #skF_23 > #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_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('#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_18',type,
'#skF_18': ( $i * $i * $i ) > $i ).
tff(aElement0,type,
aElement0: $i > $o ).
tff(sdtexdt0,type,
sdtexdt0: ( $i * $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('#skF_4',type,
'#skF_4': ( $i * $i * $i ) > $i ).
tff(xc,type,
xc: $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(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('#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_16',type,
'#skF_16': ( $i * $i * $i ) > $i ).
tff(f_784,negated_conjecture,
~ aElementOf0(xx,xT),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
tff(f_663,hypothesis,
( aSet0(xT)
& isFinite0(xT) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3291) ).
tff(f_672,hypothesis,
( aFunction0(xc)
& ( szDzozmdt0(xc) = slbdtsldtrb0(xS,xK) )
& aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3453) ).
tff(f_782,hypothesis,
( ( xx = sdtlpdtrp0(xc,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& aElementOf0(sdtlpdtrp0(xc,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))),sdtlcdtrc0(xc,szDzozmdt0(xc))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4263) ).
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(c_406,plain,
~ aElementOf0(xx,xT),
inference(cnfTransformation,[status(thm)],[f_784]) ).
tff(c_334,plain,
aSet0(xT),
inference(cnfTransformation,[status(thm)],[f_663]) ).
tff(c_342,plain,
aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT),
inference(cnfTransformation,[status(thm)],[f_672]) ).
tff(c_404,plain,
sdtlpdtrp0(xc,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) = xx,
inference(cnfTransformation,[status(thm)],[f_782]) ).
tff(c_402,plain,
aElementOf0(sdtlpdtrp0(xc,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))),sdtlcdtrc0(xc,szDzozmdt0(xc))),
inference(cnfTransformation,[status(thm)],[f_782]) ).
tff(c_407,plain,
aElementOf0(xx,sdtlcdtrc0(xc,szDzozmdt0(xc))),
inference(demodulation,[status(thm),theory(equality)],[c_404,c_402]) ).
tff(c_1537,plain,
! [W2_509,W0_510,W1_511] :
( aElementOf0(W2_509,W0_510)
| ~ aElementOf0(W2_509,W1_511)
| ~ aSubsetOf0(W1_511,W0_510)
| ~ aSet0(W0_510) ),
inference(cnfTransformation,[status(thm)],[f_84]) ).
tff(c_1831,plain,
! [W0_527] :
( aElementOf0(xx,W0_527)
| ~ aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),W0_527)
| ~ aSet0(W0_527) ),
inference(resolution,[status(thm)],[c_407,c_1537]) ).
tff(c_1838,plain,
( aElementOf0(xx,xT)
| ~ aSet0(xT) ),
inference(resolution,[status(thm)],[c_342,c_1831]) ).
tff(c_1848,plain,
aElementOf0(xx,xT),
inference(demodulation,[status(thm),theory(equality)],[c_334,c_1838]) ).
tff(c_1850,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_406,c_1848]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM587+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.17/0.35 % Computer : n012.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 300
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Thu Aug 3 15:00:37 EDT 2023
% 0.17/0.35 % CPUTime :
% 7.33/2.74 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.33/2.75
% 7.33/2.75 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.76/2.77
% 7.76/2.77 Inference rules
% 7.76/2.77 ----------------------
% 7.76/2.77 #Ref : 0
% 7.76/2.77 #Sup : 285
% 7.76/2.77 #Fact : 0
% 7.76/2.77 #Define : 0
% 7.76/2.77 #Split : 12
% 7.76/2.77 #Chain : 0
% 7.76/2.77 #Close : 0
% 7.76/2.77
% 7.76/2.77 Ordering : KBO
% 7.76/2.77
% 7.76/2.77 Simplification rules
% 7.76/2.77 ----------------------
% 7.76/2.77 #Subsume : 51
% 7.76/2.78 #Demod : 220
% 7.76/2.78 #Tautology : 91
% 7.76/2.78 #SimpNegUnit : 14
% 7.76/2.78 #BackRed : 34
% 7.76/2.78
% 7.76/2.78 #Partial instantiations: 0
% 7.76/2.78 #Strategies tried : 1
% 7.76/2.78
% 7.76/2.78 Timing (in seconds)
% 7.76/2.78 ----------------------
% 7.76/2.78 Preprocessing : 0.85
% 7.76/2.78 Parsing : 0.40
% 7.76/2.78 CNF conversion : 0.08
% 7.76/2.78 Main loop : 0.79
% 7.76/2.78 Inferencing : 0.24
% 7.76/2.78 Reduction : 0.28
% 7.76/2.78 Demodulation : 0.19
% 7.76/2.78 BG Simplification : 0.07
% 7.76/2.78 Subsumption : 0.17
% 7.76/2.78 Abstraction : 0.03
% 7.76/2.78 MUC search : 0.00
% 7.76/2.78 Cooper : 0.00
% 7.76/2.78 Total : 1.68
% 7.76/2.78 Index Insertion : 0.00
% 7.76/2.78 Index Deletion : 0.00
% 7.76/2.78 Index Matching : 0.00
% 7.76/2.78 BG Taut test : 0.00
%------------------------------------------------------------------------------