TSTP Solution File: NUM618+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM618+3 : 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 : n029.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:21 EDT 2023
% Result : Theorem 78.72s 63.98s
% Output : CNFRefutation 78.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 101
% Syntax : Number of formulae : 110 ( 4 unt; 97 typ; 0 def)
% Number of atoms : 30 ( 8 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 27 ( 10 ~; 6 |; 9 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 154 ( 76 >; 78 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 88 ( 88 usr; 21 con; 0-4 aty)
% Number of variables : 10 (; 7 !; 3 ?; 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 > xp > xn > xk > xe > xd > xc > xT > xS > xQ > xP > xO > xN > xK > xC > szNzAzT0 > sz00 > slcrc0 > #skF_53 > #skF_47 > #skF_7 > #skF_11 > #skF_41 > #skF_17 > #skF_31 > #skF_33 > #skF_44 > #skF_6 > #skF_1 > #skF_18 > #skF_55 > #skF_37 > #skF_56 > #skF_54 > #skF_38 > #skF_4 > #skF_29 > #skF_52 > #skF_12 > #skF_30 > #skF_32 > #skF_23 > #skF_35 > #skF_5 > #skF_49 > #skF_19 > #skF_10 > #skF_42 > #skF_8 > #skF_20 > #skF_28 > #skF_26 > #skF_24 > #skF_34 > #skF_15 > #skF_13 > #skF_14 > #skF_50 > #skF_25 > #skF_3 > #skF_2 > #skF_48 > #skF_40 > #skF_27 > #skF_36 > #skF_43 > #skF_46 > #skF_21 > #skF_45 > #skF_9 > #skF_22 > #skF_16 > #skF_51 > #skF_39
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_53',type,
'#skF_53': $i > $i ).
tff(xk,type,
xk: $i ).
tff('#skF_47',type,
'#skF_47': ( $i * $i ) > $i ).
tff('#skF_7',type,
'#skF_7': $i > $i ).
tff('#skF_11',type,
'#skF_11': ( $i * $i ) > $i ).
tff('#skF_41',type,
'#skF_41': ( $i * $i ) > $i ).
tff(sbrdtbr0,type,
sbrdtbr0: $i > $i ).
tff('#skF_17',type,
'#skF_17': ( $i * $i * $i ) > $i ).
tff('#skF_31',type,
'#skF_31': ( $i * $i * $i ) > $i ).
tff('#skF_33',type,
'#skF_33': ( $i * $i * $i ) > $i ).
tff(aSet0,type,
aSet0: $i > $o ).
tff(szszuzczcdt0,type,
szszuzczcdt0: $i > $i ).
tff('#skF_44',type,
'#skF_44': ( $i * $i * $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(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('#skF_55',type,
'#skF_55': $i ).
tff(aElement0,type,
aElement0: $i > $o ).
tff(sdtexdt0,type,
sdtexdt0: ( $i * $i ) > $i ).
tff('#skF_37',type,
'#skF_37': $i > $i ).
tff('#skF_56',type,
'#skF_56': $i ).
tff(szNzAzT0,type,
szNzAzT0: $i ).
tff(sdtlseqdt0,type,
sdtlseqdt0: ( $i * $i ) > $o ).
tff('#skF_54',type,
'#skF_54': $i ).
tff(xS,type,
xS: $i ).
tff(sz00,type,
sz00: $i ).
tff(sdtlpdtrp0,type,
sdtlpdtrp0: ( $i * $i ) > $i ).
tff('#skF_38',type,
'#skF_38': ( $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 * $i ) > $i ).
tff('#skF_52',type,
'#skF_52': $i > $i ).
tff(xP,type,
xP: $i ).
tff('#skF_12',type,
'#skF_12': ( $i * $i ) > $i ).
tff(sdtpldt0,type,
sdtpldt0: ( $i * $i ) > $i ).
tff('#skF_30',type,
'#skF_30': ( $i * $i * $i ) > $i ).
tff(slbdtsldtrb0,type,
slbdtsldtrb0: ( $i * $i ) > $i ).
tff('#skF_32',type,
'#skF_32': ( $i * $i * $i * $i ) > $i ).
tff(xx,type,
xx: $i ).
tff('#skF_23',type,
'#skF_23': ( $i * $i * $i ) > $i ).
tff('#skF_35',type,
'#skF_35': ( $i * $i * $i ) > $i ).
tff(aSubsetOf0,type,
aSubsetOf0: ( $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': ( $i * $i * $i ) > $i ).
tff('#skF_49',type,
'#skF_49': ( $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_42',type,
'#skF_42': ( $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_28',type,
'#skF_28': ( $i * $i ) > $i ).
tff('#skF_26',type,
'#skF_26': $i > $i ).
tff('#skF_24',type,
'#skF_24': ( $i * $i ) > $i ).
tff('#skF_34',type,
'#skF_34': ( $i * $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('#skF_50',type,
'#skF_50': ( $i * $i ) > $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('#skF_48',type,
'#skF_48': $i > $i ).
tff('#skF_40',type,
'#skF_40': ( $i * $i ) > $i ).
tff(iLess0,type,
iLess0: ( $i * $i ) > $o ).
tff('#skF_27',type,
'#skF_27': $i > $i ).
tff(szmzizndt0,type,
szmzizndt0: $i > $i ).
tff('#skF_36',type,
'#skF_36': ( $i * $i * $i * $i ) > $i ).
tff('#skF_43',type,
'#skF_43': ( $i * $i ) > $i ).
tff(xn,type,
xn: $i ).
tff('#skF_46',type,
'#skF_46': $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_45',type,
'#skF_45': $i > $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('#skF_51',type,
'#skF_51': $i > $i ).
tff('#skF_39',type,
'#skF_39': ( $i * $i ) > $i ).
tff(f_1363,hypothesis,
! [W0] :
( ( ? [W1] :
( aElementOf0(W1,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& ( sdtlpdtrp0(xe,W1) = W0 ) )
| aElementOf0(W0,xO) )
=> ? [W1] :
( aElementOf0(W1,szNzAzT0)
& ( sdtlpdtrp0(xd,W1) = szDzizrdt0(xd) )
& aElementOf0(W1,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& ( sdtlpdtrp0(xe,W1) = W0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4982) ).
tff(f_1487,negated_conjecture,
~ ? [W0] :
( aElementOf0(W0,szNzAzT0)
& ( xx = sdtlpdtrp0(xe,W0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
tff(f_1476,hypothesis,
( aElement0(xx)
& aElementOf0(xx,xQ)
& ( xx != szmzizndt0(xQ) )
& aElementOf0(xx,xP) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5348) ).
tff(f_1456,hypothesis,
( ! [W0] :
( aElementOf0(W0,xP)
=> aElementOf0(W0,xO) )
& aSubsetOf0(xP,xO) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5208) ).
tff(c_10697,plain,
! [W0_870] :
( ~ aElementOf0(W0_870,xO)
| ( sdtlpdtrp0(xe,'#skF_53'(W0_870)) = W0_870 ) ),
inference(cnfTransformation,[status(thm)],[f_1363]) ).
tff(c_10235,plain,
! [W0_843] :
( ~ aElementOf0(W0_843,xO)
| aElementOf0('#skF_53'(W0_843),szNzAzT0) ),
inference(cnfTransformation,[status(thm)],[f_1363]) ).
tff(c_9882,plain,
! [W0_815] :
( ( sdtlpdtrp0(xe,W0_815) != xx )
| ~ aElementOf0(W0_815,szNzAzT0) ),
inference(cnfTransformation,[status(thm)],[f_1487]) ).
tff(c_10247,plain,
! [W0_843] :
( ( sdtlpdtrp0(xe,'#skF_53'(W0_843)) != xx )
| ~ aElementOf0(W0_843,xO) ),
inference(resolution,[status(thm)],[c_10235,c_9882]) ).
tff(c_10966,plain,
~ aElementOf0(xx,xO),
inference(superposition,[status(thm),theory(equality)],[c_10697,c_10247]) ).
tff(c_9868,plain,
aElementOf0(xx,xP),
inference(cnfTransformation,[status(thm)],[f_1476]) ).
tff(c_10046,plain,
! [W0_822] :
( aElementOf0(W0_822,xO)
| ~ aElementOf0(W0_822,xP) ),
inference(cnfTransformation,[status(thm)],[f_1456]) ).
tff(c_10050,plain,
aElementOf0(xx,xO),
inference(resolution,[status(thm)],[c_9868,c_10046]) ).
tff(c_10968,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_10966,c_10050]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM618+3 : 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 : n029.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 15:35:52 EDT 2023
% 0.14/0.35 % CPUTime :
% 78.72/63.98 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 78.72/63.98
% 78.72/63.98 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 78.72/64.01
% 78.72/64.01 Inference rules
% 78.72/64.01 ----------------------
% 78.72/64.01 #Ref : 0
% 78.72/64.01 #Sup : 205
% 78.72/64.01 #Fact : 0
% 78.72/64.01 #Define : 0
% 78.72/64.01 #Split : 11
% 78.72/64.01 #Chain : 0
% 78.72/64.01 #Close : 0
% 78.72/64.01
% 78.72/64.01 Ordering : KBO
% 78.72/64.01
% 78.72/64.01 Simplification rules
% 78.72/64.01 ----------------------
% 78.72/64.01 #Subsume : 1142
% 78.72/64.01 #Demod : 209
% 78.72/64.01 #Tautology : 112
% 78.72/64.01 #SimpNegUnit : 7
% 78.72/64.01 #BackRed : 39
% 78.72/64.01
% 78.72/64.01 #Partial instantiations: 0
% 78.72/64.01 #Strategies tried : 1
% 78.72/64.01
% 78.72/64.01 Timing (in seconds)
% 78.72/64.01 ----------------------
% 78.72/64.01 Preprocessing : 2.32
% 78.72/64.01 Parsing : 0.55
% 78.72/64.01 CNF conversion : 0.18
% 78.72/64.01 Main loop : 60.55
% 78.72/64.01 Inferencing : 0.21
% 78.72/64.01 Reduction : 45.70
% 78.72/64.01 Demodulation : 39.58
% 78.72/64.01 BG Simplification : 0.77
% 78.72/64.01 Subsumption : 12.04
% 78.72/64.01 Abstraction : 0.46
% 78.72/64.01 MUC search : 0.00
% 78.72/64.01 Cooper : 0.00
% 78.72/64.01 Total : 62.92
% 78.72/64.01 Index Insertion : 0.00
% 78.72/64.01 Index Deletion : 0.00
% 78.72/64.01 Index Matching : 0.00
% 78.72/64.01 BG Taut test : 0.00
%------------------------------------------------------------------------------