TSTP Solution File: RNG125+4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : RNG125+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 : n032.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:03 EDT 2023
% Result : Theorem 3.92s 1.82s
% Output : CNFRefutation 4.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 73
% Syntax : Number of formulae : 77 ( 3 unt; 70 typ; 0 def)
% Number of atoms : 19 ( 4 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 19 ( 7 ~; 5 |; 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 : 95 ( 48 >; 47 *; 0 +; 0 <<)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 59 ( 59 usr; 22 con; 0-4 aty)
% Number of variables : 4 (; 0 !; 4 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdteqdtlpzmzozddtrp0 > aGcdOfAnd0 > misRelativelyPrime0 > iLess0 > doDivides0 > aElementOf0 > aDivisorOf0 > aSet0 > aNaturalNumber0 > aIdeal0 > aElement0 > sdtpldt1 > sdtpldt0 > sdtasdt0 > sdtasasdt0 > #nlpp > smndt0 > slsdtgt0 > sbrdtbr0 > xu > 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_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('#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_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(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_574,hypothesis,
~ ~ ( ? [W0] :
( aElement0(W0)
& ( sdtasdt0(xu,W0) = xb ) )
& doDivides0(xu,xb) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2612) ).
tff(f_566,hypothesis,
~ ~ ( ? [W0] :
( aElement0(W0)
& ( sdtasdt0(xu,W0) = xa ) )
& doDivides0(xu,xa) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2479) ).
tff(f_552,hypothesis,
~ ( ( ? [W0] :
( aElement0(W0)
& ( sdtasdt0(xu,W0) = xa ) )
| doDivides0(xu,xa)
| aDivisorOf0(xu,xa) )
& ( ? [W0] :
( aElement0(W0)
& ( sdtasdt0(xu,W0) = xb ) )
| doDivides0(xu,xb)
| aDivisorOf0(xu,xb) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2383) ).
tff(c_410,plain,
doDivides0(xu,xb),
inference(cnfTransformation,[status(thm)],[f_574]) ).
tff(c_404,plain,
doDivides0(xu,xa),
inference(cnfTransformation,[status(thm)],[f_566]) ).
tff(c_388,plain,
( ~ doDivides0(xu,xa)
| ~ doDivides0(xu,xb) ),
inference(cnfTransformation,[status(thm)],[f_552]) ).
tff(c_422,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_410,c_404,c_388]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : RNG125+4 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.12 % 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.11/0.31 % Computer : n032.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Thu Aug 3 18:03:21 EDT 2023
% 0.11/0.31 % CPUTime :
% 3.92/1.82 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.92/1.83
% 3.92/1.83 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.00/1.85
% 4.00/1.85 Inference rules
% 4.00/1.85 ----------------------
% 4.00/1.85 #Ref : 0
% 4.00/1.85 #Sup : 0
% 4.00/1.85 #Fact : 0
% 4.00/1.85 #Define : 0
% 4.00/1.85 #Split : 0
% 4.00/1.85 #Chain : 0
% 4.00/1.85 #Close : 0
% 4.00/1.85
% 4.00/1.85 Ordering : KBO
% 4.00/1.85
% 4.00/1.85 Simplification rules
% 4.00/1.85 ----------------------
% 4.00/1.85 #Subsume : 202
% 4.00/1.85 #Demod : 4
% 4.00/1.85 #Tautology : 5
% 4.00/1.85 #SimpNegUnit : 0
% 4.00/1.85 #BackRed : 0
% 4.00/1.85
% 4.00/1.85 #Partial instantiations: 0
% 4.00/1.85 #Strategies tried : 1
% 4.00/1.85
% 4.00/1.85 Timing (in seconds)
% 4.00/1.85 ----------------------
% 4.00/1.86 Preprocessing : 0.76
% 4.00/1.86 Parsing : 0.35
% 4.00/1.86 CNF conversion : 0.08
% 4.00/1.86 Main loop : 0.08
% 4.00/1.86 Inferencing : 0.00
% 4.00/1.86 Reduction : 0.03
% 4.00/1.86 Demodulation : 0.03
% 4.00/1.86 BG Simplification : 0.06
% 4.00/1.86 Subsumption : 0.04
% 4.00/1.86 Abstraction : 0.02
% 4.00/1.86 MUC search : 0.00
% 4.00/1.86 Cooper : 0.00
% 4.00/1.86 Total : 0.89
% 4.00/1.86 Index Insertion : 0.00
% 4.00/1.86 Index Deletion : 0.00
% 4.00/1.86 Index Matching : 0.00
% 4.00/1.86 BG Taut test : 0.00
%------------------------------------------------------------------------------