TSTP Solution File: NUM549+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM549+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 : n017.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.76s 2.19s
% Output : CNFRefutation 4.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 45
% Syntax : Number of formulae : 67 ( 14 unt; 39 typ; 1 def)
% Number of atoms : 51 ( 20 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 39 ( 16 ~; 12 |; 6 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 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 : 31 ( 31 usr; 8 con; 0-3 aty)
% Number of variables : 11 (; 9 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdtlseqdt0 > iLess0 > aSubsetOf0 > aElementOf0 > isFinite0 > isCountable0 > aSet0 > aElement0 > slbdtsldtrb0 > sdtpldt0 > sdtmndt0 > #nlpp > szszuzczcdt0 > szmzizndt0 > szmzazxdt0 > slbdtrb0 > sbrdtbr0 > xx > xk > xT > xS > xQ > 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('#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_52,definition,
! [W0] :
( ( W0 = slcrc0 )
<=> ( aSet0(W0)
& ~ ? [W1] : aElementOf0(W1,W0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefEmp) ).
tff(f_330,axiom,
! [W0] :
( aSet0(W0)
=> ( ( sbrdtbr0(W0) = sz00 )
<=> ( W0 = slcrc0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mCardEmpty) ).
tff(f_537,hypothesis,
( aSet0(xQ)
& isFinite0(xQ)
& ( sbrdtbr0(xQ) = xk ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2291) ).
tff(f_39,axiom,
! [W0] :
( aSet0(W0)
=> ! [W1] :
( aElementOf0(W1,W0)
=> aElement0(W1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEOfElem) ).
tff(f_542,negated_conjecture,
~ ? [W0] :
( aElement0(W0)
& aElementOf0(W0,xQ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
tff(c_254,plain,
xk != sz00,
inference(cnfTransformation,[status(thm)],[f_526]) ).
tff(c_14,plain,
aSet0(slcrc0),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_154,plain,
( ( sbrdtbr0(slcrc0) = sz00 )
| ~ aSet0(slcrc0) ),
inference(cnfTransformation,[status(thm)],[f_330]) ).
tff(c_278,plain,
sbrdtbr0(slcrc0) = sz00,
inference(demodulation,[status(thm),theory(equality)],[c_14,c_154]) ).
tff(c_272,plain,
aSet0(xQ),
inference(cnfTransformation,[status(thm)],[f_537]) ).
tff(c_457,plain,
! [W0_194] :
( ( slcrc0 = W0_194 )
| aElementOf0('#skF_1'(W0_194),W0_194)
| ~ aSet0(W0_194) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_6,plain,
! [W1_5,W0_3] :
( aElement0(W1_5)
| ~ aElementOf0(W1_5,W0_3)
| ~ aSet0(W0_3) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_500,plain,
! [W0_197] :
( aElement0('#skF_1'(W0_197))
| ( slcrc0 = W0_197 )
| ~ aSet0(W0_197) ),
inference(resolution,[status(thm)],[c_457,c_6]) ).
tff(c_274,plain,
! [W0_171] :
( ~ aElementOf0(W0_171,xQ)
| ~ aElement0(W0_171) ),
inference(cnfTransformation,[status(thm)],[f_542]) ).
tff(c_476,plain,
( ~ aElement0('#skF_1'(xQ))
| ( xQ = slcrc0 )
| ~ aSet0(xQ) ),
inference(resolution,[status(thm)],[c_457,c_274]) ).
tff(c_490,plain,
( ~ aElement0('#skF_1'(xQ))
| ( xQ = slcrc0 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_272,c_476]) ).
tff(c_491,plain,
~ aElement0('#skF_1'(xQ)),
inference(splitLeft,[status(thm)],[c_490]) ).
tff(c_503,plain,
( ( xQ = slcrc0 )
| ~ aSet0(xQ) ),
inference(resolution,[status(thm)],[c_500,c_491]) ).
tff(c_506,plain,
xQ = slcrc0,
inference(demodulation,[status(thm),theory(equality)],[c_272,c_503]) ).
tff(c_268,plain,
sbrdtbr0(xQ) = xk,
inference(cnfTransformation,[status(thm)],[f_537]) ).
tff(c_515,plain,
sbrdtbr0(slcrc0) = xk,
inference(demodulation,[status(thm),theory(equality)],[c_506,c_268]) ).
tff(c_519,plain,
xk = sz00,
inference(demodulation,[status(thm),theory(equality)],[c_278,c_515]) ).
tff(c_521,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_254,c_519]) ).
tff(c_522,plain,
xQ = slcrc0,
inference(splitRight,[status(thm)],[c_490]) ).
tff(c_526,plain,
sbrdtbr0(slcrc0) = xk,
inference(demodulation,[status(thm),theory(equality)],[c_522,c_268]) ).
tff(c_530,plain,
xk = sz00,
inference(demodulation,[status(thm),theory(equality)],[c_278,c_526]) ).
tff(c_532,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_254,c_530]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM549+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/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.14/0.35 % Computer : n017.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 14:28:06 EDT 2023
% 0.14/0.35 % CPUTime :
% 4.76/2.19 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.76/2.20
% 4.76/2.20 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.76/2.22
% 4.76/2.22 Inference rules
% 4.76/2.22 ----------------------
% 4.76/2.22 #Ref : 0
% 4.76/2.22 #Sup : 44
% 4.76/2.22 #Fact : 0
% 4.76/2.22 #Define : 0
% 4.76/2.22 #Split : 7
% 4.76/2.22 #Chain : 0
% 4.76/2.22 #Close : 0
% 4.76/2.22
% 4.76/2.22 Ordering : KBO
% 4.76/2.22
% 4.76/2.22 Simplification rules
% 4.76/2.22 ----------------------
% 4.76/2.22 #Subsume : 5
% 4.76/2.22 #Demod : 40
% 4.76/2.22 #Tautology : 22
% 4.76/2.22 #SimpNegUnit : 3
% 4.76/2.22 #BackRed : 13
% 4.76/2.22
% 4.76/2.22 #Partial instantiations: 0
% 4.76/2.22 #Strategies tried : 1
% 4.76/2.22
% 4.76/2.22 Timing (in seconds)
% 4.76/2.22 ----------------------
% 4.76/2.23 Preprocessing : 0.74
% 4.76/2.23 Parsing : 0.37
% 4.76/2.23 CNF conversion : 0.07
% 4.76/2.23 Main loop : 0.43
% 4.76/2.23 Inferencing : 0.11
% 4.76/2.23 Reduction : 0.14
% 4.76/2.23 Demodulation : 0.10
% 4.76/2.23 BG Simplification : 0.05
% 4.76/2.23 Subsumption : 0.11
% 4.76/2.23 Abstraction : 0.02
% 4.76/2.23 MUC search : 0.00
% 4.76/2.23 Cooper : 0.00
% 4.76/2.23 Total : 1.21
% 4.76/2.23 Index Insertion : 0.00
% 4.76/2.23 Index Deletion : 0.00
% 4.76/2.23 Index Matching : 0.00
% 4.76/2.23 BG Taut test : 0.00
%------------------------------------------------------------------------------