TSTP Solution File: RNG086+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : RNG086+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 : n019.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:54 EDT 2023
% Result : Theorem 3.98s 2.04s
% Output : CNFRefutation 4.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 35
% Syntax : Number of formulae : 41 ( 4 unt; 33 typ; 0 def)
% Number of atoms : 21 ( 5 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 19 ( 6 ~; 3 |; 10 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 29 ( 29 usr; 11 con; 0-4 aty)
% Number of variables : 8 (; 2 !; 6 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ aElementOf0 > aSet0 > aIdeal0 > aElement0 > sdtpldt1 > sdtpldt0 > sdtasdt0 > sdtasasdt0 > #nlpp > smndt0 > xz > xy > xx > 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(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('#skF_12',type,
'#skF_12': $i > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff('#skF_10',type,
'#skF_10': ( $i * $i * $i ) > $i ).
tff(f_257,hypothesis,
( ? [W0,W1] :
( aElementOf0(W0,xI)
& aElementOf0(W1,xJ)
& ( sdtpldt0(W0,W1) = xx ) )
& aElementOf0(xx,sdtpldt1(xI,xJ))
& ? [W0,W1] :
( aElementOf0(W0,xI)
& aElementOf0(W1,xJ)
& ( sdtpldt0(W0,W1) = xy ) )
& aElementOf0(xy,sdtpldt1(xI,xJ))
& aElement0(xz) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__901) ).
tff(f_264,negated_conjecture,
~ ? [W0,W1] :
( aElementOf0(W0,xI)
& aElementOf0(W1,xJ)
& ( xx = sdtpldt0(W0,W1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
tff(c_156,plain,
aElementOf0('#skF_16',xI),
inference(cnfTransformation,[status(thm)],[f_257]) ).
tff(c_154,plain,
aElementOf0('#skF_17',xJ),
inference(cnfTransformation,[status(thm)],[f_257]) ).
tff(c_152,plain,
sdtpldt0('#skF_16','#skF_17') = xx,
inference(cnfTransformation,[status(thm)],[f_257]) ).
tff(c_158,plain,
! [W0_145,W1_146] :
( ( sdtpldt0(W0_145,W1_146) != xx )
| ~ aElementOf0(W1_146,xJ)
| ~ aElementOf0(W0_145,xI) ),
inference(cnfTransformation,[status(thm)],[f_264]) ).
tff(c_170,plain,
( ~ aElementOf0('#skF_17',xJ)
| ~ aElementOf0('#skF_16',xI) ),
inference(superposition,[status(thm),theory(equality)],[c_152,c_158]) ).
tff(c_176,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_156,c_154,c_170]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.15 % Problem : RNG086+2 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.16 % 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.19/0.37 % Computer : n019.cluster.edu
% 0.19/0.37 % Model : x86_64 x86_64
% 0.19/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.37 % Memory : 8042.1875MB
% 0.19/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.37 % CPULimit : 300
% 0.19/0.37 % WCLimit : 300
% 0.19/0.37 % DateTime : Thu Aug 3 17:59:16 EDT 2023
% 0.19/0.37 % CPUTime :
% 3.98/2.04 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.98/2.05
% 3.98/2.05 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.23/2.07
% 4.23/2.07 Inference rules
% 4.23/2.07 ----------------------
% 4.23/2.07 #Ref : 0
% 4.23/2.07 #Sup : 6
% 4.23/2.07 #Fact : 0
% 4.23/2.07 #Define : 0
% 4.23/2.07 #Split : 0
% 4.23/2.07 #Chain : 0
% 4.23/2.07 #Close : 0
% 4.23/2.07
% 4.23/2.07 Ordering : KBO
% 4.23/2.07
% 4.23/2.07 Simplification rules
% 4.23/2.07 ----------------------
% 4.23/2.07 #Subsume : 0
% 4.23/2.07 #Demod : 4
% 4.23/2.07 #Tautology : 5
% 4.23/2.07 #SimpNegUnit : 0
% 4.23/2.07 #BackRed : 0
% 4.23/2.07
% 4.23/2.07 #Partial instantiations: 0
% 4.23/2.07 #Strategies tried : 1
% 4.23/2.07
% 4.23/2.07 Timing (in seconds)
% 4.23/2.07 ----------------------
% 4.23/2.07 Preprocessing : 0.69
% 4.23/2.07 Parsing : 0.34
% 4.23/2.07 CNF conversion : 0.06
% 4.23/2.07 Main loop : 0.23
% 4.23/2.07 Inferencing : 0.04
% 4.23/2.07 Reduction : 0.09
% 4.23/2.07 Demodulation : 0.07
% 4.23/2.07 BG Simplification : 0.04
% 4.23/2.07 Subsumption : 0.06
% 4.23/2.07 Abstraction : 0.02
% 4.23/2.07 MUC search : 0.00
% 4.23/2.07 Cooper : 0.00
% 4.23/2.07 Total : 0.96
% 4.23/2.07 Index Insertion : 0.00
% 4.23/2.07 Index Deletion : 0.00
% 4.23/2.08 Index Matching : 0.00
% 4.23/2.08 BG Taut test : 0.00
%------------------------------------------------------------------------------