TSTP Solution File: RNG105+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : RNG105+2 : 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 : n019.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:54:58 EDT 2023
% Result : Theorem 7.29s 2.73s
% Output : CNFRefutation 7.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 60
% Syntax : Number of formulae : 82 ( 15 unt; 51 typ; 0 def)
% Number of atoms : 64 ( 16 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 58 ( 25 ~; 18 |; 13 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 88 ( 41 >; 47 *; 0 +; 0 <<)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 40 ( 40 usr; 10 con; 0-4 aty)
% Number of variables : 18 (; 14 !; 4 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdteqdtlpzmzozddtrp0 > aGcdOfAnd0 > misRelativelyPrime0 > iLess0 > doDivides0 > aElementOf0 > aDivisorOf0 > aSet0 > aNaturalNumber0 > aIdeal0 > aElement0 > sdtpldt1 > sdtpldt0 > sdtasdt0 > sdtasasdt0 > #nlpp > smndt0 > slsdtgt0 > sbrdtbr0 > xz > xy > xx > xv > xu > xc > sz10 > sz00 > #skF_22 > #skF_6 > #skF_17 > #skF_25 > #skF_20 > #skF_4 > #skF_8 > #skF_14 > #skF_15 > #skF_18 > #skF_23 > #skF_5 > #skF_19 > #skF_7 > #skF_9 > #skF_13 > #skF_11 > #skF_3 > #skF_2 > #skF_24 > #skF_12 > #skF_1 > #skF_16 > #skF_21 > #skF_10
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_22',type,
'#skF_22': ( $i * $i ) > $i ).
tff(sbrdtbr0,type,
sbrdtbr0: $i > $i ).
tff(sdtasdt0,type,
sdtasdt0: ( $i * $i ) > $i ).
tff(aSet0,type,
aSet0: $i > $o ).
tff('#skF_6',type,
'#skF_6': ( $i * $i * $i ) > $i ).
tff(sz10,type,
sz10: $i ).
tff(sdtpldt1,type,
sdtpldt1: ( $i * $i ) > $i ).
tff('#skF_17',type,
'#skF_17': ( $i * $i ) > $i ).
tff('#skF_25',type,
'#skF_25': $i ).
tff('#skF_20',type,
'#skF_20': ( $i * $i ) > $i ).
tff(aElement0,type,
aElement0: $i > $o ).
tff(sz00,type,
sz00: $i ).
tff(misRelativelyPrime0,type,
misRelativelyPrime0: ( $i * $i ) > $o ).
tff(xu,type,
xu: $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i * $i ) > $i ).
tff(aIdeal0,type,
aIdeal0: $i > $o ).
tff(xc,type,
xc: $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $i * $i * $i ) > $i ).
tff('#skF_14',type,
'#skF_14': ( $i * $i ) > $i ).
tff('#skF_15',type,
'#skF_15': ( $i * $i * $i * $i ) > $i ).
tff(xy,type,
xy: $i ).
tff(sdtpldt0,type,
sdtpldt0: ( $i * $i ) > $i ).
tff('#skF_18',type,
'#skF_18': ( $i * $i ) > $i ).
tff(xx,type,
xx: $i ).
tff('#skF_23',type,
'#skF_23': ( $i * $i * $i ) > $i ).
tff(aNaturalNumber0,type,
aNaturalNumber0: $i > $o ).
tff(slsdtgt0,type,
slsdtgt0: $i > $i ).
tff(smndt0,type,
smndt0: $i > $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i * $i ) > $i ).
tff('#skF_19',type,
'#skF_19': ( $i * $i * $i ) > $i ).
tff('#skF_7',type,
'#skF_7': ( $i * $i * $i * $i ) > $i ).
tff(doDivides0,type,
doDivides0: ( $i * $i ) > $o ).
tff(aGcdOfAnd0,type,
aGcdOfAnd0: ( $i * $i * $i ) > $o ).
tff(aElementOf0,type,
aElementOf0: ( $i * $i ) > $o ).
tff(xz,type,
xz: $i ).
tff('#skF_9',type,
'#skF_9': ( $i * $i * $i ) > $i ).
tff('#skF_13',type,
'#skF_13': $i > $i ).
tff('#skF_11',type,
'#skF_11': $i > $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i * $i ) > $i ).
tff(aDivisorOf0,type,
aDivisorOf0: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff('#skF_24',type,
'#skF_24': $i ).
tff(sdtasasdt0,type,
sdtasasdt0: ( $i * $i ) > $i ).
tff(iLess0,type,
iLess0: ( $i * $i ) > $o ).
tff('#skF_12',type,
'#skF_12': $i > $i ).
tff(sdteqdtlpzmzozddtrp0,type,
sdteqdtlpzmzozddtrp0: ( $i * $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff('#skF_16',type,
'#skF_16': ( $i * $i ) > $i ).
tff('#skF_21',type,
'#skF_21': ( $i * $i ) > $i ).
tff(xv,type,
xv: $i ).
tff('#skF_10',type,
'#skF_10': ( $i * $i * $i ) > $i ).
tff(f_364,hypothesis,
( aElement0(xu)
& ( sdtasdt0(xc,xu) = xx ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1956) ).
tff(f_367,hypothesis,
( aElement0(xv)
& ( sdtasdt0(xc,xv) = xy ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1979) ).
tff(f_368,hypothesis,
sdtpldt0(xx,xy) = sdtasdt0(xc,sdtpldt0(xu,xv)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2010) ).
tff(f_41,axiom,
! [W0,W1] :
( ( aElement0(W0)
& aElement0(W1) )
=> aElement0(sdtpldt0(W0,W1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsB) ).
tff(f_369,hypothesis,
sdtasdt0(xz,xx) = sdtasdt0(xc,sdtasdt0(xu,xz)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2043) ).
tff(f_361,hypothesis,
( ? [W0] :
( aElement0(W0)
& ( sdtasdt0(xc,W0) = xx ) )
& aElementOf0(xx,slsdtgt0(xc))
& ? [W0] :
( aElement0(W0)
& ( sdtasdt0(xc,W0) = xy ) )
& aElementOf0(xy,slsdtgt0(xc))
& aElement0(xz) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1933) ).
tff(f_47,axiom,
! [W0,W1] :
( ( aElement0(W0)
& aElement0(W1) )
=> aElement0(sdtasdt0(W0,W1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsB_02) ).
tff(f_346,hypothesis,
aElement0(xc),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1905) ).
tff(f_383,negated_conjecture,
~ ( ( ? [W0] :
( aElement0(W0)
& ( sdtasdt0(xc,W0) = sdtpldt0(xx,xy) ) )
| aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc)) )
& ( ? [W0] :
( aElement0(W0)
& ( sdtasdt0(xc,W0) = sdtasdt0(xz,xx) ) )
| aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
tff(c_224,plain,
aElement0(xu),
inference(cnfTransformation,[status(thm)],[f_364]) ).
tff(c_228,plain,
aElement0(xv),
inference(cnfTransformation,[status(thm)],[f_367]) ).
tff(c_230,plain,
sdtasdt0(xc,sdtpldt0(xu,xv)) = sdtpldt0(xx,xy),
inference(cnfTransformation,[status(thm)],[f_368]) ).
tff(c_2585,plain,
! [W0_302,W1_303] :
( aElement0(sdtpldt0(W0_302,W1_303))
| ~ aElement0(W1_303)
| ~ aElement0(W0_302) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_232,plain,
sdtasdt0(xc,sdtasdt0(xu,xz)) = sdtasdt0(xz,xx),
inference(cnfTransformation,[status(thm)],[f_369]) ).
tff(c_208,plain,
aElement0(xz),
inference(cnfTransformation,[status(thm)],[f_361]) ).
tff(c_12,plain,
! [W0_5,W1_6] :
( aElement0(sdtasdt0(W0_5,W1_6))
| ~ aElement0(W1_6)
| ~ aElement0(W0_5) ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_206,plain,
aElement0(xc),
inference(cnfTransformation,[status(thm)],[f_346]) ).
tff(c_1163,plain,
( aElement0(sdtasdt0(xz,xx))
| ~ aElement0(sdtasdt0(xu,xz))
| ~ aElement0(xc) ),
inference(superposition,[status(thm),theory(equality)],[c_232,c_12]) ).
tff(c_1167,plain,
( aElement0(sdtasdt0(xz,xx))
| ~ aElement0(sdtasdt0(xu,xz)) ),
inference(demodulation,[status(thm),theory(equality)],[c_206,c_1163]) ).
tff(c_1628,plain,
~ aElement0(sdtasdt0(xu,xz)),
inference(splitLeft,[status(thm)],[c_1167]) ).
tff(c_1631,plain,
( ~ aElement0(xz)
| ~ aElement0(xu) ),
inference(resolution,[status(thm)],[c_12,c_1628]) ).
tff(c_1635,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_224,c_208,c_1631]) ).
tff(c_1637,plain,
aElement0(sdtasdt0(xu,xz)),
inference(splitRight,[status(thm)],[c_1167]) ).
tff(c_240,plain,
! [W0_221,W0_222] :
( ( sdtpldt0(xx,xy) != sdtasdt0(xc,W0_221) )
| ~ aElement0(W0_221)
| ( sdtasdt0(xz,xx) != sdtasdt0(xc,W0_222) )
| ~ aElement0(W0_222) ),
inference(cnfTransformation,[status(thm)],[f_383]) ).
tff(c_434,plain,
! [W0_222] :
( ( sdtasdt0(xz,xx) != sdtasdt0(xc,W0_222) )
| ~ aElement0(W0_222) ),
inference(splitLeft,[status(thm)],[c_240]) ).
tff(c_1725,plain,
sdtasdt0(xc,sdtasdt0(xu,xz)) != sdtasdt0(xz,xx),
inference(resolution,[status(thm)],[c_1637,c_434]) ).
tff(c_1748,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_232,c_1725]) ).
tff(c_1749,plain,
! [W0_221] :
( ( sdtpldt0(xx,xy) != sdtasdt0(xc,W0_221) )
| ~ aElement0(W0_221) ),
inference(splitRight,[status(thm)],[c_240]) ).
tff(c_2801,plain,
! [W0_307,W1_308] :
( ( sdtasdt0(xc,sdtpldt0(W0_307,W1_308)) != sdtpldt0(xx,xy) )
| ~ aElement0(W1_308)
| ~ aElement0(W0_307) ),
inference(resolution,[status(thm)],[c_2585,c_1749]) ).
tff(c_2807,plain,
( ~ aElement0(xv)
| ~ aElement0(xu) ),
inference(superposition,[status(thm),theory(equality)],[c_230,c_2801]) ).
tff(c_2876,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_224,c_228,c_2807]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : RNG105+2 : 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.18/0.35 % Computer : n019.cluster.edu
% 0.18/0.35 % Model : x86_64 x86_64
% 0.18/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.35 % Memory : 8042.1875MB
% 0.18/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.35 % CPULimit : 300
% 0.18/0.36 % WCLimit : 300
% 0.18/0.36 % DateTime : Thu Aug 3 18:04:16 EDT 2023
% 0.18/0.36 % CPUTime :
% 7.29/2.73 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.29/2.74
% 7.29/2.74 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.38/2.77
% 7.38/2.77 Inference rules
% 7.38/2.77 ----------------------
% 7.38/2.77 #Ref : 0
% 7.38/2.77 #Sup : 703
% 7.38/2.77 #Fact : 0
% 7.38/2.77 #Define : 0
% 7.38/2.77 #Split : 9
% 7.38/2.77 #Chain : 0
% 7.38/2.77 #Close : 0
% 7.38/2.77
% 7.38/2.77 Ordering : KBO
% 7.38/2.77
% 7.38/2.77 Simplification rules
% 7.38/2.77 ----------------------
% 7.38/2.77 #Subsume : 17
% 7.38/2.77 #Demod : 507
% 7.38/2.77 #Tautology : 426
% 7.38/2.77 #SimpNegUnit : 0
% 7.38/2.77 #BackRed : 0
% 7.38/2.77
% 7.38/2.77 #Partial instantiations: 0
% 7.38/2.77 #Strategies tried : 1
% 7.38/2.77
% 7.38/2.77 Timing (in seconds)
% 7.38/2.77 ----------------------
% 7.38/2.77 Preprocessing : 0.71
% 7.38/2.77 Parsing : 0.34
% 7.38/2.77 CNF conversion : 0.07
% 7.38/2.77 Main loop : 0.86
% 7.38/2.77 Inferencing : 0.30
% 7.38/2.77 Reduction : 0.28
% 7.38/2.77 Demodulation : 0.20
% 7.38/2.77 BG Simplification : 0.06
% 7.38/2.77 Subsumption : 0.16
% 7.38/2.77 Abstraction : 0.03
% 7.38/2.77 MUC search : 0.00
% 7.38/2.77 Cooper : 0.00
% 7.38/2.77 Total : 1.62
% 7.38/2.77 Index Insertion : 0.00
% 7.38/2.77 Index Deletion : 0.00
% 7.38/2.77 Index Matching : 0.00
% 7.38/2.77 BG Taut test : 0.00
%------------------------------------------------------------------------------