TSTP Solution File: NUM613+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM613+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 : n018.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:20 EDT 2023
% Result : Theorem 9.44s 3.16s
% Output : CNFRefutation 9.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 74
% Syntax : Number of formulae : 88 ( 11 unt; 70 typ; 0 def)
% Number of atoms : 33 ( 21 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 26 ( 11 ~; 9 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 3 ( 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 : 61 ( 61 usr; 16 con; 0-4 aty)
% Number of variables : 6 (; 6 !; 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 > xp > xk > xe > xd > xc > xT > xS > xQ > xP > 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(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(xP,type,
xP: $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(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(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_884,negated_conjecture,
sbrdtbr0(xP) != xk,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
tff(f_708,hypothesis,
( aElementOf0(xk,szNzAzT0)
& ( szszuzczcdt0(xk) = xK ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3533) ).
tff(f_882,hypothesis,
( ( sbrdtbr0(xQ) = szszuzczcdt0(xk) )
& ( szszuzczcdt0(sbrdtbr0(xP)) = sbrdtbr0(xQ) )
& aElementOf0(sbrdtbr0(xP),szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5255) ).
tff(f_227,axiom,
! [W0,W1] :
( ( aElementOf0(W0,szNzAzT0)
& aElementOf0(W1,szNzAzT0) )
=> ( ( szszuzczcdt0(W0) = szszuzczcdt0(W1) )
=> ( W0 = W1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSuccEquSucc) ).
tff(c_474,plain,
sbrdtbr0(xP) != xk,
inference(cnfTransformation,[status(thm)],[f_884]) ).
tff(c_360,plain,
szszuzczcdt0(xk) = xK,
inference(cnfTransformation,[status(thm)],[f_708]) ).
tff(c_472,plain,
szszuzczcdt0(xk) = sbrdtbr0(xQ),
inference(cnfTransformation,[status(thm)],[f_882]) ).
tff(c_478,plain,
sbrdtbr0(xQ) = xK,
inference(demodulation,[status(thm),theory(equality)],[c_360,c_472]) ).
tff(c_470,plain,
szszuzczcdt0(sbrdtbr0(xP)) = sbrdtbr0(xQ),
inference(cnfTransformation,[status(thm)],[f_882]) ).
tff(c_479,plain,
szszuzczcdt0(sbrdtbr0(xP)) = xK,
inference(demodulation,[status(thm),theory(equality)],[c_478,c_470]) ).
tff(c_468,plain,
aElementOf0(sbrdtbr0(xP),szNzAzT0),
inference(cnfTransformation,[status(thm)],[f_882]) ).
tff(c_362,plain,
aElementOf0(xk,szNzAzT0),
inference(cnfTransformation,[status(thm)],[f_708]) ).
tff(c_3051,plain,
! [W1_612,W0_613] :
( ( W1_612 = W0_613 )
| ( szszuzczcdt0(W1_612) != szszuzczcdt0(W0_613) )
| ~ aElementOf0(W1_612,szNzAzT0)
| ~ aElementOf0(W0_613,szNzAzT0) ),
inference(cnfTransformation,[status(thm)],[f_227]) ).
tff(c_3061,plain,
! [W0_613] :
( ( xk = W0_613 )
| ( szszuzczcdt0(W0_613) != xK )
| ~ aElementOf0(xk,szNzAzT0)
| ~ aElementOf0(W0_613,szNzAzT0) ),
inference(superposition,[status(thm),theory(equality)],[c_360,c_3051]) ).
tff(c_3105,plain,
! [W0_615] :
( ( xk = W0_615 )
| ( szszuzczcdt0(W0_615) != xK )
| ~ aElementOf0(W0_615,szNzAzT0) ),
inference(demodulation,[status(thm),theory(equality)],[c_362,c_3061]) ).
tff(c_3138,plain,
( ( sbrdtbr0(xP) = xk )
| ( szszuzczcdt0(sbrdtbr0(xP)) != xK ) ),
inference(resolution,[status(thm)],[c_468,c_3105]) ).
tff(c_3168,plain,
sbrdtbr0(xP) = xk,
inference(demodulation,[status(thm),theory(equality)],[c_479,c_3138]) ).
tff(c_3170,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_474,c_3168]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : NUM613+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.15 % 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.15/0.37 % Computer : n018.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu Aug 3 15:07:20 EDT 2023
% 0.15/0.37 % CPUTime :
% 9.44/3.16 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.44/3.17
% 9.44/3.17 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 9.57/3.20
% 9.57/3.20 Inference rules
% 9.57/3.20 ----------------------
% 9.57/3.20 #Ref : 1
% 9.57/3.20 #Sup : 527
% 9.57/3.20 #Fact : 0
% 9.57/3.20 #Define : 0
% 9.57/3.20 #Split : 28
% 9.57/3.20 #Chain : 0
% 9.57/3.20 #Close : 0
% 9.57/3.20
% 9.57/3.20 Ordering : KBO
% 9.57/3.20
% 9.57/3.20 Simplification rules
% 9.57/3.20 ----------------------
% 9.57/3.20 #Subsume : 92
% 9.57/3.20 #Demod : 479
% 9.57/3.20 #Tautology : 163
% 9.57/3.20 #SimpNegUnit : 32
% 9.57/3.20 #BackRed : 78
% 9.57/3.20
% 9.57/3.20 #Partial instantiations: 0
% 9.57/3.20 #Strategies tried : 1
% 9.57/3.20
% 9.57/3.20 Timing (in seconds)
% 9.57/3.20 ----------------------
% 9.57/3.20 Preprocessing : 0.88
% 9.57/3.20 Parsing : 0.43
% 9.57/3.20 CNF conversion : 0.09
% 9.57/3.20 Main loop : 1.23
% 9.57/3.20 Inferencing : 0.37
% 9.57/3.20 Reduction : 0.46
% 9.57/3.20 Demodulation : 0.33
% 9.57/3.20 BG Simplification : 0.08
% 9.57/3.20 Subsumption : 0.24
% 9.57/3.20 Abstraction : 0.04
% 9.57/3.20 MUC search : 0.00
% 9.57/3.20 Cooper : 0.00
% 9.57/3.20 Total : 2.17
% 9.57/3.20 Index Insertion : 0.00
% 9.57/3.20 Index Deletion : 0.00
% 9.57/3.20 Index Matching : 0.00
% 9.57/3.20 BG Taut test : 0.00
%------------------------------------------------------------------------------