TSTP Solution File: NUM633+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM633+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 : n003.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:24 EDT 2023
% Result : Theorem 6.96s 2.51s
% Output : CNFRefutation 6.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 72
% Syntax : Number of formulae : 83 ( 6 unt; 68 typ; 0 def)
% Number of atoms : 41 ( 8 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 46 ( 20 ~; 15 |; 8 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 108 ( 55 >; 53 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 59 ( 59 usr; 13 con; 0-4 aty)
% Number of variables : 12 (; 10 !; 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 > 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_32 > #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('#skF_32',type,
'#skF_32': ( $i * $i ) > $i ).
tff(sdtexdt0,type,
sdtexdt0: ( $i * $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_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('#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_862,hypothesis,
aSubsetOf0(xO,xS),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4998) ).
tff(f_852,hypothesis,
( aSet0(xO)
& isCountable0(xO) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4908) ).
tff(f_887,negated_conjecture,
~ ( ! [W0] :
( aElementOf0(W0,slbdtsldtrb0(xO,xK))
=> ( ( W0 != slcrc0 )
& aSubsetOf0(W0,szNzAzT0)
& aElementOf0(W0,szDzozmdt0(xc))
& ( sdtlpdtrp0(xc,W0) = szDzizrdt0(xd) ) ) )
=> ? [W0] :
( aElementOf0(W0,xT)
& ? [W1] :
( aSubsetOf0(W1,xS)
& isCountable0(W1)
& ! [W2] :
( aElementOf0(W2,slbdtsldtrb0(W1,xK))
=> ( sdtlpdtrp0(xc,W2) = W0 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
tff(f_846,hypothesis,
( aElementOf0(szDzizrdt0(xd),xT)
& isCountable0(sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4854) ).
tff(c_442,plain,
aSubsetOf0(xO,xS),
inference(cnfTransformation,[status(thm)],[f_862]) ).
tff(c_432,plain,
isCountable0(xO),
inference(cnfTransformation,[status(thm)],[f_852]) ).
tff(c_597,plain,
! [W0_451,W1_452] :
( aElementOf0('#skF_32'(W0_451,W1_452),slbdtsldtrb0(W1_452,xK))
| ~ isCountable0(W1_452)
| ~ aSubsetOf0(W1_452,xS)
| ~ aElementOf0(W0_451,xT) ),
inference(cnfTransformation,[status(thm)],[f_887]) ).
tff(c_448,plain,
! [W0_426] :
( ( sdtlpdtrp0(xc,W0_426) = szDzizrdt0(xd) )
| ~ aElementOf0(W0_426,slbdtsldtrb0(xO,xK)) ),
inference(cnfTransformation,[status(thm)],[f_887]) ).
tff(c_601,plain,
! [W0_451] :
( ( sdtlpdtrp0(xc,'#skF_32'(W0_451,xO)) = szDzizrdt0(xd) )
| ~ isCountable0(xO)
| ~ aSubsetOf0(xO,xS)
| ~ aElementOf0(W0_451,xT) ),
inference(resolution,[status(thm)],[c_597,c_448]) ).
tff(c_852,plain,
! [W0_479] :
( ( sdtlpdtrp0(xc,'#skF_32'(W0_479,xO)) = szDzizrdt0(xd) )
| ~ aElementOf0(W0_479,xT) ),
inference(demodulation,[status(thm),theory(equality)],[c_442,c_432,c_601]) ).
tff(c_444,plain,
! [W0_427,W1_431] :
( ( sdtlpdtrp0(xc,'#skF_32'(W0_427,W1_431)) != W0_427 )
| ~ isCountable0(W1_431)
| ~ aSubsetOf0(W1_431,xS)
| ~ aElementOf0(W0_427,xT) ),
inference(cnfTransformation,[status(thm)],[f_887]) ).
tff(c_858,plain,
! [W0_479] :
( ( szDzizrdt0(xd) != W0_479 )
| ~ isCountable0(xO)
| ~ aSubsetOf0(xO,xS)
| ~ aElementOf0(W0_479,xT)
| ~ aElementOf0(W0_479,xT) ),
inference(superposition,[status(thm),theory(equality)],[c_852,c_444]) ).
tff(c_866,plain,
~ aElementOf0(szDzizrdt0(xd),xT),
inference(demodulation,[status(thm),theory(equality)],[c_442,c_432,c_858]) ).
tff(c_426,plain,
aElementOf0(szDzizrdt0(xd),xT),
inference(cnfTransformation,[status(thm)],[f_846]) ).
tff(c_868,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_866,c_426]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM633+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.13/0.35 % Computer : n003.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.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Thu Aug 3 14:52:23 EDT 2023
% 0.13/0.36 % CPUTime :
% 6.96/2.51 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.96/2.51
% 6.96/2.51 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.96/2.54
% 6.96/2.54 Inference rules
% 6.96/2.54 ----------------------
% 6.96/2.54 #Ref : 0
% 6.96/2.54 #Sup : 85
% 6.96/2.54 #Fact : 0
% 6.96/2.54 #Define : 0
% 6.96/2.54 #Split : 4
% 6.96/2.54 #Chain : 0
% 6.96/2.54 #Close : 0
% 6.96/2.54
% 6.96/2.54 Ordering : KBO
% 6.96/2.54
% 6.96/2.54 Simplification rules
% 6.96/2.54 ----------------------
% 6.96/2.54 #Subsume : 5
% 6.96/2.54 #Demod : 59
% 6.96/2.54 #Tautology : 46
% 6.96/2.54 #SimpNegUnit : 1
% 6.96/2.54 #BackRed : 1
% 6.96/2.54
% 6.96/2.54 #Partial instantiations: 0
% 6.96/2.54 #Strategies tried : 1
% 6.96/2.54
% 6.96/2.54 Timing (in seconds)
% 6.96/2.54 ----------------------
% 6.96/2.54 Preprocessing : 0.92
% 6.96/2.54 Parsing : 0.44
% 6.96/2.54 CNF conversion : 0.09
% 6.96/2.54 Main loop : 0.57
% 6.96/2.54 Inferencing : 0.12
% 6.96/2.54 Reduction : 0.22
% 6.96/2.54 Demodulation : 0.15
% 6.96/2.54 BG Simplification : 0.08
% 6.96/2.54 Subsumption : 0.14
% 6.96/2.54 Abstraction : 0.03
% 6.96/2.54 MUC search : 0.00
% 6.96/2.54 Cooper : 0.00
% 6.96/2.54 Total : 1.53
% 6.96/2.54 Index Insertion : 0.00
% 6.96/2.54 Index Deletion : 0.00
% 6.96/2.54 Index Matching : 0.00
% 6.96/2.54 BG Taut test : 0.00
%------------------------------------------------------------------------------