TSTP Solution File: RNG101+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : RNG101+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/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 : n020.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:57 EDT 2023
% Result : Theorem 4.37s 2.11s
% Output : CNFRefutation 4.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 51
% Syntax : Number of formulae : 56 ( 4 unt; 49 typ; 0 def)
% Number of atoms : 15 ( 6 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 12 ( 4 ~; 1 |; 7 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 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 : 38 ( 38 usr; 8 con; 0-4 aty)
% Number of variables : 4 (; 1 !; 3 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdteqdtlpzmzozddtrp0 > aGcdOfAnd0 > misRelativelyPrime0 > iLess0 > doDivides0 > aElementOf0 > aDivisorOf0 > aSet0 > aNaturalNumber0 > aIdeal0 > aElement0 > sdtpldt1 > sdtpldt0 > sdtasdt0 > sdtasasdt0 > #nlpp > smndt0 > slsdtgt0 > sbrdtbr0 > xz > xy > xx > 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('#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('#skF_10',type,
'#skF_10': ( $i * $i * $i ) > $i ).
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/sandbox/benchmark/theBenchmark.p',m__1933) ).
tff(f_366,negated_conjecture,
~ ? [W0] :
( aElement0(W0)
& ( sdtasdt0(xc,W0) = xx ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
tff(c_218,plain,
sdtasdt0(xc,'#skF_25') = xx,
inference(cnfTransformation,[status(thm)],[f_361]) ).
tff(c_220,plain,
aElement0('#skF_25'),
inference(cnfTransformation,[status(thm)],[f_361]) ).
tff(c_224,plain,
! [W0_223] :
( ( sdtasdt0(xc,W0_223) != xx )
| ~ aElement0(W0_223) ),
inference(cnfTransformation,[status(thm)],[f_366]) ).
tff(c_248,plain,
sdtasdt0(xc,'#skF_25') != xx,
inference(resolution,[status(thm)],[c_220,c_224]) ).
tff(c_258,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_218,c_248]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : RNG101+2 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.15 % 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.16/0.37 % Computer : n020.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Thu Aug 3 17:55:52 EDT 2023
% 0.16/0.37 % CPUTime :
% 4.37/2.11 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.37/2.11
% 4.37/2.11 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.37/2.14
% 4.37/2.14 Inference rules
% 4.37/2.14 ----------------------
% 4.37/2.14 #Ref : 0
% 4.37/2.14 #Sup : 10
% 4.37/2.14 #Fact : 0
% 4.37/2.14 #Define : 0
% 4.37/2.14 #Split : 0
% 4.37/2.14 #Chain : 0
% 4.37/2.14 #Close : 0
% 4.37/2.14
% 4.37/2.14 Ordering : KBO
% 4.37/2.14
% 4.37/2.14 Simplification rules
% 4.37/2.14 ----------------------
% 4.37/2.14 #Subsume : 0
% 4.37/2.14 #Demod : 1
% 4.37/2.14 #Tautology : 8
% 4.37/2.14 #SimpNegUnit : 0
% 4.37/2.14 #BackRed : 0
% 4.37/2.14
% 4.37/2.14 #Partial instantiations: 0
% 4.37/2.14 #Strategies tried : 1
% 4.37/2.14
% 4.37/2.14 Timing (in seconds)
% 4.37/2.14 ----------------------
% 4.37/2.14 Preprocessing : 0.72
% 4.37/2.14 Parsing : 0.34
% 4.37/2.14 CNF conversion : 0.07
% 4.37/2.14 Main loop : 0.26
% 4.37/2.14 Inferencing : 0.04
% 4.37/2.14 Reduction : 0.10
% 4.37/2.14 Demodulation : 0.07
% 4.37/2.14 BG Simplification : 0.05
% 4.37/2.14 Subsumption : 0.07
% 4.37/2.14 Abstraction : 0.02
% 4.37/2.14 MUC search : 0.00
% 4.37/2.14 Cooper : 0.00
% 4.37/2.14 Total : 1.03
% 4.37/2.14 Index Insertion : 0.00
% 4.37/2.14 Index Deletion : 0.00
% 4.37/2.14 Index Matching : 0.00
% 4.37/2.14 BG Taut test : 0.00
%------------------------------------------------------------------------------