TSTP Solution File: RNG070+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : RNG070+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 : n029.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:52 EDT 2023
% Result : Theorem 6.01s 2.40s
% Output : CNFRefutation 6.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 40
% Syntax : Number of formulae : 55 ( 12 unt; 33 typ; 0 def)
% Number of atoms : 39 ( 3 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 34 ( 17 ~; 10 |; 5 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 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 : 8 (; 8 !; 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_391,hypothesis,
( aScalar0(xP)
& ( xP = sdtasdt0(xE,xH) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1911) ).
tff(f_76,axiom,
! [W0,W1] :
( ( aScalar0(W0)
& aScalar0(W1) )
=> aScalar0(sdtpldt0(W0,W1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSumSc) ).
tff(f_388,hypothesis,
( aScalar0(xR)
& ( xR = sdtasdt0(xC,xG) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1892) ).
tff(f_394,hypothesis,
( aScalar0(xS)
& ( xS = sdtasdt0(xF,xD) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1930) ).
tff(f_403,hypothesis,
~ sdtlseqdt0(sdtpldt0(xP,xP),sdtpldt0(xR,xS)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2590) ).
tff(f_223,axiom,
! [W0,W1] :
( ( aScalar0(W0)
& aScalar0(W1) )
=> ( sdtlseqdt0(W0,W1)
| sdtlseqdt0(W1,W0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mLETot) ).
tff(f_405,negated_conjecture,
~ sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
tff(c_178,plain,
aScalar0(xP),
inference(cnfTransformation,[status(thm)],[f_391]) ).
tff(c_24,plain,
! [W0_11,W1_12] :
( aScalar0(sdtpldt0(W0_11,W1_12))
| ~ aScalar0(W1_12)
| ~ aScalar0(W0_11) ),
inference(cnfTransformation,[status(thm)],[f_76]) ).
tff(c_174,plain,
aScalar0(xR),
inference(cnfTransformation,[status(thm)],[f_388]) ).
tff(c_182,plain,
aScalar0(xS),
inference(cnfTransformation,[status(thm)],[f_394]) ).
tff(c_196,plain,
~ sdtlseqdt0(sdtpldt0(xP,xP),sdtpldt0(xR,xS)),
inference(cnfTransformation,[status(thm)],[f_403]) ).
tff(c_1454,plain,
! [W1_111,W0_112] :
( sdtlseqdt0(W1_111,W0_112)
| sdtlseqdt0(W0_112,W1_111)
| ~ aScalar0(W1_111)
| ~ aScalar0(W0_112) ),
inference(cnfTransformation,[status(thm)],[f_223]) ).
tff(c_198,plain,
~ sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP)),
inference(cnfTransformation,[status(thm)],[f_405]) ).
tff(c_1462,plain,
( sdtlseqdt0(sdtpldt0(xP,xP),sdtpldt0(xR,xS))
| ~ aScalar0(sdtpldt0(xP,xP))
| ~ aScalar0(sdtpldt0(xR,xS)) ),
inference(resolution,[status(thm)],[c_1454,c_198]) ).
tff(c_1468,plain,
( ~ aScalar0(sdtpldt0(xP,xP))
| ~ aScalar0(sdtpldt0(xR,xS)) ),
inference(negUnitSimplification,[status(thm)],[c_196,c_1462]) ).
tff(c_1531,plain,
~ aScalar0(sdtpldt0(xR,xS)),
inference(splitLeft,[status(thm)],[c_1468]) ).
tff(c_1534,plain,
( ~ aScalar0(xS)
| ~ aScalar0(xR) ),
inference(resolution,[status(thm)],[c_24,c_1531]) ).
tff(c_1538,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_174,c_182,c_1534]) ).
tff(c_1539,plain,
~ aScalar0(sdtpldt0(xP,xP)),
inference(splitRight,[status(thm)],[c_1468]) ).
tff(c_1560,plain,
~ aScalar0(xP),
inference(resolution,[status(thm)],[c_24,c_1539]) ).
tff(c_1564,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_178,c_1560]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : RNG070+2 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % 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.34 % Computer : n029.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu Aug 3 18:12:22 EDT 2023
% 0.14/0.34 % CPUTime :
% 6.01/2.40 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.01/2.40
% 6.01/2.40 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.27/2.43
% 6.27/2.43 Inference rules
% 6.27/2.43 ----------------------
% 6.27/2.43 #Ref : 1
% 6.27/2.43 #Sup : 377
% 6.27/2.43 #Fact : 2
% 6.27/2.43 #Define : 0
% 6.27/2.43 #Split : 4
% 6.27/2.43 #Chain : 0
% 6.27/2.43 #Close : 0
% 6.27/2.43
% 6.27/2.43 Ordering : KBO
% 6.27/2.43
% 6.27/2.43 Simplification rules
% 6.27/2.43 ----------------------
% 6.27/2.43 #Subsume : 13
% 6.27/2.43 #Demod : 246
% 6.27/2.43 #Tautology : 255
% 6.27/2.43 #SimpNegUnit : 17
% 6.27/2.43 #BackRed : 13
% 6.27/2.43
% 6.27/2.43 #Partial instantiations: 0
% 6.27/2.43 #Strategies tried : 1
% 6.27/2.43
% 6.27/2.43 Timing (in seconds)
% 6.27/2.43 ----------------------
% 6.27/2.43 Preprocessing : 0.72
% 6.27/2.43 Parsing : 0.38
% 6.27/2.43 CNF conversion : 0.05
% 6.27/2.43 Main loop : 0.68
% 6.27/2.43 Inferencing : 0.23
% 6.27/2.43 Reduction : 0.22
% 6.27/2.43 Demodulation : 0.16
% 6.27/2.43 BG Simplification : 0.05
% 6.27/2.43 Subsumption : 0.13
% 6.27/2.43 Abstraction : 0.02
% 6.27/2.43 MUC search : 0.00
% 6.27/2.43 Cooper : 0.00
% 6.27/2.43 Total : 1.44
% 6.27/2.43 Index Insertion : 0.00
% 6.27/2.43 Index Deletion : 0.00
% 6.27/2.43 Index Matching : 0.00
% 6.27/2.43 BG Taut test : 0.00
%------------------------------------------------------------------------------