TSTP Solution File: RNG088+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : RNG088+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 : n015.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:55 EDT 2023
% Result : Theorem 6.91s 2.63s
% Output : CNFRefutation 6.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 41
% Syntax : Number of formulae : 54 ( 8 unt; 37 typ; 0 def)
% Number of atoms : 42 ( 2 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 38 ( 13 ~; 7 |; 12 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 47 ( 22 >; 25 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 33 ( 33 usr; 15 con; 0-4 aty)
% Number of variables : 10 (; 10 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ aElementOf0 > aSet0 > aIdeal0 > aElement0 > sdtpldt1 > sdtpldt0 > sdtasdt0 > sdtasasdt0 > #nlpp > smndt0 > xz > xy > xx > xn > xm > xl > xk > xJ > xI > sz10 > sz00 > #skF_17 > #skF_6 > #skF_15 > #skF_4 > #skF_8 > #skF_16 > #skF_14 > #skF_5 > #skF_7 > #skF_9 > #skF_13 > #skF_11 > #skF_3 > #skF_2 > #skF_12 > #skF_1 > #skF_10
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(xk,type,
xk: $i ).
tff(xl,type,
xl: $i ).
tff(sdtasdt0,type,
sdtasdt0: ( $i * $i ) > $i ).
tff(aSet0,type,
aSet0: $i > $o ).
tff('#skF_17',type,
'#skF_17': $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i * $i ) > $i ).
tff(sz10,type,
sz10: $i ).
tff('#skF_15',type,
'#skF_15': $i ).
tff(sdtpldt1,type,
sdtpldt1: ( $i * $i ) > $i ).
tff(aElement0,type,
aElement0: $i > $o ).
tff(sz00,type,
sz00: $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i * $i ) > $i ).
tff(aIdeal0,type,
aIdeal0: $i > $o ).
tff(xI,type,
xI: $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $i * $i * $i ) > $i ).
tff('#skF_16',type,
'#skF_16': $i ).
tff(xy,type,
xy: $i ).
tff(sdtpldt0,type,
sdtpldt0: ( $i * $i ) > $i ).
tff('#skF_14',type,
'#skF_14': $i ).
tff(xx,type,
xx: $i ).
tff(smndt0,type,
smndt0: $i > $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i * $i ) > $i ).
tff('#skF_7',type,
'#skF_7': ( $i * $i * $i * $i ) > $i ).
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('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(xJ,type,
xJ: $i ).
tff(sdtasasdt0,type,
sdtasasdt0: ( $i * $i ) > $i ).
tff(xm,type,
xm: $i ).
tff('#skF_12',type,
'#skF_12': $i > $i ).
tff(xn,type,
xn: $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff('#skF_10',type,
'#skF_10': ( $i * $i * $i ) > $i ).
tff(f_262,hypothesis,
( aElementOf0(xk,xI)
& aElementOf0(xl,xJ)
& ( xx = sdtpldt0(xk,xl) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__934) ).
tff(f_267,hypothesis,
( aElementOf0(xm,xI)
& aElementOf0(xn,xJ)
& ( xy = sdtpldt0(xm,xn) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__967) ).
tff(f_238,hypothesis,
( aSet0(xI)
& ! [W0] :
( aElementOf0(W0,xI)
=> ( ! [W1] :
( aElementOf0(W1,xI)
=> aElementOf0(sdtpldt0(W0,W1),xI) )
& ! [W1] :
( aElement0(W1)
=> aElementOf0(sdtasdt0(W1,W0),xI) ) ) )
& aIdeal0(xI)
& aSet0(xJ)
& ! [W0] :
( aElementOf0(W0,xJ)
=> ( ! [W1] :
( aElementOf0(W1,xJ)
=> aElementOf0(sdtpldt0(W0,W1),xJ) )
& ! [W1] :
( aElement0(W1)
=> aElementOf0(sdtasdt0(W1,W0),xJ) ) ) )
& aIdeal0(xJ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__870) ).
tff(f_271,negated_conjecture,
~ ( aElementOf0(sdtpldt0(xk,xm),xI)
& aElementOf0(sdtpldt0(xl,xn),xJ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
tff(c_160,plain,
aElementOf0(xl,xJ),
inference(cnfTransformation,[status(thm)],[f_262]) ).
tff(c_166,plain,
aElementOf0(xn,xJ),
inference(cnfTransformation,[status(thm)],[f_267]) ).
tff(c_4311,plain,
! [W0_219,W1_220] :
( aElementOf0(sdtpldt0(W0_219,W1_220),xJ)
| ~ aElementOf0(W1_220,xJ)
| ~ aElementOf0(W0_219,xJ) ),
inference(cnfTransformation,[status(thm)],[f_238]) ).
tff(c_162,plain,
aElementOf0(xk,xI),
inference(cnfTransformation,[status(thm)],[f_262]) ).
tff(c_168,plain,
aElementOf0(xm,xI),
inference(cnfTransformation,[status(thm)],[f_267]) ).
tff(c_1819,plain,
! [W0_179,W1_180] :
( aElementOf0(sdtpldt0(W0_179,W1_180),xI)
| ~ aElementOf0(W1_180,xI)
| ~ aElementOf0(W0_179,xI) ),
inference(cnfTransformation,[status(thm)],[f_238]) ).
tff(c_170,plain,
( ~ aElementOf0(sdtpldt0(xl,xn),xJ)
| ~ aElementOf0(sdtpldt0(xk,xm),xI) ),
inference(cnfTransformation,[status(thm)],[f_271]) ).
tff(c_171,plain,
~ aElementOf0(sdtpldt0(xk,xm),xI),
inference(splitLeft,[status(thm)],[c_170]) ).
tff(c_1825,plain,
( ~ aElementOf0(xm,xI)
| ~ aElementOf0(xk,xI) ),
inference(resolution,[status(thm)],[c_1819,c_171]) ).
tff(c_1910,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_162,c_168,c_1825]) ).
tff(c_1911,plain,
~ aElementOf0(sdtpldt0(xl,xn),xJ),
inference(splitRight,[status(thm)],[c_170]) ).
tff(c_4320,plain,
( ~ aElementOf0(xn,xJ)
| ~ aElementOf0(xl,xJ) ),
inference(resolution,[status(thm)],[c_4311,c_1911]) ).
tff(c_4433,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_160,c_166,c_4320]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : RNG088+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.13/0.35 % Computer : n015.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 18:13:14 EDT 2023
% 0.13/0.35 % CPUTime :
% 6.91/2.63 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.91/2.64
% 6.91/2.64 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.91/2.66
% 6.91/2.66 Inference rules
% 6.91/2.66 ----------------------
% 6.91/2.66 #Ref : 0
% 6.91/2.66 #Sup : 1102
% 6.91/2.66 #Fact : 0
% 6.91/2.66 #Define : 0
% 6.91/2.66 #Split : 8
% 6.91/2.66 #Chain : 0
% 6.91/2.66 #Close : 0
% 6.91/2.66
% 6.91/2.66 Ordering : KBO
% 6.91/2.66
% 6.91/2.66 Simplification rules
% 6.91/2.66 ----------------------
% 6.91/2.66 #Subsume : 9
% 6.91/2.66 #Demod : 858
% 6.91/2.66 #Tautology : 646
% 6.91/2.66 #SimpNegUnit : 2
% 6.91/2.66 #BackRed : 0
% 6.91/2.66
% 6.91/2.66 #Partial instantiations: 0
% 6.91/2.66 #Strategies tried : 1
% 6.91/2.66
% 6.91/2.66 Timing (in seconds)
% 6.91/2.66 ----------------------
% 6.91/2.67 Preprocessing : 0.64
% 6.91/2.67 Parsing : 0.32
% 6.91/2.67 CNF conversion : 0.05
% 6.91/2.67 Main loop : 0.97
% 6.91/2.67 Inferencing : 0.33
% 6.91/2.67 Reduction : 0.33
% 6.91/2.67 Demodulation : 0.25
% 6.91/2.67 BG Simplification : 0.05
% 6.91/2.67 Subsumption : 0.18
% 7.22/2.67 Abstraction : 0.04
% 7.22/2.67 MUC search : 0.00
% 7.22/2.67 Cooper : 0.00
% 7.22/2.67 Total : 1.65
% 7.22/2.67 Index Insertion : 0.00
% 7.22/2.67 Index Deletion : 0.00
% 7.22/2.67 Index Matching : 0.00
% 7.22/2.67 BG Taut test : 0.00
%------------------------------------------------------------------------------