TSTP Solution File: RNG059+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : RNG059+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 : n025.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:50 EDT 2023
% Result : Theorem 15.07s 6.05s
% Output : CNFRefutation 15.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 44
% Syntax : Number of formulae : 74 ( 20 unt; 33 typ; 0 def)
% Number of atoms : 80 ( 26 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 64 ( 25 ~; 18 |; 15 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 22 ( 15 >; 7 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 28 ( 28 usr; 18 con; 0-2 aty)
% Number of variables : 24 (; 24 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdtlseqdt0 > iLess0 > aVector0 > aScalar0 > aNaturalNumber0 > sdtpldt0 > sdtlbdtrb0 > sdtasdt0 > sdtasasdt0 > #nlpp > szszuzczcdt0 > sziznziztdt0 > smndt0 > aDimensionOf0 > xt > xs > xq > xp > xS > xR > xP > xN > xH > xG > xF > xE > xD > xC > xB > xA > sz0z00 > sz00 > #skF_1 > #skF_2
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(xq,type,
xq: $i ).
tff(xt,type,
xt: $i ).
tff(sdtasdt0,type,
sdtasdt0: ( $i * $i ) > $i ).
tff(szszuzczcdt0,type,
szszuzczcdt0: $i > $i ).
tff(sdtlbdtrb0,type,
sdtlbdtrb0: ( $i * $i ) > $i ).
tff(xG,type,
xG: $i ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(xE,type,
xE: $i ).
tff(sziznziztdt0,type,
sziznziztdt0: $i > $i ).
tff(sdtlseqdt0,type,
sdtlseqdt0: ( $i * $i ) > $o ).
tff(xS,type,
xS: $i ).
tff(sz00,type,
sz00: $i ).
tff(xR,type,
xR: $i ).
tff(xH,type,
xH: $i ).
tff(xP,type,
xP: $i ).
tff(sdtpldt0,type,
sdtpldt0: ( $i * $i ) > $i ).
tff(aDimensionOf0,type,
aDimensionOf0: $i > $i ).
tff(xB,type,
xB: $i ).
tff(aNaturalNumber0,type,
aNaturalNumber0: $i > $o ).
tff(sz0z00,type,
sz0z00: $i ).
tff(smndt0,type,
smndt0: $i > $i ).
tff(aScalar0,type,
aScalar0: $i > $o ).
tff(xs,type,
xs: $i ).
tff(xN,type,
xN: $i ).
tff(xC,type,
xC: $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(xp,type,
xp: $i ).
tff(sdtasasdt0,type,
sdtasasdt0: ( $i * $i ) > $i ).
tff(iLess0,type,
iLess0: ( $i * $i ) > $o ).
tff(xA,type,
xA: $i ).
tff(xD,type,
xD: $i ).
tff(xF,type,
xF: $i ).
tff(aVector0,type,
aVector0: $i > $o ).
tff(f_397,hypothesis,
( aScalar0(xN)
& ( xN = sdtasdt0(xR,xS) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1949) ).
tff(f_394,hypothesis,
( aScalar0(xS)
& ( xS = sdtasdt0(xF,xD) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1930) ).
tff(f_388,hypothesis,
( aScalar0(xR)
& ( xR = sdtasdt0(xC,xG) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1892) ).
tff(f_118,axiom,
! [W0,W1,W2] :
( ( aScalar0(W0)
& aScalar0(W1)
& aScalar0(W2) )
=> ( ( sdtpldt0(sdtpldt0(W0,W1),W2) = sdtpldt0(W0,sdtpldt0(W1,W2)) )
& ( sdtpldt0(W0,W1) = sdtpldt0(W1,W0) )
& ( sdtasdt0(sdtasdt0(W0,W1),W2) = sdtasdt0(W0,sdtasdt0(W1,W2)) )
& ( sdtasdt0(W0,W1) = sdtasdt0(W1,W0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mArith) ).
tff(f_328,hypothesis,
( aVector0(xs)
& aVector0(xt) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1678) ).
tff(f_351,hypothesis,
( aVector0(xp)
& ( szszuzczcdt0(aDimensionOf0(xp)) = aDimensionOf0(xs) )
& ! [W0] :
( aNaturalNumber0(W0)
=> ( sdtlbdtrb0(xp,W0) = sdtlbdtrb0(xs,W0) ) )
& ( xp = sziznziztdt0(xs) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1709) ).
tff(f_258,axiom,
! [W0] :
( aVector0(W0)
=> aNaturalNumber0(aDimensionOf0(W0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDimNat) ).
tff(f_66,axiom,
! [W0] :
( aNaturalNumber0(W0)
=> iLess0(W0,szszuzczcdt0(W0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIH) ).
tff(f_264,axiom,
! [W0,W1] :
( ( aVector0(W0)
& aNaturalNumber0(W1) )
=> aScalar0(sdtlbdtrb0(W0,W1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mElmSc) ).
tff(f_146,axiom,
! [W0,W1] :
( ( aScalar0(W0)
& aScalar0(W1) )
=> ( ( sdtasdt0(W0,smndt0(W1)) = smndt0(sdtasdt0(W0,W1)) )
& ( sdtasdt0(smndt0(W0),W1) = smndt0(sdtasdt0(W0,W1)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMNeg) ).
tff(f_401,negated_conjecture,
sdtasdt0(smndt0(xS),xR) != smndt0(xN),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
tff(c_184,plain,
sdtasdt0(xR,xS) = xN,
inference(cnfTransformation,[status(thm)],[f_397]) ).
tff(c_182,plain,
aScalar0(xS),
inference(cnfTransformation,[status(thm)],[f_394]) ).
tff(c_174,plain,
aScalar0(xR),
inference(cnfTransformation,[status(thm)],[f_388]) ).
tff(c_46,plain,
! [W1_18,W0_17,W2_19] :
( ( sdtasdt0(W1_18,W0_17) = sdtasdt0(W0_17,W1_18) )
| ~ aScalar0(W2_19)
| ~ aScalar0(W1_18)
| ~ aScalar0(W0_17) ),
inference(cnfTransformation,[status(thm)],[f_118]) ).
tff(c_2136,plain,
! [W2_19] : ~ aScalar0(W2_19),
inference(splitLeft,[status(thm)],[c_46]) ).
tff(c_116,plain,
aVector0(xs),
inference(cnfTransformation,[status(thm)],[f_328]) ).
tff(c_130,plain,
aVector0(xp),
inference(cnfTransformation,[status(thm)],[f_351]) ).
tff(c_90,plain,
! [W0_55] :
( aNaturalNumber0(aDimensionOf0(W0_55))
| ~ aVector0(W0_55) ),
inference(cnfTransformation,[status(thm)],[f_258]) ).
tff(c_128,plain,
szszuzczcdt0(aDimensionOf0(xp)) = aDimensionOf0(xs),
inference(cnfTransformation,[status(thm)],[f_351]) ).
tff(c_568,plain,
! [W0_91] :
( iLess0(W0_91,szszuzczcdt0(W0_91))
| ~ aNaturalNumber0(W0_91) ),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_571,plain,
( iLess0(aDimensionOf0(xp),aDimensionOf0(xs))
| ~ aNaturalNumber0(aDimensionOf0(xp)) ),
inference(superposition,[status(thm),theory(equality)],[c_128,c_568]) ).
tff(c_1476,plain,
~ aNaturalNumber0(aDimensionOf0(xp)),
inference(splitLeft,[status(thm)],[c_571]) ).
tff(c_1479,plain,
~ aVector0(xp),
inference(resolution,[status(thm)],[c_90,c_1476]) ).
tff(c_1483,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_130,c_1479]) ).
tff(c_1485,plain,
aNaturalNumber0(aDimensionOf0(xp)),
inference(splitRight,[status(thm)],[c_571]) ).
tff(c_126,plain,
! [W0_79] :
( ( sdtlbdtrb0(xs,W0_79) = sdtlbdtrb0(xp,W0_79) )
| ~ aNaturalNumber0(W0_79) ),
inference(cnfTransformation,[status(thm)],[f_351]) ).
tff(c_1496,plain,
sdtlbdtrb0(xs,aDimensionOf0(xp)) = sdtlbdtrb0(xp,aDimensionOf0(xp)),
inference(resolution,[status(thm)],[c_1485,c_126]) ).
tff(c_92,plain,
! [W0_56,W1_57] :
( aScalar0(sdtlbdtrb0(W0_56,W1_57))
| ~ aNaturalNumber0(W1_57)
| ~ aVector0(W0_56) ),
inference(cnfTransformation,[status(thm)],[f_264]) ).
tff(c_2037,plain,
( aScalar0(sdtlbdtrb0(xp,aDimensionOf0(xp)))
| ~ aNaturalNumber0(aDimensionOf0(xp))
| ~ aVector0(xs) ),
inference(superposition,[status(thm),theory(equality)],[c_1496,c_92]) ).
tff(c_2041,plain,
aScalar0(sdtlbdtrb0(xp,aDimensionOf0(xp))),
inference(demodulation,[status(thm),theory(equality)],[c_116,c_1485,c_2037]) ).
tff(c_2159,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_2136,c_2041]) ).
tff(c_2209,plain,
! [W1_130,W0_131] :
( ( sdtasdt0(W1_130,W0_131) = sdtasdt0(W0_131,W1_130) )
| ~ aScalar0(W1_130)
| ~ aScalar0(W0_131) ),
inference(splitRight,[status(thm)],[c_46]) ).
tff(c_22112,plain,
! [W0_200] :
( ( sdtasdt0(xR,W0_200) = sdtasdt0(W0_200,xR) )
| ~ aScalar0(W0_200) ),
inference(resolution,[status(thm)],[c_174,c_2209]) ).
tff(c_22373,plain,
sdtasdt0(xS,xR) = sdtasdt0(xR,xS),
inference(resolution,[status(thm)],[c_182,c_22112]) ).
tff(c_22497,plain,
sdtasdt0(xS,xR) = xN,
inference(demodulation,[status(thm),theory(equality)],[c_184,c_22373]) ).
tff(c_2321,plain,
! [W0_132,W1_133] :
( ( sdtasdt0(smndt0(W0_132),W1_133) = smndt0(sdtasdt0(W0_132,W1_133)) )
| ~ aScalar0(W1_133)
| ~ aScalar0(W0_132) ),
inference(cnfTransformation,[status(thm)],[f_146]) ).
tff(c_192,plain,
sdtasdt0(smndt0(xS),xR) != smndt0(xN),
inference(cnfTransformation,[status(thm)],[f_401]) ).
tff(c_2346,plain,
( ( smndt0(sdtasdt0(xS,xR)) != smndt0(xN) )
| ~ aScalar0(xR)
| ~ aScalar0(xS) ),
inference(superposition,[status(thm),theory(equality)],[c_2321,c_192]) ).
tff(c_2373,plain,
smndt0(sdtasdt0(xS,xR)) != smndt0(xN),
inference(demodulation,[status(thm),theory(equality)],[c_182,c_174,c_2346]) ).
tff(c_22518,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_22497,c_2373]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : RNG059+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.14/0.36 % Computer : n025.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 18:11:34 EDT 2023
% 0.14/0.36 % CPUTime :
% 15.07/6.05 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 15.07/6.06
% 15.07/6.06 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 15.07/6.08
% 15.07/6.08 Inference rules
% 15.07/6.08 ----------------------
% 15.07/6.08 #Ref : 3
% 15.07/6.08 #Sup : 5247
% 15.07/6.08 #Fact : 2
% 15.07/6.08 #Define : 0
% 15.07/6.08 #Split : 11
% 15.07/6.08 #Chain : 0
% 15.07/6.08 #Close : 0
% 15.07/6.08
% 15.07/6.08 Ordering : KBO
% 15.07/6.08
% 15.07/6.08 Simplification rules
% 15.07/6.08 ----------------------
% 15.07/6.08 #Subsume : 84
% 15.07/6.08 #Demod : 5185
% 15.07/6.08 #Tautology : 965
% 15.07/6.08 #SimpNegUnit : 73
% 15.07/6.08 #BackRed : 54
% 15.07/6.08
% 15.07/6.08 #Partial instantiations: 0
% 15.07/6.08 #Strategies tried : 1
% 15.07/6.08
% 15.07/6.08 Timing (in seconds)
% 15.07/6.08 ----------------------
% 15.07/6.09 Preprocessing : 0.67
% 15.07/6.09 Parsing : 0.35
% 15.07/6.09 CNF conversion : 0.05
% 15.07/6.09 Main loop : 4.36
% 15.07/6.09 Inferencing : 0.79
% 15.07/6.09 Reduction : 2.40
% 15.07/6.09 Demodulation : 2.08
% 15.07/6.09 BG Simplification : 0.10
% 15.07/6.09 Subsumption : 0.86
% 15.07/6.09 Abstraction : 0.11
% 15.07/6.09 MUC search : 0.00
% 15.07/6.09 Cooper : 0.00
% 15.07/6.09 Total : 5.08
% 15.07/6.09 Index Insertion : 0.00
% 15.07/6.09 Index Deletion : 0.00
% 15.07/6.09 Index Matching : 0.00
% 15.07/6.09 BG Taut test : 0.00
%------------------------------------------------------------------------------