TSTP Solution File: NUM618+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM618+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 : n027.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 7.85s 2.81s
% Output : CNFRefutation 8.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 75
% Syntax : Number of formulae : 82 ( 3 unt; 72 typ; 0 def)
% Number of atoms : 19 ( 5 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 17 ( 8 ~; 4 |; 4 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 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 : 63 ( 63 usr; 18 con; 0-4 aty)
% Number of variables : 7 (; 5 !; 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 > xx > xp > xn > 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(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(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(xn,type,
xn: $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_861,hypothesis,
! [W0] :
( aElementOf0(W0,xO)
=> ? [W1] :
( aElementOf0(W1,szNzAzT0)
& aElementOf0(W1,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& ( sdtlpdtrp0(xe,W1) = W0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4982) ).
tff(f_894,negated_conjecture,
~ ? [W0] :
( aElementOf0(W0,szNzAzT0)
& ( xx = sdtlpdtrp0(xe,W0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
tff(f_889,hypothesis,
( aElementOf0(xx,szNzAzT0)
& aElementOf0(xx,xO) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5365) ).
tff(c_1420,plain,
! [W0_499] :
( ( sdtlpdtrp0(xe,'#skF_31'(W0_499)) = W0_499 )
| ~ aElementOf0(W0_499,xO) ),
inference(cnfTransformation,[status(thm)],[f_861]) ).
tff(c_897,plain,
! [W0_452] :
( aElementOf0('#skF_31'(W0_452),szNzAzT0)
| ~ aElementOf0(W0_452,xO) ),
inference(cnfTransformation,[status(thm)],[f_861]) ).
tff(c_486,plain,
! [W0_426] :
( ( sdtlpdtrp0(xe,W0_426) != xx )
| ~ aElementOf0(W0_426,szNzAzT0) ),
inference(cnfTransformation,[status(thm)],[f_894]) ).
tff(c_915,plain,
! [W0_452] :
( ( sdtlpdtrp0(xe,'#skF_31'(W0_452)) != xx )
| ~ aElementOf0(W0_452,xO) ),
inference(resolution,[status(thm)],[c_897,c_486]) ).
tff(c_1655,plain,
~ aElementOf0(xx,xO),
inference(superposition,[status(thm),theory(equality)],[c_1420,c_915]) ).
tff(c_482,plain,
aElementOf0(xx,xO),
inference(cnfTransformation,[status(thm)],[f_889]) ).
tff(c_1657,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_1655,c_482]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM618+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % 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.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 15:17:38 EDT 2023
% 0.13/0.34 % CPUTime :
% 7.85/2.81 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.85/2.82
% 7.85/2.82 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 8.20/2.84
% 8.20/2.84 Inference rules
% 8.20/2.84 ----------------------
% 8.20/2.84 #Ref : 0
% 8.20/2.84 #Sup : 225
% 8.20/2.84 #Fact : 0
% 8.20/2.84 #Define : 0
% 8.20/2.84 #Split : 17
% 8.20/2.84 #Chain : 0
% 8.20/2.84 #Close : 0
% 8.20/2.84
% 8.20/2.84 Ordering : KBO
% 8.20/2.84
% 8.20/2.84 Simplification rules
% 8.20/2.84 ----------------------
% 8.20/2.84 #Subsume : 46
% 8.20/2.84 #Demod : 224
% 8.20/2.84 #Tautology : 100
% 8.20/2.84 #SimpNegUnit : 6
% 8.20/2.84 #BackRed : 49
% 8.20/2.84
% 8.20/2.84 #Partial instantiations: 0
% 8.20/2.84 #Strategies tried : 1
% 8.20/2.84
% 8.20/2.84 Timing (in seconds)
% 8.20/2.84 ----------------------
% 8.51/2.85 Preprocessing : 0.93
% 8.51/2.85 Parsing : 0.46
% 8.51/2.85 CNF conversion : 0.09
% 8.51/2.85 Main loop : 0.87
% 8.51/2.85 Inferencing : 0.23
% 8.51/2.85 Reduction : 0.32
% 8.51/2.85 Demodulation : 0.22
% 8.51/2.85 BG Simplification : 0.08
% 8.51/2.85 Subsumption : 0.18
% 8.51/2.85 Abstraction : 0.03
% 8.51/2.85 MUC search : 0.00
% 8.51/2.85 Cooper : 0.00
% 8.51/2.85 Total : 1.85
% 8.51/2.85 Index Insertion : 0.00
% 8.51/2.85 Index Deletion : 0.00
% 8.51/2.85 Index Matching : 0.00
% 8.51/2.85 BG Taut test : 0.00
%------------------------------------------------------------------------------