TSTP Solution File: NUM552+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM552+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 : n022.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:05 EDT 2023
% Result : Theorem 7.22s 2.65s
% Output : CNFRefutation 7.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 47
% Syntax : Number of formulae : 56 ( 6 unt; 44 typ; 0 def)
% Number of atoms : 64 ( 8 equ)
% Maximal formula atoms : 43 ( 5 avg)
% Number of connectives : 62 ( 10 ~; 8 |; 28 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 59 ( 34 >; 25 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 36 ( 36 usr; 10 con; 0-3 aty)
% Number of variables : 15 (; 14 !; 1 ?; 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 > 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
%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(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_637,hypothesis,
( aSet0(xQ)
& ! [W0] :
( aElementOf0(W0,xQ)
=> aElementOf0(W0,xS) )
& aSubsetOf0(xQ,xS)
& ( sbrdtbr0(xQ) = xk )
& aElementOf0(xQ,slbdtsldtrb0(xS,xk)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2270) ).
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(f_649,negated_conjecture,
~ ( aElementOf0(xx,xQ)
=> aElementOf0(xx,xT) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
tff(c_316,plain,
aElementOf0(xQ,slbdtsldtrb0(xS,xk)),
inference(cnfTransformation,[status(thm)],[f_637]) ).
tff(c_266,plain,
! [W0_175] :
( aElementOf0(W0_175,slbdtsldtrb0(xT,xk))
| ~ aElementOf0(W0_175,slbdtsldtrb0(xS,xk)) ),
inference(cnfTransformation,[status(thm)],[f_624]) ).
tff(c_336,plain,
~ aElementOf0(xx,xT),
inference(cnfTransformation,[status(thm)],[f_649]) ).
tff(c_338,plain,
aElementOf0(xx,xQ),
inference(cnfTransformation,[status(thm)],[f_649]) ).
tff(c_1698,plain,
! [W1_280,W0_281] :
( aElementOf0(W1_280,xT)
| ~ aElementOf0(W1_280,W0_281)
| ~ aElementOf0(W0_281,slbdtsldtrb0(xT,xk)) ),
inference(cnfTransformation,[status(thm)],[f_624]) ).
tff(c_1738,plain,
( aElementOf0(xx,xT)
| ~ aElementOf0(xQ,slbdtsldtrb0(xT,xk)) ),
inference(resolution,[status(thm)],[c_338,c_1698]) ).
tff(c_1762,plain,
~ aElementOf0(xQ,slbdtsldtrb0(xT,xk)),
inference(negUnitSimplification,[status(thm)],[c_336,c_1738]) ).
tff(c_1769,plain,
~ aElementOf0(xQ,slbdtsldtrb0(xS,xk)),
inference(resolution,[status(thm)],[c_266,c_1762]) ).
tff(c_1773,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_316,c_1769]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM552+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 : n022.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:29:03 EDT 2023
% 0.13/0.35 % CPUTime :
% 7.22/2.65 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.22/2.65
% 7.22/2.65 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 7.32/2.68
% 7.32/2.68 Inference rules
% 7.32/2.68 ----------------------
% 7.32/2.68 #Ref : 0
% 7.32/2.68 #Sup : 271
% 7.32/2.68 #Fact : 0
% 7.32/2.68 #Define : 0
% 7.32/2.68 #Split : 18
% 7.32/2.68 #Chain : 0
% 7.32/2.68 #Close : 0
% 7.32/2.68
% 7.32/2.68 Ordering : KBO
% 7.32/2.68
% 7.32/2.68 Simplification rules
% 7.32/2.68 ----------------------
% 7.32/2.68 #Subsume : 57
% 7.32/2.68 #Demod : 220
% 7.32/2.68 #Tautology : 92
% 7.32/2.68 #SimpNegUnit : 34
% 7.32/2.68 #BackRed : 44
% 7.32/2.68
% 7.32/2.68 #Partial instantiations: 0
% 7.32/2.68 #Strategies tried : 1
% 7.32/2.68
% 7.32/2.68 Timing (in seconds)
% 7.32/2.68 ----------------------
% 7.32/2.68 Preprocessing : 0.81
% 7.32/2.68 Parsing : 0.41
% 7.32/2.68 CNF conversion : 0.07
% 7.32/2.68 Main loop : 0.76
% 7.32/2.68 Inferencing : 0.23
% 7.32/2.68 Reduction : 0.25
% 7.32/2.68 Demodulation : 0.17
% 7.32/2.68 BG Simplification : 0.06
% 7.32/2.68 Subsumption : 0.17
% 7.32/2.68 Abstraction : 0.03
% 7.32/2.68 MUC search : 0.00
% 7.32/2.68 Cooper : 0.00
% 7.32/2.68 Total : 1.62
% 7.32/2.68 Index Insertion : 0.00
% 7.32/2.68 Index Deletion : 0.00
% 7.32/2.68 Index Matching : 0.00
% 7.32/2.68 BG Taut test : 0.00
%------------------------------------------------------------------------------