TSTP Solution File: NUM603+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM603+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:17 EDT 2023
% Result : Theorem 14.94s 5.03s
% Output : CNFRefutation 15.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 75
% Syntax : Number of formulae : 87 ( 9 unt; 69 typ; 0 def)
% Number of atoms : 40 ( 4 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 37 ( 15 ~; 10 |; 7 &)
% ( 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 : 106 ( 54 >; 52 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 60 ( 60 usr; 15 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 > xx > xk > xi > xe > xd > xc > xT > xS > 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(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(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(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('#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_865,hypothesis,
( aElementOf0(xi,szNzAzT0)
& ( sdtlpdtrp0(xe,xi) = xx ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5034) ).
tff(f_252,axiom,
! [W0] :
( aElementOf0(W0,szNzAzT0)
=> sdtlseqdt0(sz00,W0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mZeroLess) ).
tff(f_212,axiom,
aElementOf0(sz00,szNzAzT0),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/benchmark/theBenchmark.p',m__3754) ).
tff(f_867,negated_conjecture,
~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
tff(c_446,plain,
aElementOf0(xi,szNzAzT0),
inference(cnfTransformation,[status(thm)],[f_865]) ).
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_5996,plain,
! [W0_708,W1_709] :
( aSubsetOf0(sdtlpdtrp0(xN,W0_708),sdtlpdtrp0(xN,W1_709))
| ~ sdtlseqdt0(W1_709,W0_708)
| ~ aElementOf0(W1_709,szNzAzT0)
| ~ aElementOf0(W0_708,szNzAzT0) ),
inference(cnfTransformation,[status(thm)],[f_738]) ).
tff(c_6012,plain,
! [W0_708] :
( aSubsetOf0(sdtlpdtrp0(xN,W0_708),xS)
| ~ sdtlseqdt0(sz00,W0_708)
| ~ aElementOf0(sz00,szNzAzT0)
| ~ aElementOf0(W0_708,szNzAzT0) ),
inference(superposition,[status(thm),theory(equality)],[c_364,c_5996]) ).
tff(c_10487,plain,
! [W0_845] :
( aSubsetOf0(sdtlpdtrp0(xN,W0_845),xS)
| ~ sdtlseqdt0(sz00,W0_845)
| ~ aElementOf0(W0_845,szNzAzT0) ),
inference(demodulation,[status(thm),theory(equality)],[c_110,c_6012]) ).
tff(c_448,plain,
~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
inference(cnfTransformation,[status(thm)],[f_867]) ).
tff(c_10503,plain,
( ~ sdtlseqdt0(sz00,xi)
| ~ aElementOf0(xi,szNzAzT0) ),
inference(resolution,[status(thm)],[c_10487,c_448]) ).
tff(c_10526,plain,
~ sdtlseqdt0(sz00,xi),
inference(demodulation,[status(thm),theory(equality)],[c_446,c_10503]) ).
tff(c_10533,plain,
~ aElementOf0(xi,szNzAzT0),
inference(resolution,[status(thm)],[c_126,c_10526]) ).
tff(c_10537,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_446,c_10533]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : NUM603+1 : TPTP v8.1.2. Released v4.0.0.
% 0.13/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.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 14:54:07 EDT 2023
% 0.14/0.36 % CPUTime :
% 14.94/5.03 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 14.94/5.03
% 14.94/5.03 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 15.09/5.06
% 15.09/5.06 Inference rules
% 15.09/5.06 ----------------------
% 15.09/5.06 #Ref : 2
% 15.09/5.06 #Sup : 2024
% 15.09/5.06 #Fact : 2
% 15.09/5.06 #Define : 0
% 15.09/5.06 #Split : 53
% 15.09/5.06 #Chain : 0
% 15.09/5.06 #Close : 0
% 15.09/5.06
% 15.09/5.06 Ordering : KBO
% 15.09/5.06
% 15.09/5.06 Simplification rules
% 15.09/5.06 ----------------------
% 15.09/5.06 #Subsume : 324
% 15.09/5.06 #Demod : 1556
% 15.09/5.06 #Tautology : 391
% 15.09/5.06 #SimpNegUnit : 119
% 15.09/5.06 #BackRed : 88
% 15.09/5.06
% 15.09/5.06 #Partial instantiations: 0
% 15.09/5.06 #Strategies tried : 1
% 15.09/5.06
% 15.09/5.06 Timing (in seconds)
% 15.09/5.06 ----------------------
% 15.18/5.06 Preprocessing : 0.90
% 15.18/5.06 Parsing : 0.44
% 15.18/5.06 CNF conversion : 0.09
% 15.18/5.06 Main loop : 2.97
% 15.18/5.06 Inferencing : 0.89
% 15.18/5.06 Reduction : 1.13
% 15.18/5.06 Demodulation : 0.83
% 15.18/5.06 BG Simplification : 0.11
% 15.18/5.06 Subsumption : 0.68
% 15.18/5.06 Abstraction : 0.07
% 15.18/5.06 MUC search : 0.00
% 15.18/5.06 Cooper : 0.00
% 15.18/5.06 Total : 3.92
% 15.18/5.06 Index Insertion : 0.00
% 15.18/5.06 Index Deletion : 0.00
% 15.18/5.06 Index Matching : 0.00
% 15.18/5.06 BG Taut test : 0.00
%------------------------------------------------------------------------------