TSTP Solution File: NUM582+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM582+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 : n009.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:12 EDT 2023
% Result : Theorem 11.05s 3.61s
% Output : CNFRefutation 11.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 67
% Syntax : Number of formulae : 79 ( 10 unt; 61 typ; 0 def)
% Number of atoms : 39 ( 3 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 36 ( 15 ~; 10 |; 6 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 1 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 : 52 ( 52 usr; 11 con; 0-4 aty)
% Number of variables : 9 (; 9 !; 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 > xi > xc > xT > xS > xQ > xN > xK > 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('#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('#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_749,hypothesis,
aElementOf0(xi,szNzAzT0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3989) ).
tff(f_252,axiom,
! [W0] :
( aElementOf0(W0,szNzAzT0)
=> sdtlseqdt0(sz00,W0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mZeroLess) ).
tff(f_212,axiom,
aElementOf0(sz00,szNzAzT0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mZeroNum) ).
tff(f_724,hypothesis,
( aFunction0(xN)
& ( szDzozmdt0(xN) = szNzAzT0 )
& ( sdtlpdtrp0(xN,sz00) = xS )
& ! [W0] :
( aElementOf0(W0,szNzAzT0)
=> ( ( aSubsetOf0(sdtlpdtrp0(xN,W0),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,W0)) )
=> ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(W0)),sdtmndt0(sdtlpdtrp0(xN,W0),szmzizndt0(sdtlpdtrp0(xN,W0))))
& isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(W0))) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3623) ).
tff(f_738,hypothesis,
! [W0,W1] :
( ( aElementOf0(W0,szNzAzT0)
& aElementOf0(W1,szNzAzT0) )
=> ( sdtlseqdt0(W1,W0)
=> aSubsetOf0(sdtlpdtrp0(xN,W0),sdtlpdtrp0(xN,W1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3754) ).
tff(f_753,negated_conjecture,
~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
tff(c_382,plain,
aElementOf0(xi,szNzAzT0),
inference(cnfTransformation,[status(thm)],[f_749]) ).
tff(c_126,plain,
! [W0_80] :
( sdtlseqdt0(sz00,W0_80)
| ~ aElementOf0(W0_80,szNzAzT0) ),
inference(cnfTransformation,[status(thm)],[f_252]) ).
tff(c_110,plain,
aElementOf0(sz00,szNzAzT0),
inference(cnfTransformation,[status(thm)],[f_212]) ).
tff(c_364,plain,
sdtlpdtrp0(xN,sz00) = xS,
inference(cnfTransformation,[status(thm)],[f_724]) ).
tff(c_6369,plain,
! [W0_687,W1_688] :
( aSubsetOf0(sdtlpdtrp0(xN,W0_687),sdtlpdtrp0(xN,W1_688))
| ~ sdtlseqdt0(W1_688,W0_687)
| ~ aElementOf0(W1_688,szNzAzT0)
| ~ aElementOf0(W0_687,szNzAzT0) ),
inference(cnfTransformation,[status(thm)],[f_738]) ).
tff(c_6385,plain,
! [W0_687] :
( aSubsetOf0(sdtlpdtrp0(xN,W0_687),xS)
| ~ sdtlseqdt0(sz00,W0_687)
| ~ aElementOf0(sz00,szNzAzT0)
| ~ aElementOf0(W0_687,szNzAzT0) ),
inference(superposition,[status(thm),theory(equality)],[c_364,c_6369]) ).
tff(c_6555,plain,
! [W0_698] :
( aSubsetOf0(sdtlpdtrp0(xN,W0_698),xS)
| ~ sdtlseqdt0(sz00,W0_698)
| ~ aElementOf0(W0_698,szNzAzT0) ),
inference(demodulation,[status(thm),theory(equality)],[c_110,c_6385]) ).
tff(c_388,plain,
~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
inference(cnfTransformation,[status(thm)],[f_753]) ).
tff(c_6571,plain,
( ~ sdtlseqdt0(sz00,xi)
| ~ aElementOf0(xi,szNzAzT0) ),
inference(resolution,[status(thm)],[c_6555,c_388]) ).
tff(c_6590,plain,
~ sdtlseqdt0(sz00,xi),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_6571]) ).
tff(c_6595,plain,
~ aElementOf0(xi,szNzAzT0),
inference(resolution,[status(thm)],[c_126,c_6590]) ).
tff(c_6599,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_382,c_6595]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM582+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.14/0.35 % Computer : n009.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 14:58:08 EDT 2023
% 0.14/0.35 % CPUTime :
% 11.05/3.61 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.05/3.61
% 11.05/3.61 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 11.05/3.64
% 11.05/3.64 Inference rules
% 11.05/3.64 ----------------------
% 11.05/3.64 #Ref : 2
% 11.05/3.64 #Sup : 1233
% 11.05/3.64 #Fact : 0
% 11.05/3.64 #Define : 0
% 11.05/3.64 #Split : 48
% 11.05/3.64 #Chain : 0
% 11.05/3.64 #Close : 0
% 11.05/3.64
% 11.05/3.64 Ordering : KBO
% 11.05/3.64
% 11.05/3.64 Simplification rules
% 11.05/3.64 ----------------------
% 11.05/3.64 #Subsume : 265
% 11.05/3.64 #Demod : 931
% 11.05/3.64 #Tautology : 272
% 11.05/3.64 #SimpNegUnit : 79
% 11.05/3.64 #BackRed : 54
% 11.05/3.64
% 11.05/3.64 #Partial instantiations: 0
% 11.05/3.64 #Strategies tried : 1
% 11.05/3.64
% 11.05/3.64 Timing (in seconds)
% 11.05/3.64 ----------------------
% 11.05/3.64 Preprocessing : 0.88
% 11.05/3.64 Parsing : 0.43
% 11.05/3.64 CNF conversion : 0.09
% 11.05/3.64 Main loop : 1.67
% 11.05/3.64 Inferencing : 0.54
% 11.05/3.64 Reduction : 0.58
% 11.05/3.64 Demodulation : 0.40
% 11.05/3.64 BG Simplification : 0.09
% 11.05/3.64 Subsumption : 0.37
% 11.05/3.64 Abstraction : 0.05
% 11.05/3.64 MUC search : 0.00
% 11.05/3.65 Cooper : 0.00
% 11.05/3.65 Total : 2.60
% 11.05/3.65 Index Insertion : 0.00
% 11.05/3.65 Index Deletion : 0.00
% 11.05/3.65 Index Matching : 0.00
% 11.05/3.65 BG Taut test : 0.00
%------------------------------------------------------------------------------