TSTP Solution File: RNG103+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : RNG103+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 : n026.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 21.06s 10.00s
% Output : CNFRefutation 21.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 56
% Syntax : Number of formulae : 68 ( 10 unt; 51 typ; 0 def)
% Number of atoms : 31 ( 13 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 24 ( 10 ~; 8 |; 5 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 8 (; 8 !; 0 ?; 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_369,negated_conjecture,
sdtpldt0(xx,xy) != sdtasdt0(xc,sdtpldt0(xu,xv)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
tff(f_364,hypothesis,
( aElement0(xu)
& ( sdtasdt0(xc,xu) = xx ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1956) ).
tff(f_346,hypothesis,
aElement0(xc),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1905) ).
tff(f_367,hypothesis,
( aElement0(xv)
& ( sdtasdt0(xc,xv) = xy ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1979) ).
tff(f_103,axiom,
! [W0,W1,W2] :
( ( aElement0(W0)
& aElement0(W1)
& aElement0(W2) )
=> ( ( sdtasdt0(W0,sdtpldt0(W1,W2)) = sdtpldt0(sdtasdt0(W0,W1),sdtasdt0(W0,W2)) )
& ( sdtasdt0(sdtpldt0(W1,W2),W0) = sdtpldt0(sdtasdt0(W1,W0),sdtasdt0(W2,W0)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mAMDistr) ).
tff(c_230,plain,
sdtasdt0(xc,sdtpldt0(xu,xv)) != sdtpldt0(xx,xy),
inference(cnfTransformation,[status(thm)],[f_369]) ).
tff(c_224,plain,
aElement0(xu),
inference(cnfTransformation,[status(thm)],[f_364]) ).
tff(c_222,plain,
sdtasdt0(xc,xu) = xx,
inference(cnfTransformation,[status(thm)],[f_364]) ).
tff(c_206,plain,
aElement0(xc),
inference(cnfTransformation,[status(thm)],[f_346]) ).
tff(c_228,plain,
aElement0(xv),
inference(cnfTransformation,[status(thm)],[f_367]) ).
tff(c_226,plain,
sdtasdt0(xc,xv) = xy,
inference(cnfTransformation,[status(thm)],[f_367]) ).
tff(c_5157,plain,
! [W0_352,W1_353,W2_354] :
( ( sdtpldt0(sdtasdt0(W0_352,W1_353),sdtasdt0(W0_352,W2_354)) = sdtasdt0(W0_352,sdtpldt0(W1_353,W2_354)) )
| ~ aElement0(W2_354)
| ~ aElement0(W1_353)
| ~ aElement0(W0_352) ),
inference(cnfTransformation,[status(thm)],[f_103]) ).
tff(c_5523,plain,
! [W1_353] :
( ( sdtpldt0(sdtasdt0(xc,W1_353),xy) = sdtasdt0(xc,sdtpldt0(W1_353,xv)) )
| ~ aElement0(xv)
| ~ aElement0(W1_353)
| ~ aElement0(xc) ),
inference(superposition,[status(thm),theory(equality)],[c_226,c_5157]) ).
tff(c_29543,plain,
! [W1_502] :
( ( sdtpldt0(sdtasdt0(xc,W1_502),xy) = sdtasdt0(xc,sdtpldt0(W1_502,xv)) )
| ~ aElement0(W1_502) ),
inference(demodulation,[status(thm),theory(equality)],[c_206,c_228,c_5523]) ).
tff(c_29617,plain,
( ( sdtasdt0(xc,sdtpldt0(xu,xv)) = sdtpldt0(xx,xy) )
| ~ aElement0(xu) ),
inference(superposition,[status(thm),theory(equality)],[c_222,c_29543]) ).
tff(c_29648,plain,
sdtasdt0(xc,sdtpldt0(xu,xv)) = sdtpldt0(xx,xy),
inference(demodulation,[status(thm),theory(equality)],[c_224,c_29617]) ).
tff(c_29650,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_230,c_29648]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : RNG103+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.17/0.35 % Computer : n026.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 300
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Thu Aug 3 18:16:32 EDT 2023
% 0.17/0.35 % CPUTime :
% 21.06/10.00 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 21.06/10.01
% 21.06/10.01 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 21.06/10.03
% 21.06/10.03 Inference rules
% 21.06/10.03 ----------------------
% 21.06/10.03 #Ref : 0
% 21.06/10.03 #Sup : 6731
% 21.06/10.03 #Fact : 0
% 21.06/10.03 #Define : 0
% 21.06/10.03 #Split : 15
% 21.06/10.03 #Chain : 0
% 21.06/10.03 #Close : 0
% 21.06/10.03
% 21.06/10.03 Ordering : KBO
% 21.06/10.03
% 21.06/10.03 Simplification rules
% 21.06/10.03 ----------------------
% 21.06/10.03 #Subsume : 72
% 21.06/10.03 #Demod : 8255
% 21.06/10.03 #Tautology : 2182
% 21.06/10.03 #SimpNegUnit : 54
% 21.06/10.03 #BackRed : 0
% 21.06/10.03
% 21.06/10.03 #Partial instantiations: 0
% 21.06/10.03 #Strategies tried : 1
% 21.06/10.03
% 21.06/10.03 Timing (in seconds)
% 21.06/10.03 ----------------------
% 21.06/10.03 Preprocessing : 0.74
% 21.06/10.03 Parsing : 0.36
% 21.06/10.03 CNF conversion : 0.07
% 21.06/10.03 Main loop : 8.20
% 21.06/10.03 Inferencing : 1.55
% 21.06/10.03 Reduction : 4.66
% 21.06/10.03 Demodulation : 4.07
% 21.06/10.03 BG Simplification : 0.12
% 21.06/10.03 Subsumption : 1.51
% 21.06/10.03 Abstraction : 0.13
% 21.06/10.03 MUC search : 0.00
% 21.06/10.03 Cooper : 0.00
% 21.06/10.03 Total : 8.98
% 21.06/10.03 Index Insertion : 0.00
% 21.06/10.03 Index Deletion : 0.00
% 21.06/10.03 Index Matching : 0.00
% 21.06/10.03 BG Taut test : 0.00
%------------------------------------------------------------------------------