TSTP Solution File: NUM425+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM425+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:51:38 EDT 2023
% Result : Theorem 6.56s 2.56s
% Output : CNFRefutation 6.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 19
% Syntax : Number of formulae : 42 ( 13 unt; 12 typ; 2 def)
% Number of atoms : 71 ( 13 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 78 ( 37 ~; 24 |; 11 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 7 >; 6 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 23 (; 21 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdteqdtlpzmzozddtrp0 > aDivisorOf0 > aInteger0 > sdtpldt0 > sdtasdt0 > #nlpp > smndt0 > xq > xb > xa > sz10 > sz00 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(aInteger0,type,
aInteger0: $i > $o ).
tff(xq,type,
xq: $i ).
tff(sdtasdt0,type,
sdtasdt0: ( $i * $i ) > $i ).
tff(xa,type,
xa: $i ).
tff(sz10,type,
sz10: $i ).
tff(sz00,type,
sz00: $i ).
tff(sdtpldt0,type,
sdtpldt0: ( $i * $i ) > $i ).
tff(smndt0,type,
smndt0: $i > $i ).
tff(xb,type,
xb: $i ).
tff(aDivisorOf0,type,
aDivisorOf0: ( $i * $i ) > $o ).
tff(sdteqdtlpzmzozddtrp0,type,
sdteqdtlpzmzozddtrp0: ( $i * $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(f_170,hypothesis,
( aInteger0(xa)
& aInteger0(xb)
& aInteger0(xq)
& ( xq != sz00 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__704) ).
tff(f_171,hypothesis,
sdteqdtlpzmzozddtrp0(xa,xb,xq),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__724) ).
tff(f_153,definition,
! [W0,W1,W2] :
( ( aInteger0(W0)
& aInteger0(W1)
& aInteger0(W2)
& ( W2 != sz00 ) )
=> ( sdteqdtlpzmzozddtrp0(W0,W1,W2)
<=> aDivisorOf0(W2,sdtpldt0(W0,smndt0(W1))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEquMod) ).
tff(f_35,axiom,
! [W0] :
( aInteger0(W0)
=> aInteger0(smndt0(W0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIntNeg) ).
tff(f_41,axiom,
! [W0,W1] :
( ( aInteger0(W0)
& aInteger0(W1) )
=> aInteger0(sdtpldt0(W0,W1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIntPlus) ).
tff(f_140,definition,
! [W0] :
( aInteger0(W0)
=> ! [W1] :
( aDivisorOf0(W1,W0)
<=> ( aInteger0(W1)
& ( W1 != sz00 )
& ? [W2] :
( aInteger0(W2)
& ( sdtasdt0(W1,W2) = W0 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDivisor) ).
tff(f_176,negated_conjecture,
~ ? [W0] :
( aInteger0(W0)
& ( sdtasdt0(xq,W0) = sdtpldt0(xa,smndt0(xb)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
tff(c_64,plain,
xq != sz00,
inference(cnfTransformation,[status(thm)],[f_170]) ).
tff(c_70,plain,
aInteger0(xa),
inference(cnfTransformation,[status(thm)],[f_170]) ).
tff(c_68,plain,
aInteger0(xb),
inference(cnfTransformation,[status(thm)],[f_170]) ).
tff(c_66,plain,
aInteger0(xq),
inference(cnfTransformation,[status(thm)],[f_170]) ).
tff(c_72,plain,
sdteqdtlpzmzozddtrp0(xa,xb,xq),
inference(cnfTransformation,[status(thm)],[f_171]) ).
tff(c_4074,plain,
! [W2_109,W0_110,W1_111] :
( aDivisorOf0(W2_109,sdtpldt0(W0_110,smndt0(W1_111)))
| ~ sdteqdtlpzmzozddtrp0(W0_110,W1_111,W2_109)
| ( sz00 = W2_109 )
| ~ aInteger0(W2_109)
| ~ aInteger0(W1_111)
| ~ aInteger0(W0_110) ),
inference(cnfTransformation,[status(thm)],[f_153]) ).
tff(c_8,plain,
! [W0_2] :
( aInteger0(smndt0(W0_2))
| ~ aInteger0(W0_2) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_10,plain,
! [W0_3,W1_4] :
( aInteger0(sdtpldt0(W0_3,W1_4))
| ~ aInteger0(W1_4)
| ~ aInteger0(W0_3) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_52,plain,
! [W0_27,W1_33] :
( aInteger0('#skF_1'(W0_27,W1_33))
| ~ aDivisorOf0(W1_33,W0_27)
| ~ aInteger0(W0_27) ),
inference(cnfTransformation,[status(thm)],[f_140]) ).
tff(c_987,plain,
! [W1_77,W0_78] :
( ( sdtasdt0(W1_77,'#skF_1'(W0_78,W1_77)) = W0_78 )
| ~ aDivisorOf0(W1_77,W0_78)
| ~ aInteger0(W0_78) ),
inference(cnfTransformation,[status(thm)],[f_140]) ).
tff(c_74,plain,
! [W0_42] :
( ( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,W0_42) )
| ~ aInteger0(W0_42) ),
inference(cnfTransformation,[status(thm)],[f_176]) ).
tff(c_1038,plain,
! [W0_79] :
( ( sdtpldt0(xa,smndt0(xb)) != W0_79 )
| ~ aInteger0('#skF_1'(W0_79,xq))
| ~ aDivisorOf0(xq,W0_79)
| ~ aInteger0(W0_79) ),
inference(superposition,[status(thm),theory(equality)],[c_987,c_74]) ).
tff(c_1043,plain,
! [W0_27] :
( ( sdtpldt0(xa,smndt0(xb)) != W0_27 )
| ~ aDivisorOf0(xq,W0_27)
| ~ aInteger0(W0_27) ),
inference(resolution,[status(thm)],[c_52,c_1038]) ).
tff(c_1320,plain,
( ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
| ~ aInteger0(sdtpldt0(xa,smndt0(xb))) ),
inference(reflexivity,[status(thm),theory(equality)],[c_1043]) ).
tff(c_1989,plain,
~ aInteger0(sdtpldt0(xa,smndt0(xb))),
inference(splitLeft,[status(thm)],[c_1320]) ).
tff(c_2141,plain,
( ~ aInteger0(smndt0(xb))
| ~ aInteger0(xa) ),
inference(resolution,[status(thm)],[c_10,c_1989]) ).
tff(c_2144,plain,
~ aInteger0(smndt0(xb)),
inference(demodulation,[status(thm),theory(equality)],[c_70,c_2141]) ).
tff(c_2147,plain,
~ aInteger0(xb),
inference(resolution,[status(thm)],[c_8,c_2144]) ).
tff(c_2151,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_68,c_2147]) ).
tff(c_2152,plain,
~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))),
inference(splitRight,[status(thm)],[c_1320]) ).
tff(c_4080,plain,
( ~ sdteqdtlpzmzozddtrp0(xa,xb,xq)
| ( xq = sz00 )
| ~ aInteger0(xq)
| ~ aInteger0(xb)
| ~ aInteger0(xa) ),
inference(resolution,[status(thm)],[c_4074,c_2152]) ).
tff(c_4108,plain,
xq = sz00,
inference(demodulation,[status(thm),theory(equality)],[c_70,c_68,c_66,c_72,c_4080]) ).
tff(c_4110,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_64,c_4108]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM425+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.36 % DateTime : Thu Aug 3 14:28:21 EDT 2023
% 0.14/0.36 % CPUTime :
% 6.56/2.56 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.56/2.57
% 6.56/2.57 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.56/2.60
% 6.56/2.60 Inference rules
% 6.56/2.60 ----------------------
% 6.56/2.60 #Ref : 1
% 6.56/2.60 #Sup : 902
% 6.56/2.60 #Fact : 0
% 6.56/2.60 #Define : 0
% 6.56/2.60 #Split : 8
% 6.56/2.60 #Chain : 0
% 6.56/2.60 #Close : 0
% 6.56/2.60
% 6.56/2.60 Ordering : KBO
% 6.56/2.60
% 6.56/2.60 Simplification rules
% 6.56/2.60 ----------------------
% 6.56/2.60 #Subsume : 10
% 6.56/2.60 #Demod : 1127
% 6.56/2.60 #Tautology : 330
% 6.56/2.60 #SimpNegUnit : 24
% 6.56/2.60 #BackRed : 83
% 6.56/2.60
% 6.56/2.60 #Partial instantiations: 0
% 6.56/2.60 #Strategies tried : 1
% 6.56/2.60
% 6.56/2.60 Timing (in seconds)
% 6.56/2.60 ----------------------
% 6.56/2.60 Preprocessing : 0.56
% 6.56/2.60 Parsing : 0.29
% 6.56/2.60 CNF conversion : 0.04
% 6.56/2.60 Main loop : 0.96
% 6.56/2.60 Inferencing : 0.32
% 6.56/2.60 Reduction : 0.33
% 6.56/2.60 Demodulation : 0.24
% 6.56/2.60 BG Simplification : 0.05
% 6.56/2.60 Subsumption : 0.19
% 6.56/2.60 Abstraction : 0.05
% 6.56/2.60 MUC search : 0.00
% 6.56/2.60 Cooper : 0.00
% 6.56/2.60 Total : 1.58
% 6.56/2.60 Index Insertion : 0.00
% 6.56/2.60 Index Deletion : 0.00
% 6.56/2.60 Index Matching : 0.00
% 6.56/2.60 BG Taut test : 0.00
%------------------------------------------------------------------------------