TSTP Solution File: RNG121+4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : RNG121+4 : 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 : n007.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:55:02 EDT 2023
% Result : Theorem 7.30s 2.67s
% Output : CNFRefutation 7.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 77
% Syntax : Number of formulae : 85 ( 5 unt; 73 typ; 0 def)
% Number of atoms : 36 ( 11 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 31 ( 7 ~; 6 |; 17 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 95 ( 48 >; 47 *; 0 +; 0 <<)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 62 ( 62 usr; 25 con; 0-4 aty)
% Number of variables : 12 (; 4 !; 8 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdteqdtlpzmzozddtrp0 > aGcdOfAnd0 > misRelativelyPrime0 > iLess0 > doDivides0 > aElementOf0 > aDivisorOf0 > aSet0 > aNaturalNumber0 > aIdeal0 > aElement0 > sdtpldt1 > sdtpldt0 > sdtasdt0 > sdtasasdt0 > #nlpp > smndt0 > slsdtgt0 > sbrdtbr0 > xu > xr > xq > xc > xb > xa > xI > sz10 > sz00 > #skF_33 > #skF_41 > #skF_22 > #skF_24 > #skF_6 > #skF_31 > #skF_17 > #skF_25 > #skF_20 > #skF_36 > #skF_43 > #skF_40 > #skF_4 > #skF_37 > #skF_8 > #skF_14 > #skF_15 > #skF_29 > #skF_26 > #skF_18 > #skF_45 > #skF_23 > #skF_28 > #skF_46 > #skF_5 > #skF_19 > #skF_38 > #skF_7 > #skF_32 > #skF_39 > #skF_9 > #skF_13 > #skF_42 > #skF_11 > #skF_3 > #skF_2 > #skF_35 > #skF_27 > #skF_44 > #skF_12 > #skF_1 > #skF_16 > #skF_21 > #skF_30 > #skF_10 > #skF_34
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_33',type,
'#skF_33': $i ).
tff('#skF_41',type,
'#skF_41': $i ).
tff(xq,type,
xq: $i ).
tff('#skF_22',type,
'#skF_22': ( $i * $i ) > $i ).
tff(xr,type,
xr: $i ).
tff(sbrdtbr0,type,
sbrdtbr0: $i > $i ).
tff(sdtasdt0,type,
sdtasdt0: ( $i * $i ) > $i ).
tff(aSet0,type,
aSet0: $i > $o ).
tff('#skF_24',type,
'#skF_24': $i > $i ).
tff(xa,type,
xa: $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i * $i ) > $i ).
tff(sz10,type,
sz10: $i ).
tff('#skF_31',type,
'#skF_31': $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('#skF_36',type,
'#skF_36': $i ).
tff(sz00,type,
sz00: $i ).
tff('#skF_43',type,
'#skF_43': $i ).
tff(misRelativelyPrime0,type,
misRelativelyPrime0: ( $i * $i ) > $o ).
tff(xu,type,
xu: $i ).
tff('#skF_40',type,
'#skF_40': $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i * $i ) > $i ).
tff('#skF_37',type,
'#skF_37': $i ).
tff(aIdeal0,type,
aIdeal0: $i > $o ).
tff(xI,type,
xI: $i ).
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('#skF_29',type,
'#skF_29': $i > $i ).
tff('#skF_26',type,
'#skF_26': $i ).
tff(sdtpldt0,type,
sdtpldt0: ( $i * $i ) > $i ).
tff('#skF_18',type,
'#skF_18': ( $i * $i ) > $i ).
tff('#skF_45',type,
'#skF_45': $i ).
tff('#skF_23',type,
'#skF_23': ( $i * $i * $i ) > $i ).
tff(aNaturalNumber0,type,
aNaturalNumber0: $i > $o ).
tff('#skF_28',type,
'#skF_28': $i > $i ).
tff('#skF_46',type,
'#skF_46': $i ).
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_38',type,
'#skF_38': $i > $i ).
tff('#skF_7',type,
'#skF_7': ( $i * $i * $i * $i ) > $i ).
tff(doDivides0,type,
doDivides0: ( $i * $i ) > $o ).
tff('#skF_32',type,
'#skF_32': $i ).
tff(aGcdOfAnd0,type,
aGcdOfAnd0: ( $i * $i * $i ) > $o ).
tff(aElementOf0,type,
aElementOf0: ( $i * $i ) > $o ).
tff('#skF_39',type,
'#skF_39': $i > $i ).
tff(xb,type,
xb: $i ).
tff('#skF_9',type,
'#skF_9': ( $i * $i * $i ) > $i ).
tff('#skF_13',type,
'#skF_13': $i > $i ).
tff('#skF_42',type,
'#skF_42': $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_35',type,
'#skF_35': $i ).
tff(sdtasasdt0,type,
sdtasasdt0: ( $i * $i ) > $i ).
tff(iLess0,type,
iLess0: ( $i * $i ) > $o ).
tff('#skF_27',type,
'#skF_27': $i > $i ).
tff('#skF_44',type,
'#skF_44': $i ).
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_30',type,
'#skF_30': $i > $i ).
tff('#skF_10',type,
'#skF_10': ( $i * $i * $i ) > $i ).
tff('#skF_34',type,
'#skF_34': $i ).
tff(f_479,hypothesis,
( ? [W0] :
( aElement0(W0)
& ( sdtasdt0(xa,W0) = sz00 ) )
& aElementOf0(sz00,slsdtgt0(xa))
& ? [W0] :
( aElement0(W0)
& ( sdtasdt0(xa,W0) = xa ) )
& aElementOf0(xa,slsdtgt0(xa))
& ? [W0] :
( aElement0(W0)
& ( sdtasdt0(xb,W0) = sz00 ) )
& aElementOf0(sz00,slsdtgt0(xb))
& ? [W0] :
( aElement0(W0)
& ( sdtasdt0(xb,W0) = xb ) )
& aElementOf0(xb,slsdtgt0(xb)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2203) ).
tff(f_352,hypothesis,
( aElement0(xa)
& aElement0(xb) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2091) ).
tff(f_67,axiom,
! [W0] :
( aElement0(W0)
=> ( ( sdtpldt0(W0,sz00) = W0 )
& ( W0 = sdtpldt0(sz00,W0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mAddZero) ).
tff(f_608,negated_conjecture,
~ ( ? [W0,W1] :
( aElementOf0(W0,slsdtgt0(xa))
& aElementOf0(W1,slsdtgt0(xb))
& ( sdtpldt0(W0,W1) = xb ) )
| ? [W0,W1] :
( aElementOf0(W0,slsdtgt0(xa))
& aElementOf0(W1,slsdtgt0(xb))
& ( sdtpldt0(W0,W1) = xb ) )
| aElementOf0(xb,xI) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
tff(c_338,plain,
aElementOf0(sz00,slsdtgt0(xa)),
inference(cnfTransformation,[status(thm)],[f_479]) ).
tff(c_320,plain,
aElementOf0(xb,slsdtgt0(xb)),
inference(cnfTransformation,[status(thm)],[f_479]) ).
tff(c_208,plain,
aElement0(xb),
inference(cnfTransformation,[status(thm)],[f_352]) ).
tff(c_919,plain,
! [W0_288] :
( ( sdtpldt0(sz00,W0_288) = W0_288 )
| ~ aElement0(W0_288) ),
inference(cnfTransformation,[status(thm)],[f_67]) ).
tff(c_983,plain,
sdtpldt0(sz00,xb) = xb,
inference(resolution,[status(thm)],[c_208,c_919]) ).
tff(c_434,plain,
! [W0_276,W1_277] :
( ( sdtpldt0(W0_276,W1_277) != xb )
| ~ aElementOf0(W1_277,slsdtgt0(xb))
| ~ aElementOf0(W0_276,slsdtgt0(xa)) ),
inference(cnfTransformation,[status(thm)],[f_608]) ).
tff(c_1113,plain,
( ~ aElementOf0(xb,slsdtgt0(xb))
| ~ aElementOf0(sz00,slsdtgt0(xa)) ),
inference(superposition,[status(thm),theory(equality)],[c_983,c_434]) ).
tff(c_1119,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_338,c_320,c_1113]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : RNG121+4 : 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.15/0.36 % Computer : n007.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 17:52:24 EDT 2023
% 0.15/0.36 % CPUTime :
% 7.30/2.67 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.30/2.68
% 7.30/2.68 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.40/2.72
% 7.40/2.72 Inference rules
% 7.40/2.72 ----------------------
% 7.40/2.72 #Ref : 0
% 7.40/2.72 #Sup : 210
% 7.40/2.72 #Fact : 0
% 7.40/2.72 #Define : 0
% 7.40/2.72 #Split : 4
% 7.40/2.72 #Chain : 0
% 7.40/2.72 #Close : 0
% 7.40/2.72
% 7.40/2.72 Ordering : KBO
% 7.40/2.72
% 7.40/2.72 Simplification rules
% 7.40/2.72 ----------------------
% 7.40/2.72 #Subsume : 10
% 7.40/2.72 #Demod : 26
% 7.40/2.72 #Tautology : 100
% 7.40/2.72 #SimpNegUnit : 1
% 7.40/2.72 #BackRed : 0
% 7.40/2.72
% 7.40/2.72 #Partial instantiations: 0
% 7.40/2.72 #Strategies tried : 1
% 7.40/2.72
% 7.40/2.72 Timing (in seconds)
% 7.40/2.72 ----------------------
% 7.40/2.73 Preprocessing : 0.86
% 7.40/2.73 Parsing : 0.39
% 7.40/2.73 CNF conversion : 0.09
% 7.40/2.73 Main loop : 0.71
% 7.40/2.73 Inferencing : 0.18
% 7.40/2.73 Reduction : 0.27
% 7.40/2.73 Demodulation : 0.19
% 7.40/2.73 BG Simplification : 0.07
% 7.40/2.73 Subsumption : 0.14
% 7.40/2.73 Abstraction : 0.03
% 7.40/2.73 MUC search : 0.00
% 7.40/2.73 Cooper : 0.00
% 7.40/2.73 Total : 1.64
% 7.40/2.73 Index Insertion : 0.00
% 7.40/2.73 Index Deletion : 0.00
% 7.40/2.73 Index Matching : 0.00
% 7.40/2.73 BG Taut test : 0.00
%------------------------------------------------------------------------------