TSTP Solution File: NUM557+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM557+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/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n006.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:06 EDT 2023
% Result : Theorem 8.37s 2.87s
% Output : CNFRefutation 8.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 46
% Syntax : Number of formulae : 56 ( 8 unt; 41 typ; 1 def)
% Number of atoms : 33 ( 5 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 31 ( 13 ~; 9 |; 6 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 56 ( 31 >; 25 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 33 ( 33 usr; 10 con; 0-3 aty)
% Number of variables : 8 (; 8 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdtlseqdt0 > iLess0 > aSubsetOf0 > aElementOf0 > isFinite0 > isCountable0 > aSet0 > aElement0 > slbdtsldtrb0 > sdtpldt0 > sdtmndt0 > #nlpp > szszuzczcdt0 > szmzizndt0 > szmzazxdt0 > slbdtrb0 > sbrdtbr0 > xy > xx > xk > xT > xS > xQ > xP > szNzAzT0 > sz00 > slcrc0 > #skF_7 > #skF_11 > #skF_6 > #skF_1 > #skF_4 > #skF_12 > #skF_5 > #skF_10 > #skF_8 > #skF_15 > #skF_13 > #skF_14 > #skF_3 > #skF_2 > #skF_9
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(xk,type,
xk: $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(aSet0,type,
aSet0: $i > $o ).
tff(szszuzczcdt0,type,
szszuzczcdt0: $i > $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i * $i ) > $i ).
tff(sdtmndt0,type,
sdtmndt0: ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(aElement0,type,
aElement0: $i > $o ).
tff(szNzAzT0,type,
szNzAzT0: $i ).
tff(sdtlseqdt0,type,
sdtlseqdt0: ( $i * $i ) > $o ).
tff(xS,type,
xS: $i ).
tff(sz00,type,
sz00: $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i * $i ) > $i ).
tff(xP,type,
xP: $i ).
tff(xy,type,
xy: $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(aSubsetOf0,type,
aSubsetOf0: ( $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': ( $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(aElementOf0,type,
aElementOf0: ( $i * $i ) > $o ).
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(isFinite0,type,
isFinite0: $i > $o ).
tff(xQ,type,
xQ: $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $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_9',type,
'#skF_9': ( $i * $i ) > $i ).
tff(slbdtrb0,type,
slbdtrb0: $i > $i ).
tff(f_526,hypothesis,
( aSet0(xS)
& aSet0(xT)
& ( xk != sz00 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2202_02) ).
tff(f_552,hypothesis,
( aSubsetOf0(xP,xS)
& ( sbrdtbr0(xP) = xk ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2431) ).
tff(f_520,hypothesis,
aElementOf0(xk,szNzAzT0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2202) ).
tff(f_487,definition,
! [W0,W1] :
( ( aSet0(W0)
& aElementOf0(W1,szNzAzT0) )
=> ! [W2] :
( ( W2 = slbdtsldtrb0(W0,W1) )
<=> ( aSet0(W2)
& ! [W3] :
( aElementOf0(W3,W2)
<=> ( aSubsetOf0(W3,W0)
& ( sbrdtbr0(W3) = W1 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSel) ).
tff(f_554,negated_conjecture,
~ aElementOf0(xP,slbdtsldtrb0(xS,xk)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
tff(c_258,plain,
aSet0(xS),
inference(cnfTransformation,[status(thm)],[f_526]) ).
tff(c_290,plain,
aSubsetOf0(xP,xS),
inference(cnfTransformation,[status(thm)],[f_552]) ).
tff(c_252,plain,
aElementOf0(xk,szNzAzT0),
inference(cnfTransformation,[status(thm)],[f_520]) ).
tff(c_288,plain,
sbrdtbr0(xP) = xk,
inference(cnfTransformation,[status(thm)],[f_552]) ).
tff(c_3216,plain,
! [W3_360,W0_361] :
( aElementOf0(W3_360,slbdtsldtrb0(W0_361,sbrdtbr0(W3_360)))
| ~ aSubsetOf0(W3_360,W0_361)
| ~ aElementOf0(sbrdtbr0(W3_360),szNzAzT0)
| ~ aSet0(W0_361) ),
inference(cnfTransformation,[status(thm)],[f_487]) ).
tff(c_3233,plain,
! [W0_361] :
( aElementOf0(xP,slbdtsldtrb0(W0_361,xk))
| ~ aSubsetOf0(xP,W0_361)
| ~ aElementOf0(sbrdtbr0(xP),szNzAzT0)
| ~ aSet0(W0_361) ),
inference(superposition,[status(thm),theory(equality)],[c_288,c_3216]) ).
tff(c_3303,plain,
! [W0_364] :
( aElementOf0(xP,slbdtsldtrb0(W0_364,xk))
| ~ aSubsetOf0(xP,W0_364)
| ~ aSet0(W0_364) ),
inference(demodulation,[status(thm),theory(equality)],[c_252,c_288,c_3233]) ).
tff(c_292,plain,
~ aElementOf0(xP,slbdtsldtrb0(xS,xk)),
inference(cnfTransformation,[status(thm)],[f_554]) ).
tff(c_3317,plain,
( ~ aSubsetOf0(xP,xS)
| ~ aSet0(xS) ),
inference(resolution,[status(thm)],[c_3303,c_292]) ).
tff(c_3329,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_258,c_290,c_3317]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM557+1 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.35 % Computer : n006.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 14:52:28 EDT 2023
% 0.13/0.35 % CPUTime :
% 8.37/2.87 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.37/2.87
% 8.37/2.87 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 8.57/2.90
% 8.57/2.90 Inference rules
% 8.57/2.90 ----------------------
% 8.57/2.90 #Ref : 1
% 8.57/2.90 #Sup : 582
% 8.57/2.90 #Fact : 0
% 8.57/2.90 #Define : 0
% 8.57/2.90 #Split : 30
% 8.57/2.90 #Chain : 0
% 8.57/2.90 #Close : 0
% 8.57/2.90
% 8.57/2.90 Ordering : KBO
% 8.57/2.90
% 8.57/2.90 Simplification rules
% 8.57/2.90 ----------------------
% 8.57/2.90 #Subsume : 106
% 8.57/2.90 #Demod : 576
% 8.57/2.90 #Tautology : 194
% 8.57/2.90 #SimpNegUnit : 35
% 8.57/2.90 #BackRed : 85
% 8.57/2.90
% 8.57/2.90 #Partial instantiations: 0
% 8.57/2.90 #Strategies tried : 1
% 8.57/2.90
% 8.57/2.90 Timing (in seconds)
% 8.57/2.90 ----------------------
% 8.57/2.90 Preprocessing : 0.75
% 8.57/2.90 Parsing : 0.37
% 8.57/2.90 CNF conversion : 0.07
% 8.57/2.90 Main loop : 1.10
% 8.57/2.90 Inferencing : 0.39
% 8.57/2.90 Reduction : 0.35
% 8.57/2.90 Demodulation : 0.24
% 8.57/2.90 BG Simplification : 0.07
% 8.57/2.90 Subsumption : 0.23
% 8.57/2.90 Abstraction : 0.04
% 8.57/2.90 MUC search : 0.00
% 8.57/2.90 Cooper : 0.00
% 8.57/2.90 Total : 1.90
% 8.57/2.90 Index Insertion : 0.00
% 8.57/2.90 Index Deletion : 0.00
% 8.57/2.90 Index Matching : 0.00
% 8.57/2.90 BG Taut test : 0.00
%------------------------------------------------------------------------------