TSTP Solution File: RNG077+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : RNG077+1 : 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 : n017.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:53 EDT 2023
% Result : Theorem 8.48s 3.25s
% Output : CNFRefutation 8.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 39
% Syntax : Number of formulae : 59 ( 15 unt; 33 typ; 0 def)
% Number of atoms : 49 ( 18 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 43 ( 20 ~; 12 |; 9 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 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 : 17 (; 17 !; 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_371,hypothesis,
( aScalar0(xH)
& ( xH = sdtasdt0(xA,xB) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1873) ).
tff(f_82,axiom,
! [W0,W1] :
( ( aScalar0(W0)
& aScalar0(W1) )
=> aScalar0(sdtasdt0(W0,W1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulSc) ).
tff(f_377,hypothesis,
( aScalar0(xP)
& ( xP = sdtasdt0(xE,xH) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1911) ).
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_362,hypothesis,
( aScalar0(xE)
& ( xE = sdtasasdt0(xp,xq) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1820) ).
tff(f_388,negated_conjecture,
sdtpldt0(sdtpldt0(xP,xP),sdtasdt0(xH,xH)) != sdtpldt0(sdtasdt0(xE,xH),sdtpldt0(sdtasdt0(xH,xE),sdtasdt0(xH,xH))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
tff(c_162,plain,
aScalar0(xH),
inference(cnfTransformation,[status(thm)],[f_371]) ).
tff(c_26,plain,
! [W0_13,W1_14] :
( aScalar0(sdtasdt0(W0_13,W1_14))
| ~ aScalar0(W1_14)
| ~ aScalar0(W0_13) ),
inference(cnfTransformation,[status(thm)],[f_82]) ).
tff(c_170,plain,
aScalar0(xP),
inference(cnfTransformation,[status(thm)],[f_377]) ).
tff(c_3774,plain,
! [W0_148,W1_149,W2_150] :
( ( sdtpldt0(sdtpldt0(W0_148,W1_149),W2_150) = sdtpldt0(W0_148,sdtpldt0(W1_149,W2_150)) )
| ~ aScalar0(W2_150)
| ~ aScalar0(W1_149)
| ~ aScalar0(W0_148) ),
inference(cnfTransformation,[status(thm)],[f_118]) ).
tff(c_168,plain,
sdtasdt0(xE,xH) = xP,
inference(cnfTransformation,[status(thm)],[f_377]) ).
tff(c_150,plain,
aScalar0(xE),
inference(cnfTransformation,[status(thm)],[f_362]) ).
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_1897,plain,
! [W2_19] : ~ aScalar0(W2_19),
inference(splitLeft,[status(thm)],[c_46]) ).
tff(c_1915,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_1897,c_162]) ).
tff(c_2247,plain,
! [W1_126,W0_127] :
( ( sdtasdt0(W1_126,W0_127) = sdtasdt0(W0_127,W1_126) )
| ~ aScalar0(W1_126)
| ~ aScalar0(W0_127) ),
inference(splitRight,[status(thm)],[c_46]) ).
tff(c_2305,plain,
! [W0_128] :
( ( sdtasdt0(xH,W0_128) = sdtasdt0(W0_128,xH) )
| ~ aScalar0(W0_128) ),
inference(resolution,[status(thm)],[c_162,c_2247]) ).
tff(c_2353,plain,
sdtasdt0(xH,xE) = sdtasdt0(xE,xH),
inference(resolution,[status(thm)],[c_150,c_2305]) ).
tff(c_2381,plain,
sdtasdt0(xH,xE) = xP,
inference(demodulation,[status(thm),theory(equality)],[c_168,c_2353]) ).
tff(c_186,plain,
sdtpldt0(sdtasdt0(xE,xH),sdtpldt0(sdtasdt0(xH,xE),sdtasdt0(xH,xH))) != sdtpldt0(sdtpldt0(xP,xP),sdtasdt0(xH,xH)),
inference(cnfTransformation,[status(thm)],[f_388]) ).
tff(c_187,plain,
sdtpldt0(xP,sdtpldt0(sdtasdt0(xH,xE),sdtasdt0(xH,xH))) != sdtpldt0(sdtpldt0(xP,xP),sdtasdt0(xH,xH)),
inference(demodulation,[status(thm),theory(equality)],[c_168,c_186]) ).
tff(c_2385,plain,
sdtpldt0(sdtpldt0(xP,xP),sdtasdt0(xH,xH)) != sdtpldt0(xP,sdtpldt0(xP,sdtasdt0(xH,xH))),
inference(demodulation,[status(thm),theory(equality)],[c_2381,c_187]) ).
tff(c_3786,plain,
( ~ aScalar0(sdtasdt0(xH,xH))
| ~ aScalar0(xP) ),
inference(superposition,[status(thm),theory(equality)],[c_3774,c_2385]) ).
tff(c_3894,plain,
~ aScalar0(sdtasdt0(xH,xH)),
inference(demodulation,[status(thm),theory(equality)],[c_170,c_3786]) ).
tff(c_3952,plain,
~ aScalar0(xH),
inference(resolution,[status(thm)],[c_26,c_3894]) ).
tff(c_3956,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_162,c_3952]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : RNG077+1 : 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.35 % Computer : n017.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 17:33:36 EDT 2023
% 0.14/0.35 % CPUTime :
% 8.48/3.25 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.48/3.25
% 8.48/3.25 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 8.72/3.28
% 8.72/3.28 Inference rules
% 8.72/3.28 ----------------------
% 8.72/3.28 #Ref : 1
% 8.72/3.28 #Sup : 931
% 8.72/3.28 #Fact : 2
% 8.72/3.28 #Define : 0
% 8.72/3.28 #Split : 11
% 8.72/3.28 #Chain : 0
% 8.72/3.28 #Close : 0
% 8.72/3.28
% 8.72/3.28 Ordering : KBO
% 8.72/3.28
% 8.72/3.28 Simplification rules
% 8.72/3.28 ----------------------
% 8.72/3.28 #Subsume : 96
% 8.72/3.28 #Demod : 977
% 8.72/3.28 #Tautology : 501
% 8.72/3.28 #SimpNegUnit : 53
% 8.72/3.28 #BackRed : 42
% 8.72/3.28
% 8.72/3.28 #Partial instantiations: 0
% 8.72/3.28 #Strategies tried : 1
% 8.72/3.28
% 8.72/3.28 Timing (in seconds)
% 8.72/3.28 ----------------------
% 8.72/3.28 Preprocessing : 0.85
% 8.72/3.28 Parsing : 0.43
% 8.72/3.28 CNF conversion : 0.06
% 8.72/3.28 Main loop : 1.28
% 8.72/3.28 Inferencing : 0.44
% 8.72/3.28 Reduction : 0.45
% 8.72/3.28 Demodulation : 0.34
% 8.72/3.28 BG Simplification : 0.06
% 8.72/3.28 Subsumption : 0.25
% 8.72/3.28 Abstraction : 0.04
% 8.72/3.28 MUC search : 0.00
% 8.72/3.28 Cooper : 0.00
% 8.72/3.28 Total : 2.18
% 8.72/3.28 Index Insertion : 0.00
% 8.72/3.28 Index Deletion : 0.00
% 8.72/3.28 Index Matching : 0.00
% 8.72/3.28 BG Taut test : 0.00
%------------------------------------------------------------------------------