TSTP Solution File: NUM597+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM597+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 : n001.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:16 EDT 2023
% Result : Theorem 79.92s 63.61s
% Output : CNFRefutation 79.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 91
% Syntax : Number of formulae : 107 ( 8 unt; 87 typ; 0 def)
% Number of atoms : 48 ( 8 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 41 ( 13 ~; 11 |; 10 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 152 ( 74 >; 78 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 78 ( 78 usr; 13 con; 0-4 aty)
% Number of variables : 16 (; 14 !; 2 ?; 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 > xe > xd > xc > xT > xS > xN > xK > xC > szNzAzT0 > sz00 > slcrc0 > #skF_47 > #skF_7 > #skF_11 > #skF_52 > #skF_41 > #skF_17 > #skF_31 > #skF_33 > #skF_44 > #skF_6 > #skF_1 > #skF_18 > #skF_37 > #skF_38 > #skF_4 > #skF_29 > #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(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_52',type,
'#skF_52': $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(aElement0,type,
aElement0: $i > $o ).
tff(sdtexdt0,type,
sdtexdt0: ( $i * $i ) > $i ).
tff('#skF_37',type,
'#skF_37': $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_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_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('#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('#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('#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('#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('#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_1329,negated_conjecture,
~ aElementOf0(szDzizrdt0(xd),xT),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
tff(f_1327,hypothesis,
~ ( ( aSet0(sdtlbdtrb0(xd,szDzizrdt0(xd)))
& ! [W0] :
( aElementOf0(W0,sdtlbdtrb0(xd,szDzizrdt0(xd)))
<=> ( aElementOf0(W0,szDzozmdt0(xd))
& ( sdtlpdtrp0(xd,W0) = szDzizrdt0(xd) ) ) ) )
=> ~ ? [W0] : aElementOf0(W0,sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4868) ).
tff(f_1298,hypothesis,
( aFunction0(xd)
& ( szDzozmdt0(xd) = szNzAzT0 )
& ! [W0] :
( aElementOf0(W0,szNzAzT0)
=> ! [W1] :
( ( aSet0(W1)
& ( ( ( ! [W2] :
( aElementOf0(W2,W1)
=> aElementOf0(W2,sdtlpdtrp0(xN,szszuzczcdt0(W0))) )
| aSubsetOf0(W1,sdtlpdtrp0(xN,szszuzczcdt0(W0))) )
& ( sbrdtbr0(W1) = xk ) )
| aElementOf0(W1,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(W0)),xk)) ) )
=> ( sdtlpdtrp0(xd,W0) = sdtlpdtrp0(sdtlpdtrp0(xC,W0),W1) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4730) ).
tff(f_1314,hypothesis,
( aSet0(sdtlcdtrc0(xd,szDzozmdt0(xd)))
& ! [W0] :
( aElementOf0(W0,sdtlcdtrc0(xd,szDzozmdt0(xd)))
<=> ? [W1] :
( aElementOf0(W1,szDzozmdt0(xd))
& ( sdtlpdtrp0(xd,W1) = W0 ) ) )
& ! [W0] :
( aElementOf0(W0,sdtlcdtrc0(xd,szDzozmdt0(xd)))
=> aElementOf0(W0,xT) )
& aSubsetOf0(sdtlcdtrc0(xd,szDzozmdt0(xd)),xT) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4758) ).
tff(c_9746,plain,
~ aElementOf0(szDzizrdt0(xd),xT),
inference(cnfTransformation,[status(thm)],[f_1329]) ).
tff(c_9736,plain,
aElementOf0('#skF_52',sdtlbdtrb0(xd,szDzizrdt0(xd))),
inference(cnfTransformation,[status(thm)],[f_1327]) ).
tff(c_9712,plain,
szDzozmdt0(xd) = szNzAzT0,
inference(cnfTransformation,[status(thm)],[f_1298]) ).
tff(c_9744,plain,
! [W0_794] :
( aElementOf0(W0_794,szDzozmdt0(xd))
| ~ aElementOf0(W0_794,sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
inference(cnfTransformation,[status(thm)],[f_1327]) ).
tff(c_10660,plain,
! [W0_866] :
( aElementOf0(W0_866,szNzAzT0)
| ~ aElementOf0(W0_866,sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
inference(demodulation,[status(thm),theory(equality)],[c_9712,c_9744]) ).
tff(c_10676,plain,
aElementOf0('#skF_52',szNzAzT0),
inference(resolution,[status(thm)],[c_9736,c_10660]) ).
tff(c_12140,plain,
! [W0_956] :
( ( sdtlpdtrp0(xd,W0_956) = szDzizrdt0(xd) )
| ~ aElementOf0(W0_956,sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
inference(cnfTransformation,[status(thm)],[f_1327]) ).
tff(c_12170,plain,
sdtlpdtrp0(xd,'#skF_52') = szDzizrdt0(xd),
inference(resolution,[status(thm)],[c_9736,c_12140]) ).
tff(c_9728,plain,
! [W1_793] :
( aElementOf0(sdtlpdtrp0(xd,W1_793),sdtlcdtrc0(xd,szDzozmdt0(xd)))
| ~ aElementOf0(W1_793,szDzozmdt0(xd)) ),
inference(cnfTransformation,[status(thm)],[f_1314]) ).
tff(c_11302,plain,
! [W1_922] :
( aElementOf0(sdtlpdtrp0(xd,W1_922),sdtlcdtrc0(xd,szNzAzT0))
| ~ aElementOf0(W1_922,szNzAzT0) ),
inference(demodulation,[status(thm),theory(equality)],[c_9712,c_9712,c_9728]) ).
tff(c_9726,plain,
! [W0_789] :
( aElementOf0(W0_789,xT)
| ~ aElementOf0(W0_789,sdtlcdtrc0(xd,szDzozmdt0(xd))) ),
inference(cnfTransformation,[status(thm)],[f_1314]) ).
tff(c_9747,plain,
! [W0_789] :
( aElementOf0(W0_789,xT)
| ~ aElementOf0(W0_789,sdtlcdtrc0(xd,szNzAzT0)) ),
inference(demodulation,[status(thm),theory(equality)],[c_9712,c_9726]) ).
tff(c_11324,plain,
! [W1_922] :
( aElementOf0(sdtlpdtrp0(xd,W1_922),xT)
| ~ aElementOf0(W1_922,szNzAzT0) ),
inference(resolution,[status(thm)],[c_11302,c_9747]) ).
tff(c_12180,plain,
( aElementOf0(szDzizrdt0(xd),xT)
| ~ aElementOf0('#skF_52',szNzAzT0) ),
inference(superposition,[status(thm),theory(equality)],[c_12170,c_11324]) ).
tff(c_12194,plain,
aElementOf0(szDzizrdt0(xd),xT),
inference(demodulation,[status(thm),theory(equality)],[c_10676,c_12180]) ).
tff(c_12196,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_9746,c_12194]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM597+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.13/0.35 % Computer : n001.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 15:38:40 EDT 2023
% 0.13/0.35 % CPUTime :
% 79.92/63.61 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 79.92/63.61
% 79.92/63.61 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 79.92/63.64
% 79.92/63.64 Inference rules
% 79.92/63.64 ----------------------
% 79.92/63.64 #Ref : 0
% 79.92/63.64 #Sup : 483
% 79.92/63.64 #Fact : 0
% 79.92/63.64 #Define : 0
% 79.92/63.64 #Split : 22
% 79.92/63.64 #Chain : 0
% 79.92/63.64 #Close : 0
% 79.92/63.64
% 79.92/63.64 Ordering : KBO
% 79.92/63.64
% 79.92/63.64 Simplification rules
% 79.92/63.64 ----------------------
% 79.92/63.64 #Subsume : 1179
% 79.92/63.64 #Demod : 362
% 79.92/63.64 #Tautology : 121
% 79.92/63.64 #SimpNegUnit : 13
% 79.92/63.64 #BackRed : 66
% 79.92/63.64
% 79.92/63.64 #Partial instantiations: 0
% 79.92/63.64 #Strategies tried : 1
% 79.92/63.64
% 79.92/63.64 Timing (in seconds)
% 79.92/63.64 ----------------------
% 79.92/63.65 Preprocessing : 2.24
% 79.92/63.65 Parsing : 0.55
% 79.92/63.65 CNF conversion : 0.17
% 79.92/63.65 Main loop : 60.35
% 79.92/63.65 Inferencing : 0.29
% 79.92/63.65 Reduction : 44.73
% 79.92/63.65 Demodulation : 38.86
% 79.92/63.65 BG Simplification : 0.73
% 79.92/63.65 Subsumption : 12.74
% 79.92/63.65 Abstraction : 0.44
% 79.92/63.65 MUC search : 0.00
% 79.92/63.65 Cooper : 0.00
% 79.92/63.65 Total : 62.64
% 79.92/63.65 Index Insertion : 0.00
% 79.92/63.65 Index Deletion : 0.00
% 79.92/63.65 Index Matching : 0.00
% 79.92/63.65 BG Taut test : 0.00
%------------------------------------------------------------------------------