TSTP Solution File: NUM547+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM547+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 : n016.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:04 EDT 2023
% Result : Theorem 4.33s 1.98s
% Output : CNFRefutation 4.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 45
% Syntax : Number of formulae : 48 ( 3 unt; 43 typ; 0 def)
% Number of atoms : 52 ( 8 equ)
% Maximal formula atoms : 43 ( 10 avg)
% Number of connectives : 51 ( 4 ~; 6 |; 26 &)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 60 ( 35 >; 25 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 35 ( 35 usr; 8 con; 0-3 aty)
% Number of variables : 14 (; 12 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdtlseqdt0 > iLess0 > aSubsetOf0 > aElementOf0 > isFinite0 > isCountable0 > aSet0 > aElement0 > slbdtsldtrb0 > sdtpldt0 > sdtmndt0 > #nlpp > szszuzczcdt0 > szmzizndt0 > szmzazxdt0 > slbdtrb0 > sbrdtbr0 > xx > xk > xT > xS > szNzAzT0 > sz00 > slcrc0 > #skF_7 > #skF_11 > #skF_16 > #skF_18 > #skF_17 > #skF_6 > #skF_19 > #skF_1 > #skF_4 > #skF_12 > #skF_5 > #skF_10 > #skF_8 > #skF_15 > #skF_13 > #skF_14 > #skF_3 > #skF_2 > #skF_9 > #skF_20
%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('#skF_16',type,
'#skF_16': $i > $i ).
tff(sbrdtbr0,type,
sbrdtbr0: $i > $i ).
tff(aSet0,type,
aSet0: $i > $o ).
tff(szszuzczcdt0,type,
szszuzczcdt0: $i > $i ).
tff('#skF_18',type,
'#skF_18': $i > $i ).
tff('#skF_17',type,
'#skF_17': $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i * $i ) > $i ).
tff('#skF_19',type,
'#skF_19': $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('#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('#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('#skF_20',type,
'#skF_20': $i > $i ).
tff(f_639,negated_conjecture,
~ ? [W0] :
( ( ( ( aSet0(W0)
& ! [W1] :
( aElementOf0(W1,W0)
=> aElementOf0(W1,xS) ) )
| aSubsetOf0(W0,xS) )
& ( sbrdtbr0(W0) = xk ) )
| aElementOf0(W0,slbdtsldtrb0(xS,xk)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
tff(f_624,hypothesis,
( aSet0(slbdtsldtrb0(xS,xk))
& ! [W0] :
( ( aElementOf0(W0,slbdtsldtrb0(xS,xk))
=> ( aSet0(W0)
& ! [W1] :
( aElementOf0(W1,W0)
=> aElementOf0(W1,xS) )
& aSubsetOf0(W0,xS)
& ( sbrdtbr0(W0) = xk ) ) )
& ( ( ( ( aSet0(W0)
& ! [W1] :
( aElementOf0(W1,W0)
=> aElementOf0(W1,xS) ) )
| aSubsetOf0(W0,xS) )
& ( sbrdtbr0(W0) = xk ) )
=> aElementOf0(W0,slbdtsldtrb0(xS,xk)) ) )
& aSet0(slbdtsldtrb0(xT,xk))
& ! [W0] :
( ( aElementOf0(W0,slbdtsldtrb0(xT,xk))
=> ( aSet0(W0)
& ! [W1] :
( aElementOf0(W1,W0)
=> aElementOf0(W1,xT) )
& aSubsetOf0(W0,xT)
& ( sbrdtbr0(W0) = xk ) ) )
& ( ( ( ( aSet0(W0)
& ! [W1] :
( aElementOf0(W1,W0)
=> aElementOf0(W1,xT) ) )
| aSubsetOf0(W0,xT) )
& ( sbrdtbr0(W0) = xk ) )
=> aElementOf0(W0,slbdtsldtrb0(xT,xk)) ) )
& ! [W0] :
( aElementOf0(W0,slbdtsldtrb0(xS,xk))
=> aElementOf0(W0,slbdtsldtrb0(xT,xk)) )
& aSubsetOf0(slbdtsldtrb0(xS,xk),slbdtsldtrb0(xT,xk))
& ~ ( ! [W0] :
( ( aElementOf0(W0,slbdtsldtrb0(xS,xk))
=> ( aSet0(W0)
& ! [W1] :
( aElementOf0(W1,W0)
=> aElementOf0(W1,xS) )
& aSubsetOf0(W0,xS)
& ( sbrdtbr0(W0) = xk ) ) )
& ( ( ( ( aSet0(W0)
& ! [W1] :
( aElementOf0(W1,W0)
=> aElementOf0(W1,xS) ) )
| aSubsetOf0(W0,xS) )
& ( sbrdtbr0(W0) = xk ) )
=> aElementOf0(W0,slbdtsldtrb0(xS,xk)) ) )
=> ( ~ ? [W0] : aElementOf0(W0,slbdtsldtrb0(xS,xk))
| ( slbdtsldtrb0(xS,xk) = slcrc0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2227) ).
tff(c_316,plain,
! [W0_184] : ~ aElementOf0(W0_184,slbdtsldtrb0(xS,xk)),
inference(cnfTransformation,[status(thm)],[f_639]) ).
tff(c_262,plain,
aElementOf0('#skF_17',slbdtsldtrb0(xS,xk)),
inference(cnfTransformation,[status(thm)],[f_624]) ).
tff(c_329,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_316,c_262]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM547+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 : n016.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:36:22 EDT 2023
% 0.13/0.36 % CPUTime :
% 4.33/1.98 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.33/1.98
% 4.33/1.98 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.38/2.01
% 4.38/2.01 Inference rules
% 4.38/2.01 ----------------------
% 4.38/2.01 #Ref : 0
% 4.38/2.01 #Sup : 0
% 4.38/2.01 #Fact : 0
% 4.38/2.01 #Define : 0
% 4.38/2.01 #Split : 0
% 4.38/2.01 #Chain : 0
% 4.38/2.01 #Close : 0
% 4.38/2.01
% 4.38/2.01 Ordering : KBO
% 4.38/2.01
% 4.38/2.01 Simplification rules
% 4.38/2.01 ----------------------
% 4.38/2.01 #Subsume : 154
% 4.38/2.01 #Demod : 0
% 4.38/2.01 #Tautology : 6
% 4.38/2.01 #SimpNegUnit : 7
% 4.38/2.01 #BackRed : 0
% 4.38/2.01
% 4.38/2.01 #Partial instantiations: 0
% 4.38/2.01 #Strategies tried : 1
% 4.38/2.01
% 4.38/2.01 Timing (in seconds)
% 4.38/2.01 ----------------------
% 4.38/2.01 Preprocessing : 0.77
% 4.38/2.01 Parsing : 0.38
% 4.38/2.01 CNF conversion : 0.07
% 4.38/2.01 Main loop : 0.09
% 4.38/2.01 Inferencing : 0.00
% 4.38/2.01 Reduction : 0.04
% 4.38/2.01 Demodulation : 0.03
% 4.38/2.01 BG Simplification : 0.06
% 4.38/2.01 Subsumption : 0.04
% 4.38/2.01 Abstraction : 0.02
% 4.38/2.01 MUC search : 0.00
% 4.38/2.01 Cooper : 0.00
% 4.38/2.01 Total : 0.91
% 4.38/2.01 Index Insertion : 0.00
% 4.38/2.01 Index Deletion : 0.00
% 4.38/2.01 Index Matching : 0.00
% 4.38/2.01 BG Taut test : 0.00
%------------------------------------------------------------------------------