TSTP Solution File: NUM490+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM490+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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n016.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:51:52 EDT 2023
% Result : Theorem 49.57s 36.51s
% Output : CNFRefutation 49.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 31
% Syntax : Number of formulae : 72 ( 29 unt; 19 typ; 2 def)
% Number of atoms : 114 ( 37 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 107 ( 46 ~; 40 |; 11 &)
% ( 2 <=>; 8 =>; 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 ( 13 >; 9 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-2 aty)
% Number of variables : 34 (; 33 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdtlseqdt0 > iLess0 > doDivides0 > isPrime0 > aNaturalNumber0 > sdtsldt0 > sdtpldt0 > sdtmndt0 > sdtasdt0 > #nlpp > xr > xp > xn > xm > sz10 > sz00 > #skF_4 > #skF_3 > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(xr,type,
xr: $i ).
tff(sdtasdt0,type,
sdtasdt0: ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': $i > $i ).
tff(sz10,type,
sz10: $i ).
tff(sdtmndt0,type,
sdtmndt0: ( $i * $i ) > $i ).
tff(sdtlseqdt0,type,
sdtlseqdt0: ( $i * $i ) > $o ).
tff(sz00,type,
sz00: $i ).
tff(sdtpldt0,type,
sdtpldt0: ( $i * $i ) > $i ).
tff(isPrime0,type,
isPrime0: $i > $o ).
tff(aNaturalNumber0,type,
aNaturalNumber0: $i > $o ).
tff(doDivides0,type,
doDivides0: ( $i * $i ) > $o ).
tff('#skF_3',type,
'#skF_3': $i > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(xp,type,
xp: $i ).
tff(iLess0,type,
iLess0: ( $i * $i ) > $o ).
tff(xm,type,
xm: $i ).
tff(sdtsldt0,type,
sdtsldt0: ( $i * $i ) > $i ).
tff(xn,type,
xn: $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(f_423,hypothesis,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xp) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1837) ).
tff(f_73,axiom,
! [W0,W1] :
( ( aNaturalNumber0(W0)
& aNaturalNumber0(W1) )
=> ( sdtasdt0(W0,W1) = sdtasdt0(W1,W0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulComm) ).
tff(f_449,hypothesis,
xn = sdtpldt0(xp,xr),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1924) ).
tff(f_141,axiom,
! [W0,W1] :
( ( aNaturalNumber0(W0)
& aNaturalNumber0(W1) )
=> ( ( sdtpldt0(W0,W1) = sz00 )
=> ( ( W0 = sz00 )
& ( W1 = sz00 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mZeroAdd) ).
tff(f_443,hypothesis,
sdtlseqdt0(xp,xn),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1870) ).
tff(f_444,hypothesis,
xr = sdtmndt0(xn,xp),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1883) ).
tff(f_175,definition,
! [W0,W1] :
( ( aNaturalNumber0(W0)
& aNaturalNumber0(W1) )
=> ( sdtlseqdt0(W0,W1)
=> ! [W2] :
( ( W2 = sdtmndt0(W1,W0) )
<=> ( aNaturalNumber0(W2)
& ( sdtpldt0(W0,W2) = W1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefDiff) ).
tff(f_452,negated_conjecture,
sdtasdt0(xr,xm) != sdtmndt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
tff(f_47,axiom,
! [W0,W1] :
( ( aNaturalNumber0(W0)
& aNaturalNumber0(W1) )
=> aNaturalNumber0(sdtasdt0(W0,W1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB_02) ).
tff(f_450,hypothesis,
sdtasdt0(xn,xm) = sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1951) ).
tff(f_41,axiom,
! [W0,W1] :
( ( aNaturalNumber0(W0)
& aNaturalNumber0(W1) )
=> aNaturalNumber0(sdtpldt0(W0,W1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB) ).
tff(f_162,definition,
! [W0,W1] :
( ( aNaturalNumber0(W0)
& aNaturalNumber0(W1) )
=> ( sdtlseqdt0(W0,W1)
<=> ? [W2] :
( aNaturalNumber0(W2)
& ( sdtpldt0(W0,W2) = W1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefLE) ).
tff(c_147,plain,
aNaturalNumber0(xn),
inference(cnfTransformation,[status(thm)],[f_423]) ).
tff(c_145,plain,
aNaturalNumber0(xm),
inference(cnfTransformation,[status(thm)],[f_423]) ).
tff(c_1564,plain,
! [W1_137,W0_138] :
( ( sdtasdt0(W1_137,W0_138) = sdtasdt0(W0_138,W1_137) )
| ~ aNaturalNumber0(W1_137)
| ~ aNaturalNumber0(W0_138) ),
inference(cnfTransformation,[status(thm)],[f_73]) ).
tff(c_28204,plain,
! [W0_485] :
( ( sdtasdt0(xm,W0_485) = sdtasdt0(W0_485,xm) )
| ~ aNaturalNumber0(W0_485) ),
inference(resolution,[status(thm)],[c_145,c_1564]) ).
tff(c_28284,plain,
sdtasdt0(xn,xm) = sdtasdt0(xm,xn),
inference(resolution,[status(thm)],[c_147,c_28204]) ).
tff(c_143,plain,
aNaturalNumber0(xp),
inference(cnfTransformation,[status(thm)],[f_423]) ).
tff(c_163,plain,
sdtpldt0(xp,xr) = xn,
inference(cnfTransformation,[status(thm)],[f_449]) ).
tff(c_626,plain,
! [W1_112,W0_113] :
( ( sz00 = W1_112 )
| ( sdtpldt0(W0_113,W1_112) != sz00 )
| ~ aNaturalNumber0(W1_112)
| ~ aNaturalNumber0(W0_113) ),
inference(cnfTransformation,[status(thm)],[f_141]) ).
tff(c_648,plain,
( ( xr = sz00 )
| ( xn != sz00 )
| ~ aNaturalNumber0(xr)
| ~ aNaturalNumber0(xp) ),
inference(superposition,[status(thm),theory(equality)],[c_163,c_626]) ).
tff(c_674,plain,
( ( xr = sz00 )
| ( xn != sz00 )
| ~ aNaturalNumber0(xr) ),
inference(demodulation,[status(thm),theory(equality)],[c_143,c_648]) ).
tff(c_675,plain,
~ aNaturalNumber0(xr),
inference(splitLeft,[status(thm)],[c_674]) ).
tff(c_155,plain,
sdtlseqdt0(xp,xn),
inference(cnfTransformation,[status(thm)],[f_443]) ).
tff(c_157,plain,
sdtmndt0(xn,xp) = xr,
inference(cnfTransformation,[status(thm)],[f_444]) ).
tff(c_1350,plain,
! [W1_131,W0_132] :
( aNaturalNumber0(sdtmndt0(W1_131,W0_132))
| ~ sdtlseqdt0(W0_132,W1_131)
| ~ aNaturalNumber0(W1_131)
| ~ aNaturalNumber0(W0_132) ),
inference(cnfTransformation,[status(thm)],[f_175]) ).
tff(c_1378,plain,
( aNaturalNumber0(xr)
| ~ sdtlseqdt0(xp,xn)
| ~ aNaturalNumber0(xn)
| ~ aNaturalNumber0(xp) ),
inference(superposition,[status(thm),theory(equality)],[c_157,c_1350]) ).
tff(c_1389,plain,
aNaturalNumber0(xr),
inference(demodulation,[status(thm),theory(equality)],[c_143,c_147,c_155,c_1378]) ).
tff(c_1391,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_675,c_1389]) ).
tff(c_1393,plain,
aNaturalNumber0(xr),
inference(splitRight,[status(thm)],[c_674]) ).
tff(c_28280,plain,
sdtasdt0(xr,xm) = sdtasdt0(xm,xr),
inference(resolution,[status(thm)],[c_1393,c_28204]) ).
tff(c_23271,plain,
! [W0_416] :
( ( sdtasdt0(xp,W0_416) = sdtasdt0(W0_416,xp) )
| ~ aNaturalNumber0(W0_416) ),
inference(resolution,[status(thm)],[c_143,c_1564]) ).
tff(c_23336,plain,
sdtasdt0(xp,xm) = sdtasdt0(xm,xp),
inference(resolution,[status(thm)],[c_145,c_23271]) ).
tff(c_167,plain,
sdtmndt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm)) != sdtasdt0(xr,xm),
inference(cnfTransformation,[status(thm)],[f_452]) ).
tff(c_26207,plain,
sdtmndt0(sdtasdt0(xn,xm),sdtasdt0(xm,xp)) != sdtasdt0(xr,xm),
inference(demodulation,[status(thm),theory(equality)],[c_23336,c_167]) ).
tff(c_28293,plain,
sdtmndt0(sdtasdt0(xn,xm),sdtasdt0(xm,xp)) != sdtasdt0(xm,xr),
inference(demodulation,[status(thm),theory(equality)],[c_28280,c_26207]) ).
tff(c_28744,plain,
sdtmndt0(sdtasdt0(xm,xn),sdtasdt0(xm,xp)) != sdtasdt0(xm,xr),
inference(demodulation,[status(thm),theory(equality)],[c_28284,c_28293]) ).
tff(c_12,plain,
! [W0_4,W1_5] :
( aNaturalNumber0(sdtasdt0(W0_4,W1_5))
| ~ aNaturalNumber0(W1_5)
| ~ aNaturalNumber0(W0_4) ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_26227,plain,
( aNaturalNumber0(sdtasdt0(xm,xp))
| ~ aNaturalNumber0(xm)
| ~ aNaturalNumber0(xp) ),
inference(superposition,[status(thm),theory(equality)],[c_23336,c_12]) ).
tff(c_26251,plain,
aNaturalNumber0(sdtasdt0(xm,xp)),
inference(demodulation,[status(thm),theory(equality)],[c_143,c_145,c_26227]) ).
tff(c_28328,plain,
( aNaturalNumber0(sdtasdt0(xm,xr))
| ~ aNaturalNumber0(xm)
| ~ aNaturalNumber0(xr) ),
inference(superposition,[status(thm),theory(equality)],[c_28280,c_12]) ).
tff(c_28362,plain,
aNaturalNumber0(sdtasdt0(xm,xr)),
inference(demodulation,[status(thm),theory(equality)],[c_1393,c_145,c_28328]) ).
tff(c_165,plain,
sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)) = sdtasdt0(xn,xm),
inference(cnfTransformation,[status(thm)],[f_450]) ).
tff(c_26206,plain,
sdtpldt0(sdtasdt0(xm,xp),sdtasdt0(xr,xm)) = sdtasdt0(xn,xm),
inference(demodulation,[status(thm),theory(equality)],[c_23336,c_165]) ).
tff(c_112925,plain,
sdtpldt0(sdtasdt0(xm,xp),sdtasdt0(xm,xr)) = sdtasdt0(xm,xn),
inference(demodulation,[status(thm),theory(equality)],[c_28280,c_28284,c_26206]) ).
tff(c_10,plain,
! [W0_2,W1_3] :
( aNaturalNumber0(sdtpldt0(W0_2,W1_3))
| ~ aNaturalNumber0(W1_3)
| ~ aNaturalNumber0(W0_2) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_52,plain,
! [W0_34,W2_38] :
( sdtlseqdt0(W0_34,sdtpldt0(W0_34,W2_38))
| ~ aNaturalNumber0(W2_38)
| ~ aNaturalNumber0(sdtpldt0(W0_34,W2_38))
| ~ aNaturalNumber0(W0_34) ),
inference(cnfTransformation,[status(thm)],[f_162]) ).
tff(c_29234,plain,
! [W0_492,W2_493] :
( ( sdtmndt0(sdtpldt0(W0_492,W2_493),W0_492) = W2_493 )
| ~ aNaturalNumber0(W2_493)
| ~ sdtlseqdt0(W0_492,sdtpldt0(W0_492,W2_493))
| ~ aNaturalNumber0(sdtpldt0(W0_492,W2_493))
| ~ aNaturalNumber0(W0_492) ),
inference(cnfTransformation,[status(thm)],[f_175]) ).
tff(c_52714,plain,
! [W0_614,W2_615] :
( ( sdtmndt0(sdtpldt0(W0_614,W2_615),W0_614) = W2_615 )
| ~ aNaturalNumber0(W2_615)
| ~ aNaturalNumber0(sdtpldt0(W0_614,W2_615))
| ~ aNaturalNumber0(W0_614) ),
inference(resolution,[status(thm)],[c_52,c_29234]) ).
tff(c_52896,plain,
! [W0_2,W1_3] :
( ( sdtmndt0(sdtpldt0(W0_2,W1_3),W0_2) = W1_3 )
| ~ aNaturalNumber0(W1_3)
| ~ aNaturalNumber0(W0_2) ),
inference(resolution,[status(thm)],[c_10,c_52714]) ).
tff(c_112929,plain,
( ( sdtmndt0(sdtasdt0(xm,xn),sdtasdt0(xm,xp)) = sdtasdt0(xm,xr) )
| ~ aNaturalNumber0(sdtasdt0(xm,xr))
| ~ aNaturalNumber0(sdtasdt0(xm,xp)) ),
inference(superposition,[status(thm),theory(equality)],[c_112925,c_52896]) ).
tff(c_113048,plain,
sdtmndt0(sdtasdt0(xm,xn),sdtasdt0(xm,xp)) = sdtasdt0(xm,xr),
inference(demodulation,[status(thm),theory(equality)],[c_26251,c_28362,c_112929]) ).
tff(c_113050,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_28744,c_113048]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM490+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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.16/0.35 % Computer : n016.cluster.edu
% 0.16/0.35 % Model : x86_64 x86_64
% 0.16/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.35 % Memory : 8042.1875MB
% 0.16/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.35 % CPULimit : 300
% 0.16/0.35 % WCLimit : 300
% 0.16/0.35 % DateTime : Thu Aug 3 15:02:07 EDT 2023
% 0.16/0.35 % CPUTime :
% 49.57/36.51 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 49.81/36.52
% 49.81/36.52 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 49.81/36.55
% 49.81/36.55 Inference rules
% 49.81/36.55 ----------------------
% 49.81/36.55 #Ref : 14
% 49.81/36.55 #Sup : 23383
% 49.81/36.55 #Fact : 10
% 49.81/36.55 #Define : 0
% 49.81/36.55 #Split : 56
% 49.81/36.55 #Chain : 0
% 49.81/36.55 #Close : 0
% 49.81/36.55
% 49.81/36.55 Ordering : KBO
% 49.81/36.55
% 49.81/36.55 Simplification rules
% 49.81/36.55 ----------------------
% 49.81/36.55 #Subsume : 3428
% 49.81/36.55 #Demod : 42451
% 49.81/36.55 #Tautology : 7674
% 49.81/36.55 #SimpNegUnit : 4675
% 49.81/36.55 #BackRed : 676
% 49.81/36.55
% 49.81/36.55 #Partial instantiations: 0
% 49.81/36.55 #Strategies tried : 1
% 49.81/36.55
% 49.81/36.55 Timing (in seconds)
% 49.81/36.55 ----------------------
% 49.81/36.56 Preprocessing : 0.68
% 49.81/36.56 Parsing : 0.34
% 49.81/36.56 CNF conversion : 0.05
% 49.81/36.56 Main loop : 34.81
% 49.81/36.56 Inferencing : 3.84
% 49.81/36.56 Reduction : 22.00
% 49.81/36.56 Demodulation : 18.04
% 49.81/36.56 BG Simplification : 0.21
% 49.81/36.56 Subsumption : 7.40
% 49.81/36.56 Abstraction : 0.35
% 49.81/36.56 MUC search : 0.00
% 49.81/36.56 Cooper : 0.00
% 49.81/36.56 Total : 35.55
% 49.81/36.56 Index Insertion : 0.00
% 49.81/36.56 Index Deletion : 0.00
% 49.81/36.56 Index Matching : 0.00
% 49.81/36.56 BG Taut test : 0.00
%------------------------------------------------------------------------------