TSTP Solution File: RNG115+4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : RNG115+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/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 : 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:55:01 EDT 2023
% Result : Theorem 7.18s 2.64s
% Output : CNFRefutation 7.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 68
% Syntax : Number of formulae : 75 ( 5 unt; 66 typ; 0 def)
% Number of atoms : 28 ( 11 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 29 ( 10 ~; 6 |; 12 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 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 : 55 ( 55 usr; 18 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 > 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_40 > #skF_4 > #skF_37 > #skF_8 > #skF_14 > #skF_15 > #skF_29 > #skF_26 > #skF_18 > #skF_23 > #skF_28 > #skF_5 > #skF_19 > #skF_38 > #skF_7 > #skF_32 > #skF_39 > #skF_9 > #skF_13 > #skF_11 > #skF_3 > #skF_2 > #skF_35 > #skF_27 > #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(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_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_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_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_534,hypothesis,
( ? [W0,W1] :
( aElementOf0(W0,slsdtgt0(xa))
& aElementOf0(W1,slsdtgt0(xb))
& ( sdtpldt0(W0,W1) = xu ) )
& aElementOf0(xu,xI)
& ( xu != sz00 )
& ! [W0] :
( ( ( ? [W1,W2] :
( aElementOf0(W1,slsdtgt0(xa))
& aElementOf0(W2,slsdtgt0(xb))
& ( sdtpldt0(W1,W2) = W0 ) )
| aElementOf0(W0,xI) )
& ( W0 != sz00 ) )
=> ~ iLess0(sbrdtbr0(W0),sbrdtbr0(xu)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2273) ).
tff(f_569,negated_conjecture,
~ ? [W0,W1] :
( ( ? [W2] :
( aElement0(W2)
& ( sdtasdt0(xa,W2) = W0 ) )
| aElementOf0(W0,slsdtgt0(xa)) )
& ( ? [W2] :
( aElement0(W2)
& ( sdtasdt0(xb,W2) = W1 ) )
| aElementOf0(W1,slsdtgt0(xb)) )
& ( xu = sdtpldt0(W0,W1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
tff(c_370,plain,
sdtpldt0('#skF_40','#skF_41') = xu,
inference(cnfTransformation,[status(thm)],[f_534]) ).
tff(c_372,plain,
aElementOf0('#skF_41',slsdtgt0(xb)),
inference(cnfTransformation,[status(thm)],[f_534]) ).
tff(c_374,plain,
aElementOf0('#skF_40',slsdtgt0(xa)),
inference(cnfTransformation,[status(thm)],[f_534]) ).
tff(c_398,plain,
! [W0_275,W1_276] :
( ~ aElementOf0(W0_275,slsdtgt0(xa))
| ~ aElementOf0(W1_276,slsdtgt0(xb))
| ( sdtpldt0(W0_275,W1_276) != xu ) ),
inference(cnfTransformation,[status(thm)],[f_569]) ).
tff(c_1280,plain,
! [W1_309] :
( ~ aElementOf0(W1_309,slsdtgt0(xb))
| ( sdtpldt0('#skF_40',W1_309) != xu ) ),
inference(resolution,[status(thm)],[c_374,c_398]) ).
tff(c_1289,plain,
sdtpldt0('#skF_40','#skF_41') != xu,
inference(resolution,[status(thm)],[c_372,c_1280]) ).
tff(c_1298,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_370,c_1289]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : RNG115+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/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.15/0.35 % Computer : n026.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu Aug 3 18:10:01 EDT 2023
% 0.15/0.35 % CPUTime :
% 7.18/2.64 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.18/2.65
% 7.18/2.65 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 7.18/2.67
% 7.18/2.67 Inference rules
% 7.18/2.67 ----------------------
% 7.18/2.67 #Ref : 0
% 7.18/2.67 #Sup : 276
% 7.18/2.67 #Fact : 0
% 7.18/2.67 #Define : 0
% 7.18/2.67 #Split : 3
% 7.18/2.67 #Chain : 0
% 7.18/2.67 #Close : 0
% 7.18/2.67
% 7.18/2.67 Ordering : KBO
% 7.18/2.67
% 7.18/2.67 Simplification rules
% 7.18/2.67 ----------------------
% 7.18/2.67 #Subsume : 23
% 7.18/2.67 #Demod : 57
% 7.18/2.67 #Tautology : 150
% 7.18/2.67 #SimpNegUnit : 0
% 7.18/2.67 #BackRed : 1
% 7.18/2.67
% 7.18/2.67 #Partial instantiations: 0
% 7.18/2.67 #Strategies tried : 1
% 7.18/2.67
% 7.18/2.67 Timing (in seconds)
% 7.18/2.67 ----------------------
% 7.18/2.68 Preprocessing : 0.86
% 7.18/2.68 Parsing : 0.42
% 7.18/2.68 CNF conversion : 0.08
% 7.18/2.68 Main loop : 0.70
% 7.18/2.68 Inferencing : 0.20
% 7.18/2.68 Reduction : 0.24
% 7.18/2.68 Demodulation : 0.17
% 7.18/2.68 BG Simplification : 0.07
% 7.18/2.68 Subsumption : 0.14
% 7.18/2.68 Abstraction : 0.02
% 7.18/2.68 MUC search : 0.00
% 7.18/2.68 Cooper : 0.00
% 7.18/2.68 Total : 1.61
% 7.18/2.68 Index Insertion : 0.00
% 7.18/2.68 Index Deletion : 0.00
% 7.18/2.68 Index Matching : 0.00
% 7.18/2.68 BG Taut test : 0.00
%------------------------------------------------------------------------------